Efficient Circulant Matrix Construction and Implementation for Compressed Sensing

The design of measurement matrices is an important part in compressed sensing (CS). Random matrices superior to incoherence are considered to be optimal measurement matrices to achieve successful recovery. However, they are deficient in memory cost. Structure matrices like circulant matrices are preferred for low-memory cost. Nevertheless, their recovery performance is greatly damaged because of element coherence. In this paper, a new method called different-spaced selection & different-spaced flipping (DSS & DSF) is proposed to modify structure matrices. Based on circulant matrices, regular extraction and symbol flipping imposed on columns of measurement matrices can increase randomness to a large scale. As a result, not only near optimal recovery but also much less memory cost can be achieved. Compared with Gaussian random matrices, the memory cost can be reduced to 4% when measurement matrices based on circulant matrices are in 128 × 512 dimensions. An efficient hardware design and VLSI implementation are also presented at the end of this paper.

[1]  Zhongfeng Wang,et al.  Low-complexity shift-LDPC decoder for high-speed communication systems , 2008, APCCAS 2008 - 2008 IEEE Asia Pacific Conference on Circuits and Systems.

[2]  Richard G. Baraniuk,et al.  On the feasibility of hardware implementation of sub-Nyquist random-sampling based analog-to-information conversion , 2008, 2008 IEEE International Symposium on Circuits and Systems.

[3]  R.G. Baraniuk,et al.  Compressive Sensing [Lecture Notes] , 2007, IEEE Signal Processing Magazine.

[4]  Keshab K. Parhi,et al.  A Network-Efficient Nonbinary QC-LDPC Decoder Architecture , 2012, IEEE Transactions on Circuits and Systems I: Regular Papers.

[5]  An-Yeu Wu,et al.  Structural Scrambling of Circulant Matrices for Cost-effective Compressive Sensing , 2018, J. Signal Process. Syst..

[6]  Emmanuel J. Candès,et al.  Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.

[7]  E.J. Candes,et al.  An Introduction To Compressive Sampling , 2008, IEEE Signal Processing Magazine.

[8]  Junfeng Yang,et al.  Practical compressive sensing with Toeplitz and circulant matrices , 2010, Visual Communications and Image 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]  E. Candès,et al.  Sparsity and incoherence in compressive sampling , 2006, math/0611957.

[11]  Chuan Zhang,et al.  Efficient network for non-binary QC-LDPC decoder , 2012, 2012 IEEE International Symposium on Circuits and Systems.

[12]  Joel A. Tropp,et al.  Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit , 2007, IEEE Transactions on Information Theory.

[13]  Daibashish Gangopadhyay,et al.  Compressive sampling of ECG bio-signals: Quantization noise and sparsity considerations , 2010, 2010 Biomedical Circuits and Systems Conference (BioCAS).

[14]  Zhongfeng Wang,et al.  Flexible LDPC Decoder Design for Multigigabit-per-Second Applications , 2010, IEEE Transactions on Circuits and Systems I: Regular Papers.