A fast compressive sensing reconstruction hardware based on modified subspace pursuit

Compressive sensing theory is an attractive way in signal processing due to its capability of sampling signals at sub-Nyquist rate. In this paper, a modified subspace pursuit algorithm is proposed to reconstruct compressed signals. The proposed algorithm reduces the complexity by omitting one of the least square operations. A high speed hardware is implemented in SMIC 65nm CMOS. The ACD algorithm is used when solving least square problem. Systolic array architecture is used and multipliers are reused to the most extent to reduce area. The accelerator utilizes a measure vector with 64 elements to reconstruct a digital signal with length 256 and sparsity 8. The synthesized design area is 3.33 mm2 and reconstruction time is 7.42us.

[1]  William P. Marnane,et al.  Alternative systolic array for non-square-root Cholesky decomposition , 1997 .

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

[3]  Tihomir Car Lectures on Physics , 2013 .

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

[5]  Tinoosh Mohsenin,et al.  High performance compressive sensing reconstruction hardware with QRD process , 2012, 2012 IEEE International Symposium on Circuits and Systems.