Analysis and design of tuned turbo codes

IEEE Transactions on Information Theory

Volumn 58, Issue 7, 2012, Pages 4796-4813

  Koller, Christian ^a   Graell I Amat, Alexandre ^b   Kliewer, Jörg ^c   Vatta, Francesca ^d   Zigangirov, Kamil Sh ^a,e,f   Costello, Daniel J ^a  

^a University of Notre Dame   (United States)

^b CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^c Horeshoe Cir Jett Hall   (United States)

^d UNIVERSITY OF TRIESTE   (Italy)

^e INSTITUTE FOR INFORMATION TRANSMISSION PROBLEMS   (Russian Federation)

^f LUND UNIVERSITY   (Sweden)

Author keywords

Concatenated codes; distance growth rates; extrinsic information transfer (EXIT) charts; Hamming distance; iterative decoding; turbo codes

Indexed keywords

CONCATENATED CODES; GROWTH RATE; ITERATIVE DECODING; SIGNAL TO NOISE RATIO; TUNING; TURBO CODES;

ASYMPTOTICS; BLOCK LENGTHS; CONVERGENCE BEHAVIORS; DISTANCE GROWTH RATES; ERROR FLOOR; EXTRINSICINFORMATION TRANSFER (EXIT) CHART; ITERATIVE DECODINGS; MINIMUM HAMMING DISTANCES; MINIMUMS DISTANCE; PROPERTY;

HAMMING DISTANCE;

EID: 84862538615     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2012.2195711     Document Type: Article

References (32)

1. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo codes," in Proc. IEEE Int. Conf. Commun., Geneva, Switzerland, May 1993, pp. 1064-1070.
2. D. Divsalar and F. Pollara, "Turbo codes for PCS applications," in Proc. IEEE Int. Conf. Commun., Seattle, WA, Jun. 1995, pp. 54-59.
3. N. Kahale and R. Urbanke, "On the minimum distance of parallel and serially concatenated codes," in Proc. IEEE Int. Symp. Inf. Theory, Cambridge, MA, Aug. 1998, p. 31.
4. M. Breiling, "A logarithmic upper bound on the minimum distance of turbo codes," IEEE Trans. Inf. Theory, vol. 50, no. 8, pp. 1692-1710, Aug. 2004.
5. H. D. Pfister, "On the capacity of finite state channels and the analysis of convolutional accumulate-m codes," Ph.D. dissertation, Univ. California, San Diego, 2003.
6. L. Bazzi, M. Mahdian, and D. A. Spielman, "The minimum distance of turbo-like codes," IEEE Trans. Inf. Theory, vol. 55, no. 1, pp. 6-15, Jan. 2009.
7. F. Fagnani and C. Ravazzi, "Spectra and minimum distances of repeat multiple accumulate codes," IEEE Trans. Inf. Theory, vol. 55, no. 11, pp. 4905-4924, Nov. 2009.
8. A. Brown, M. Luby, and A. Shokrollahi, "Repeat-accumulate codes that approach the Gilbert-Varshamov bound," in Proc. IEEE Int. Symp. Inf. Theory, Adelaide, Australia, Sep. 2005, pp. 169-173.
9. D. Divsalar and F. Pollara, "Serial and hybrid concatenated codes with applications," in Proc. Int. Symp. Turbo Codes Related Topics, Brest, France, Sep. 1997, pp. 80-87.
10. C. Koller, A. Graell i Amat, J. Kliewer, F. Vatta, and D. J. Costello Jr., "Hybrid concatenated codes with asymptotically good distance growth," presented at the presented at the Int. Symp. Turbo Codes Related Topics, Lausanne, Switzerland, Sep. 2008.
11. A. Graell i Amat and E. Rosnes, "Good concatenated code ensembles for the binary erasure channel," IEEE J. Sel. Areas Commun., vol. 27, no. 6, pp. 928-943, Jul. 2009.
12. C. Koller, A. Graell i Amat, J. Kliewer, F. Vatta, and D. J. Costello Jr., "Tuned turbo codes," presented at the presented at the Int. Symp. Inf. Theory Appl., Auckland, New Zealand, Dec. 2008.
13. E. Rosnes and A. Graell i Amat, "Performance analysis of 3-D turbo codes," IEEE Trans. Inf. Theory, vol. 57, no. 6, pp. 3707-3720, May 2011.
14. R. Smarandache and P. O. Vontobel, "Quasi-cyclic LDPC codes: Influence of proto-and Tanner-graph structure on minimum Hamming distance upper bounds," IEEE Trans. Inf. Theory, vol. 58, no. 2, pp. 585-607, Feb. 2012.
15. P. C. Massey and D. J. Costello Jr., "New low-complexity turbo-like codes," presented at the presented at the IEEE Inf. Theory Workshop, Cairns, Australia, Sep. 2001.
16. C. He, A. Banerjee, D. J. Costello Jr., and P. C.Massey, "On the performance of low complexity multiple turbo codes," presented at the presented at the 40th Annu. Allerton Conf. Commun., Control, Comput., Monticello, IL, Sep. 2002.
17. C. Koller, A. Graell i Amat, J. Kliewer, and D. J. Costello Jr., "Trapping set enumerators for repeat multiple accumulate code ensembles," in Proc. IEEE Int. Symp. Inf. Theory, Seoul, Korea, Jun. 2009, pp. 1819-1823.
18. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory, vol. 47, pp. 498-519, Feb. 2001.
19. P. O. Vontobel and R. Koetter, Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes CoRR, Dec. 2005 [Online]. Available: http://www.arxiv.org/abs/cs.IT/0512078
20. J. Feldman, T. Malkin, R. A. Servedio, C. Stein, andM. J.Wainwright, "LP decoding corrects a constant fraction of errors," IEEE Trans. Inf. Theory, vol. 53, no. 1, pp. 82-89, Jan. 2007.
21. S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, "Analysis, design, and iterative decoding of double serially concatenated codes with interleavers," IEEE J. Sel. Areas Commun., vol. 16, no. 2, pp. 231-244, Feb. 1998.
22. D. Divsalar, H. Jin, and R. J. McEliece, "Coding theorems for 'turbolike' codes," in Proc. 36th Annual Allerton Conf. Commun., Control, Comput., Monticello, IL, Sep. 1998, pp. 201-210.
23. A. Abbasfar, D. Divsalar, and K. Yao, "Accumulate-repeat-accumulate codes," IEEE Trans. Commun., vol. 55, no. 4, pp. 692-702, Apr. 2007.
24. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
25. H. Jin and R. J. McEliece, "Coding theorems for turbo code ensembles," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1451-1461, Jun. 2002.
26. C. T. Kelley, Iterative Methods for Optimization. Philadelphia, PA: Soc. Ind. Appl. Math., 1999.
27. I. Sason, E. Telatar, and R. Urbanke, "The asymptotic input output weight distribution of convolutional codes," IEEE Trans. Inf. Theory, vol. 48, no. 12, pp. 3052-3061, Dec. 2002.
28. S. ten Brink, "Convergence behavior of iteratively decoded parallel concatenated codes," IEEE Trans. Commun., vol. 49, no. 2, pp. 1727-1737, Oct. 2001.
29. M. Tüchler, "Convergence prediction for iterative decoding of threefold concatenated systems," in Proc. IEEE Global Telecommun. Conf., Taipei, Taiwan, Nov. 2002, pp. 1358-1362.
30. F. Brännström, L. K. Rasmussen, and A. J. Grant, "Convergence analysis and optimal scheduling for multiple concatenated codes," IEEE Trans. Inf. Theory, vol. 51, no. 9, pp. 3354-3364, Sep. 2005.
31. C. He, M. Lentmaier, D. J. Costello Jr., and K. S. Zigangirov, "Joint permutor analysis and design for multiple turbo codes," IEEE Trans. Inf. Theory, vol. 52, no. 9, pp. 4068-4083, Sep. 2006.
32. R. P. Stanley, "Log-concave and unimodal sequences in algebra, combinatorics, and geometry," Graph Theory and Its Applications: East and West, Ann. New York Acad. Sci., vol. 576, pp. 500-535, 1989.