List message passing algorithm for noiseless compressed sensing

We propose a verification-based algorithm for noiseless Compressed Sensing that reconstructs the original signal operating on a sparse graph. The proposed scheme has affordable computational complexity and its performance is significantly better than previous verification-based algorithms and simila...

Full description

Saved in:
Bibliographic Details
Published in2015 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA) pp. 1116 - 1120
Main Authors Ramirez-Javega, Francisco, Lamarca, Meritxell
Format Conference Proceeding
LanguageEnglish
Published Asia-Pacific Signal and Information Processing Association 01.12.2015
Subjects
Algorithm design and analysis
Compressed sensing
Computational complexity
Decoding
Message passing
Parity check codes
Sparse matrices
Online AccessGet full text
DOI10.1109/APSIPA.2015.7415444

Cover

More Information
Summary:We propose a verification-based algorithm for noiseless Compressed Sensing that reconstructs the original signal operating on a sparse graph. The proposed scheme has affordable computational complexity and its performance is significantly better than previous verification-based algorithms and similar to AMP-based algorithms. We also show that the performance of a noiseless compressed sensing scheme when verification-based algorithms and a sparse matrix is employed to reconstruct the original signal can be upper bounded by the performance of a LDPC code employing the same parity matrix when correcting a codeword transmitted through a BEC.
DOI:10.1109/APSIPA.2015.7415444