Analysis and Design of Punctured LDPC

Lin S and Yu P S. A hybrid ARQ scheme with parity retransmission for error control of satellite channels[J].IEEE Trans. on Comm.1982, 30(7):1701-1709[2]Hagenauer J. Rate-compatible punctured convolutional codes (RCPC codes) and their applications[J].IEEE Trans. on Comm.1988, 36(4):389-400[3]Barbulescu A S and Pietrobon S S. Rate compatible turbo codes[J].Electronics Letters.1995, 31(7):535-536[4]Rowitch D N and Milstein L B. Rate compatible punctured turbo (RCPT) codes in a hybrid FER/ARQ system. IEEE GLOBECOM, Rio de Janeiro, BR, 1999: 2341-2345.[5]Gallager R G. Low-density parity-check codes[J].IRE Trans. On Info. Theory.1962, 8(1):21-28[6]Chung S Y, Forney G D, and Richardson T J, et al.. On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit. IEEE Comm. Letters, 2001, 5(2): 58-60.[7]Li J and Narayanan K. Rate-compatible low density parity check codes for capacity-approaching ARQ scheme in packet data communications. IEEE CIIT, US Virgin Islands, 2002: 201-206.[8]Yazdani M and Banihashemi A. On construction of rate-compatible low-density parity-check codes[J].IEEE Comm. Letters.2004, 8(3):159-161[9]Dholakia A and Olcer S. Rate-compatible low-density parity-check codes for digital subscriber lines. IEEE ICC, Paris, France, 2004: 415-419.[10]Ha J and McLaughlin S W. Optimal puncturing of low-density parity-check codes. IEEE ICC, Alaska, USA, 2003: 3110-3114.Ha J and McLaughlin S W. Optimal puncturing distributions for rate-compatible low-density parity-check codes. IEEE ISIT, Yokohama, Japan, 2003: 233.[11]Ha J, Kim J, and McLaughlin S W. Rate-compatible of Low-density parity-check codes[J].IEEE Trans. on Info. Theory.2004, 50(11):2824-2836[12]Richardson T J and Urbanke R. The capacity of low-density parity-check codes under message-passing decoding[J].IEEE Trans. on Info. Theory.2001, 47(2):599-618[13]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 Trans. on Info. Theory.2001, 47(2):657-670