Extended bit-filling and LDPC code design

Campello, Modha and Rajagopalan (see Proc. Int. Conf. Communications (ICC), Helsinki, Finland, 2001) proposed a simple-to-implement heuristic, namely, bit-filling, for constructing high rate and high girth LDPC codes. In the present work, we extend bit-filling, and demonstrate that the extended algorithm produces better codes, that is, codes with higher rate/girth and good bit error rate performance. We demonstrate the positive effect of girth on bit error rate performance.

[1]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[2]  David J. C. MacKay,et al.  Encyclopedia of Sparse Graph Codes , 1999 .

[3]  David J. C. MacKay,et al.  Good Error-Correcting Codes Based on Very Sparse Matrices , 1997, IEEE Trans. Inf. Theory.

[4]  Dharmendra S. Modha,et al.  Designing LDPC codes using bit-filling , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

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

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