On error bounds and Turbo-codes

Christian Schlegel, Lance C Perez

Research output: Contribution to journalArticle

39 Citations (Scopus)

Abstract

Turbo-codes have been hailed as the ultimate step toward achieving the capacity limit Shannon established some 50 years ago. In this letter we look at the performance of Turbo-codes with respect to various information theoretic error bounds. This comparison suggests that, if (block, or) frame error rates are considered, careful interleaver design is necessary to ensure an error performance within a fraction of a decibel of the theoretical limit for large block sizes, while random interleavers perform well for block sizes smaller than about 2K. If bit error performance is considered, interleaver design seems to have only a minor effect, and the codes perform close to the limit for all block sizes considered.

Original languageEnglish (US)
Pages (from-to)205-207
Number of pages3
JournalIEEE Communications Letters
Volume3
Issue number7
DOIs
StatePublished - Jul 1 1999

Fingerprint

Turbo Codes
Turbo codes
Error Bounds
Decibel
Error Rate
Minor
Necessary
Design

ASJC Scopus subject areas

  • Modeling and Simulation
  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this

On error bounds and Turbo-codes. / Schlegel, Christian; Perez, Lance C.

In: IEEE Communications Letters, Vol. 3, No. 7, 01.07.1999, p. 205-207.

Research output: Contribution to journalArticle

Schlegel, Christian ; Perez, Lance C. / On error bounds and Turbo-codes. In: IEEE Communications Letters. 1999 ; Vol. 3, No. 7. pp. 205-207.
@article{8f8b601afd9e4bbea07089c6ee5990f6,
title = "On error bounds and Turbo-codes",
abstract = "Turbo-codes have been hailed as the ultimate step toward achieving the capacity limit Shannon established some 50 years ago. In this letter we look at the performance of Turbo-codes with respect to various information theoretic error bounds. This comparison suggests that, if (block, or) frame error rates are considered, careful interleaver design is necessary to ensure an error performance within a fraction of a decibel of the theoretical limit for large block sizes, while random interleavers perform well for block sizes smaller than about 2K. If bit error performance is considered, interleaver design seems to have only a minor effect, and the codes perform close to the limit for all block sizes considered.",
author = "Christian Schlegel and Perez, {Lance C}",
year = "1999",
month = "7",
day = "1",
doi = "10.1109/4234.775255",
language = "English (US)",
volume = "3",
pages = "205--207",
journal = "IEEE Communications Letters",
issn = "1089-7798",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "7",

}

TY - JOUR

T1 - On error bounds and Turbo-codes

AU - Schlegel, Christian

AU - Perez, Lance C

PY - 1999/7/1

Y1 - 1999/7/1

N2 - Turbo-codes have been hailed as the ultimate step toward achieving the capacity limit Shannon established some 50 years ago. In this letter we look at the performance of Turbo-codes with respect to various information theoretic error bounds. This comparison suggests that, if (block, or) frame error rates are considered, careful interleaver design is necessary to ensure an error performance within a fraction of a decibel of the theoretical limit for large block sizes, while random interleavers perform well for block sizes smaller than about 2K. If bit error performance is considered, interleaver design seems to have only a minor effect, and the codes perform close to the limit for all block sizes considered.

AB - Turbo-codes have been hailed as the ultimate step toward achieving the capacity limit Shannon established some 50 years ago. In this letter we look at the performance of Turbo-codes with respect to various information theoretic error bounds. This comparison suggests that, if (block, or) frame error rates are considered, careful interleaver design is necessary to ensure an error performance within a fraction of a decibel of the theoretical limit for large block sizes, while random interleavers perform well for block sizes smaller than about 2K. If bit error performance is considered, interleaver design seems to have only a minor effect, and the codes perform close to the limit for all block sizes considered.

UR - http://www.scopus.com/inward/record.url?scp=0033358489&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033358489&partnerID=8YFLogxK

U2 - 10.1109/4234.775255

DO - 10.1109/4234.775255

M3 - Article

VL - 3

SP - 205

EP - 207

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 7

ER -