Design of rate-compatible RA-type low-density parity-check codes using splitting

In this letter, a new rate-control scheme, called splitting, is proposed to construct low-rate codes from high-rate codes, which splits rows of parity-check matrices of repeat accumulate-type (RA-Type) LDPC codes by adding new parity bits. When a high-degree check node is split into two low-degree check nodes, by making the check node degree distribution in a concentrated form, the performance of low-rate codes can be improved. We also explicitly construct rate-compatible repeat RA-Type LDPC (RC RA-type LDPC) codes using splitting for code rates from 1/3 to 4/5 and compare this with other RC RA-type LDPC codes.

[1]  Dong-Joon Shin,et al.  New Construction of Rate-Compatible Block-Type Low-Density Parity-Check Codes Using Splitting , 2006, 2006 IEEE 17th International Symposium on Personal, Indoor and Mobile Radio Communications.

[2]  Uwe Schwiegelshohn,et al.  A data puncturing IR-scheme for type-II hybrid ARQ protocols using LDPC codes , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

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

[4]  Steven W. McLaughlin,et al.  Rate-compatible punctured low-density parity-check codes with short block lengths , 2006, IEEE Transactions on Information Theory.

[5]  Jaehong Kim,et al.  Design of Rate-Compatible Irregular LDPC Codes for Incremental Redundancy Hybrid ARQ Systems , 2006, 2006 IEEE International Symposium on Information Theory.

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

[7]  H. Jin,et al.  Irregular repeat accumulate codes , 2000 .

[8]  Ajay Dholakia,et al.  Reduced-complexity decoding of LDPC codes , 2005, IEEE Transactions on Communications.

[9]  Amir H. Banihashemi,et al.  On construction of rate-compatible low-density Parity-check codes , 2004, IEEE Commun. Lett..

[10]  Faramarz Fekri,et al.  Finite-length rate-compatible LDPC codes: a novel puncturing scheme - [transactions letters] , 2009, IEEE Transactions on Communications.

[11]  F. Kschischang,et al.  Incremental Redundancy via Check Splitting , 2006, 23rd Biennial Symposium on Communications, 2006.

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

[13]  Faramarz Fekri,et al.  Rate-Compatible Puncturing of Finite-Length Low-Density Parity-Check Codes , 2006, 2006 IEEE International Symposium on Information Theory.

[14]  Song-Nam Hong,et al.  Rate-Compatible Puncturing for Finite-Length Low-Density Parity-Check Codes with Zigzag Parity Structure , 2006, 2006 IEEE 17th International Symposium on Personal, Indoor and Mobile Radio Communications.

[15]  Guosen Yue,et al.  Design of Rate-Compatible Irregular Repeat Accumulate Codes , 2007, IEEE Transactions on Communications.

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