Asymptotically good LDPC convolutional codes with AWGN channel thresholds close to the Shannon limit

6th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2010

Volumn , Issue , 2010, Pages 324-328

  Lentmaier, Michael ^a   Mitchell, David G M ^b   Fettweis, Gerhard ^a   Costello Jr , Daniel J ^b  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b University of Notre Dame   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AWGN CHANNEL; BLOCK LENGTHS; CODE DESIGNER; DECODING THRESHOLDS; LDPC CONVOLUTIONAL CODES; MINIMUM DISTANCE; SHANNON LIMIT;

CONVOLUTION; CONVOLUTIONAL CODES; DATA PROCESSING; TURBO CODES;

ITERATIVE DECODING;

EID: 78649252804     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISTC.2010.5613891     Document Type: Conference Paper

References (12)

1. M. Lentmaier, G.P. Fettweis, K.Sh. Zigangirov, and D.J. Costello Jr., "Approaching capacity with asymptotically regular LDPC codes," in Proc. Information Theory and Applications Workshop, San Diego, CA, Feb. 2009.
2. M. Lentmaier, A. Sridharan, D.J. Costello Jr., and K.Sh. Zigangirov, "Iterative decoding threshold analysis for LDPC convolutional codes," IEEE Trans. Inform. Theory, accepted for publication. See also http://www.vodafone-chair.com/staff/lentmaier/LDPCCCThresholds-TransIT.pdf.
3. Shrinivas Kudekar, Tom Richardson, and Rudiger L. Urbanke," Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC," in Proc. IEEE International Symposium on Information Theory, Austin, TX, July 2010.
4. M. Lentmaier, D. G. M. Mitchell, G.P. Fettweis, and D.J. Costello Jr., "Asymptotically regular LDPC codes with linear distance growth and thresholds close to capacity," in Proc. Information Theory and Applications Workshop, San Diego, CA, Feb. 2010.
5. D. G. M. Mitchell, M. Lentmaier, and DJ. Costello Jr., "New families of LDPC block codes formed by terminating irregular protograph-based LDPC convolutional codes," in Proc. IEEE International Symposium on Information Theory, Austin, TX, July 2010.
6. S.-Y. Chung, On the construction of some capacity-approaching coding schemes, Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA, 2000.
7. D. Divsalar, S. Dolinar, and C. Jones, "Construction of protograph LDPC codes with linear minimum distance," in Proc. IEEE International Symposium on Information Theory, Seattle, WA, July 2006, pp. 664-668.
8. R. Gallager, Low-Density Parity-Check Codes, MIT Press, Cambridge, MA, 1963.
9. A. Sridharan, D. Sridhara, DJ. Costello Jr., and T.E. Fuja, "A construction for irregular low density parity check convolutional codes," in Proc. IEEE International Symposium on Information Theory, Yokohama, Japan, June 2003, p. 4.
10. J. Thorpe, "Low-density parity-check (LDPC) codes constructed from protographs," in IPN Progress Report 42-154, Jet Propulsion Laboratory, Aug. 2003.
11. D.G.M. Mitchell, A.E. Pusane, K.Sh. Zigangirov, and D.J. Costello, "Asymptotically good LDPC convolutional codes based on protographs," in Proc. IEEE International Symposium on Information Theory, Toronto, Canada, July 2008, pp. 1030- 1034.
12. M. Papaleo, A. Iyengar, P. Siegel, J. Wolf, and G. Corazza, "Windowed erasure decoding of LDPC convolutional codes," in Proc. 2010 IEEE Information Theory Workshop, Cairo, Egypt, Jan. 2010.