New Code Matched Interleaver for Turbo Codes with Short Frames
Turbo codes are a parallel concatenation of two or more convolutional codes, separated by interleavers, therefore their performance is not influenced just by the constituent encoders, but also by the interleaver. For short frame turbo codes, the selection of a proper interleaver becomes critical. Th...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Stefan cel Mare University of Suceava
2010-02-01
|
Series: | Advances in Electrical and Computer Engineering |
Subjects: | |
Online Access: | http://dx.doi.org/10.4316/AECE.2010.01019 |
Summary: | Turbo codes are a parallel concatenation of two or more convolutional codes, separated by interleavers, therefore their performance is not influenced just by the constituent encoders, but also by the interleaver. For short frame turbo codes, the selection of a proper interleaver becomes critical. This paper presents a new algorithm of obtaining a code matched interleaver leading to a very high minimum distance and improved performance. |
---|---|
ISSN: | 1582-7445 1844-7600 |