Design and performance evaluation of some high-rate irregular low-density parity-check codes

The irregular low-density parity-check codes (LDPCC) have been proposed by Richardson, Shokrollahi and Urbanke (see IEEE Trans. on Inf. Theory), in many cases outperforming the best known turbo-codes. These results have been obtained by allowing the degree of nodes (variable or check) of a LDPCC to vary according to some distribution. We give new distributions to design high rate irregular LDPCC, more precisely rates 7/8, 8/9 and 15/16, motivated by applications to space data communication. Then, we investigate the performance of these new codes over AWGN channels, for different codeword lengths. The error rates obtained are always less than 1 dB from the channel capacity, and in most cases better than the results obtained by turbo-codes with the same parameters. Finally, we investigate, by means of an original method, the minimum distance of irregular LDPCC. The results show that irregular LDPCC have quite low minimum distance, giving rise, similarly to turbo-codes, to the "error floor" phenomenon.

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

[2]  D.J.C. MacKay,et al.  Good error-correcting codes based on very sparse matrices , 1997, Proceedings of IEEE International Symposium on Information Theory.

[3]  Sergio Benedetto,et al.  Principles of digital transmission , 1999 .

[4]  R. Gallager Information Theory and Reliable Communication , 1968 .

[5]  T. Richardson,et al.  Design of provably good low-density parity check codes , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[6]  Marco Chiani,et al.  Evaluation of low-density parity-check codes over block fading channels , 2000, 2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record.

[7]  Rüdiger L. Urbanke,et al.  Efficient encoding of low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.