RLS Adaptive Filtering Algorithms Based on Parallel Computations
Abstract
The paper presents a family of the sliding window RLS adaptive filtering algorithms with the regularization of adaptive filter correlation matrix. The algorithms are developed in forms, fitted to the implementation by means of parallel computations. The family includes RLS and fast RLS algorithms based on generalized matrix inversion lemma, fast RLS algorithms based on square root free inverse QR decomposition and linearly constrained RLS algorithms. The considered algorithms are mathematically identical to the appropriate algorithms with sequential computations. The computation procedures of the developed algorithms are presented. The results of the algorithm simulation are presented as well.
Keywords
Adaptive filtering, RLS, fast RLS, QR decomposi-tion, linear constraints, parallel computationsPersistent identifier
http://hdl.handle.net/11012/58009Document type
Peer reviewedDocument version
Final PDFSource
Radioengineering. 2005, vol. 14, č. 3, s. 28-36. ISSN 1210-2512http://www.radioeng.cz/fulltexts/2005/05_03_28_36.pdf
Collections
- 2005/3 [7]