Advanced

Asymptotic analysis of superorthogonal turbo codes

Wintzell, Ola LU ; Lentmaier, Michael LU and Zigangirov, Kamil LU (2003) In IEEE Transactions on Information Theory 49(1). p.253-258
Abstract
In this correspondence, we examine a low-rate turbo coding. scheme based on superorthogonal convolutional encoders (SOCEs). The low-rate coding is suitable for code-division multiple-access (CDMA) applications. We use the property that the component encoders are equivalent to conventional convolutional encoders to analyze the asymptotic performance. We analyze the iterative decoding performance that can be achieved when both the code length and the number of iterations tend to infinity and present a bound on the iterative limit of the code construction. It is shown by asymptotic analysis, that the rate 1 / 7, 1 / 15, and I / 3 1 codes with component encoders of memory 3, 4, and 5 have iterative limits below -0.65, -0.88, and -0.95 dB,... (More)
In this correspondence, we examine a low-rate turbo coding. scheme based on superorthogonal convolutional encoders (SOCEs). The low-rate coding is suitable for code-division multiple-access (CDMA) applications. We use the property that the component encoders are equivalent to conventional convolutional encoders to analyze the asymptotic performance. We analyze the iterative decoding performance that can be achieved when both the code length and the number of iterations tend to infinity and present a bound on the iterative limit of the code construction. It is shown by asymptotic analysis, that the rate 1 / 7, 1 / 15, and I / 3 1 codes with component encoders of memory 3, 4, and 5 have iterative limits below -0.65, -0.88, and -0.95 dB, respectively. Simulations for codes with large permutors (interleavers) confirm these asymptotic results. The construction is general and can be done for codes of lower rates as well. (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
superorthogonal turbo codes, superorthogonal convolutional codes, codes, low-rate turbo, iterative decoding, low-density convolutional codes
in
IEEE Transactions on Information Theory
volume
49
issue
1
pages
253 - 258
publisher
IEEE--Institute of Electrical and Electronics Engineers Inc.
external identifiers
  • wos:000180370400019
  • scopus:0037269010
ISSN
0018-9448
DOI
10.1109/TIT.2002.806143
language
English
LU publication?
yes
id
3186b0c2-1b0d-4832-bff9-90cf5a300ece (old id 320381)
date added to LUP
2007-09-24 09:02:41
date last changed
2018-01-07 08:37:22
@article{3186b0c2-1b0d-4832-bff9-90cf5a300ece,
  abstract     = {In this correspondence, we examine a low-rate turbo coding. scheme based on superorthogonal convolutional encoders (SOCEs). The low-rate coding is suitable for code-division multiple-access (CDMA) applications. We use the property that the component encoders are equivalent to conventional convolutional encoders to analyze the asymptotic performance. We analyze the iterative decoding performance that can be achieved when both the code length and the number of iterations tend to infinity and present a bound on the iterative limit of the code construction. It is shown by asymptotic analysis, that the rate 1 / 7, 1 / 15, and I / 3 1 codes with component encoders of memory 3, 4, and 5 have iterative limits below -0.65, -0.88, and -0.95 dB, respectively. Simulations for codes with large permutors (interleavers) confirm these asymptotic results. The construction is general and can be done for codes of lower rates as well.},
  author       = {Wintzell, Ola and Lentmaier, Michael and Zigangirov, Kamil},
  issn         = {0018-9448},
  keyword      = {superorthogonal turbo codes,superorthogonal convolutional codes,codes,low-rate turbo,iterative decoding,low-density convolutional codes},
  language     = {eng},
  number       = {1},
  pages        = {253--258},
  publisher    = {IEEE--Institute of Electrical and Electronics Engineers Inc.},
  series       = {IEEE Transactions on Information Theory},
  title        = {Asymptotic analysis of superorthogonal turbo codes},
  url          = {http://dx.doi.org/10.1109/TIT.2002.806143},
  volume       = {49},
  year         = {2003},
}