Girth-10 LDPC Codes Based on 3-D Cyclic Lattices

In this paper, we propose a new method based on combinatorial designs for constructing high-girth low-density parity-check (LDPC) codes. We use a 3-D lattice to generate balanced incomplete block designs based on planes and lines in the lattice. This gives families of regular LDPC codes with girths of at least 6, 8, and 10, whose parity-check matrices are all block circulant. The main advantage of this construction is that the algebraic structure leads to efficient encoders and decoders. Based on the block-circulant structure of a parity-check matrix, we present an efficient encoder that can be parallelized to improve the speed of encoding. The simulation results show that these families of LDPC codes perform very well on additive-white-Gaussian-noise channels (roughly 0.45 dB from the channel capacity) and Rayleigh fading channels (roughly 0.51 dB from the channel capacity).

[1]  Sarah J. Johnson,et al.  Construction of low-density parity-check codes from Kirkman triple systems , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[2]  Sae-Young Chung,et al.  On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit , 2001, IEEE Communications Letters.

[3]  Daniel A. Spielman,et al.  Efficient erasure correcting codes , 2001, IEEE Trans. Inf. Theory.

[4]  Naresh R. Shanbhag,et al.  High-throughput LDPC decoders , 2003, IEEE Trans. Very Large Scale Integr. Syst..

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

[6]  Sarah J. Johnson,et al.  Regular low-density parity-check codes from combinatorial designs , 2001, Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494).

[7]  D. Mackay,et al.  Evaluation of Gallager Codes for Short Block Length and High Rate Applications , 2001 .

[8]  Daniel A. Spielman,et al.  Improved low-density parity-check codes using irregular graphs and belief propagation , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

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

[10]  Jose M. F. Moura,et al.  Large-girth LDPC codes based on graphical models , 2003, 2003 4th IEEE Workshop on Signal Processing Advances in Wireless Communications - SPAWC 2003 (IEEE Cat. No.03EX689).

[11]  Zhenyu Liu,et al.  LDPC codes from generalized polygons , 2005, IEEE Transactions on Information Theory.

[12]  Shu Lin,et al.  Low-density parity-check codes based on finite geometries: A rediscovery and new results , 2001, IEEE Trans. Inf. Theory.

[13]  Paul H. Siegel,et al.  Performance analysis and code optimization of low density parity-check codes on Rayleigh fading channels , 2001, IEEE J. Sel. Areas Commun..

[14]  Xiaodong Wang,et al.  LDPC-based space-time coded OFDM systems over correlated fading channels: performance analysis and receiver design , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[15]  Bane V. Vasic,et al.  Combinatorial constructions of low-density parity-check codes for iterative decoding , 2002, IEEE Transactions on Information Theory.

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

[17]  L. Hanzo,et al.  LDPC assisted Block Coded Modulation for Transmission over Rayleigh Fading Channels , .

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

[19]  Dharmendra S. Modha,et al.  Extended bit-filling and LDPC code design , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

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

[21]  Daniel A. Spielman,et al.  Analysis of low density codes and improved designs using irregular graphs , 1998, STOC '98.

[22]  Rüdiger L. Urbanke,et al.  The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.

[23]  Soon Xin Ng,et al.  LPDC assisted block coded modulation for transmission over Rayleigh fading channels , 2003, The 57th IEEE Semiannual Vehicular Technology Conference, 2003. VTC 2003-Spring..

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