On union bounds for random serially concatenated turbo codes with maximum likelihood decoding

European Transactions on Telecommunications

Volumn 11, Issue 3, 2000, Pages 271-282

  Sason, Igal ^a   Shamai, Shlomo ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0004891446     PISSN: 1124318X     EISSN: None     Source Type: Journal    
DOI: 10.1002/ett.4460110304     Document Type: Article

References (16)

1. S. Benedetto and G. Montorsi. Unveiling turbo codes: some results on parallel concatenated coding schemes. IEEE Trans. Information Theory, Vol. 42, No. 2, pages 409-428, March 1996.
2. S. Benedetto, D. Divsalar, G. Montorsi and F. Pollara. Serial concatenation of interleaved codes: Performance analysis, design, and iterative decoding. IEEE Trans. on Information Theory, Vol. 44, No. 3, pages 909-926, May 1998.
3. C. Berrou, A. Glavieux and P. Thitimajshima. Near Shannon limit error correcting coding and decoding: turbo-codes. Proc. of International Conference on Communications, pages 1064-1070, Geneva. Switzerland, May 23-26, 1993.
4. J. Craig. A new, simple and exact result for calculating error probability for two-dimensional signal constellation. Proceedings of 1991 Mil Commun. Conf. (MILCOM'91).
5. F. Daneshgaran and M. Mondin. An efficient algorithm for obtaining the distance spectrum of turbo codes. Proceedings of the International Symposium on Turbo Codex @ Related Topics, pages 251-254, Brest, France, 3-5 September, 1997.
6. D. Divsalar, S. Dolinar, R.J. McEliece and F. Pollara. Transfer functions bounds on the performance of turbo codes. the Telecommunications and Data Acquisition Progress Report 42-122, April-June, Jet Propulsion Laboratory, Pasadena, California, pages 44-55, August 15, 1995.
7. D. Divsalar, A simple tight bound on error probability of block codes with application to turbo codes. JPL, TDA Progress Report, 42-139, pages 1-35, November 1999.
8. D. Divsalar and F. Pollara. Serial and hybrid concatenated codes with applications. Proceedings of the International Symposium on Turbo Codes @ Related Topics, pages 80-87, Brest, France, 3-5 September, 1997.
9. T.M. Duman and M. Salehi. New performance bounds for turbo codes. IEEE Trans. on Communications, Vol. 46, No. 6, pages 717-723, June 1998.
10. N. Kahale and R. Urbanke. On the minimum distances of parallel and serially concatenated codes. Proceedings 1998 IEEE Int. Symp. Information Theory (ISIT'98), p. 31, Boston, MA, USA, August 16-21, 1998. See also Bell Laboratories, Lucent Technologies, Technical Report, 1997.
11. P. T. Nielsen. On the expected duration of a search for a fixed pattern in random data. IEEE Trans. Inform. Th., Vol. IT-19, pages 702-704, September 1973.
12. I. Sason and S. Shamai (Shitz). Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum. IEEE Trans. on Information Theory, Vol. 46, No. 1, pages 24-47, January 2000.
13. Y.V. Svirid. Weight distributions and bounds for turbo codes. European Trans. on Telecommunications, Vol. 6, No. 5, pages 543-555, September-October 1995.
14. E. Telatar and R. Urbanke. On the ensemble performance of turbo codes. 1996. Available in: http://cavwww.epfl.ch/ruediger/publications.html.
15. A.J. Viterbi and J.K. Omura. Principles of Digital Communications and Coding. New York, McGraw-Hill, 1979.
16. A.J. Viterbi, A.M. Viterbi, J. Nicolas and N.T. Sindushyana. Perspectives on interleaved concatenated codes with iterative soft-output decoding. Proceedings of the International Symposium on Turbo Codes & Related Topics, pages 47-54, Brest, France, 3-5 September, 1997.