A robust, parallelizable, O(m), a posteriori recursive least squares algorithm for efficient adaptive filtering

Authors
Citation
C. Papaodysseus, A robust, parallelizable, O(m), a posteriori recursive least squares algorithm for efficient adaptive filtering, IEEE SIGNAL, 47(9), 1999, pp. 2552-2558
Citations number
28
Categorie Soggetti
Eletrical & Eletronics Engineeing
Journal title
IEEE TRANSACTIONS ON SIGNAL PROCESSING
ISSN journal
1053587X → ACNP
Volume
47
Issue
9
Year of publication
1999
Pages
2552 - 2558
Database
ISI
SICI code
1053-587X(199909)47:9<2552:ARPOAP>2.0.ZU;2-F
Abstract
This correspondence presents a new recursive least squares (RLS) adaptive a lgorithm. The proposed computational scheme uses a finite window by means o f a lemma for the system matrix inversion that is, for the first time, stat ed and proven here. The new algorithm has excellent tracking capabilities. Moreover, its particular structure allows for stabilization by means of a q uite 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 t racking properties. The new algorithm can be parallelized via a simple tech nique. Its parallel form is very fast when implemented with four processors .