Lattice filter interpretations of the Chandrasekhar recursions for estimation and spectral factorization
- 1 January 1992
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4 (15206149) , 549-552 vol.4
- https://doi.org/10.1109/icassp.1992.226389
Abstract
The authors use the classical Schur reduction procedure to give a lattice filter implementation of the Chandrasekhar recursions. The derivation is based on the observation that the covariance matrix of a process with a time-invariant state-space model is structured. This allows one to easily derive the connection between the Schur algorithm and spectral factorization and to extend the Chandrasekhar recursions to the case of nonsymmetric Riccati equations. The Chandrasekhar recursions can be implemented in scalar steps using a sequence of well-defined elementary (hyperbolic and Givens) rotations.Keywords
This publication has 7 references indexed in Scilit:
- Triangular Factorization of Structured Hermitian MatricesPublished by Springer Nature ,1986
- Lattice filter parameterization and modeling of nonstationary processesIEEE Transactions on Information Theory, 1984
- Lectures on Wiener and Kalman FilteringPublished by Springer Nature ,1981
- The Nevanlinna–Pick Problem for Matrix-Valued FunctionsSIAM Journal on Applied Mathematics, 1979
- Extended Levinson and Chandrasekhar equations for general discrete-time linear estimation problemsIEEE Transactions on Automatic Control, 1978
- Some new algorithms for recursive estimation in constant, linear, discrete-time systemsIEEE Transactions on Automatic Control, 1974
- A New Approach to Linear Filtering and Prediction ProblemsJournal of Basic Engineering, 1960