The design of rate-compatible protograph LDPC codes

2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010

Volumn , Issue , 2010, Pages 1-5

  Van Nguyen, Thuy ^a   Nosratinia, Aria ^a   Divsalar, Dariush ^b  

^a The University of Texas at Dallas   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALTERNATIVE METHODS; CAPACITY LIMIT; COMMUNICATION APPLICATION; DECODING ALGORITHM; ENCODING COMPLEXITY; HIGH RATE; HYBRID AUTOMATIC REPEAT REQUEST SYSTEMS; LDPC CODES; RATE COMPATIBLE CODES; RATE-COMPATIBLE; RATE-COMPATIBLE LDPC CODES;

CODES (SYMBOLS);

ERROR CORRECTION;

EID: 79952370996     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2010.5706880     Document Type: Conference Paper

References (19)

1. J. Ha, J. Kim, and S. McLaughlin, "Rate-compatible puncturing of low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 50, no. 11, pp. 2824-2836, nov. 2004.
2. H. Pishro-Nik and F. Fekri, "Results on punctured LDPC codes," in Proc. IEEE Information Theory Workshop, oct. 2004, pp. 215-219.
3. T. Tian and C. R. Jones, "Construction of rate-compatible LDPC codes utilizing information shortening and parity puncturing," EURASIP J. Wirel. Commun. Netw., vol. 2005, no. 5, pp. 789-795, 2005.
4. N. Jacobsen and R. Soni, "Design of rate-compatible irregular LDPC codes based on edge growth and parity splitting," in Proc. IEEE Vehicular Technology Conference (VTC), 30 2007-oct. 3 2007, pp. 1052-1056.
5. C.-H. Hsu and A. Anastasopoulos, "Capacity achieving LDPC codes through puncturing," IEEE Trans. Inform. Theory, vol. 54, no. 10, pp. 4698-4706, oct. 2008.
6. J. Thorpe, "Low-density parity-check (LDPC) codes constructed from protogrtaphs," IPN Progress Report 42-154, Aug. 2003.
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. CIIT, Nov. 2002.
8. S. Dolinar, "A rate-compatible family of protograph-based LDPC codes built by expurgation and lengthening," in Proc. IEEE ISIT, sept. 2005, pp. 1627-1631.
9. 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.
10. D. Divsalar, S. Dolinar, C. R. Jones, and K. Andrews, "Capacity-approaching protograph codes," IEEE J. Select. Areas Commun., vol. 27, no. 6, pp. 876-888, Aug. 2009.
11. J. Thorpe, K. Andrews, and S. Dolinar, "Methodologies for designing LDPC codes using protographs and circulants," in Proc. IEEE ISIT, July 2004, pp. 236-236.
12. D. Divsalar, S. Dolinar, and C. R. Jones, "Low-rate LDPC codes with simple protograph structure," in Proc. IEEE ISIT, Nov. 2005, pp. 1622-1626.
13. M. El-Khamy, J. Hou, and N. Bhushan, "Design of rate-compatible structured LDPC codes for hybrid ARQ applications," IEEE J. Select. Areas Commun., vol. 27, no. 6, pp. 965-973, Aug. 2009.
14. 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, Feb. 2001.
15. S. ten Brink, "Convergence behavior of iteratively decoded parallel concatenated codes," IEEE Trans. Commun., vol. 49, no. 10, pp. 1727-1737, Oct 2001.
16. G. Liva and M. Chiani, "Protograph LDPC codes design based on EXIT analysis," in Proc. IEEE GLOBECOM, Nov. 2007, pp. 3250-3254.
17. T. Richardson and R. Urbanke, "Multi-Edge Type LDPC Codes," Tech. Rep., 2004, submitted IEEE IT.
18. A. Abbasfar, D. Divsalar, and K. Yao, "Accumulate-repeat-accumulate codes," IEEE Trans. Commun., vol. 55, no. 4, pp. 692-702, Apr. 2007.
19. T. V. Nguyen, A. Nosratinia, and D. Divsalar, "Bilayer protograph codes for half-duplex relay channels," in Proc. IEEE ISIT, June 2010, pp. 948-952.