New insights into the RLS algorithm

  • Authors:
  • Jacob Benesty;Tomas Gänsler

  • Affiliations:
  • INRS-EMT, Université du Québec, Suite, Montréal, Québec, Canada;Agere Systems Inc., NE, Allentown, PA

  • Venue:
  • EURASIP Journal on Applied Signal Processing
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

The recursive least squares (RLS) algorithm is one of the most popular adaptive algorithms that can be found in the literature, due to the fact that it is easily and exactly derived from the normal equations. In this paper, we give another interpretation of the RLS algorithm and show the importance of linear interpolation error energies in the RLS structure. We also give a very efficient way to recursively estimate the condition number of the input signal covariance matrix thanks to fast versions of the RLS algorithm. Finally, we quantify the misalignment of the RLS algorithm with respect to the condition number.