LDPC Codes for Compressed Sensing
Alexandros G. Dimakis, Roxana Smarandache, and Pascal O. Vontobel

TL;DR
This paper establishes a mathematical link between channel coding and compressed sensing, showing how LDPC codes can be used as effective measurement matrices for basis pursuit, enabling deterministic constructions with optimal size.
Contribution
It introduces a tight connection between LP decoding in channel coding and compressed sensing, enabling the transfer of performance guarantees and proposing LDPC codes as measurement matrices.
Findings
Parity-check matrices of good channel codes are effective measurement matrices.
First deterministic construction of compressed sensing matrices with optimal size.
High-girth LDPC codes can be used for basis pursuit.
Abstract
We present a mathematical connection between channel coding and compressed sensing. In particular, we link, on the one hand, \emph{channel coding linear programming decoding (CC-LPD)}, which is a well-known relaxation o maximum-likelihood channel decoding for binary linear codes, and, on the other hand, \emph{compressed sensing linear programming decoding (CS-LPD)}, also known as basis pursuit, which is a widely used linear programming relaxation for the problem of finding the sparsest solution of an under-determined system of linear equations. More specifically, we establis a tight connection between CS-LPD based on a zero-one measurement matrix over the reals and CC-LPD of the binary linear channel code that is obtained by viewing this measurement matrix as a binary parity-check matrix. This connection allows the translation of performance guarantees from one setup to the other. The…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
