Title :
A robust, parallelizable, O(m), a posteriori recursive least squares algorithm for efficient adaptive filtering
Author :
Papaodysseus, C.
Author_Institution :
Dept. of Electr. & Comput. Eng., Nat. Tech. Univ. of Athens, Greece
fDate :
9/1/1999 12:00:00 AM
Abstract :
This article presents a new recursive least squares (RLS) adaptive algorithm. The proposed computational scheme uses a finite window by means of a lemma for the system matrix inversion that is, for the first time, stated and proven here. The new algorithm has excellent tracking capabilities. Moreover, its particular structure allows for stabilization by means of a quite simple method. Its stabilized version performs very well not only for a white noise input but also for nonstationary inputs as well. It is shown to follow music, speech, environmental noise, etc., with particularly good tracking properties. The new algorithm can be parallelized via a simple technique. Its parallel form is very fast when implemented with four processors
Keywords :
adaptive filters; adaptive signal processing; computational complexity; filtering theory; least squares approximations; matrix inversion; music; noise pollution; numerical stability; parallel algorithms; recursive estimation; speech processing; tracking filters; white noise; a posteriori recursive least squares algorithm; adaptive filtering; computational complexity; environmental noise; finite window; music; nonstationary inputs; parallelizable RLS algorithm; processors; recursive least squares adaptive algorithm; robust parallel algorithm; speech; stabilization; system matrix inversion; tracking properties; white noise input; Adaptive filters; Computational complexity; Equations; Filtering algorithms; Least squares methods; Matrices; Resonance light scattering; Robustness; Signal processing algorithms;
Journal_Title :
Signal Processing, IEEE Transactions on