Error propagation analysis of fast recursive least squares algorithms

Authors:
M. Arezki;P. Meyrueis;A. Benallal;A. Guessoum;D. Berkani
Affiliations:
LATSI, University of Blida, Algeria;ENSPS - Université Louis Pasteur, Boulevard Sébastien Brant -BP, France;LATSI, University of Blida, Algeria;LATSI, University of Blida, Algeria;Signal & Communications Laboratory, ENPA, Algiers, Algeria
Venue:
SIP '07 Proceedings of the Ninth IASTED International Conference on Signal and Image Processing
Year:
2007

Citing 2
Cited 1

A unifed view of parametric processing algorithms for prewindowed signals

Signal Processing
Adaptive filter theory

Adaptive filter theory

Advanced algorithms for adaptive filtering

ISPRA'09 Proceedings of the 8th WSEAS international conference on Signal processing, robotics and automation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present new versions of numerically stable fast recursive least squares (NS-FRLS) algorithms. These new versions are obtained by using some redundant formulae of the fast recursive least squares (FRLS) algorithms. Numerical stabilization is achieved by using a propagation model of first order of the numerical errors. A theoretical justification for these versions is presented by formulating new conditions on the forgetting factor. An advanced comparative method is used to study the efficiency of these new versions relatively to RLS algorithm by calculating their squared norm gains ratio (SNGR). The simulation over a very long duration for a stationary signal did not reveal any tendency to divergence.