Low complexity LDPC codes for partial response channels

This paper constructs and analyzes a class of regular LDPC codes with column weight of j=2, in contrast to the often-used j/spl ges/3 setting. These codes possess several significant features. First, they are free of 6-cycle, and can be easily constructed for a large range of code rates. Secondly, the parity check matrix of the code can be represented by a simple set, thus lending itself to a low complexity implementation. Thirdly, the proposed codes concatenated with proper precoder outperform j/spl ges/3 LDPC codes for partial response (PR) channels. Finally, they exhibit block error statistics significantly different from LDPC codes with j/spl ges/3, making them more compatible with Reed-Solomon error correction codes. The LDPC coded partial response (PR) channel is formulated as a dynamical model and analyzed using density evolution technique, which is used to explain the behavior of the concatenated system. A high rate (8/9) code with block size 4608 is constructed as an example, and its bit error rate (BER), block error statistics, and decoding convergence over ideal PR channel are investigated using simulation. The simulation results are consistent with the density evolution analysis, both indicating that LDPC codes with j=2 are attractive for partial response channels. PR targets for magnetic recording channel are used as examples to illustrate the performance of the proposed codes.

[1]  Yu Kou,et al.  Low Density Parity Check Codes Based on Finite Geometries: A Rediscovery and More , 1999 .

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

[3]  Sae-Young Chung,et al.  On the construction of some capacity-approaching coding schemes , 2000 .

[4]  Hesham El Gamal,et al.  Analyzing the turbo decoder using the Gaussian approximation , 2001, IEEE Trans. Inf. Theory.

[5]  Dariush Divsalar,et al.  Iterative turbo decoder analysis based on density evolution , 2001, IEEE J. Sel. Areas Commun..

[6]  S. W. McLaughlin,et al.  Iterative decoding for partial response (PR), equalized, magneto-optical (MO) data storage channels , 2001, IEEE J. Sel. Areas Commun..

[7]  Krishna R. Narayanan.  Effect of precoding on the convergence of turbo equalization for partial response channels , 2001, IEEE J. Sel. Areas Commun..

[8]  Jing Li,et al.  On the performance of high-rate TPC/SPC codes and LDPC codes over partial response channels , 2002, IEEE Trans. Commun..

[9]  R. Townsend,et al.  Self-orthogonal quasi-cyclic codes , 1967, IEEE Trans. Inf. Theory.

[10]  Jin Fan,et al.  Disjoint difference sets, difference triangle sets, and related codes , 1992, IEEE Trans. Inf. Theory.

[11]  Bane V. Vasic,et al.  Structured iteratively decodable codes based on Steiner systems and their application in magnetic recording , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[12]  Evangelos Eleftheriou,et al.  Progressive edge-growth Tanner graphs , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

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

[14]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[15]  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).