Construction of protograph LDPC codes with linear minimum distance

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2006, Pages 664-668

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

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL APPROXIMATION; LINEAR MINIMUM DISTANCE;

CHANNEL CODING; COMPUTER SIMULATION; FIELD PROGRAMMABLE GATE ARRAYS (FPGA); GRAPH THEORY; ITERATIVE DECODING;

CODES (SYMBOLS);

EID: 39049109690     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2006.261868     Document Type: Conference Paper

References (22)

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- density 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, 1998.
6. H. Jin, A. Khandekar, and R. McEliece, "Irregular repeat-accumulate codes," in 2nd International Symposium on Turbo Codes, 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. T. Richardson, "Multi-Edge Type LDPC Codes," presented at the Workshop honoring Prof. Bob McEliece on his 60th birthday, California Institute of Technology, Pasadena, California, May 24-25, 2002.
10. 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.
11. T. Richardson and R. Urbanke,'The Renaissance of Gallager's Low-Density Parity-Check Codes," IEEE Communications Magazine, pages 126-131, August 2003
12. 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.
13. 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.
14. 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, vol. 47, Nov. 2001, pp. 2711-2736.
15. F.R. Kschischang, "Codes defined on graphs," IEEE Communications Magazine, Vol. 41, Issue 8, Aug. 2003, Pages 118-125.
16. A. Abbasfar, D. Divsalar, and K. Yao, "Accumulate Repeat Accumulate Codes," (abstract) IEEE ISIT 2004, Chicago, IL, June 27-July 2, and IEEE Globecom 2004, Dallas, Texas, 29 November - 3 December, 2004.
17. D. Divsalar, C. Jones, S. Dolinar, J. Thorpe; Protograph Based LDPC Codes with Minimum Distance Linearly Growing with Block Size, IEEE Globecom 2005.
18. S.L. Fogal, Robert McEliece, Jeremy thorpe "Enumerators for Protograph Ensembles of LDPC Codes," IEEE ISIT 2005, Adelaide, Australia 4-9 September,2005.
19. D. Divsalar, "Finite Length Weight Enumerators for Protograph Based LDPC Code Ensembles," IEEE Communication Theory Workshop, Park City, Utah, June 12-15, 2005.
20. Changyan Di; Urbanke, R.; Richardson, T.; "Weight distributions: how deviant can you be? " Proceedings, 2001 IEEE International Symposium on Information Theory, 2001. 24-29 June 2001 Page(s):50
21. Tian, T.; Jones, C.; Villasenor, J.; and Wesel, R. D.; "Characterization and selective avoidance of cycles in irregular LDPC code construction," IEEE Transactions on Communications, Aug. 2004, pp. 1242-1247.
22. Chung S. Y.,"On the Construction of Some Capacity-Approaching Coding Schemes," Ph.D. dissertation, Massachusetts Institute of Technology, Cambridge,Massachusetts", Sept., 2000.