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.

On the asymptotic analysis of superorthogonal turbo codes

På svenska

Author

Summary, in English

A low-rate turbo coding scheme based on superorthogonal convolutional encoders is examined. We analyze the asymptotic 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 this superorthogonal turbo code construction. Simulations of the codes with large permutors (interleavers) confirm the results of the asymptotic analysis.

Publishing year

2002

Language

English

Publication/Series

[Host publication title missing]

Document type

Conference paper

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Conference name

IEEE International Symposium on Information Theory (ISIT), 2002

Conference date

2002-06-30 - 2002-07-05

Conference place

Lausanne, Switzerland

Status

Published

Research group

  • Telecommunication Theory

ISBN/ISSN/Other

  • ISBN: 0-7803-7501-7