Scaling behavior of convolutional LDPC ensembles over the BEC

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2011, Pages 1816-1820

  Olmos, Pablo M ^a   Urbanke, Rüdiger ^b  

^a UNIVERSITY OF SEVILLE   (Spain)

^b Ceramics Laboratory Ecole Polytechnique Federale de Lausanne   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY ERASURE CHANNEL; BIT ERROR PROBABILITY; CHANNEL PARAMETER; CODING SYSTEM; COUPLED CHAINS; EMPIRICAL EVIDENCE; NUMBER OF ITERATIONS; SCALING BEHAVIOR; SPARSE GRAPHS;

BIT ERROR RATE; CODES (SYMBOLS);

BEHAVIORAL RESEARCH;

EID: 80054824884     PISSN: 21578104     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2011.6033863     Document Type: Conference Paper

References (10)

1. S. Kudekar, T. J. Richardson, and R. L. Urbanke, "Threshold saturation via spatial coupling: why convolutional LDPC ensembles perform so well over the BEC", e-print, 2010. [Online]. Available: http://arxiv.org/abs/1001.1826
2. R. M. Tanner, D. Sridhara, A. Sridharan, T. E. Fuja, and D. J. Costello, "LDPC block and convolutional codes based on circulant matrices", IEEE Transactions Information Theory, Dec. 2004.
3. M. Lentmaier, A. Sridharan, D. J. Costello, and K. Zigangirov, "Iterative decoding threshold analysis for LDPC convolutional codes", IEEE Transactions on Information Theory, vol. 56, no. 10, pp. 5274-5289, Oct. 2010.
4. S. Kudekar, C. Measson, T. J. Richardson, and R. L. Urbanke, "Threshold Saturation on BMS Channels via Spatial Coupling", e-print, 2010. [Online]. Available: http://arxiv.org/abs/1004.3742
5. A. J. Feltström and K. S. Zigangirov, "Time-varying periodic convolutional codes with low-density parity-check matrix", IEEE Transactions on Information Theory, vol. 45, no. 6, Sept. 1999.
6. M. Lentmaier, G. Fettweis, K. Zigangirov, and D. J. Costello, "Approaching capacity with asymptotically regular LDPC codes", in 2009 IEEE Information Theory and Applications Workshop, Feb. 2009, pp. 173-177.
7. T. Richardson and R. Urbanke, Modern Coding Theory. Cambridge University Press, Mar. 2008.
8. M. Lentmaier, D. G. M. Mitchell, G. Fettweis, and D. J. Costello, "Asymptotically regular LDPC codes with linear distance growth and thresholds close to capacity", e-print, 2010. [Online]. Available: http://arxiv.org/abs/1005.1062
9. J. Thorpe, "Low density parity check (LDPC) codes constructed from protographs", JPL IPN Progress Report 42-154, Tech. Rep., 2003.
10. M. Papaleo, A. Iyengar, P. Siegel, J. Wolf, and G. Corazza, "Windowed erasure decoding of LDPC convolutional codes", in 2010 IEEE Information Theory Workshop (ITW), Jan. 2010, pp. 1-5.