New performance bounds for turbo codes

Tolga M. Duman, Masoud Salehi

Research output: Contribution to journalArticle

88 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. Since the derivation of the bound for a given interleaver is intractable, we assume uniform interleaving as in the derivation of the standard union bound for turbo codes [1], [2]. The result is a generalization of the transfer function bound and remains useful for a wider range of signal-tonoise ratios, particularly for some range below the channel cutoff rate. The new bound is also applicable to other linear codes.

Original languageEnglish (US)
Pages (from-to)717-723
Number of pages7
JournalIEEE Transactions on Communications
Volume46
Issue number6
DOIs
StatePublished - Dec 1 1998

Keywords

  • Error bounds
  • Gallager bound
  • Parallel concatenated codes
  • Performance bounds
  • Turbo codes
  • Union bound

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

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

  • Cite this