Abstract
This paper discusses a new adaptive filtering algorithm called fast affine projections (FAP). FAP''s key features include LMS like complexity and memory requirements (low), and RLS like convergence (fast) for the important case where the excitation signal is speech. Another of FAP''s important features is that it causes no delay in the input or output signals. In addition, the algorithm is easily regularized resulting in robust performance even for highly colored excitation signals. The combination of these features make FAP an excellent candidate for the adaptive filter in the acoustic echo cancellation problem. A simple, low complexity numerical stabilization method for the algorithm is also introduced.
Recommended Citation
S. L. Grant and S. Tavathia, "The Fast Affine Projection Algorithm," Proceedings of the International Conference on Acoustics, Speech, and Signal Processing, 1995, Institute of Electrical and Electronics Engineers (IEEE), Jan 1995.
The definitive version is available at https://doi.org/10.1109/ICASSP.1995.479482
Meeting Name
International Conference on Acoustics, Speech, and Signal Processing, 1995
Department(s)
Electrical and Computer Engineering
Keywords and Phrases
LMS Like Complexity; RLS Like Convergence; Acoustic Echo Cancellation Problem; Adaptive Filtering Algorithm; Adaptive Filters; Adaptive Signal Processing; Computational Complexity; Echo; Excitation Signal; Fast Affine Projection Algorithm; Highly Colored Excitation Signals; Least Mean Squares Methods; Low Complexity Numerical Stabilization Method; Memory Requirements; Performance; Speech Processing
Document Type
Article - Conference proceedings
Document Version
Final Version
File Type
text
Language(s)
English
Rights
© 1995 Institute of Electrical and Electronics Engineers (IEEE), All rights reserved.
Publication Date
01 Jan 1995
