New performance bounds for turbo codes

Author

Duman, Tolga M. ; Salehi, Masoud

Author_Institution

Dept. of Electr. & Comput. Eng., Northeastern Univ., Boston, MA, USA

Volume

46

Issue

6

fYear

1998

fDate

6/1/1998 12:00:00 AM

Firstpage

717

Lastpage

723

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. The result is a generalization of the transfer function bound and remains useful for a wider range of signal-to-noise ratios, particularly for some range below the channel cutoff rate. The new bound is also applicable to other linear codes

Keywords

channel coding; concatenated codes; convolutional codes; error statistics; linear codes; maximum likelihood decoding; transfer functions; Gallager bound; bit-error probabilities; channel cutoff rate; interleaver; linear codes; maximum-likelihood decoding; performance bounds; signal-to-noise ratios; standard union bound; transfer function bound; turbo codes; upper bound; word-probabilities; Code standards; Computer simulation; Concatenated codes; Convolutional codes; Error probability; Maximum likelihood decoding; Maximum likelihood estimation; Signal to noise ratio; Turbo codes; Upper bound;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/26.681398

Filename

681398