DocumentCode
2052634
Title
On the asymptotic analysis of superorthogonal turbo codes
Author
Wintzell, Ola ; Lentmaier, Michael ; Zigangirov, Kamil Sh
Author_Institution
Ericsson Mobile Platforms, Lund, Sweden
fYear
2002
fDate
2002
Firstpage
85
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.
Keywords
interleaved codes; iterative decoding; turbo codes; asymptotic analysis; interleaver; iterative decoding; large permutor; low-rate turbo coding scheme; superorthogonal convolutional encoders; superorthogonal turbo codes; Convolution; Convolutional codes; Error probability; H infinity control; Information analysis; Information technology; Iterative algorithms; Iterative decoding; Signal to noise ratio; Turbo codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN
0-7803-7501-7
Type
conf
DOI
10.1109/ISIT.2002.1023357
Filename
1023357
Link To Document