Semi-random Construction of Rate-Compatible Low-Density Parity-Check Codes

This paper presents a semi-random construction of rate-compatible low-density parity-check (LDPC) codes. We analyze some crucial properties determining the performance of LDPC codes to direct our construction approach. The new parity-check matrices corresponding to lower-rate codes are generated by computer search which is subject to these important properties. The novel construction approach is flexible as we only add new rows with certain constraints to the original parity-check matrix. The simulation results demonstrate that rate-compatible LDPC codes based on this approach work quite well.

[1]  T. Etzion,et al.  Which codes have cycle-free Tanner graphs? , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[2]  Jung-Fu Cheng,et al.  Turbo Decoding as an Instance of Pearl's "Belief Propagation" Algorithm , 1998, IEEE J. Sel. Areas Commun..

[3]  Amir H. Banihashemi,et al.  On construction of rate-compatible low-density parity-check codes , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

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

[5]  Sae-Young Chung,et al.  Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation , 2001, IEEE Trans. Inf. Theory.

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

[7]  Chris Jones,et al.  Rate-compatible low-density parity-check codes , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[8]  X. Jin.  Factor graphs and the Sum-Product Algorithm , 2002 .

[9]  Rudiger Urbanke,et al.  Fixed Points and Stability of Density Evolution , 2004, Commun. Inf. Syst..

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

[11]  Tiffany Jing Li,et al.  Rate-compatible Low Density Parity Check Codes for Capacity-approaching ARQ Schemes in Packet Data Communications , 2002, Communications, Internet, and Information Technology.

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

[13]  Brendan J. Frey,et al.  Iterative Decoding of Compound Codes by Probability Propagation in Graphical Models , 1998, IEEE J. Sel. Areas Commun..