Title :
The super-trellis structure of turbo codes
Author :
Breiling, Marco ; Hanzo, Lajos
Author_Institution :
Dept. of Electron. & Comput. Sci., Southampton Univ., UK
fDate :
9/1/2000 12:00:00 AM
Abstract :
In this contribution we derive the super-trellis structure of turbo codes. We show that this structure and its associated decoding complexity depend strongly on the interleaver applied in the turbo encoder. We provide upper bounds for the super-trellis complexity. Turbo codes are usually decoded by an iterative decoding algorithm, which is suboptimum. Applying the super-trellis structure, we can optimally decode simple turbo codes and compare the associated bit-error rate results to those of iterative algorithms
Keywords :
computational complexity; error statistics; interleaved codes; iterative decoding; trellis codes; turbo codes; bit-error rate; decoding complexity; interleaver; iterative decoding algorithm; super-trellis structure; turbo codes; turbo encoder; upper bounds; Bit error rate; Block codes; Computer science; Iterative algorithms; Iterative decoding; Maximum likelihood decoding; Maximum likelihood estimation; Turbo codes; Upper bound; Writing;
Journal_Title :
Information Theory, IEEE Transactions on
