Protograph-based raptor-like LDPC codes for rate compatibility with short blocklengths

GLOBECOM - IEEE Global Telecommunications Conference

Volumn , Issue , 2011, Pages

  Chen, Tsung Yi ^a   Divsalar, Dariush ^b   Wang, Jiadong ^a   Wesel, Richard D ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BELIEF PROPAGATION; DESIGN PROCEDURE; ERROR FLOOR; EXCLUSIVE-OR; HIGH SNR; LDPC CODES; PARITY BITS; RAPTOR CODES; RATE COMPATIBILITY; RATE-COMPATIBLE; RATE-COMPATIBLE LDPC CODES;

CODES (SYMBOLS); COMMUNICATION; MOBILE TELECOMMUNICATION SYSTEMS;

ERROR CORRECTION;

EID: 84863128448     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2011.6134051     Document Type: Conference Paper

References (18)

1. R. G. Gallager, "Low-density parity-check codes," Ph.D. dissertation, MIT, Cambridge, MA, 1963.
2. D. J. C. Mackay and R. M. Neal, "Near Shannon Limit Performance of Low Density Parity Check Codes," Electronics Letters, vol. 32, Issue 18, p. 1645, Aug. 1996.
3. M. R. Tanner, "A Recursive Approach to Low Complexity Codes," IEEE Trans. Inf. Theory, vol. 27, No. 5, pp. 533-547, 1981.
4. J. Thorpe, "Low Density Parity Check (LDPC) Codes Constructed from Protographs," JPL INP Progress Report, pp. 42-154, Aug. 2003.
5. D. Divsalar, C. Jones, S. Donlinar and J. Thorpe, "Protograph based LDPC codes with minimum distance linearly growing with block size,"in Proc. GLOBECOM '05, St. Louis, MO, USA, Nov. 2005.
6. D. Divsalar, S. Donlinar, C. R. Jones and Kenneth Andrews, "Capacity-Approaching Protograph Codes," IEEE J. Sel. Areas Commun., vol. 27, No. 6, pp. 876-888, Aug. 2009.
7. M. Luby, "LT Codes," in Proc. 43rd Annu. IEEE Symp. Foundations of Computer Science (FOCS), Vancouver, BC, Canada, Nov. 2002.
8. A. Shokorollahi, "Raptor Codes," IEEE Trans. Inf. Theory, vol. 52, pp. 2551-2567, Jun. 2006.
9. O. Etesami and A. Shokorollahi, "Raptor Codes on Binary Memoryless Symmetric Channels," IEEE Trans. Inf. Theory, vol. 52, pp. 2033-2051, May 2006.
10. T-Y. Chen, N. Seshadri and R. D. Wesel, "A Sphere-Packing Analysis of Incremental Redundancy Scheme with Feedback," in Proc. IEEE Intl. Conf. Comm. '11, Kyoto, Japan, 2011.
11. -, "Incremental Redundancy: A Comparison of a Sphere-Packing Analysis and Convolutional Codes," in Proc. Inform. Theory and Applications Workshop, San Diego, CA, USA, Feb. 2011.
12. T-Y. Chen, B-Z. Shen and N. Seshadri, "Is Feedback a Performance Equalizer of Classic and Modern Codes?" in ITA Workshop, San Diego, CA, USA, Feb. 2010.
13. 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.
14. N. Jacobsen and R. Soni, "Deign of Rate-Compatible Irregular LDPC Codes Based on Edge Growth and Parity Splitting," in Proc. IEEE Vehicular Technology Conference (VTC), Baltimore, MD, USA, Oct. 2007.
15. T. V. Nguyen, A. Nosratinia, and D. Divsalar, "The Deisgn of Rate-Compatible Protograph LDPC Codes," in Proc. Forth-Eighth Annual Allerton Conference, Allerton, IL, USA, Sep. 2010.
16. E. Soljanin, "Punctured vs Rateless Codes for Hybrid ARQ," in Proc. IEEE Inform. Theory Workshop '06, Punta del Este, Uruguay, Mar. 2006.
17. X.-Y. Hu, E. Eleftheriou, and D.-M. Arnold, "Capacity-Approaching Protograph Codes," IEEE Trans. Inf. Theory, vol. 51, No. 1, pp. 386-398, Jan. 2005.
18. 3rd Generation Partnership Project (http://www.3gpp.org), "3GPP TS 36.212 Multiplexing and channel coding."