Investigation into decoding algorithm for turbo codes

D. Raphaeli*, A. Gurevitz

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


An investigation into the turbo decoder is presented. It was carried out to determine whether the decoded bit sequence constitutes a (at least) local maximum in the likelihood between possible codewords in the composite code trellis. The answer was obtained experimentally using a modified iterative turbo decoder. Results show that the turbo decoder does not necessarily lead to a maximum likelihood sequence estimator being realised for the composite code. Moreover, finding a closer code in a Euclidean distance sense only degrades the bit error rate of the system.

Original languageEnglish
Pages (from-to)809-810
Number of pages2
JournalElectronics Letters
Issue number9
StatePublished - 27 Apr 2000


Dive into the research topics of 'Investigation into decoding algorithm for turbo codes'. Together they form a unique fingerprint.

Cite this