Advanced

Analysis and Design of Tuned Turbo Codes

Koller, Christian; Graell i Amat, Alexandre; Kliewer, Joerg; Vatta, Francesca; Zigangirov, Kamil LU and Costello, Daniel J. Jr. (2012) In IEEE Transactions on Information Theory 58(7). p.4796-4813
Abstract
It has been widely observed that there exists a fundamental tradeoff between the minimum (Hamming) distance properties and the iterative decoding convergence behavior of turbo-like codes. 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 moderate-to-high signal-to-noise ratios, asymptotically good codes usually converge further away from channel capacity. In this paper, we introduce the concept of tuned turbo codes, a family of asymptotically good hybrid concatenated code ensembles, where asymptoticminimum distance growth rates, convergence thresholds, and code rates can be tradedoff using... (More)
It has been widely observed that there exists a fundamental tradeoff between the minimum (Hamming) distance properties and the iterative decoding convergence behavior of turbo-like codes. 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 moderate-to-high signal-to-noise ratios, asymptotically good codes usually converge further away from channel capacity. In this paper, we introduce the concept of tuned turbo codes, a family of asymptotically good hybrid concatenated code ensembles, where asymptoticminimum distance growth rates, convergence thresholds, and code rates can be tradedoff using two tuning parameters: lambda and mu By decreasing lambda, the asymptotic minimum distance growth rate is reduced in exchange for improved iterative decoding convergence behavior, while increasing lambda raises the asymptotic minimum distance growth rate at the expense of worse convergence behavior, and thus, the code performance can be tuned to fit the desired application. By decreasing mu, a similar tuning behavior can be achieved for higher rate code ensembles. (Less)
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Contribution to journal
publication status
published
subject
keywords
Concatenated codes, distance growth rates, extrinsic information, transfer (EXIT) charts, Hamming distance, iterative decoding, turbo, codes
in
IEEE Transactions on Information Theory
volume
58
issue
7
pages
4796 - 4813
publisher
IEEE--Institute of Electrical and Electronics Engineers Inc.
external identifiers
  • wos:000305575000043
  • scopus:84862538615
ISSN
0018-9448
DOI
10.1109/TIT.2012.2195711
language
English
LU publication?
yes
id
c4b271ce-8569-479b-9963-d0649c450ee5 (old id 2883884)
date added to LUP
2012-07-25 10:43:49
date last changed
2017-10-08 04:02:20
@article{c4b271ce-8569-479b-9963-d0649c450ee5,
  abstract     = {It has been widely observed that there exists a fundamental tradeoff between the minimum (Hamming) distance properties and the iterative decoding convergence behavior of turbo-like codes. 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 moderate-to-high signal-to-noise ratios, asymptotically good codes usually converge further away from channel capacity. In this paper, we introduce the concept of tuned turbo codes, a family of asymptotically good hybrid concatenated code ensembles, where asymptoticminimum distance growth rates, convergence thresholds, and code rates can be tradedoff using two tuning parameters: lambda and mu By decreasing lambda, the asymptotic minimum distance growth rate is reduced in exchange for improved iterative decoding convergence behavior, while increasing lambda raises the asymptotic minimum distance growth rate at the expense of worse convergence behavior, and thus, the code performance can be tuned to fit the desired application. By decreasing mu, a similar tuning behavior can be achieved for higher rate code ensembles.},
  author       = {Koller, Christian and Graell i Amat, Alexandre and Kliewer, Joerg and Vatta, Francesca and Zigangirov, Kamil and Costello, Daniel J. Jr.},
  issn         = {0018-9448},
  keyword      = {Concatenated codes,distance growth rates,extrinsic information,transfer (EXIT) charts,Hamming distance,iterative decoding,turbo,codes},
  language     = {eng},
  number       = {7},
  pages        = {4796--4813},
  publisher    = {IEEE--Institute of Electrical and Electronics Engineers Inc.},
  series       = {IEEE Transactions on Information Theory},
  title        = {Analysis and Design of Tuned Turbo Codes},
  url          = {http://dx.doi.org/10.1109/TIT.2012.2195711},
  volume       = {58},
  year         = {2012},
}