Analysis of the widely linear complex Kalman filter
Author(s) -
Dahir H. Dini,
Danilo P. Mandic
Publication year - 2010
Publication title -
citeseer x (the pennsylvania state university)
Language(s) - English
Resource type - Conference proceedings
DOI - 10.1049/ic.2010.0228
Subject(s) - kalman filter , computer science , invariant extended kalman filter , fast kalman filter , context (archaeology) , mean squared error , minimum mean square error , algorithm , adaptive filter , extended kalman filter , ensemble kalman filter , filter (signal processing) , linear model , control theory (sociology) , artificial intelligence , mathematics , machine learning , statistics , computer vision , paleontology , control (management) , estimator , biology
The augmented complex Kalman filter (ACKF) has been recently proposed for the modeling of noncircular complex-valued signals for which widely linear modelling is more suitable than a strictly linear model. This has been achieved in the context of neural network training, however, the extent to which the ACKF outperforms the conventional complex Kalman filter (CCKF) in standard adaptive filtering applications remains unclear. In this paper, we show analytically that the ACKF algorithm achieves a lower mean squared error than the CCKF algorithm for noncircular signals. The analysis is supported by illustrative simulations.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom