New families of LDPC block codes formed by terminating irregular protograph-based LDPC convolutional codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2010, Pages 824-828

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

^a University of Notre Dame   (United States)

^b DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

A-DENSITY; ASYMPTOTIC WEIGHT; BINARY ERASURE CHANNEL; BLOCK LENGTHS; CODE RATES; FLEXIBLE DESIGNS; LDPC CONVOLUTIONAL CODES; MINIMUM DISTANCE; PROTOGRAPH;

BLOCK CODES; CONVOLUTION; CONVOLUTIONAL CODES; INFORMATION THEORY;

ASYMPTOTIC ANALYSIS;

EID: 77955689879     PISSN: 21578103     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2010.5513633     Document Type: Conference Paper

References (15)

1. M. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, "Efficient erasure correcting codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 569-584, Feb. 2001.
2. P. Oswald and M. A. Shokrollahi, "Capacity-achieving sequences for the erasure channel," IEEE Trans. Inf. Theory, vol. 48, no. 12, pp. 3017-3028, Dec. 2002.
3. R. G. Gallager, "Low-density parity-check codes," IRE Trans. Inf. Theory, vol. 8, no. 1, pp. 21-28, Jan. 1962.
4. J. Thorpe, "Low-density parity-check (LDPC) codes constructed from protographs," Jet Propulsion Laboratory, INP Progress Report 42-154, Aug. 2003.
5. D. Divsalar, S. Dolinar, C. Jones, and K. Andrews, "Capacity- approaching protograph codes," IEEE Journal on Selected Areas in Communications, vol. 27, no. 6, pp. 876-888, Aug. 2009.
6. M. Lentmaier, G. Fettweis, K. Sh. Zigangirov, and D. J. Costello, Jr., "Approaching capacity with asymptotically regular LDPC codes," in Proc. Inf. Theory and App. Workshop, Feb. 2009.
7. S. Kudekar, T. Richardson, and R. Urbanke, "Threshold saturation via spatial coupling: why convolutional LDPC ensembles perform so well over the BEC," e-print: http://arxiv.org/abs/1001.1826.
8. 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. Inf. Theory and App. Workshop, San Diego, CA, Feb. 2010.
9. S. L. Fogal, R. McEliece, and J. Thorpe, "Enumerators for protograph ensembles of LDPC codes," in Proc. IEEE Int. Symp. Inf. Theory, Sept. 2005.
10. A. Jiménez-Felström and K. Sh. Zigangirov, "Time-varying periodic convolutional codes with low-density parity-check matrices," IEEE Trans. Inf. Theory, vol. 45, no. 6, pp. 2181-2191, Sept. 1999.
11. D. G. M. Mitchell, A. E. Pusane, K. Sh. Zigangirov, and D. J. Costello, Jr., "Asymptotically good LDPC convolutional codes based on protographs," in Proc. IEEE Int. Symp. Inf. Theory, July 2008.
12. A. Sridharan, D. Truhachev, M. Lentmaier, D. J. Costello, Jr., and K. Sh. Zigangirov, "Distance bounds for an ensemble of LDPC convolutional codes," IEEE Trans. Inf. Theory, vol. 53, no. 12, pp. 4537-4555, Dec. 2007.
13. A. Sridharan, M. Lentmaier, D. J. Costello, Jr., and K. Sh. Zigangirov, "Convergence analysis of a class of LDPC convolutional codes for the erasure channel," in Proc. 42nd Allerton Conf., Sept. 2004.
14. M. Lentmaier, A. Sridharan, K. Sh. Zigangirov, and D. J. Costello, Jr., "Iterative decoding threshold analysis for LDPC convolutional codes," IEEE Trans. Inf. Theory, to appear, 2010.
15. M. Lentmaier, D. G. M. Mitchell, G. Fettweis, and D. J. Costello, Jr., "Asymptotically Good LDPC Convolutional Codes with AWGN Channel Thresholds Close to the Shannon limit," submitted to 6th Int. Symp. on Turbo Codes and Iterative Inf. Processing, Apr. 2010.