A comparison of ARA- and protograph-based LDPC block and convolutional codes

2007 Information Theory and Applications Workshop, Conference Proceedings, ITA

Volumn , Issue , 2007, Pages 111-119

  Costello Jr , Daniel J ^a   Pusane, Ali Emre ^a   Jones, Christopher R ^b   Divsalar, Dariush ^b  

^a University of Notre Dame   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (STANDARDS); COMPUTATIONAL METHODS; COMPUTER SIMULATION; CONVOLUTION; CONVOLUTIONAL CODES; CYBERNETICS; DECODING; INFORMATION THEORY; PIPELINE CODES; PIPELINES; VIDEO STREAMING;

COMPUTER SIMULATIONS; CONSTRAINT LENGTHS; DECODING DELAYS; DECODING PROCESSING; ERROR PERFORMANCES; IMPROVED PERFORMANCE; LDPC CODING; LDPC CONVOLUTIONAL CODES; MEMORY REQUIREMENTS; PROCESSOR SIZE; RECEIVED SYMBOLS; UNWRAPPING PROCESS;

CODES (SYMBOLS);

EID: 48049086496     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITA.2007.4357569     Document Type: Conference Paper

References (12)

1. A. Jiménez-Feltström and K. Sh. Zigangirov, "Time-varying periodic convolutional codes with low-density parity-check matrix," IEEE Trans. Inform. Theory, vol. IT-45, pp. 2181-2191, Sept. 1999.
2. D. J. Costello, Jr., A. E. Pusane, S. Bates, and K. Sh. Zigangirov, "A comparison between LDPC block and convolutional codes," in Proc. Information Theory and Applications Workshop, (San Diego, CA, USA), February 2006.
3. J. Thorpe, "Low density parity check (LDPC) codes constructed from protographs," JPL IPN Progress Report, pp. 42-154, August 2003.
4. A. Abbasfar, D. Divsalar, and K. Yao, "Accumulate repeat accumulate codes," in Proc. IEEE Int. Symp. Inf. Theory, (Dallas, TX, USA), July 2004.
5. D. Divsalar, S. Dolinar, and C. Jones, "Protograph based LDPC codes with minimum distance growing linearly with block size," in Proc. IEEE Global Communications Conference (GlobeCom), (St. Louis, MO, USA), Nov. 2005.
6. D. Divsalar, S. Dolinar, and C. Jones, "Low-rate LDPC codes with simple protograph structure," in Proc. IEEE Int. Symp. Inf. Theory, (Adelaide, South Australia, Australia), June 2005.
7. R. Johannesson and K. Sh. Zigangirov, Fundamentals of'Convolutional Coding. Piscataway, NJ: IEEE Press, 1999.
8. S. Lin and D. J. Costello, Jr., Error Control Coding. Englewood Cliffs, NJ: Prentice-Hall, 2nd ed., 2004.
9. S. Fogal, S. Dolinar, and K. Andrews, "Buffer analysis for LDPC decoders," in Submitted to ISIT, 2007.
10. X. Y. Hu, E. Eleftheriou, and D. M. Arnold, "Progressive edge-growth Tanner graphs," in Proc. IEEE Global Telecommun. Conf., (San Antonio, TX), pp. 995-1001, Nov. 2001.
11. C. Jones, E. Valles, M. Smith, and J. Villasenor, "Approximate- min* constraint node updating for LDPC code decoding," in Proc. IEEE Military Communications Conference (MILCOM), (Boston, Massachusetts, USA), Oct. 2004.
12. A. E. Pusane, A. Jiménez-Feltström, A. Sridharan, M. Lentmaier, K. Sh. Zigangirov, and D. J. Costello, Jr., "Implementation aspects of LDPC convolutional codes," submitted to IEEE Trans. Commun., Nov. 2005.