Maximum likelihood decoding analysis of Accumulate-Repeat-Accumulate codes

GLOBECOM - IEEE Global Telecommunications Conference

Volumn 1, Issue , 2004, Pages 514-519

  Abbasfar, Aliazam ^a   Divsalar, Dariush ^b   Yao, Kung ^a  

^a University of California   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LOW DENSITY PARITY CHECK (LDPC); MAXIMUM LIKELIHOOD (ML); MAXIMUM LIKELIHOOD DECODING ANALYSIS; REPEAT-ACCUMULATE (RA) CODES;

BIT ERROR RATE; GAUSSIAN NOISE (ELECTRONIC); IMAGE CODING; MATHEMATICAL MODELS; SIGNAL TO NOISE RATIO; TURBO CODES;

DECODING;

EID: 18144391226     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. R. G. Gallager, Low Density Parity Check Codes. Cambridge, MA: MIT Press, 1963.
2. C. Berrou and A. Glavieux, "Near optimum error correcting coding and decoding: Turbo-codes," IEEE Trans. Commun., Vol. 44, pp. 1261-1271, October 1996.
3. M. R. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. 27, pp. 533-547, 1981.
4. D. Divsalar, H. Jin, and R. McEliece, "Coding theorems for Turbo-like codes," in Proceedings of the 1998 Allerton Conference, pp. 201-210. 1998.
5. H. Jin, A. Khandekar, and R. McEliece, "Irregular repeat-accumulate codes," in Proc. 2nd International Symposium on Turbo Codes, pp. 1-8, 2000.
6. D.J.C. MacKay, R.M Neal, "Near Shannon limit performance of low density parity check codes," Electronics Letters, Vol. 32, Issue 18, 29 Aug. 1996, Page(s) 1645.
7. D. Divsalar, "A simple tight bound on error probability of block codes with application to turbo codes," Jet Propulsion Laboratory, CA, JPL TMO Progress Report 42-139, Nov. 15, 1999 pp. 1-35. (http://lmo.jpl.nasa.gov/ tmo/progress_report/42-139/title.htm)
8. D. Divsalar, and E. Biglieri, "Upper Bounds to Error Probabilities of Coded Systems Beyond the Cutoff Rate," IEEE Trans. on Communications, vol. 51, No. 12, December 2003.
9. M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. Spielman, "Analysis of low density codes and improved designs using irregular graphs," IEEE Trans. Inform. Theory, vol. 47, pp. 585-598, 2001.
10. T. Richardson and R. Urbanke, "The capacity of low-density parity check codes under message-passing decoding," IEEE Trans. Inform. Theory, vol. 47, pp. 599-618, 2001.
11. Y. Kou, S. Lin, and M.P.C. Fossorier, "Low-density parity-check codes based on finite geometries: a rediscovery and new results," IEEE Transactions on Information Theory, Volume: 47 Issue: 7, Nov. 2001, Page(s): 2711-2736.
12. F.R. Kschischang, "Codes defined on graphs," IEEE Communications Magazine, Vol. 41, Issue 8, Aug. 2003, Pages 118-25.
13. S. Bennedetto and G. Montorsi, "Unveiling Tuitoo Codes: Some results on parallel concatenated codes," IEEE Trans. On Information Theory, vol. 42, no. 2, March 1996, pp. 409-428.
14. S. Benedetto, G. Montorsi, D. Divsalar, and F. Pollara, "Serial concatenation of interleaved codes: Performance analysis, design, and iterative decoding," IEEE Trans. Info. Theory, vol. 44, pp. 909-926, May 1998.