Optimum Non-iterative Turbo-Decoding


Breiling, M and Hanzo, L (1997) Optimum Non-iterative Turbo-Decoding At of PIMRC 1997, Finland. 01 - 04 Sep 1997. , pp. 714-718.

This is the latest version of this item.

Download

[img] PDF mb-lh-pimrc-1997.pdf - Other
Download (528kB)

Description/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.5dB lower Gaussian channel signal-tp-noise ratio (SNR) than the Maximum A Posteriori (MAP) algorithm using 16 iterations.

Item Type: Conference or Workshop Item (Other)
Additional Information: Event Dates: 1-4. September 1997 Organisation: PIMRC'97 Address: Helsinki, Finland
Venue - Dates: of PIMRC 1997, Finland, 1997-09-01 - 1997-09-04
Organisations: Southampton Wireless Group
ePrint ID: 257109
Date :
Date Event
September 1997Published
Date Deposited: 12 Dec 2002
Last Modified: 17 Apr 2017 22:55
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/257109

Available Versions of this Item

  • Optimum Non-iterative Turbo-Decoding (deposited 12 Dec 2002) [Currently Displayed]

Actions (login required)

View Item View Item