Iterative construction of regular LDPC codes from independent tree-based minimum distance bounds

IEEE Communications Letters

Volumn 15, Issue 3, 2011, Pages 334-336

  Psota, Eric ^a   Pérez, Lance C ^a  

^a UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

computation tree; girth; iterative decoding; LDPC codes; minimum distance; progressive edge growth (PEG)

Indexed keywords

COMPUTATION TREES; GIRTH; LDPC CODES; MINIMUM DISTANCE; PROGRESSIVE EDGE-GROWTH (PEG);

CODES (SYMBOLS); CODING ERRORS; ERROR CORRECTION; GAUSSIAN NOISE (ELECTRONIC); OPTICAL COMMUNICATION; OPTIMIZATION; SIGNAL TO NOISE RATIO; WHITE NOISE;

ITERATIVE DECODING;

EID: 79952698621     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2011.011311.102252     Document Type: Article

References (9)

1. D. J. C. MacKay and R. M. Neal, "Near Shannon limit performance of low-density parity check codes," IEE Electron. Lett., vol. 32, pp. 1645-1646, Aug. 1996. (Pubitemid 126546283)
2. X.-Y. Hu, E. Eleftheriou, and D.-M. Arnold, "Progressive edge-growth Tanner graphs," in Proc. 2001 Global Telecommunications Conference, vol. 2, pp. 995-1001, Nov. 2001. (Pubitemid 34058764)
3. T. Richardson and R. Urbanke, "The capacity of low-density parity check codes under message-passing decoding," IEEE Trans. Inf. Theory, vol. 47, pp. 599-618, Feb. 2001. (Pubitemid 32318092)
4. H. Xiao and A. Banihashemi, "Improved progressive-edge-growth (PEG) construction of irregular LDPC codes," IEEE Commun. Lett., vol. 8, pp. 715-717, Dec. 2004. (Pubitemid 40085293)
5. D. Vukobratovic and V. Senk, "Generalized ACE constrained progressive edge-growth LDPC code design," IEEE Commun. Lett., vol. 12, pp. 32-34, Jan. 2008. (Pubitemid 351279752)
6. E. Psota and L. C. Pérez, "Extrinsic tree decoding," in Proc. 2009 Conference on Information Sciences and Systems, Mar. 2009.
7. E. Psota and L. C. Pérez, "LDPC decoding and code design on extrinsic trees," in Proc. 2009 Int'l Symposium on Information Theory, June 2009.
8. N. Wiberg, "Codes and decoding on general graphs," Ph.D. thesis, Linköping University, Linköping, Sweden, 1996.
9. H. Chen and Z. Cao, "A modified PEG algorithm for construction of LDPC codes with strictly concentrated check-node degree distributions," in Proc. IEEE Wireless Communications and Networking Conference (WCNC 2007), pp. 564-568, Mar. 2007.