Abstract

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.