List message passing algorithm for noiseless compressed sensing
Document typeConference report
Rights accessOpen Access
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.
© 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
CitationRamirez, F., Lamarca, M. List message passing algorithm for noiseless compressed sensing. A: Asia-Pacific Signal and Information Processing Association Annual Summit and Conference. "Proceedings of APSIPA Annual Summit and Conference 2015". Hong-Kong: 2015, p. 1116-1120.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder