Number of measurements in sparse signal recovery

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2009, Pages 16-20

  Tune, Paul ^a   Bhaskaran, Sibi Raj ^a   Hanly, Stephen ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC PERFORMANCE; COMPOUND CHANNEL; COMPRESSED SENSING; GAUSSIANS; LINEAR REGIME; NOISY MEASUREMENTS; SPARSE SIGNALS; SUB-GAUSSIANS;

INFORMATION THEORY;

SIGNAL RECONSTRUCTION;

EID: 70449490669     PISSN: 21578102     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2009.5205809     Document Type: Conference Paper

References (11)

1. M. Akcakaya and V. Tarokh. Shannon theoretic limits on noisy compressive sensing. IEEE Tran. Info. Theory, 2007. preprint, http://arxiv.org/PS- cache/arxiv/pdf/0711/0711.0366v1.pdf.
2. S.-C. Chang and J. K. Wolf. On the T-user M-frequency noiseless multiple-access channel with and without intensity information. IEEE Trans. Info. Theory, 27(1):41-48, January 1981.
3. T. M. Cover and J. A. Thomas. Elements of Information Theory. John Wiley and Sons, Inc., 2nd edition, 2006.
4. I. Csiszár and J. Körner. Information Theory. Akadémiai Kiadó, 3rd edition, 1981.
5. A. K. Fletcher, S. Rangan, and V. K. Goyal. Necessary and sufficient conditions on sparsity pattern recovery. 2008. preprint, http://arxiv.org/abs/ 0804.1839.
6. M. Gastpar and Y. Bresler. On the necessary density for spectrum-blind nonuniform sampling subject to quantization. In Proc. IEEE Int. Conf. Acoustics, Speech and Signal Processing, pages 1633-1636, Istanbul, Turkey, June 2000.
7. G. Reeves. Sparse signal sampling using noisy linear projections. Technical Report UCB/EECS-2008-3, Univ. of California, Berkeley, Dept. of Elec. Eng. and Comp. Sci., January 2008.
8. M. Rudelson and R. Vershynin. The smallest singular value of a random rectangular matrix. 2008. preprint, http://wwwpersonal.umich.edu/-romanv/papers/ rv-rectangular-matrices.pdf.
9. P. Tune, S. B. Pillai, and S. Hanly. Number of measurements in sparse signal recovery. 2009. preprint, http://arxiv.org/abs/0904.4525.
10. 1-constrained quadratic programming. IEEE Tran. Info. Theory, 2006. preprint, http://www.eecs.berkeley.edu/-wainwrig/Papers/ Wai-SharpThres.pdf.
11. M. Wainwright. Information-theoretic bounds on sparsity recovery in the high-dimensional and noisy setting. In ISIT '07, pages 961-965, June 2007.