Protograph-Based Raptor-Like LDPC Codes for Rate Compatibility with Short Blocklengths

This paper presents a new class of rate-compatible LDPC codes, protograph-based Raptor-like (PBRL) codes. The proposed PBRL codes are jointly decodable with an iterative belief propagation decoder. As with Raptor codes, additional parity bits can be easily produced by exclusive-or operations on the precoded bits, providing extensive rate compatibility. This paper provides a design procedure that optimizes this class of rate- compatible LDPC codes. The new PBRL codes outperform 3GPP rate-compatible turbo codes with the same short blocklength at high SNR and show no sign of an error floor at the FER region of $10^{-7}$.

[1]  Richard D. Wesel,et al.  A Sphere-Packing Analysis of Incremental Redundancy with Feedback , 2011, 2011 IEEE International Conference on Communications (ICC).

[2]  Robert Soni,et al.  Design of Rate-Compatible Irregular LDPC Codes Based on Edge Growth and Parity Splitting , 2007, 2007 IEEE 66th Vehicular Technology Conference.

[3]  Nambi Seshadri,et al.  Is feedback a performance equalizer of classic and modern codes? , 2010, 2010 Information Theory and Applications Workshop (ITA).

[4]  Dariush Divsalar,et al.  Capacity-approaching protograph codes , 2009, IEEE Journal on Selected Areas in Communications.

[5]  Omid Etesami,et al.  Raptor codes on binary memoryless symmetric channels , 2006, IEEE Transactions on Information Theory.

[6]  Aria Nosratinia,et al.  The design of rate-compatible protograph LDPC codes , 2010 .

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

[8]  Emina Soljanin,et al.  Punctured vs Rateless Codes for Hybrid ARQ , 2006, 2006 IEEE Information Theory Workshop - ITW '06 Punta del Este.

[9]  Dariush Divsalar,et al.  Protograph based LDPC codes with minimum distance linearly growing with block size , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[10]  J. Thorpe.  Low-Density Parity-Check (LDPC) Codes Constructed from Protographs , 2003 .

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

[12]  Evangelos Eleftheriou,et al.  Regular and irregular progressive edge-growth tanner graphs , 2005, IEEE Transactions on Information Theory.

[13]  Richard D. Wesel,et al.  Incremental redundancy: A comparison of a sphere-packing analysis and convolutional codes , 2011, 2011 Information Theory and Applications Workshop.

[14]  Michael Luby,et al.  LT codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

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

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

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