A Novel Puncturing Scheme for Rate-compatible LDPC Codes

Ha J, Kim J, and McLaughlin S W. Rate-compatible puncturing of low-density parity-check codes [J].IEEE Transactions on Information Theory.2004, 50(11):2824-2836[2]Ha J and McLaughlin S W. Optimal puncturing distributions for rate compatible low-density parity-check codes[C]. IEEE International Symposium on Information Theory, Yokohama, Japan, Jun./Jul. 2003: 233.[3]Li J and Narayanan K. Rate-compatible low density parity check codes for capacity-approaching ARQ scheme in packet data communications[C]. International Conference on Communications, Internet, and Information Technology, Virgin Islands, US, Nov. 2002: 201-206.[4]Yazdani M R and Banihashemi A H. On construction of rate-compatible low-density parity-check codes [J].IEEE Communications Letters.2004, 8(3):159-161[5]Ha J, Kim J, Klinc D, et al.. Rate-compatible punctured low-density parity-check codes with short block lengths[J].IEEE Transactions on Information Theory.2006, 52(2):728-738[6]Kim J, Ramamoorthy A, and McLaughlin S W. The design of efficiently-encodable rate-compatible LDPC codes [J].IEEE Transactions on Communications.2009, 57(2):365-375[8]Chung S Y, Richardson T J, and Urbanke R L. Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation [J].IEEE Transactions on Information Theory.2001, 47(2):657-670[9]Vellambi B N and Fekri F. Finite-length rate-compatible LDPC codes: a novel puncturing scheme [J].IEEE Transactions on Communications.2009, 57(2):297-301[10]Hu X Y, Eleftheriou E, and Arnold D M. Regular and irregular progressive edge-growth tanner graphs [J].IEEE Transactions on Information Theory.2005, 51(1):386-398