A fast converging, low complexity adaptive filtering algorithm
- 30 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
This paper introduces a new adaptive filtering algorithm called fast affine projections (FAP). Its main attributes include RLS (recursive least squares) like convergence and tracking with NLMS (normalized least mean squares) like complexity. This mix of complexity and performance is similar to the recently introduced fast Newton transversal filter (FNTF) algorithm. While FAP shares some similar properties with FNTF it is derived from a different perspective, namely the generalization of the affine projection interpretation of NLMS. FAP relies on a sliding windowed fast RLS (FRLS) algorithm to generate forward and backward prediction vectors and expected prediction error energies. Since sliding windowed FRLS algorithms easily incorporate regularization of the implicit inverse of the covariance matrix, FAP is regularized as well.Keywords
This publication has 5 references indexed in Scilit:
- Regularized fast recursive least squares algorithms for adaptive filteringIEEE Transactions on Signal Processing, 1991
- Fast Newton transversal filters-a new class of adaptive estimation algorithmsIEEE Transactions on Signal Processing, 1991
- Windowed fast transversal filters adaptive algorithms with normalizationIEEE Transactions on Acoustics, Speech, and Signal Processing, 1985
- An adaptive filtering algorithm using an orthogonal projection to an affine subspace and its propertiesElectronics and Communications in Japan (Part I: Communications), 1984
- Fast, recursive-least-squares transversal filters for adaptive filteringIEEE Transactions on Acoustics, Speech, and Signal Processing, 1984