VLSI Design of Approximate Message Passing for Signal Restoration and Compressive Sensing

被引:51
作者
Maechler, Patrick [1 ]
Studer, Christoph [3 ]
Bellasi, David E. [1 ]
Maleki, Arian [3 ]
Burg, Andreas [2 ]
Felber, Norbert [1 ]
Kaeslin, Hubert [1 ]
Baraniuk, Richard G. [3 ]
机构
[1] ETH, Dept Elect Engn & Informat Technol, CH-8092 Zurich, Switzerland
[2] Ecole Polytech Fed Lausanne, Inst Elect Engn, CH-1015 Lausanne, Switzerland
[3] Rice Univ, Dept Elect & Comp Engn, Houston, TX 77004 USA
基金
美国国家科学基金会; 瑞士国家科学基金会;
关键词
Approximate message passing (AMP); compressive sensing (CS); fast discrete cosine transform (DCT); field-programmable gate array (FPGA); signal restoration; sparse signal recovery; very-large scale integration (VLSI); l(1-)norm minimization; THRESHOLDING ALGORITHM; COSINE TRANSFORM; RECOVERY; RECONSTRUCTION; FFT;
D O I
10.1109/JETCAS.2012.2214636
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Sparse signal recovery finds use in a variety of practical applications, such as signal and image restoration and the recovery of signals acquired by compressive sensing. In this paper, we present two generic very-large-scale integration (VLSI) architectures that implement the approximate message passing (AMP) algorithm for sparse signal recovery. The first architecture, referred to as AMP-M, employs parallel multiply-accumulate units and is suitable for recovery problems based on unstructured (e. g., random) matrices. The second architecture, referred to as AMP-T, takes advantage of fast linear transforms, which arise in many real-world applications. To demonstrate the effectiveness of both architectures, we present corresponding VLSI and field-programmable gate array implementation results for an audio restoration application. We show that AMP-T is superior to AMP-M with respect to silicon area, throughput, and power consumption, whereas AMP-M offers more flexibility.
引用
收藏
页码:579 / 590
页数:12
相关论文
共 42 条
[1]  
Adler A, 2011, INT CONF ACOUST SPEE, P329
[2]   K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation [J].
Aharon, Michal ;
Elad, Michael ;
Bruckstein, Alfred .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2006, 54 (11) :4311-4322
[3]   DISCRETE COSINE TRANSFORM [J].
AHMED, N ;
NATARAJAN, T ;
RAO, KR .
IEEE TRANSACTIONS ON COMPUTERS, 1974, C 23 (01) :90-93
[4]  
[Anonymous], 2009, WAVELET TOUR SIGNAL
[5]  
[Anonymous], TR0707 RIC U DEP COM
[6]  
Baraniuk Richard, 2007, 2007 IEEE Radar Conference, P128, DOI 10.1109/RADAR.2007.374203
[7]  
Baraniuk R., 2006, Goodbye, textbooks
[8]  
hello, open-source learning [video]. Retrieved November 15, 2007
[9]   A Simple Proof of the Restricted Isometry Property for Random Matrices [J].
Baraniuk, Richard ;
Davenport, Mark ;
DeVore, Ronald ;
Wakin, Michael .
CONSTRUCTIVE APPROXIMATION, 2008, 28 (03) :253-263
[10]   A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems [J].
Beck, Amir ;
Teboulle, Marc .
SIAM JOURNAL ON IMAGING SCIENCES, 2009, 2 (01) :183-202