Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

A parallel square-root algorithm for modified extended Kalman filter

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Mi Lu ; Dept. of Electr. Eng., Texas A&M Univ., College Station, TX, USA ; Qiao, X. ; Chen, G.

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(2n2) 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) n3) time-steps for a sequential implementation, where s≈log n

Published in:

Aerospace and Electronic Systems, IEEE Transactions on  (Volume:28 ,  Issue: 1 )