On the thresholds of generalized LDPC convolutional codes based on protographs

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2010, Pages 709-713

  Lentmaier, Michael ^a   Fettweis, Gerhard P ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BELIEF PROPAGATION DECODING; BINARY ERASURE CHANNEL; DECODING THRESHOLDS; LDPC CONVOLUTIONAL CODES; PROTOGRAPH; THRESHOLD ANALYSIS;

CONVOLUTION; CONVOLUTIONAL CODES; DECODING; INFORMATION THEORY; NUMERICAL ANALYSIS;

BLOCK CODES;

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

References (15)

1. A. Sridharan, M. Lentmaier, D. J. Costello, Jr., and K. Sh. Zigangirov, "Convergence analysis of a class of LDPC con-volutional codes for the erasure channel," in Proceedings of the 42nd Allerton Conference on Communication, Control, and Computing, Monticello, IL, USA, 2004.
2. M. Lentmaier, A. Sridharan, D.J. Costello, Jr., and K.Sh. Zi-gangirov, "Iterative decoding threshold analysis for LDPC convolutional codes," IEEE Trans. Inform. Theory, accepted for publication. See also http://www.vodafone-chair.com/staff/lentmaier/LDPCCCThresholdsTransIT.pdf.
3. E. Paolini, M. Varrella, M. Chiani, B. Matuz, and G. Liva, "Low-complexity LDPC codes with near-optimum performance over the BEC," in Proc. 4th Advanced Satellite Mobile Systems. ASMS 2008., Aug. 2008, pp. 274-282.
4. C. Measson, A. Montanari, and R. Urbanke, "Maxwell construction: The hidden bridge between iterative and maximum a posteriori decoding," IEEE Trans. Inform. Theory, vol. 54, no. 12, pp. 5277-5307, Dec. 2008.
5. D. Divsalar, S. Dolinar, and C. Jones, "Construction of pro-tograph LDPC codes with linear minimum distance," in Proc. IEEE International Symposium on Information Theory, Seattle, WA, July 2006, pp. 664-668.
6. 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.
7. Shrinivas Kudekar, Tom Richardson, and Rüdiger L. Urbanke, "Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC," available online at http://arxiv.org/abs/1001.1826.
8. M. Lentmaier, M.B.S. Tavares, and G.P. Fettweis, "Exact erasure channel density evolution for protograph based generalized LDPC codes," in Proc. IEEE International Symposium on Information Theory, Seoul, Korea, July. 2009, pp. 566-570.
9. M. Lentmaier, A. Sridharan, K. Sh. Zigangirov, and D. J. Costello, Jr., "Terminated LDPC convolutional codes with thresholds close to capacity," in Proc. IEEE International Symposium on Information Theory, Adelaide, Australia, Sept. 2005, pp. 1372-1376.
10. A.J. Feltström, D. Truhachev, M. Lentmaier, and K.Sh. Zigan-girov, "Braided block codes," IEEE Trans. Inform. Theory, vol. 55, no. 6, pp. 2640-2658, June 2009.
11. M. Lentmaier, B. Noethen, and G.P. Fettweis, "Density evolution analysis of protograph-based braided block codes on the erasure channel," in Proc. 8th International ITG Conference on Source and Channel Coding, Siegen, Germany, Feb. 2010.
12. G. Liva, W.E. Ryan, and M. Chiani, "Quasi-cyclic generalized LDPC codes with low error floors," IEEE Trans. Commun., vol. 56, no. 1, pp. 49-57, January 2008.
13. J. Thorpe, "Low-density parity-check (LDPC) codes constructed from protographs," in IPN Progress Report 42-154, JPL, Aug. 2003.
14. A. Ashikhmin, G. Kramer, and S. ten Brink, "Extrinsic information transfer functions: model and erasure channel properties," IEEE Trans. Inform. Theory, vol. 50, no. 11, pp. 2657-2673, Nov. 2004.
15. 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.