A class of efficient-encoding generalized low-density parity-check codes

In this paper, we investigate an efficient encoding approach for generalized low-density (GLD) parity check codes, a generalization of Gallager's (1962, 1963) low-density parity check (LDPC) codes. We propose a systematic approach to construct an approximate upper triangular GLD parity check matrix which defines a class of efficient-encoding GLD codes. It is shown that such GLD codes have equally good performance. By effectively exploiting structure sharing in the encoding process, we also present a hardware/software codesign for practical encoder implementation of these efficient-encoding GLD codes.

[1]  Keshab K. Parhi,et al.  Hardware/software codesign of finite field datapath for low-energy Reed-Solomon codecs , 2000, IEEE Trans. Very Large Scale Integr. Syst..

[2]  Niclas Wiberg,et al.  Codes and Decoding on General Graphs , 1996 .

[3]  Michael Lentmaier,et al.  Iterative decoding of generalized low-density parity-check codes , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

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

[5]  Edward A. Lee,et al.  DSP Processor Fundamentals , 1997 .

[6]  Edward A. Lee,et al.  DSP Processor Fundamentals: Architectures and Features , 1997 .

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

[8]  David J. C. MacKay,et al.  Comparison of constructions of irregular Gallager codes , 1999, IEEE Trans. Commun..

[9]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

[10]  J. Boutros,et al.  Generalized low density (Tanner) codes , 1999, 1999 IEEE International Conference on Communications (Cat. No. 99CH36311).