Low-rate LDPC codes with simple protograph structure

IEEE International Symposium on Information Theory - Proceedings

Volumn 2005, Issue , 2005, Pages 1622-1626

  Divsalar, Dariush ^a   Dolinar, Sam ^a   Jones, Christopher ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIFFERENTIATORS; HYBRID CONCATENATED CODES; LOW DENSITY PARITY CHECK (LDPC) CODES; PROTOGRAPH STRUCTURES;

CHANNEL CAPACITY; COMPUTER SIMULATION; DECODING; ERROR CORRECTION; GRAPH THEORY; ITERATIVE METHODS;

CODES (SYMBOLS);

EID: 33749451195     PISSN: 21578099     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2005.1523619     Document Type: Conference Paper

References (21)

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. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching irregular low-ensity parity-check codes," IEEE Trans. Inform. Theory, vol. 47, pp. 619-637, 2001.
5. D. Divsalar, H. Jin, and R. McEliece, "Coding theorems for Turbo-like codes," in Proceedings of the 1998 Allerton Conference, pp. 201-210, 1998.
6. H. Jin, A. Khandekar, and R. McEliece, " Irregular repeat-accumulate codes," in Proc. 2nd International Symposium on Turbo Codes, pp. 1-8, 2000.
7. Jeremy Thorpe, "Low Density Parity Check (LDPC) Codes Constructed from Protographs," JPL INP Progress Report 42-154, August 15, 2003.
8. Richardson, et al., "Methods and apparatus for decoding LDPC codes," United States Patent 6,633,856, October 14, 2003.
9. 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.
10. T. Richardson and R. Urbanke, "The Renaissance of Gallager's Low-Density Parity-Check Codes," IEEE Communications Magazine, pages 126-131, August 2003
11. 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.
12. F.R. Kschischang, "Codes defined on graphs," IEEE Communications Magazine, Vol. 41, Issue 8, Aug. 2003, Pages 118-125.
13. S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, "Serial concate-nation of interleaved codes: Performance analysis, design, and iterative decoding," IEEE Trans. Info. Theory, vol. 44, pp. 909-926, May 1998.
14. A. Abbasfar, D. Divsalar, and K. Yao,"Accumulate Repeat Accumulate Codes," ISIT 2004, and IEEE Globecom 2004.
15. T. J. Richardson and R. Urbanke, "Multi-edge type LDPC codes," preprint. [Online]. Available: http://lthcwww.ep.ch/papers/multiedge.ps.
16. M. Luby,"LT-codes," in Proceedings of the ACM Symposium on Foundations of Computer Science (FOCS), 2002.
17. A. Shokrollahi, "Raptor codes," Proceedings 2004 IEEE International Symposium on Information Theory (ISIT2004), p. 36, Chicago, IL, USA, June 2004.
18. D. Divsalar,and F. Pollara, "Hybrid concatenated codes and iterative decoding," Proceedings of 1997 IEEE International Symposium on Information Theory, page 10, June 29-July 4, 1997.
19. Tian T., Jones C., Villasenor J., Wesel R. D.,"Characterization and selective avoidance of cycles in irregular LDPC code construction," IEEE Trans. on Comm., vol. 52, pages 1242-1247, Aug. 2004.
20. Ramamoorthy A., Wesel R. D.," Analysis of an Algorithm for Irregular LDPC Code Construction," In Proceedings ISIT 2004, page 69, Chicago, Illinois.
21. Arnold D. M., Eleftheriou E., Hu. X. Y., "Progressive edge-growth Tanner graphs,"In Proceedings IEEE Global Telecommunications Conf. 2001, Pages:995-1001 vol.2, San Antonio, TX, 25-29 Nov. 2001.