Abstract
The conventional projection approximation subspace tracking (PAST) algorithm is based on the recursive least-squares algorithm, and its performance will degrade considerably when the subspace rapidly changes and the additive noise is impulsive. This brief proposes a new robust Kalman filter-based subspace tracking algorithm to overcome these two limitations of the PAST algorithm. It is based on a new extension of the adaptive Kalman filter with variable number of measurements (KFVNM) for tracking fast-varying subspace. Furthermore, M-estimation is incorporated into this KFVNM algorithm to combat the adverse effects of impulsive noise. Simulation results show that the robust KFVNM-based subspace tracking algorithm has a better performance than the PAST algorithm for tracking fast-varying subspace and in an impulsive noise environment.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Circuits and Systems II: Express Briefs
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
