Compressed Sensing using sparse binary measurements: A rateless coding perspective

Compressed Sensing (CS) methods using sparse binary measurement matrices and iterative message-passing recovery procedures have been recently investigated due to their low computational complexity and excellent performance. Drawing much of inspiration from sparse-graph codes such as Low-Density Parity-Check (LDPC) codes, these studies use analytical tools from modern coding theory to analyze CS solutions. In this paper, we consider and systematically analyze the CS setup inspired by a class of efficient, popular and flexible sparse-graph codes called rateless codes. The proposed rateless CS setup is asymptotically analyzed using tools such as Density Evolution and EXIT charts and fine-tuned using degree distribution optimization techniques.

[1]  Iqbal Hussain,et al.  Analysis and Design of Rateless Codes , 2014 .

[2]  Nazanin Rahnavard,et al.  GBCS: A two-step compressive sensing reconstruction based on group testing and basis pursuit , 2011, 2011 - MILCOM 2011 Military Communications Conference.

[3]  Muriel Médard,et al.  A power efficient sensing/communication scheme: Joint source-channel-network coding by using compressive sensing , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[4]  Vojin Senk,et al.  Expanding Window Fountain Codes for Unequal Error Protection , 2007, ASILOMAR 2007.

[5]  Richard G. Baraniuk,et al.  Bayesian Compressive Sensing Via Belief Propagation , 2008, IEEE Transactions on Signal Processing.

[6]  Deanna Needell,et al.  Two-part reconstruction in compressed sensing , 2013, 2013 IEEE Global Conference on Signal and Information Processing.

[7]  Nazanin Rahnavard,et al.  Rateless Codes With Unequal Error Protection Property , 2007, IEEE Transactions on Information Theory.

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

[9]  Ieee Staff,et al.  2015 IEEE 16th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) , 2015 .

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

[11]  Nazanin Rahnavard,et al.  Non-uniform compressive sensing , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

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

[13]  Devavrat Shah,et al.  A simple message-passing algorithm for compressed sensing , 2010, 2010 IEEE International Symposium on Information Theory.

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

[15]  Michael Mitzenmacher,et al.  Analysis of random processes via And-Or tree evaluation , 1998, SODA '98.

[16]  Mikael Skoglund,et al.  Joint Source-Channel Vector Quantization for Compressed Sensing , 2014, IEEE Transactions on Signal Processing.

[17]  Michael Luby,et al.  LT codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[18]  David Declercq,et al.  Interval-Passing Algorithm for Non-Negative Measurement Matrices: Performance and Reconstruction Analysis , 2012, IEEE Journal on Emerging and Selected Topics in Circuits and Systems.

[19]  Aleksandra Pizurica,et al.  Compressed sensing using sparse adaptive measurements , 2014 .

[20]  Lin Zhang,et al.  Expanding Window Compressed Sensing for Non-Uniform Compressible Signals , 2012, Sensors.

[21]  Stephan ten Brink,et al.  Convergence behavior of iteratively decoded parallel concatenated codes , 2001, IEEE Trans. Commun..