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 language | English (US) |
---|---|
Title of host publication | Conference Record / IEEE Global Telecommunications Conference |
Editors | Anon |
Place of Publication | Piscataway, NJ, United States |
Publisher | IEEE |
Pages | 634-638 |
Number of pages | 5 |
Volume | 2 |
State | Published - 1997 |
Externally published | Yes |
Event | Proceedings of the 1997 IEEE Global Telecommunications Conference. Part 2 (of 3) - Phoenix, AZ, USA Duration: Nov 3 1997 → Nov 8 1997 |
Other
Other | Proceedings of the 1997 IEEE Global Telecommunications Conference. Part 2 (of 3) |
---|---|
City | Phoenix, AZ, USA |
Period | 11/3/97 → 11/8/97 |
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Global and Planetary Change