An efficient girth-locating algorithm for quasi-cyclic LDPC codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2006, Pages 817-820

  Xiaofu, Wu ^a,b   Xiaohu, You ^a   Chunming, Zhao ^a  

^a SOUTHEAST UNIVERSITY   (China)

^b INSTITUTE OF COMMUNICATIONS ENGINEERING   (China)

Author keywords

[No Author keywords available]

Indexed keywords

GIRTH-LOCATING ALGORITHM; QUASI-CYCLIC CODES;

CODES (SYMBOLS); MATRIX ALGEBRA; POLYNOMIAL APPROXIMATION;

ALGORITHMS;

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

References (6)

1. M. P. C. Fossorier, "Quasi-cyclic low-density parity-check codes from circulant permutation matrices," IEEE Trans. Inform. Theory, vol. 50, no. 8, pp. 1788-1794, Aug. 2004.
2. R. M. Tanner, D. Sridhara, A. Sridharan, T. E. Fuja, and D. J. Costello, "Ldpc block and convolutional codes based on circulant matrices," IEEE Trans. Inform. Theory, vol. 50, no. 12, pp. 2966-2984, Dec. 2004.
3. J. L. Fan, "Array codes as low-density parity-check codes," in Proc. 2nd Int. Symp. on Turbo Codes, Sept. 2000, pp. 543-546.
4. R. Smarandache and P. O. Vontobel, "On regular quasi-cyclic ldpc codes from binomials," in Proc. 2004 IEEE International Symposium on Information Theory, 2004, p. 274.
5. J. A. McGowan and R. C. Williamson, "Loop removal from ldpc codes," in Proc. 2003 IEEE Information Theory Workshop, 2003, p. 274.
6. X. Y. Hu, E. Eleftheriou, and D. M. Arnold, "Progressive edge-growth tanner graphs," in Proc. 2001 IEEE Global Telecommun. Conf, Nov. 2001, pp. 995-1001.