The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Asymptotic analysis of superorthogonal turbo codes

På svenska

Author

Summary, in English

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.

Publishing year

2003

Language

English

Pages

253-258

Publication/Series

IEEE Transactions on Information Theory

Volume

49

Issue

1

Document type

Journal article

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

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

Status

Published

ISBN/ISSN/Other

  • ISSN: 0018-9448