A Data-Reuse Regularized Recursive Least-Squares Adaptive Filtering Algorithm
The recursive least-squares (RLS) algorithm is very popular for adaptive filtering applications, mainly due to its fast convergence rate. The regularized version of this algorithm owns improved robustness features, especially in noisy environments. On the other hand, this robust behavior could influence the tracking capability of the algorithm and its overall convergence performance. To reach a proper balance between these performance criteria, a data-reuse regularized RLS algorithm is proposed in this paper. The specific data-reuse parameter of the resulting algorithm can be used as an additional control mechanism, thus reducing the influence of tuning the main convergence parameter of the RLS filter, which is the forgetting factor. Simulation results obtained in the framework of echo cancellation sustain the performance characteristics.
Authors
- Cristian-Lucian Stanciu (ORCID: https://orcid.org/0000-0003-2312-9467)
- Laura-Maria Dogariu (ORCID: https://orcid.org/0000-0002-5945-5179)
- Constantin Paleologu (ORCID: https://orcid.org/0000-0002-0379-2360)
- Silviu Ciochină (ORCID: https://orcid.org/0000-0003-3982-1837)
- Jacob Benesty (ORCID: https://orcid.org/0000-0002-0036-5865)
- Radu Otopeleanu
Institutions
- Université du Québec à Montréal (CA)
- Institut National de la Recherche Scientifique (CA)
- Universitatea Națională de Știință și Tehnologie Politehnica București (RO)
Publication Details
- Published
- 2024-11-07
- DOI
- https://doi.org/10.1109/isetc63109.2024.10797358
- Citations
- 3
- Primary Topic
- Advanced Algorithms and Applications
- Type
- article
- Field-Weighted Citation Impact
- 0.98