Comparison of LDPC block and LDPC convolutional codes based on their decoding latency

International Symposium on Turbo Codes and Iterative Information Processing, ISTC

Volumn , Issue , 2012, Pages 225-229

  Ul Hassan, Najeeb ^a   Lentmaier, Michael ^a   Fettweis, Gerhard P ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BELIEF PROPAGATION; DECODING PERFORMANCE; INFORMATION BIT; LDPC CODES; LDPC CONVOLUTIONAL CODES; LOW LATENCY; SLIDING WINDOW; TRADE OFF; VITERBI DECODING; WINDOW SIZE;

CONVOLUTIONAL CODES; DATA PROCESSING; TURBO CODES; VITERBI ALGORITHM;

DECODING;

EID: 84870843246     PISSN: 21654700     EISSN: 21654719     Source Type: Conference Proceeding    
DOI: 10.1109/ISTC.2012.6325232     Document Type: Conference Paper

References (16)

1. C. E. Shannon, "A mathematical theory of communication." in Bell Systems Technical Journal, vol. 27, no. 3, Jul. 1948, pp. 379-423.
2. T. Hehn and J. Huber, "LDPC codes and convolutional codes with equal structural delay: A comparison," IEEE Transactions on Communications, vol. 57, no. 6, pp. 1683-1692, Jun. 2009.
3. S. Maiya, D. Costello, T. Fuja, and W. Fong, "Coding with a latency constraint: The benefits of sequential decoding," in 48th Annual Allerton Conference on Communication, Control, and Computing, Oct. 2010, pp. 201-207.
4. K. S. Zigangirov, "Some sequential decoding procedures," Probl. Peredachi Inf., vol. 2, pp. 13-25, 1966.
5. A. Sridharan, M. Lentmaier, D. J. Costello, and K. S. Zigangirov, "Convergence analysis of a class of LDPC convolutional codes for the erasure channel," in proceddings of the 42nd Allerton Conference on Communiations, Control, and Computing, Monticello, II, USA, 2004.
6. M. Lentmaier, A. Sridharan, D. 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.
7. S. Kudekar, T. Richardson, and R. Urbanke, "Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC," in Proceedings of IEEE International Symposium on Information Theory (ISIT), Jun. 2010, pp. 684-688.
8. A. Jimenez Felstrom and K. Zigangirov, "Time-varying periodic convolutional codes with low-density parity-check matrix," IEEE Transactions on Information Theory, vol. 45, no. 6, pp. 2181-2191, Sep. 1999.
9. A. Pusane, A. Feltstrom, A. Sridharan, M. Lentmaier, K. Zigangirov, and D. Costello, "Implementation aspects of LDPC convolutional codes," IEEE Transactions on Communications, vol. 56, no. 7, pp. 1060-1069, Jul. 2008.
10. M. Papaleo, A. Iyengar, P. Siegel, J. Wolf, and G. Corazza, "Windowed erasure decoding of LDPC convolutional codes," in IEEE Information Theory Workshop (ITW), Jan. 2010, pp. 1-5.
11. A. Viterbi, "Error bounds for convolutional codes and an asymptotically optimum decoding algorithm," IEEE Transactions on Information Theory, vol. 13, no. 2, pp. 260-269, Apr. 1967.
12. X.-Y. Hu, E. Eleftheriou, and D. Arnold, "Regular and irregular progressive edge-growth tanner graphs," IEEE Transactions on Information Theory, vol. 51, no. 1, pp. 386-398, Jan. 2005.
13. M. Lentmaier, M. Prenda, and G. Fettweis, "Efficient message passing scheduling for terminated LDPC convolutional codes," in Proceedings of IEEE International Symposium on Information Theory (ISIT), Aug. 2011, pp. 1826-1830.
14. A. Iyengar, M. Papaleo, P. Siegel, J. Wolf, A. Vanelli-Coralli, and G. Corazza, "Windowed decoding of protograph-based LDPC convolutional codes over erasure channels," IEEE Transactions on Information Theory, vol. PP, no. 99, p. 1, 2011.
15. P. A. Hoeher, I. Land, and U. Sorger, "Log-likelihood values and monte carlo simulation-some fundamental results," in 2nd International Symposium on Turbo Codes and Related Topics, 2000, pp. 43-46.
16. M. Lentmaier and G. Fettweis, "Coupled LDPC codes: Complexity aspects of threshold saturation," in IEEE Information Theory Workshop (ITW), Oct. 2011, pp. 668-672.