Optimum non-iterative turbo-decoding

Author

Breiling, M. ; Hanzo, L.

Author_Institution

Dept. of Electron. & Comput. Sci., Southampton Univ., UK

Volume

2

fYear

1997

fDate

1-4 Sep 1997

Firstpage

714

Abstract

By observing the structure of the decoder´s trellis a new, non-iterative turbo-decoder based on a super-trellis structure is proposed, which exhibits the same decoding complexity as a conventional convolutional decoder possessing an identical number of trellis states. For the investigated half-rate, memory-length two code the proposed algorithm requires about 0.5 dB lower Gaussian channel signal-to-noise ratio (SNR) than the maximum a posteriori (MAP) algorithm using 16 iterations

Keywords

Gaussian channels; computational complexity; convolutional codes; dynamic programming; interleaved codes; maximum likelihood decoding; Gaussian channel; MAP algorithm; SNR; block interleaver; convolutional decoder; decoder trellis; decoding complexity; dynamic programming; half-rate code; maximum a posteriori algorithm; memory-length; optimum noniterative turbo-decoding; signal-to-noise ratio; super-trellis structure; trellis states; Block codes; Convolution; Convolutional codes; Forward contracts; Gaussian channels; Iterative decoding; Merging; Signal to noise ratio; Turbo codes; Viterbi algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Personal, Indoor and Mobile Radio Communications, 1997. Waves of the Year 2000. PIMRC '97., The 8th IEEE International Symposium on

Conference_Location

Helsinki

Print_ISBN

0-7803-3871-5

Type

conf

DOI

10.1109/PIMRC.1997.631161

Filename

631161