Design of rate-compatible structured LDPC codes for hybrid ARQ applications

IEEE Journal on Selected Areas in Communications

Volumn 27, Issue 6, 2009, Pages 965-973

  El Khamy, Mostafa ^a   Hou, Jilei ^a   Bhushan, Naga ^a  

^a Janssen Pharmaceutical of Johnson and Johnson   (United States)

Author keywords

Channel coding for wireless applications; Hybrid automatic repeat request (HARQ); Low density parity check (LDPC) codes; Progressive puncturing; Progressive edge growth (PEG); Protographs; Rate compatible error correcting codes

Indexed keywords

HYBRID AUTOMATIC REPEAT REQUEST; LOW-DENSITY PARITY-CHECK CODES; PROGRESSIVE-EDGE GROWTH (PEG); PROTOGRAPHS; RATE-COMPATIBLE; WIRELESS APPLICATION;

ALGORITHMS; CHANNEL CAPACITY; DATA COMMUNICATION SYSTEMS; ERROR CORRECTION; WIRELESS TELECOMMUNICATION SYSTEMS;

CODES (SYMBOLS);

EID: 77955704094     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2009.090814     Document Type: Article

References (18)

1. T. Richardson and V. Novichkov, "Methods and apparatus for decoding LDPC codes, " United States patent 6, 633, 856, Oct. 2003.
2. J. Thorpe, "Low-density parity-check (LDPC) codes constructed from protographs, " IPN Progress Report 42-154, JPL, Aug. 2003.
3. J.-S. Lee, B. Lee, J. Thorpe, K. Andrews, S. Dolinar, and J. Hamkins, "A scalable architecture of a structured LDPC decoder, " in International Symposium on Information Theory, 2004. ISIT 2004, June 2004, p. 292.
4. D. Divsalar, S. Dolinar, J. Thorpe, and C. Jones, "Constructing LDPC codes from simple loop-free encoding modules, " in 2005 IEEE International Conference on Communications, pp. 658-662.
5. S. Dolinar, "A rate-compatible family of protograph-based LDPC codes built by expurgation and lengthening, " in Proc. ISIT, 2005, pp. 1622-1626.
6. J. Ha, J. Kim, D. Klinc, and S. McLaughlin, "Rate-compatible punctured low-density parity-check codes with short block lengths, " IEEE Trans. Inform. Theory, vol. 52, pp. 728-738, Feb 2006.
7. J. Ha, J. Kim, and S. McLaughlin, "Rate-compatible puncturing of lowdensity parity-check codes, " IEEE Trans. Inform. Theory, vol. 50, no. 11, pp. 2824-2836, 2004.
8. H. Pishro-Nik and F. Fekri, "Results on punctured LDPC codes, " in 2004 IEEE Information Theory Workshop, San Antonio, Texas, Oct. 2004.
9. D. Divsalar, S. Dolinar, and C. Jones, "Low-rate LDPC codes with simple protograph structure, " in Proc. ISIT, 2005, pp. 1627-1631.
10. J. Li and K. R. Narayanan, "Rate-compatible low density parity check (RC-LDPC) codes for capacity-approaching ARQ schemes in packet data communications, " in Proceeding of International Conference on Communications, Internet and Information Technology (CIIT), US Virgin Islands, Nov. 2002, pp. 201-206.
11. M. Yazdani and A. Banihashemi, "On construction of rate-compatible low-density parity-check codes, " IEEE Commun. Lett., vol. 8, pp. 159-161, Mar. 2004.
12. T. Tian and C. R. Jones, "Construction of rate-compatible LDPC codes utilizing information shortening and parity puncturing, " EURASIP JWCN 2005:5 (2005), pp. 789-795.
13. T. J. Richardson and R. Urbanke, "Multi-edge type LDPC codes, " preprint. [Online]. Available: http://lthcwww.ep.ch/papers/multiedge.ps.
14. A. Shokrollahi, "Raptor codes, " in Proceedings 2004 IEEE International Symposium on Information Theory (ISIT2004), Chicago, IL, USA, 2004.
15. A. Orlitsky, R. Urbanke, K. Viswanathan, and J. Zhang, "Stopping sets and the girth of Tanner graphs, " in 2002 IEEE International Symposium on Information Theory, 2002.
16. X.-Y. Hu, E. Eleftheriou, and D. Arnold, "Regular and irregular progressive edge-growth Tanner graphs, " IEEE Trans. Inform. Theory, pp. 386-398, Jan. 2005.
17. H. Xiao and A. Banihashemi, "Improved progressive-edge-growth (PEG) construction of irregular LDPC codes, " IEEE Commun. Lett., pp. 715-717, Dec. 2004.
18. S.-Y. Chung, T. Richardson, and R. Urbanke, "Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation, " IEEE Trans. Inform. Theory, pp. 657-670, 2001.