A Distributed Digital Codec for Jointly Sparse Correlated Signals

In this paper, targeting jointly sparse correlated signals, we propose a distributed digital codec framework. First, the non-zero coefficients of each signal are quantized and then mapped onto a finite field. Subsequently, measurements obtained by compressed sensing (CS) over finite fields, where Low-density Parity-check (LDPC) matrices are adopted as CS encoding matrices, are modulated and conveyed through separate additive white Gaussian noise (AWGN) channel. Such an order for the encoder is named as "first quantization, then compressed sensing". For joint recovery, a novel joint belief propagation (JBP) algorithm is applied at the sink node, where a new type of constraint node, i.e., correlation constraint nodes is introduced, which connect two factor graphs that separately represent the CS encoding matrix of each signal. Experimental results prove that the proposed scheme outperforms the scheme that ignores the correlated information between the signals, especially when the correlation is high. Moreover, we compare the proposed framework vis-a-vis "first compressed sensing, then quantization" framework and validate the superiority in terms of recovery quality.

[1]  Mikael Skoglund,et al.  Greedy pursuits for compressed sensing of jointly sparse signals , 2011, 2011 19th European Signal Processing Conference.

[2]  Enrico Magli,et al.  Operational Rate-Distortion Performance of Single-Source and Distributed Compressed Sensing , 2014, IEEE Transactions on Communications.

[3]  Enrico Magli,et al.  Lossy compression of distributed sparse sources: A practical scheme , 2011, 2011 19th European Signal Processing Conference.

[4]  Stark C. Draper,et al.  Compressed sensing over finite fields , 2009, 2009 IEEE International Symposium on Information Theory.

[5]  Richard G. Baraniuk,et al.  Distributed Compressive Sensing , 2009, ArXiv.

[6]  Norbert Goertz,et al.  Bayesian Optimal Approximate Message Passing to Recover Structured Sparse Signals , 2015, ArXiv.

[7]  Ananthanarayanan Chockalingam,et al.  Bayesian framework and message passing for joint support and signal recovery of approximately sparse signals , 2011, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

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

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

[10]  Joel A. Tropp,et al.  Simultaneous sparse approximation via greedy pursuit , 2005, Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005..

[11]  Vito Cerone,et al.  A linear programming approach to sparse linear regression with quantized data , 2019, 2019 American Control Conference (ACC).

[12]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[13]  Lawrence Carin,et al.  Bayesian Compressive Sensing , 2008, IEEE Transactions on Signal Processing.

[14]  Sriram Vishwanath,et al.  On finite alphabet compressive sensing , 2013, 2013 IEEE International Conference on Acoustics, Speech and Signal Processing.

[15]  Zhilin Zhang,et al.  Quantized Compressive Sensing for Low-Power Data Compression and Wireless Telemonitoring , 2016, IEEE Sensors Journal.

[16]  David L Donoho,et al.  Compressed sensing , 2006, IEEE Transactions on Information Theory.