Recursive design of high girth (2,k) LDPC codes from (k,k) LDPC codes

IEEE Communications Letters

Volumn 15, Issue 1, 2011, Pages 70-72

  Tao, Xiongfei ^a   Zheng, Lixin ^a   Liu, Weizhong ^a   Liu, Dongsheng ^a  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

column weight 2; high girth; LDPC codes; recursive design

Indexed keywords

COLUMN-WEIGHT-2; HIGH GIRTH; LDPC CODES; QC LDPC CODES; RECURSIVE DESIGN; SEARCH ALGORITHMS; TANNER GRAPHS;

CODING ERRORS; CONVOLUTIONAL CODES; DESIGN;

ERROR CORRECTION;

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

References (8)

1. R. G. Gallager, "Low density parity check codes," IEEE Trans. Inf.Theory, vol.IT-8, no. 1, pp. 21-28, Jan. 1962.
2. H. Song, J. Liu, and B. V. K. V. Kumar, "Low complexity LDPC codesfor partial response channels," in Proc. IEEE Globecom 2002, vol. 2, pp.1294-1299. .
3. A. Venkiah, D. Declercq, and C. Poulliat, "Design of cages with arandomized progressive edge-growth algorithms," IEEE Commun. Lett.,vol. 12, no. 4, pp. 301-303, Apr. 2008. .
4. H. Zhang and J. M. F. Moura, "Large-girth LDPC codes based ongraphical models," in Proc. IEEE SPAWC'03, pp. 100-104. .
5. M. Esmaeili and M. Gholami, "Geometrically-structured maximum-girthLDPC block and convolutional codes," IEEE J. Sel. Areas Commun., vol.27, no. 6, pp. 831-845, 2009. .
6. Y. Kou, S. Lin, and M. P. C. Fossorier, "Low-density parity-check codesbased on finite geometries: a rediscovery and new results," IEEE Trans.Inf. Theory, vol. 47, no. 7, pp. 2711-2736, Nov. 2001. .
7. S. Kim, J. No, H. Chung, and D. Shin, "Quasi-cyclic low-density parity-check codes with girth larger than 12," IEEE Trans. Inf. Theory, vol. 53,no. 8, pp. 2885-2891, 2007. .
8. M. P. C. Fossorier, "Quasi-cyclic low-density parity-check codes fromcirculant permutation matrices," IEEE Trans. Inf. Theory, vol. 50, no. 8,pp. 1788-1793, Aug. 2004.