Tuned turbo codes

Christian Koller, Alexandre Graell I. Amat, Jörg Kliewer, Francesca Vatta, Daniel J. Costello

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

6 Scopus citations

Abstract

As implied by previous studies, there exists a fundamental trade-off between the minimum distance and the iterative decoding convergence behavior of a turbo code. While capacity achieving code ensembles typically are asymptotically bad in the sense that their minimum distance does not grow linearly with block length and they therefore exhibit an error floor at medium to high signal to noise ratios, asymptotically good codes usually converge further away from channel capacity. In this paper we present so-called tuned turbo codes, a family of asymptotically good hybrid concatenated code ensembles, where minimum distance growths and convergence thresholds can be traded-off using a tuning parameter λ. By decreasing λ, the asymptotic minimum distance growth rate coefficient is reduced for the sake of improved iterative decoding convergence behavior, and thus the code performance can be tuned to fit the desired application.

Original languageEnglish (US)
Title of host publication2008 International Symposium on Information Theory and its Applications, ISITA2008
DOIs
StatePublished - Dec 1 2008
Externally publishedYes
Event2008 International Symposium on Information Theory and its Applications, ISITA2008 - Auckland, New Zealand
Duration: Dec 7 2008Dec 10 2008

Publication series

Name2008 International Symposium on Information Theory and its Applications, ISITA2008

Other

Other2008 International Symposium on Information Theory and its Applications, ISITA2008
CountryNew Zealand
CityAuckland
Period12/7/0812/10/08

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Fingerprint Dive into the research topics of 'Tuned turbo codes'. Together they form a unique fingerprint.

Cite this