Replica analysis and approximate message passing decoder for superposition codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2014, Pages 1494-1498

  Barbier, Jean ^a,b   Krzakala, Florent ^a,b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b SORBONNE UNIVERSITÉ   (France)

Author keywords

[No Author keywords available]

Indexed keywords

GAUSSIAN NOISE (ELECTRONIC); INFORMATION THEORY;

ADDITIVE WHITE GAUSSIAN NOISE CHANNEL; CRUCIAL PARAMETERS; DENSITY EVOLUTION; LARGE-SIGNALS; MESSAGE PASSING DECODERS; MESSAGE-PASSING DECODER; REPLICA ANALYSIS; SUPERPOSITION CODES;

DECODING;

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

References (22)

1. A. R. Barron and A. Joseph, "Sparse superposition codes: Fast and reliable at rates approaching capacity with gaussian noise, " Manuscript. Available at "http://www.stat.yale.edu/arb4, 2010.
2. A. Joseph and A. R. Barron, "Least squares superposition codes of moderate dictionary size are reliable at rates up to capacity, " Information Theory, IEEE Transactions on, vol. 58, no. 5, pp. 2541-2557, 2012.
3. D. L. Donoho, A. Maleki, and A. Montanari, "Message-passing algorithms for compressed sensing, " Proc. Natl. Acad. Sci., vol. 106, no. 45, pp. 18 914-18 919, 2009.
4. M. Bayati and A. Montanari, "The dynamics of message passing on dense graphs, with applications to compressed sensing, " IEEE Transactions on Information Theory, vol. 57, no. 2, pp. 764 -785, 2011.
5. S. Rangan, "Generalized approximate message passing for estimation with random linear mixing, " in IEEE International Symposium on Information Theory Proceedings (ISIT), 2011, pp. 2168 -2172.
6. F. Krzakala, M. Mézard, F. Sausset, Y. Sun, and L. Zdeborová, "Statistical physics-based reconstruction in compressed sensing, " Phys. Rev. X, vol. 2, p. 021005, 2012.
7. T. Richardson and R. Urbanke, Modern Coding Theory. Cambridge University Press, 2008.
8. M. Mézard, G. Parisi, and M. A. Virasoro, Spin-Glass Theory and Beyond. Singapore: World Scientific, 1987, vol. 9.
9. M. Mézard and A. Montanari, Information, Physics, and Computation. Oxford: Oxford Press, 2009.
10. A. R. Barron and A. Joseph, "Analysis of fast sparse superposition codes, " in Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on. IEEE, 2011, pp. 1772-1776.
11. A. Montanari, "Graphical models concepts in compressed sensing, " Compressed Sensing: Theory and Applications, pp. 394-438, 2012.
12. F. Krzakala, M. Mézard, F. Sausset, Y. Sun, and L. Zdeborová, "Probabilistic reconstruction in compressed sensing: Algorithms, phase diagrams, and threshold achieving matrices, " J. Stat. Mech., 2012.
13. T. Tanaka, "A statistical-mechanics approach to large-system analysis of cdma multiuser detectors, " IEEE Trans. Infor. Theory, vol. 48, pp. 2888-2910, 2002.
14. Y. Kabashima, T. Wadayama, and T. Tanaka, "A typical reconstruction limit of compressed sensing based on lp-norm minimization, " J. Stat. Mech., p. L09003, 2009.
15. H. Nishimori, Statistical Physics of Spin Glasses and Information Processing. Oxford: Oxford University Press, 2001.
16. A. R. Barron and S. Cho, "High-rate sparse superposition codes with iteratively optimal estimates, " in Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on. IEEE, 2012, pp. 120-124.
17. S. Kudekar, T. Richardson, and R. Urbanke, "Spatially coupled ensembles universally achieve capacity under belief propagation, " 2012, arXiv:1201.2999v1 [cs.IT].
18. S. Kudekar, T. Richardson, and R. Urbanke, "Threshold saturation via spatial coupling: Why convolutional ldpc ensembles perform so well over the bec, " in Information Theory Proceedings (ISIT) 2010, pp. 684-688.
19. A. Yedla, Y.-Y. Jian, P. S. Nguyen, and H. D. Pfister, "A simple proof of threshold saturation for coupled scalar recursions, " 2012, arXiv:1204.5703v1 [cs.IT].
20. D. L. Donoho, A. Javanmard, and A. Montanari, " Informationtheoretically optimal compressed sensing via spatial coupling and approximate message passing, " in Proc. of the IEEE Int. Symposium on Information Theory (ISIT), 2012.
21. A. Javanmard and A. Montanari, "Subsampling at information theoretically optimal rates, " in Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on, July 2012, pp. 2431-2435.
22. J. Barbier, F. Krzakala, and C. Schülke, "Compressed sensing and approximate message passing with spatially-coupled fourier and hadamard matrices, " arXiv preprint arXiv:1312.1740, 2013.