A Recursive Least-Squares with a Time-Varying Regularization Parameter

20Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

Recursive least-squares (RLS) algorithms are widely used in many applications, such as real-time signal processing, control and communications. In some applications, regularization of the least-squares provides robustness and enhances performance. Interestingly, updating the regularization parameter as processing data continuously in time is a desirable strategy to improve performance in applications such as beamforming. While many of the presented works in the literature assume non-time-varying regularized RLS (RRLS) techniques, this paper deals with a time-varying RRLS as the parameter varies during the update. The paper proposes a novel and efficient technique that uses an approximate recursive formula, assuming a slight variation in the regularization parameter to provide a low-complexity update method. Simulation results illustrate the feasibility of the derived formula and the superiority of the time-varying RRLS strategy over the fixed one.

Cite

CITATION STYLE

APA

Mahadi, M., Ballal, T., Moinuddin, M., & Al-Saggaf, U. M. (2022). A Recursive Least-Squares with a Time-Varying Regularization Parameter. Applied Sciences (Switzerland), 12(4). https://doi.org/10.3390/app12042077

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free