High-rate sparse superposition codes with iteratively optimal estimates

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2012, Pages 120-124

  Barron, Andrew R ^a   Cho, Sanghee ^a  

^a YALE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADDITIVE WHITE GAUSSIAN NOISE CHANNEL; HIGH RATE; PERFORMANCE IMPROVEMENTS; POSTERIOR PROBABILITY; SOFT DECISION; SQUARED ERRORS; TERM SELECTION; THRESHOLDING;

DECODING; INFORMATION THEORY;

OPTIMIZATION;

EID: 84867548964     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2012.6283048     Document Type: Conference Paper

References (7)

1. A.R. Barron and A. Joseph, "Toward fast reliable communication at rates near capacity with Gaussian noise, Proc. IEEE Intern. Symp. Inform. Theory, Austin, TX, June 13-18, 2010.
2. A.R. Barron and A. Joseph, "Sparse superposition codes: Fast and reliable at rates approaching capacity with Gaussian noise," March 2011. Available from www.stat.yale.edu/~arb4/publications.html
3. A.R. Barron and A. Joseph "Analysis of fast sparse superposition codes," Proc. IEEE Intern. Symp. Inform. Theory, St. Petersburg, Russia, 2011.
4. M. Bayati and A. Montanari, "The dynamics of message passing on dense graphs, with applications to compressed sensing," IEEE Trans. Inform. Theory, vol.57, no.2, pp.764-785, Feb. 2011.
5. M. Bayati and A. Montanari, "The LASSO risk for gaussian matrices," IEEE Trans. Inform. Theory, vol.58, no.4, pp.1997-2017, April 2012.
6. A. Joseph and A.R. Barron, "Least squares superposition codes of moderate dictionary size are reliable at rates up to capacity," IEEE Trans. Inform. Theory, vol.58, no.5, pp.2541-2557, May 2012.
7. S. ten Brink, "Convergence behavior of iteratively decoded parallel concatenated codes," IEEE Trans. Commun., vol.49, no.10, pp.1727-1737, Oct 2001.