Capacity-achieving Sparse Regression Codes via approximate message passing decoding

IEEE International Symposium on Information Theory - Proceedings

Volumn 2015-June, Issue , 2015, Pages 2016-2020

  Rush, Cynthia ^a   Greig, Adam ^b   Venkataramanan, Ramji ^b  

^a YALE UNIVERSITY   (United States)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL CAPACITY; CODES (SYMBOLS); DECODING; INFORMATION THEORY; WHITE NOISE;

EMPIRICAL PERFORMANCE; FINITE BLOCK LENGTH; LINEAR COMBINATIONS; MESSAGE PASSING DECODERS; MESSAGE-PASSING DECODING; RELIABLE COMMUNICATION; SPARSE REGRESSION; SUPERPOSITION CODES;

MESSAGE PASSING;

EID: 84969835557     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2015.7282809     Document Type: Conference Paper

References (16)

1. A. Joseph and A. R. Barron, "Fast sparse superposition codes have near exponential error probability for R < C, " IEEE Trans. Inf. Theory, vol. 60, pp. 919-942, Feb. 2014.
2. A. R. Barron and S. Cho, "High-rate sparse superposition codes with iteratively optimal estimates, " in ISIT, 2012.
3. S. Cho, High-dimensional regression with random design, including sparse superposition codes. PhD thesis, Yale University, 2014.
4. D. L. Donoho, A. Maleki, and A. Montanari, "Message-passing algorithms for compressed sensing, " Proceedings of the National Academy of Sciences, vol. 106, no. 45, pp. 18914-18919, 2009.
5. D. L. Donoho, A. Maleki, and A. Montanari, "Message passing algorithms for compressed sensing: I. motivation and construction, " in IEEE Information Theory Workshop (ITW), 2010.
6. M. Bayati and A. Montanari, "The dynamics of message passing on dense graphs, with applications to compressed sensing, " IEEE Trans. Inf. Theory, pp. 764-785, 2011.
7. A. Montanari, "Graphical models concepts in compressed sensing, " in Compressed Sensing (Y. C. Eldar and G. Kutyniok, eds.), pp. 394-438, Cambridge University Press, 2012.
8. F. Krzakala, M. Mézard, F. Sausset, Y. Sun, and L. Zdeborová, "Probabilistic reconstruction in compressed sensing: algorithms, phase diagrams, and threshold achieving matrices, " Journal of Statistical Mechanics: Theory and Experiment, no. 8, 2012.
9. S. Rangan, "Generalized approximate message passing for estimation with random linear mixing, " in ISIT, pp. 2168-2172, 2011.
10. R. Baraniuk, E. Candes, R. Nowak, and M. Vetterli (editors), "Special issue on compressive sampling, " IEEE Signal Processing Magazine, vol. 25, March 2008.
11. E. Candes and T. Tao, "Decoding by linear programming, " IEEE Trans. Inf. Theory, vol. 51, pp. 4203-4215, Dec. 2005.
12. D. Donoho, "Compressed sensing, " IEEE Trans. Inf. Theory, vol. 52, pp. 1289-1306, April 2006.
13. A. Javanmard and A. Montanari, "State evolution for general approximate message passing algorithms, with applications to spatial coupling, " Information and Inference, p. iat004, 2013.
14. J. Barbier and F. Krzakala, "Replica analysis and approximate message passing decoder for sparse superposition codes, " in ISIT, 2014.
15. J. Barbier, C. Schulke, and F. Krzakala, "Approximate message-passing with spatially coupled structured operators, with applications to compressed sensing and sparse superposition codes. " arXiv: 1312. 1740.
16. C. Rush, A. Greig, and R. Venkataramanan, "Capacity-achieving sparse superposition codes via approximate message passing decoding. " arXiv: 1501. 05892.