A parallel square-root algorithm for modified extended Kalman filter

A parallel square-root algorithm and its systolic array implementation are proposed for performing modified extended Kalman filtering (MEKF). The proposed parallel square-root algorithm is designed based on the singular value decomposition (SVD) and the Faddeev algorithm, and a very large scale inte...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on aerospace and electronic systems Ročník 28; číslo 1; s. 153 - 163
Hlavní autori: Lu, M., Qiao, X., Chen, G.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York, NY IEEE 01.01.1992
Institute of Electrical and Electronics Engineers
Predmet:
Applied sciences
Communication system control
Control systems
Exact sciences and technology
Filtering algorithms
Information, signal and communications theory
Kalman filters
Linear approximation
Mathematical methods
Nonlinear filters
Signal processing algorithms
State estimation
Telecommunications and information theory
Vectors
Very large scale integration
VLSI circuit
Kalman filter
Theoretical study
Reliability
Performance
Systolic network
Algorithm
Implementation
ISSN:0018-9251, 1557-9603
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:A parallel square-root algorithm and its systolic array implementation are proposed for performing modified extended Kalman filtering (MEKF). The proposed parallel square-root algorithm is designed based on the singular value decomposition (SVD) and the Faddeev algorithm, and a very large scale integration (VLSI) systolic array architecture is developed for its implementation. Compared to other square root Kalman filtering algorithms, the proposed method is more numerically stable. The VLSI architecture described has good parallel and pipelining characteristics in applying to the MEKF and achieves higher efficiency. For n-dimensional state vector estimations, the proposed architecture consists of O(2n/sup 2/) processing elements and uses O((s+17)n) time-steps for a complete iteration at each instant, in contrast to the complexity of O((s+6)n/sup 3/) time-steps for a sequential implementation, where s approximately=log n.< >
Bibliografia:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9251
1557-9603
DOI:10.1109/7.135441