Skip to main navigation Skip to search Skip to main content

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

  • Maaz Mahadi*
  • , Tarig Ballal
  • , Muhammad Moinuddin
  • , Ubaid M. Al-Saggaf
  • *Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

24 Scopus citations

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.

Original languageEnglish
Article number2077
JournalApplied Sciences (Switzerland)
Volume12
Issue number4
DOIs
StatePublished - 1 Feb 2022
Externally publishedYes

Bibliographical note

Publisher Copyright:
© 2022 by the authors. Licensee MDPI, Basel, Switzerland.

Keywords

  • Recursive least-squares (RLS)
  • Taylor’s series
  • Tikhonov regularization

ASJC Scopus subject areas

  • General Materials Science
  • Instrumentation
  • General Engineering
  • Process Chemistry and Technology
  • Computer Science Applications
  • Fluid Flow and Transfer Processes

Fingerprint

Dive into the research topics of 'A Recursive Least-Squares with a Time-Varying Regularization Parameter'. Together they form a unique fingerprint.

Cite this