Asymptotic analysis of superorthogonal turbo codes

Ola Wintzell, Michael Lentmaier, Kamil Zigangirov

Research output: Contribution to journalArticlepeer-review

11 Citations (SciVal)


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.
Original languageEnglish
Pages (from-to)253-258
JournalIEEE Transactions on Information Theory
Issue number1
Publication statusPublished - 2003

Subject classification (UKÄ)

  • Electrical Engineering, Electronic Engineering, Information Engineering


  • superorthogonal turbo codes
  • superorthogonal convolutional codes
  • codes
  • low-rate turbo
  • iterative decoding
  • low-density convolutional codes


Dive into the research topics of 'Asymptotic analysis of superorthogonal turbo codes'. Together they form a unique fingerprint.

Cite this