Convergence analysis and optimal scheduling for multiple concatenated codes

IEEE Transactions on Information Theory

Volumn 51, Issue 9, 2005, Pages 3354-3364

  Brännström, Fredrik ^a   Rasmussen, Lars K ^a,b   Grant, Alex J ^b  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^b UNIVERSITY OF SOUTH AUSTRALIA   (Australia)

Author keywords

Exit chart; Iterative decoding; Multiple concatenated codes; Optimal scheduling

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; DECODING; ITERATIVE METHODS; OPTIMIZATION; WHITE NOISE;

EXIT CHART; ITERATIVE DECODING; MULTIPLE CONCATENATED CODES; OPTIMAL SCHEDULING;

CODES (SYMBOLS);

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

References (22)

1. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near shannon limit error-correcting coding and decoding: Turbo-codes," in Proc. IEEE Int. Conf. Communications (ICC '93), vol. 2, Geneva, Switzerland, May 1993, pp. 1064-1070.
2. S. Benedetto and G. Montorsi, "Serial concatenation of block and convolutional codes," IEE Electron. Lett., vol. 32, no. 10, pp. 887-888, May 1996.
3. D. Divsalar and F. Pollara, "Multiple turbo codes for deep-space communications," Jet Propulsion Laboratory, Pasadena, CA, TDA Progress Rep. 42-121, May 1995.
4. 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.
5. S. ten Brink, "Convergence of iterative decoding," IEE Electron. Lett., vol. 35, pp. 1117-1119, Jun. 1999.
6. S. ten Brink, "Convergence behavior of iteratively decoded parallel concatenated codes," IEEE Trans. Commun., vol. 49, no. 10, pp. 1727-1737, Oct. 2001.
7. S. ten Brink, "Convergence of multi-dimensional iterative decoding schemes," in Proc. 35th Asilomar Conf. Signals, Systems and Computers, vol. 1, Pacific Grove, CA, Nov. 2001, pp. 270-274.
8. J. Han and O. Y. Takeshita, "On the decoding structure for multiple turbo codes," in Proc. IEEE Int. Symp. Information Theory (ISIT '01), Washington, DC, Jun. 2001, p. 98.
9. S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, "A soft-input soft-output APP module for iterative decoding of concatenated codes," IEEE Commun. Lett., vol. 1, no. 1, pp. 22-24, Jan. 1997.
10. M. Tüchler, "Convergence prediction for iterative decoding of threefold concatenated systems," in Proc. IEEE Global Communications Conf. (GLOBECOM '02), vol. 2, Taipei, Taiwan, R.O.C., Nov. 2002, pp. 1358-1362.
11. F. Brännström, T. M. Aulin, L. K. Rasmussen, and A. J. Grant, "Convergence analysis of iterative detectors for narrow-band multiple access," in Proc. IEEE Global Commun. Conf. (GLOBECOM '02), vol. 2, Taipei, Taiwan, R.O.C., Nov. 2002, pp. 1373-1377.
12. F. Brännström, "Convergence analysis and design of multiple concatenated codes," Ph.D. dissertation, Chalmers Univ. Technol., Göteborg, Sweden, Mar. 2004.
13. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
14. J. A. Nelder and R. Mead, "A simplex method for function minimization," Comp. J., vol. 7, pp. 308-313, 1965.
15. A. Ashikhmin, G. Kramer, and S. ten Brink, "Extrinsic information transfer functions, information functiors, support weights, and duality," in Proc. Int. Symp. Turbo Codes and Related Topics, Brest, France, Sep. 2003, pp. 223-226.
16. A. Ashikhmin, G. Kramer, and S. ten Brink, "Extrinsic information transfer functions: Model and erasure channel properties," IEEE Trans. Inf. Theory, vol. 50, no. 11, pp. 2657-2673, Nov. 2004.
17. S. ten Brink, "Design of serially concatenated codes based on iterative decoding convergence," in Proc. Int. Symp. Turbo Codes and Related Topics, Brest, France, Sep. 2000, pp. 319-322.
18. F. Brännström, L. K. Rasmussen, and A. Grant, "Optimal scheduling for multiple serially concatenated codes," in Proc. Int. Symp. Turbo Codes and Related Topics, Brest, France, Sep. 2003, pp. 383-386.
19. S. Huettinger and J. Huber, "Design of "multiple-turbo-codes" with transfer characteristics of component codes," in Proc. Conf. Information Sciences and Systems (CISS '02). Princeton, NJ, Mar. 2002.
20. F. Brännström, L. K. Rasmussen, and A. Grant, "Optimal scheduling for iterative decoding," in Proc. IEEE Int. Symp. Information Theory (ISIT '03), Yokohama, Japan, Jun./Jul. 2003, p. 350.
21. G. D. Forney Jr., "The Viterbi algorithm," Proc. IEEE, vol. 61, no. 3, pp. 268-278, Mar. 1973.
22. D. P. Bertsekas and J. N. Tsitsiklis, Parallel and Distributed Computation. Englewood Cliffs, NJ: Prentice-Hall, 1989.