Multi Stage Kalman Filter (MSKF) Based Time-Varying Sparse Channel Estimation With Fast Convergence | IEEE Journals & Magazine | IEEE Xplore

Multi Stage Kalman Filter (MSKF) Based Time-Varying Sparse Channel Estimation With Fast Convergence


Abstract:

The paper develops novel algorithms for time-varying (TV) sparse channel estimation in Massive multiple-input, multiple-output (MMIMO) systems. This is achieved by employ...Show More

Abstract:

The paper develops novel algorithms for time-varying (TV) sparse channel estimation in Massive multiple-input, multiple-output (MMIMO) systems. This is achieved by employing a novel reduced (non-uniformly spaced tap) delay-line equalizer, which can be related to low/reduced rank filters. This low rank filter is implemented by deriving an innovative TV (Krylov-space based) Multi-Stage Kalman Filter (MSKF), employing appropriate state estimation techniques. MSKF converges very quickly, within few stages/iterations (at each symbol). This is possible because MSKF uses those signal spaces, maximally correlated with the desired signal, rather than the standard principal component (PCA) signal spaces. MSKF is also able to reduce channel tracking errors, encountered by a standard Kalman filter in a high-mobility channel. In addition, MSKF is well suited for large-scale MMIMO systems. This is unlike most existing methods, including recent Bayesian-Belief Propagation, Krylov, fast iterative re-weighted compressed sensing (RCS) and minimum rank minimization methods, which requires more and more iterations to converge, as the scale of MMIMO system increases. A Bayesian Cramer Rao lower bound (BCRLB) for noisy CS (in sparse channel) is also derived, which provides a benchamrk for the performance for novel MSKF and other CS estimators.
Published in: IEEE Open Journal of Signal Processing ( Volume: 3)
Page(s): 21 - 35
Date of Publication: 03 December 2021
Electronic ISSN: 2644-1322

References

References is not available for this document.