An Efficient Approach Toward the Asymptotic Analysis of Node-Based Recovery Algorithms in Compressed Sensing

In this paper, we propose a general framework for the asymptotic analysis of node-based verification-based algorithms. In our analysis we tend the signal length $n$ to infinity. We also let the number of non-zero elements of the signal $k$ scale linearly with $n$. Using the proposed framework, we study the asymptotic behavior of the recovery algorithms over random sparse matrices (graphs) in the context of compressive sensing. Our analysis shows that there exists a success threshold on the density ratio $k/n$, before which the recovery algorithms are successful, and beyond which they fail. This threshold is a function of both the graph and the recovery algorithm. We also demonstrate that there is a good agreement between the asymptotic behavior of recovery algorithms and finite length simulations for moderately large values of $n$.

[1]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[2]  Brendan D. McKay,et al.  Short Cycles in Random Regular Graphs , 2004, Electron. J. Comb..

[3]  Andrea Montanari,et al.  Message passing algorithms for compressed sensing: I. motivation and construction , 2009, 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo).

[4]  Fan Zhang,et al.  Compressed sensing and linear codes over real numbers , 2008, 2008 Information Theory and Applications Workshop.

[5]  Fan Zhang,et al.  On the Iterative Decoding of High-Rate LDPC Codes With Applications in Compressed Sensing , 2009, ArXiv.

[6]  Andrea Montanari,et al.  Counter braids: a novel counter architecture for per-flow measurement , 2008, SIGMETRICS '08.

[7]  Richard G. Baraniuk,et al.  Sudocodes ߝ Fast Measurement and Reconstruction of Sparse Signals , 2006, 2006 IEEE International Symposium on Information Theory.

[8]  Andrea Montanari,et al.  Message passing algorithms for compressed sensing: II. analysis and validation , 2009, 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo).

[9]  Vahid Tarokh,et al.  Compressive Sensing Using Low Density Frames , 2009, ArXiv.

[10]  Weiyu Xu,et al.  Efficient Compressive Sensing with Deterministic Guarantees Using Expander Graphs , 2007, 2007 IEEE Information Theory Workshop.

[11]  Rüdiger L. Urbanke,et al.  The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.

[12]  Sergio Verdú,et al.  Fundamental limits of almost lossless analog compression , 2009, 2009 IEEE International Symposium on Information Theory.

[13]  Michael Mitzenmacher,et al.  Verification-based decoding for packet-based low-density parity-check codes , 2005, IEEE Transactions on Information Theory.

[14]  Fan Zhang,et al.  Verification Decoding of High-Rate LDPC Codes With Applications in Compressed Sensing , 2009, IEEE Transactions on Information Theory.

[15]  Fan Zhang,et al.  Analysis of Verification-Based Decoding on the q -ary Symmetric Channel for Large q , 2008, IEEE Trans. Inf. Theory.

[16]  Fan Zhang,et al.  List-Message Passing Achieves Capacity on the q-ary Symmetric Channel for Large q , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[17]  N. Linial,et al.  Expander Graphs and their Applications , 2006 .

[18]  Daniel A. Spielman,et al.  Efficient erasure correcting codes , 2001, IEEE Trans. Inf. Theory.