Kalman-based time-varying sparse channel estimation

In this paper, we investigate a problem of estimating time-varying sparse channel impulse response for wireless communications. We are primarily interested in the scenario where the support of channels (i.e., the location of nonzero elements in channel impulse response) rarely changes within a local period of time. The proposed channel estimator estimates both support and amplitudes of the channel impulse response in an iterative fashion using the expectation and maximization algorithm. In order to exploit the (temporal) joint sparsity as well as temporal correlation of the channel gains, the proposed channel estimator performs two steps 1) E-step: Kalman smoothing of channel gains under the sparsity constraint and 2) M-step: semidefinite relaxation (SDR) technique for estimating the common support of channel impulse responses. Numerical evaluation shows that the proposed method performs close to the Oracle-based Kalman smoother and outperforms the existing sparse channel estimators.

[1]  Joel A. Tropp,et al.  Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit , 2007, IEEE Transactions on Information Theory.

[2]  Jun Won Choi,et al.  Downlink Pilot Reduction for Massive MIMO Systems via Compressed Sensing , 2015, IEEE Communications Letters.

[3]  Jian Wang,et al.  Generalized Orthogonal Matching Pursuit , 2011, IEEE Transactions on Signal Processing.

[4]  Dong In Kim,et al.  Compressed Sensing for Wireless Communications: Useful Tips and Tricks , 2015, IEEE Communications Surveys & Tutorials.

[5]  Bhaskar D. Rao,et al.  Joint Approximately Sparse Channel Estimation and Data Detection in OFDM Systems Using Sparse Bayesian Learning , 2014, IEEE Transactions on Signal Processing.

[6]  Holger Rauhut,et al.  Multichannel-compressive estimation of doubly selective channels in MIMO-OFDM systems: Exploiting and enhancing joint sparsity , 2010, 2010 IEEE International Conference on Acoustics, Speech and Signal Processing.

[7]  D. Rubin,et al.  Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .

[8]  Stergios I. Roumeliotis,et al.  Lasso-Kalman smoother for tracking sparse signals , 2009, 2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers.

[9]  Bhaskar D. Rao,et al.  Sparse channel estimation via matching pursuit with application to equalization , 2002, IEEE Trans. Commun..

[10]  E.J. Candes,et al.  An Introduction To Compressive Sampling , 2008, IEEE Signal Processing Magazine.

[11]  Kareem E. Baddour,et al.  Autoregressive modeling for fading channel simulation , 2005, IEEE Transactions on Wireless Communications.

[12]  Sundeep Rangan,et al.  Estimation of Sparse MIMO Channels with Common Support , 2011, IEEE Transactions on Communications.

[13]  Namrata Vaswani,et al.  Kalman filtered Compressed Sensing , 2008, 2008 15th IEEE International Conference on Image Processing.

[14]  Yonina C. Eldar,et al.  Structured Compressed Sensing: From Theory to Applications , 2011, IEEE Transactions on Signal Processing.