On the asymptotic analysis of superorthogonal turbo codes

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceeding

Abstract

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.

Details

Authors
Organisations
Research areas and keywords

Subject classification (UKÄ)

  • Electrical Engineering, Electronic Engineering, Information Engineering
Original languageEnglish
Title of host publication[Host publication title missing]
PublisherIEEE - Institute of Electrical and Electronics Engineers Inc.
ISBN (Print)0-7803-7501-7
Publication statusPublished - 2002
Publication categoryResearch
Peer-reviewedYes
EventIEEE International Symposium on Information Theory (ISIT), 2002 - Lausanne, Switzerland
Duration: 2002 Jun 302002 Jul 5

Conference

ConferenceIEEE International Symposium on Information Theory (ISIT), 2002
Country/TerritorySwitzerland
CityLausanne
Period2002/06/302002/07/05