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.<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A parallel square-root algorithm for modified extended Kalman filter


    Contributors:
    Lu, M. (author) / Qiao, X. (author) / Chen, G. (author)


    Publication date :

    1992-01-01


    Size :

    779508 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Square-Root Unscented Schmidt–Kalman Filter

    Geeraert, Jeroen L. / McMahon, Jay W. | AIAA | 2017


    Square-Root Unscented Schmidt-Kalman Filter

    Jeroen L Geeraert | Online Contents | 2017


    A square root formulation of the Kalman- Schmidt filter

    BELLANTONI, J. / DODGE, K. | AIAA | 1967



    A square root formulation of the Kalman- Schmidt filter.

    Bellantoni, J. F. / Dodge, K. W. | NTRS | 1967