A unified treatment of fast algorithms for identification†
- 1 May 1982
- journal article
- research article
- Published by Taylor & Francis in International Journal of Control
- Vol. 35 (5) , 909-934
- https://doi.org/10.1080/00207178208922661
Abstract
We propose a unified description of several so-called fast, algorithms. The projection operator technique is used to derive least-squares ladder (or lattice) algorithms in the filter and the predictor forms. This technique, usually associated with orthogonal projection operations, is extended to oblique projections. The first application is an easy derivation of the ‘ exact ’ instrumental variable ladder algorithm which, to our knowledge, has not previously been described in the literature. A second application is a new derivation, based on the operator technique, of an algorithm for the fast calculation of gain matrices for recursive estimation schemes.Keywords
This publication has 7 references indexed in Scilit:
- AR and ARMA identification algorithms of Levinson type: An innovations approachIEEE Transactions on Automatic Control, 1981
- Recursive least squares ladder estimation algorithmsIEEE Transactions on Circuits and Systems, 1981
- Optimized lattice-form adaptive line enhancer for a sinusoidal signal in broad-band noiseIEEE Transactions on Acoustics, Speech, and Signal Processing, 1981
- Application of Least Squares Lattice Algorithms to Adaptive EqualizationIEEE Transactions on Communications, 1981
- Application of Fast Kalman Estimation to Adaptive EqualizationIEEE Transactions on Communications, 1978
- Fast calculation of gain matrices for recursive estimation schemesInternational Journal of Control, 1978
- Identification of linear discrete time systems using the instrumental variable methodIEEE Transactions on Automatic Control, 1967