Fast stable Kalman filter algorithms utilising the square root
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15206149,p. 1815-1818
- https://doi.org/10.1109/icassp.1990.115844
Abstract
Consideration is given to Kalman filtering algorithms from the viewpoint of fast and stable implementation. A number of authors have reformulated certain signal processing and linear algebra algorithms to be square-root-free in an effort to simplify parallel implementation. Following these derivations a number of Kalman filter algorithms and parallel array architectures have been realized that also avoid square-root computations. It is shown that, contrary to the motivation for realizing these algorithms, the standard algorithms (utilizing square roots) can be implemented more quickly than the square-root-free versions. Furthermore, the square-root-free versions suffer from overflow/underflow and in some cases are numerically unstable.<>Keywords
This publication has 7 references indexed in Scilit:
- Implementation of module combining multiplication, division, and square rootPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- The Square Root In Signal ProcessingPublished by SPIE-Intl Soc Optical Eng ,1989
- Parallel architectures for RLS with directional forgettingInternational Journal of Adaptive Control and Signal Processing, 1987
- A parallel architecture for Kalman filter measurement update and parameter estimationAutomatica, 1986
- Square-root algorithms for least-squares estimationIEEE Transactions on Automatic Control, 1975
- A Cellular Array for the Nonrestoring Extraction of Square RootsIEEE Transactions on Computers, 1971
- Discrete square root filtering: A survey of current techniquesIEEE Transactions on Automatic Control, 1971