论文信息 - A greedy search for improved QC LDPC codes with good girth profile and degree distribution

A greedy search for improved QC LDPC codes with good girth profile and degree distribution

The girth profile is introduced and search algorithms for regular and irregular quasi-cyclic LDPC block codes with both good girth profile and good degree distribution are presented. New QC LDPC block codes of various code rates are obtained and their bit error rate performance is compared with that of the corresponding LDPC block codes defined in the IEEE 802.16 WiMAX standard of the same block length and code rate.

Florian Hug | Rolf Johannesson | Irina E. Bocharova | Boris D. Kudryashov

[1] M. Esmaeili,et al. Structured quasi-cyclic LDPC codes with girth 18 and column-weight J⩾3 , 2010 .

[2] Florian Hug,et al. Searching for Voltage Graph-Based LDPC Tailbiting Codes With Large Girth , 2011, IEEE Transactions on Information Theory.

[3] Rüdiger L. Urbanke,et al. Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[4] Robert Michael Tanner,et al. A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[5] R. Häggkvist,et al. Bipartite graphs and their applications , 1998 .

[6] M. E. O'Sullivan,et al. Algebraic construction of sparse matrices with large girth , 2006, IEEE Transactions on Information Theory.