Premium
Fast bias‐constrained optimal FIR filtering for time‐invariant state space models
Author(s) -
Zhao Shunyi,
Shmaliy Yuriy S.,
Ji Guoli,
Khan Sanowar H.
Publication year - 2017
Publication title -
international journal of adaptive control and signal processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.73
H-Index - 66
eISSN - 1099-1115
pISSN - 0890-6327
DOI - 10.1002/acs.2747
Subject(s) - kalman filter , finite impulse response , control theory (sociology) , robustness (evolution) , mathematics , impulse response , infinite impulse response , computation , mathematical optimization , algorithm , computer science , filter (signal processing) , digital filter , statistics , artificial intelligence , mathematical analysis , biochemistry , chemistry , control (management) , computer vision , gene
Summary This paper combines the finite impulse response filtering with the Kalman structure (predictor/corrector) and proposes a fast iterative bias‐constrained optimal finite impulse response filtering algorithm for linear discrete time‐invariant models. In order to provide filtering without any requirement of the initial state, the property of unbiasedness is employed. We first derive the optimal finite impulse response filter constrained by unbiasedness in the batch form and then find its fast iterative form for finite‐horizon and full‐horizon computations. The corresponding mean square error is also given in the batch and iterative forms. Extensive simulations are provided to investigate the trade‐off with the Kalman filter. We show that the proposed algorithm has much higher immunity against errors in the noise covariances and better robustness against temporary model uncertainties. The full‐horizon filter operates almost as fast as the Kalman filter, and its estimate converges with time to the Kalman estimate. Copyright © 2016 John Wiley & Sons, Ltd.