Sparse Vector Recovery: Bernoulli-Gaussian Message Passing

Low-cost message passing (MP) algorithm has been recognized as a promising technique for sparse vector recovery. However, the existing MP algorithms either focus on mean square error (MSE) of the value recovery while ignoring the sparsity requirement, or support error rate (SER) of the sparse support (non-zero position) recovery while ignoring its value. A novel low-complexity Bernoulli-Gaussian MP (BGMP) is proposed to perform the value recovery as well as the support recovery. Particularly, in the proposed BGMP, support-related Bernoulli messages and value- related Gaussian messages are jointly processed and assist each other. In addition, a strict lower bound is developed for the MSE of BGMP via the genie-aided minimum mean-square-error (GA-MMSE) method. The GA-MMSE lower bound is shown to be tight in high signal-to-noise ratio. Numerical results are provided to verify the advantage of BGMP in terms of final MSE, SER and convergence speed.

[1]  Antonia Maria Tulino,et al.  Random Matrix Theory and Wireless Communications , 2004, Found. Trends Commun. Inf. Theory.

[2]  Hans-Andrea Loeliger,et al.  Gaussian Message Passing on Linear Models: An Update , 2006 .

[3]  E. Candès,et al.  Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.

[4]  Sundeep Rangan,et al.  Generalized approximate message passing for estimation with random linear mixing , 2010, 2011 IEEE International Symposium on Information Theory Proceedings.

[5]  Andrea Montanari,et al.  Message-passing algorithms for compressed sensing , 2009, Proceedings of the National Academy of Sciences.

[6]  Xiaojun Yuan,et al.  Turbo Compressed Sensing with Partial DFT Sensing Matrix , 2014, IEEE Signal Processing Letters.

[7]  Yaakov Tsaig,et al.  Fast Solution of $\ell _{1}$ -Norm Minimization Problems When the Solution May Be Sparse , 2008, IEEE Transactions on Information Theory.

[8]  Xiaohu You,et al.  Generalized turbo signal recovery for nonlinear measurements and orthogonal sensing matrices , 2015, 2016 IEEE International Symposium on Information Theory (ISIT).

[9]  Shlomo Shamai,et al.  Support Recovery With Sparsely Sampled Free Random Matrices , 2011, IEEE Transactions on Information Theory.

[10]  Lei Liu,et al.  A low-complexity Gaussian message passing iterative detector for massive MU-MIMO systems , 2015, 2015 10th International Conference on Information, Communications and Signal Processing (ICICS).

[11]  Balas K. Natarajan,et al.  Sparse Approximate Solutions to Linear Systems , 1995, SIAM J. Comput..

[12]  Yoshiyuki Kabashima,et al.  Erratum: A typical reconstruction limit of compressed sensing based on Lp-norm minimization , 2009, ArXiv.

[13]  Lei Liu,et al.  Gaussian Message Passing Iterative Detection for MIMO-NOMA Systems with Massive Access , 2016, 2016 IEEE Global Communications Conference (GLOBECOM).

[14]  Junshan Zhang,et al.  Distributed Algorithms to Compute Walrasian Equilibrium in Mobile Crowdsensing , 2017, IEEE Transactions on Industrial Electronics.

[15]  T. Blumensath,et al.  Theory and Applications , 2011 .

[16]  S. Frick,et al.  Compressed Sensing , 2014, Computer Vision, A Reference Guide.

[17]  Lei Liu,et al.  A LSE and Sparse Message Passing-Based Channel Estimation for mmWave MIMO Systems , 2016, 2016 IEEE Globecom Workshops (GC Wkshps).

[18]  Li Ping,et al.  Orthogonal AMP , 2016, IEEE Access.

[19]  Chau Yuen,et al.  On Sparse Vector Recovery Performance in Structurally Orthogonal Matrices via LASSO , 2014, IEEE Transactions on Signal Processing.

[20]  Philip Schniter,et al.  Expectation-Maximization Gaussian-Mixture Approximate Message Passing , 2012, IEEE Transactions on Signal Processing.