The fast affine projection (FAP) algorithm is a relatively new type of adaptive filter which is reported to have complexity comparable with the least mean square (LMS) algorithm but with performance matching that of recursive least squares (RLS) techniques. This paper compares the error performance of the FAP and LMS algorithms when applied to the task of acoustic echo cancellation using both real and simulated data. The results confirm that the convergence of the FAP algorithm is faster than that of LMS but that care must be taken with respect to the stability of the FAP algorithm which can diverge with certain types of input signal or with unsuitable update parameters.

Authors: Reed, M. J.; Hawksford, Malcolm J.; Hollier, M. P.
Affiliations: Centre for Audio Research and Engineering, University of Essex, Colchester, Essex, UK ; BT Laboratories, Martlesham Heath, Ipswich, UK(See document for exact affiliation information.)
AES Convention: 105 (September 1998) Paper Number: 4765
Publication Date: September 1, 1998 Import into BibTeX
Subject: Digital Signal Processing for Audio
Permalink: https://www.aes.org/e-lib/browse.cfm?elib=8415

Click to purchase paper as a non-member or login as an AES member. If your company or school subscribes to the E-Library then switch to the institutional version. If you are not an AES member and would like to subscribe to the E-Library then Join the AES!

This paper costs $33 for non-members and is free for AES members and E-Library subscribers.

Learn more about the AES E-Library

E-Library Location: (CD aes14)   /pp9798/pp9809/4655.pdf

Start a discussion about this paper!