The design of efficiently-encodable rate-compatible LDPC codes

IEEE Transactions on Communications

Volumn 57, Issue 2, 2009, Pages 365-375

  Kim, Jaehong ^a   Ramamoorthy, Aditya ^b   McLaughlin, Steven W ^c  

^a SAMSUNG Electronics   (South Korea)

^b Iowa State University of Science and Technology   (United States)

^c GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Efficient encoding; Low density parity check (LDPC) code; Puncturing; Rate compatible code

Indexed keywords

BINARY CODES; ENCODING (SYMBOLS); HYBRID SYSTEMS;

BLOCK LENGTHS; CODE PERFORMANCE; EFFICIENT ENCODING; HYBRID-AUTOMATIC REPEAT REQUESTS; INCREMENTAL REDUNDANCIES; IRREGULAR LDPC CODES; IRREGULAR LOW-DENSITY PARITY-CHECK CODES; IRREGULAR REPEAT ACCUMULATE (EIRA); LOW-DENSITY PARITY-CHECK (LDPC) CODE; NEW CLASS; PUNCTURING; RATE-COMPATIBLE CODE; RATE-COMPATIBLE LDPC CODES; REGISTER CIRCUITS;

BLOCK CODES;

EID: 61649115957     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2009.02.060233     Document Type: Article

References (15)

1. T. Richardson and R. Urbanke, "Efficient encoding of low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 638-656, Feb. 2001.
2. S. Lin, L. Chen, J. Xu, and I. Djurdjevic, "Near Shannon limit quasicyclic low-density parity-check codes," in Proc. IEEE GLOBECOM San Francisco, CA, Dec. 2003.
3. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. IT-27, pp. 533-547, Sept. 1981.
4. H. Jin, A. Khandekar, and R. McEliece, "Irregular repeat-accumulate codes," in Proc. 2nd. Int. Symp. Turbo Codes Related Topics, Brest, France, Sept. 2000, pp. 1-8.
5. M. Yang, W. E. Ryan, and Y. Li, "Design of efficiently encodable moderate-length high-rate irregular LDPC codes," IEEE Trans. Commun. vol. 52, no. 4, pp. 564-571, Apr. 2004.
6. J. Hagenauer, "Rate-compatible punctured convolutional codes (RCPC codes) and their applications," IEEE Trans. Commun., vol. 36, pp. 389-400, Apr. 1998.
7. 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, Nov. 2004.
8. J. Ha, J. Kim, D. Kline, and S. W. McLaughlin, "Rate-compatible punctured low-density paiity-check codes with short block lengths," IEEE Trans. Inform. Theory, vol. 52, no. 2, pp. 728-738, Feb. 2006.
9. J. Ha, J. Kim, and S. W. McLaughlin, "Puncturing for finite length low-density parity-check codes," in Proc. IEEE ISIT, Chicago, 2004, p. 152.
10. 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, Mar. 2004.
11. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, pp. 619-637, Feb. 2001.
12. X. Hu, E. Eleftheriou, and D. M. Arnold, "Progressive edge-growth Tanner graphs," in Proc. IEEE GLOBECOM, San Antonio, TX, Nov. 2001, pp. 995-1001.
13. T. Tian, C. 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
14. A. Ramamoorthy and R. D. Wesel, "Construction of short block length irregular low-density parity-check codes," in Proc. IEEE ICC, Paris, France, June 2004, pp. 410-414.
15. W. Weng, A. Ramamoorthy, and R. D. Wesel, "Lowering the error floors of high-rate LDPC codes by graph conditioning," in Proc. IEEE VTC, Los Angeles, CA, 2004, pp. 2549-2553.