Construction of rate-compatible LDPC codes utilizing information shortening and parity puncturing

Eurasip Journal on Wireless Communications and Networking

Volumn 2005, Issue 5, 2005, Pages 789-795

  Tian, Tao ^a   Jones, Christopher R ^b  

^a QUALCOMM INC   (United States)

^b NASA HEADQUARTERS   (United States)

Author keywords

Density evolution; Extrinsic message degree; Irregular low density parity check codes; Punctured codes; Rate compatibility; Shortened codes

Indexed keywords

GRAPH THEORY; INFORMATION ANALYSIS; OPTIMIZATION; PROBLEM SOLVING; WIRELESS TELECOMMUNICATION SYSTEMS;

DENSITY EVOLUTION; EXTRINSIC MESSAGE DEGREE; IRREGULAR LOW-DENSITY PARITY-CHECK CODES; PUNCTURED CODES; RATE COMPATIBILITY; SHORTENED CODES;

CODES (SYMBOLS);

EID: 33746828216     PISSN: 16871472     EISSN: 16871499     Source Type: Journal    
DOI: 10.1155/WCN.2005.789     Document Type: Article

References (13)

1. J. Hagenauer, "Rate-compatible punctured convolutional codes (RCPC codes) and their applications," IEEE Trans. Commun., vol. 36, no. 4, pp. 389-400, 1988.
2. A. S. Barbulescu and S. S. Pietrobon, "Rate compatible turbo codes," IEE Electronics Letters, vol. 31, no. 7, pp. 535-536, 1995.
3. D. N. Rowitch and L. B. Milstein, "On the performance of hybrid FEC/ARQ systems using rate compatible punctured turbo (RCPT) codes," IEEE Trans. Commun., vol. 48, no. 6, pp. 948-959, 2000.
4. F. Babich, G. Montorsi, and F. Vatta, "Rate-compatible punctured serial concatenated convolutional codes," in Proc. IEEE Global Telecommunications Conference (GLOBECOM '03), vol. 4, pp. 2062-2066, San Francisco, Calif, USA, December 2003.
5. J. Ha, J. Kim, and S. W. McLaughlin, "Rate-compatible puncturing of low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 50, no. 11, pp. 2824-2836, 2004.
6. H. Pishro-Nik and F. Fekri, "Results on punctured LDPC codes," in Proc. IEEE Information Theory Workshop, pp. 215-219, San Antonio, Tex, USA, October 2004.
7. J. Li and K. R. Narayanan, "Rate-compatible low density parity check codes for capacity-approaching ARQ schemes in packet data communications," in Proc. LASTED International Conference. Communications, Internet, and Information Technology (CIIT '02), pp. 201-206, St.Thomas, Virgin Islands, USA, November 2002.
8. M. R. Yazdani and A. H. Banihashemi, "On construction of rate-compatible low-density parity-check codes," IEEE Commun. Lett., vol. 8, no. 3, pp. 159-161, 2004.
9. T. Tian, C. R. Jones, J. D. Villasenor, and R. D. Wesel, "Selective avoidance of cycles in irregular LDPC code construction," IEEE Trans. Commun., vol. 52, no. 8, pp. 1242-1247, 2004.
10. S.-Y. Chung, T. J. Richardson, and R. L. Urbanke, "Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 657-670, 2001.
11. T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 619-637, 2001.
12. T. J. Richardson and R. L. Urbanke, "Efficient encoding of low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 638-656, 2001.
13. C. Di, D. Proietti, I. E. Telatar, T. J. Richardson, and R. L. Urbanke, "Finite-length analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inform. Theory, vol. 48, no. 6, pp. 1570-1579, 2002.