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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Data-Reuse Regularized Recursive Least-Squares Adaptive Filtering Algorithm

Cristian-Lucian Stanciu, Laura-Maria Dogariu, Constantin Paleologu, Silviu Ciochină et al.
3 citations
Advanced Algorithms and Applications
0.98
article

A Data-Reuse Regularized Recursive Least-Squares Adaptive Filtering Algorithm

Cristian-Lucian Stanciu, Laura-Maria Dogariu, Constantin Paleologu, Silviu Ciochină, Jacob Benesty, Radu Otopeleanu
article en
3 citations

Abstract

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.

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)
Openalex Percentile: Top 22%
Advanced Algorithms and Applications
0.98
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.