Compressive Sensing Using Low Density Frames
| dc.creator | Akçakaya, Mehmet | |
| dc.creator | Park, Jinsoo | |
| dc.creator | Tarokh, Vahid | |
| dc.date | 2009-03-03 | |
| dc.date.accessioned | 2026-07-07T12:48:57Z | |
| dc.date.available | 2026-07-07T12:48:57Z | |
| dc.description | We consider the compressive sensing of a sparse or compressible signal ${\bf x} \in {\mathbb R}^M$. We explicitly construct a class of measurement matrices, referred to as the low density frames, and develop decoding algorithms that produce an accurate estimate $\hat{\bf x}$ even in the presence of additive noise. Low density frames are sparse matrices and have small storage requirements. Our decoding algorithms for these frames have $O(M)$ complexity. Simulation results are provided, demonstrating that our approach significantly outperforms state-of-the-art recovery algorithms for numerous cases of interest. In particular, for Gaussian sparse signals and Gaussian noise, we are within 2 dB range of the theoretical lower bound in most cases. | |
| dc.description | 11 pages, 6 figures, Submitted to IEEE Transactions on Signal Processing | |
| dc.identifier | https://arxiv.org/abs/0903.0650 | |
| dc.identifier | http://arxiv.org/abs/0903.0650 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/222238 | |
| dc.subject | Information Theory | |
| dc.subject | Computation | |
| dc.title | Compressive Sensing Using Low Density Frames | |
| dc.type | text |