Support recovery with sparsely sampled free random matrices

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2011, Pages 2328-2332

  Tulino, Antonia ^a   Caire, Giuseppe ^b   Shamai, Shlomo ^c   Verdu, Sergio ^d  

^a UNIVERSITY OF NAPLES FEDERICO II   (Italy)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^d PRINCETON UNIVERSITY   (United States)

Author keywords

Compressed Sensing; Random Matrices; Rate Distortion Theory; Sparse Models; Support Recovery

Indexed keywords

ADDITIVE GAUSSIAN NOISE; AVERAGE SIZE; COMPRESSED SENSING; COMPRESSIVE SAMPLING; ERROR RATE; INFORMATION THEORETIC BOUNDS; INPUT-OUTPUT; MATRIX; MUTUAL INFORMATIONS; MUTUALLY INDEPENDENTS; RANDOM MATRICES; RANDOM MATRIX; RATE-DISTORTION THEORY; REPLICA METHOD; SPARSE MODELS;

GAUSSIAN NOISE (ELECTRONIC); INFORMATION THEORY;

RECOVERY;

EID: 80054818160     PISSN: 21578104     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2011.6033978     Document Type: Conference Paper

References (16)

1. A. M. Tulino and S. Verdu, "Random Matrix Theory and Wireless Communications", Foundations and Trends In Communications and Information Theory, vol. 1, no. 1, pp. 1-184, 2004.
2. D. L. Donoho, "Compressed sensing", IEEE Tram. Inform. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
3. E. J. Candes and T. Tao, "Near optimal signal recovery from random projections: Universal encoding strategies" IEEE Trans. Inform. Theory, vol. 52, no. 12, pp. 5406-5425, Dec. 2006.
4. M. J. Wainwright, "Information theoretic limitations on sparsity recovery in the high-dimensional and noisy setting", IEEE Tram, on Inform. Theory, Vol. 55, pp. 5728-5741, 2009.
5. W. Wang, M. J. Wainwright, K. Ramchandran, "Information-theoretic limits on sparse signal recovery: Dense versus sparse measurement matrices", IEEE Transactions on Information Theory, Vol. 56, No. 6, pp. 2967-2979, June 2010.
6. G. Reeves and M. Gastpar, "Fundamental Tradeoffs for Sparsity Pattern Recovery", Arxiv 1006.3128vl, June 2010, Also, Proc. 2010 IEEE Int. Symp. on Information Theory.
7. M. Akcakaya and V. Tarokh, "Shannon-theoretic limits on noisy compressive sampling", Vol. 56, No. 1, pp. 492-504, Jan. 2009.
8. D. Guo and S. Verdu, "Randomly Spread CDMA: Asymptotics via Statistical Physics", IEEE Trans, on Inform. Theory, Vol. 51, No. 6, pp. 1983-2010, June 2005.
9. S. Rangan, A. K. Fletcher, and V. K Goyal, "Asymptotic Analysis of MAP Estimation via the Replica Method and Applications to Compressed Sensing", arXiv:0906.3234v2 [cs. IT] 26 Aug. 2009.
10. T. Tanaka, "A statistical mechanics approach to large-system analysis of CDMA multiuser detectors", IEEE Trans. Inform. Theory, vol. 48, pp. 2888-2910, Nov. 2002.
11. D. Guo, D. Baron and S. Shamai (Shitz), "A Single-letter Characterization of Optimal Noisy Compressed Sensing", Forty-Seventh Annual Allerton Conference on Communication, Control, and Computing September 30-October 2, 2009, Allerton Retreat Center, Monticello, Illinois, USA.
12. Y. Kabashima, T. Wadayama and T. Tananka, "Statistical Mechanical Analysis of a Typical Reconstruction Limit of Compressed Sensing", arXiv:1001.4298v2 [cs. IT] 2 Jun. 2010
13. M. Bayati and A. Montanari, "The dynamics of message passing on dense graphs, with applications to compressed sensing", (http://arxiv.org/abs/1001.3448)
14. D. Donoho, "Precise Optimality in Compressed Sensing: Rigorous Theory and Ultra Fast Algorithms", Keynote Address, 2011 Workshop on Information Theory and Applications, UCSD, La Jolla, CA, February 2011
15. A. Tulino, G. Caire, S. Shamai and S. Verdu, "Support Recovery with Sparsely Sampled Free Random Matrices: An Information Theoretic Approach", preprint, 2011.
16. A. M. Tulino, G. Caire, S. Shamai and S. Verdu, "Capacity of Channels with Frequency-Selective and Time-Selective Fading", IEEE Trans. Information Theory, vol. 56, no. 3, pp. 1187-1215, Mar. 2010.