New performance bounds for turbo codes

Tolga M. Duman, Masoud Salehi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

Abstract

We derive a new upper bound on the word and bit error probabilities of turbo codes with maximum likelihood decoding by using the Gallager bound instead of the standard union bound. Since the derivation of the bound for a given interleaver is intractable, we assume `uniform interleaving' as in the standard union bound applied to turbo codes. The result is a generalization of the transfer function bounds remains useful for a wider range of signal to noise ratios, particularly for some range below the channel cut-off rate. Previously, for signal to noise ratios below the cut-off rate, the performance of turbo codes could only be predicted through simulation. We illustrate the usefulness of the new bound via some examples. We also discuss the possibility of extending the derived upper bound to some other codes.

Original languageEnglish (US)
Title of host publicationConference Record / IEEE Global Telecommunications Conference
Editors Anon
Place of PublicationPiscataway, NJ, United States
PublisherIEEE
Pages634-638
Number of pages5
Volume2
StatePublished - 1997
Externally publishedYes
EventProceedings of the 1997 IEEE Global Telecommunications Conference. Part 2 (of 3) - Phoenix, AZ, USA
Duration: Nov 3 1997Nov 8 1997

Other

OtherProceedings of the 1997 IEEE Global Telecommunications Conference. Part 2 (of 3)
CityPhoenix, AZ, USA
Period11/3/9711/8/97

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Global and Planetary Change

Fingerprint Dive into the research topics of 'New performance bounds for turbo codes'. Together they form a unique fingerprint.

  • Cite this

    Duman, T. M., & Salehi, M. (1997). New performance bounds for turbo codes. In Anon (Ed.), Conference Record / IEEE Global Telecommunications Conference (Vol. 2, pp. 634-638). IEEE.