Improvement of the fast recursive least-squares algorithms via normalization: A comparative study

This paper deals with the derivation and the properties of fast optimal least-squares algorithms, and particularly with their normalization. It is shown how the well-known fast Kalman algorithm, written in the most general form, can be normalized through a purely algebraic point of view, leading to...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on acoustics, speech, and signal processing speech, and signal processing, 1986-04, Vol.34 (2), p.296-308
Main Authors: Fabre, P., Gueguen, C.
Format: Article
Language:English
Subjects:
Applied sciences
Convergence of numerical methods
Covariance matrix
Equations
Exact sciences and technology
Information, signal and communications theory
Kalman filters
Lattices
Predictive models
Recursive estimation
Resonance light scattering
Telecommunications and information theory
Transversal filters
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper deals with the derivation and the properties of fast optimal least-squares algorithms, and particularly with their normalization. It is shown how the well-known fast Kalman algorithm, written in the most general form, can be normalized through a purely algebraic point of view, leading to the normalized least-squares transversal filter derived by Cioffi, Kailath, and Lev-Ari from the geometric approach. An improved form of the algorithm is presented. The different algorithms have been compared from a practical point of view as regards their convergence, initialization procedures, complexity, and numerical properties. Normalized transversal algorithms are shown to be interesting because of their nice structured form, simplicity of conception, and improved good numerical behavior.
ISSN:0096-3518
DOI:10.1109/TASSP.1986.1164813