Low-Complexity Iterative Reconstruction Algorithms in Compressed Sensing

ITC/USA 2013 Conference Proceedings / The Forty-Ninth Annual International Telemetering Conference and Technical Exhibition / October 21-24, 2013 / Bally's Hotel & Convention Center, Las Vegas, NV === In this paper we focus on two low-complexity iterative reconstruction algorithms in compre...

Full description

Bibliographic Details
Main Author: Danjean, Ludovic
Other Authors: Vasić, Bane
Language:en_US
Published: International Foundation for Telemetering 2013
Online Access:http://hdl.handle.net/10150/579661
Description
Summary:ITC/USA 2013 Conference Proceedings / The Forty-Ninth Annual International Telemetering Conference and Technical Exhibition / October 21-24, 2013 / Bally's Hotel & Convention Center, Las Vegas, NV === In this paper we focus on two low-complexity iterative reconstruction algorithms in compressed sensing. These algorithms, called the approximate message-passing algorithm and the interval-passing algorithm, are suitable to recover sparse signals from a small set of measurements. Depending on the type of measurement matrix (sparse or random) used to acquire the samples of the signal, one or the other reconstruction algorithm can be used. We present the reconstruction results of these two reconstruction algorithms in terms of proportion of correct reconstructions in the noise free case. We also report in this paper possible practical applications of compressed sensing where the choice of the measurement matrix and the reconstruction algorithm are often governed by the constraint of the considered application.