A power efficient sensing/communication scheme: Joint source-channel-network coding by using compressive sensing

We propose a joint source-channel-network coding scheme, based on compressive sensing principles, for wireless networks with AWGN channels (that may include multiple access and broadcast), with sources exhibiting temporal and spatial dependencies. Our goal is to provide a reconstruction of sources within an allowed distortion level at each receiver. We perform joint source-channel coding at each source by randomly projecting source values to a lower dimensional space. We consider sources that satisfy the restricted eigenvalue (RE) condition as well as more general sources for which the randomness of the network allows a mapping to lower dimensional spaces. Our approach relies on using analog random linear network coding. The receiver uses compressive sensing decoders to reconstruct sources. Our key insight is the fact that, compressive sensing and analog network coding both preserve the source characteristics required for compressive sensing decoding.

[1]  E. Candès,et al.  Sparsity and incoherence in compressive sampling , 2006, math/0611957.

[2]  Andrea Montanari,et al.  Compressed Sensing over ℓp-balls: Minimax mean square error , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[3]  Muriel Médard,et al.  Compressive sensing over networks , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[4]  Tracey Ho,et al.  A Random Linear Network Coding Approach to Multicast , 2006, IEEE Transactions on Information Theory.

[5]  Toby Berger,et al.  Review of Information Theory: Coding Theorems for Discrete Memoryless Systems (Csiszár, I., and Körner, J.; 1981) , 1984, IEEE Trans. Inf. Theory.

[6]  Aditya Ramamoorthy,et al.  Separating distributed source coding from network coding , 2006, IEEE Transactions on Information Theory.

[7]  R. DeVore,et al.  Compressed sensing and best k-term approximation , 2008 .

[8]  Vladimir Stojanovic,et al.  A signal-agnostic compressed sensing acquisition system for wireless and implantable sensors , 2010, IEEE Custom Integrated Circuits Conference 2010.

[9]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

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

[11]  Muriel Médard,et al.  An algebraic approach to network coding , 2003, TNET.

[12]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

[13]  I. Johnstone,et al.  Compressed Sensing over $\ell_p$-balls: Minimax Mean Square Error , 2011 .

[14]  Ivana Maric,et al.  Analog Network Coding in the High-SNR Regime , 2010, 2010 Third IEEE International Workshop on Wireless Network Coding.

[15]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[16]  Jack K. Wolf,et al.  Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.

[17]  Dimitris Achlioptas,et al.  Database-friendly random projections: Johnson-Lindenstrauss with binary coins , 2003, J. Comput. Syst. Sci..

[18]  R. Tibshirani Regression Shrinkage and Selection via the Lasso , 1996 .

[19]  Sachin Katti,et al.  Embracing wireless interference: analog network coding , 2007, SIGCOMM '07.

[20]  R. DeVore,et al.  A Simple Proof of the Restricted Isometry Property for Random Matrices , 2008 .

[21]  Martin J. Wainwright,et al.  Restricted Eigenvalue Properties for Correlated Gaussian Designs , 2010, J. Mach. Learn. Res..