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
Subject:
Digital Signal Processing for Audio
Click to purchase paper as a non-member or you can login as an AES member to see more options.
No AES members have commented on this paper yet.
To be notified of new comments on this paper you can subscribe to this RSS feed. Forum users should login to see additional options.
If you are not yet an AES member and have something important to say about this paper then we urge you to join the AES today and make your voice heard. You can join online today by clicking here.