Application of the Berrou SOVA algorithm in decoding of a turbo code

Risto Nordman (Corresponding Author)

Research output: Contribution to journalArticleScientificpeer-review

1 Citation (Scopus)

Abstract

We present a turbo decoder that is based on a low complexity soft output Viterbi algorithm (SOVA) introduced by Claude Berrou et al. in ICC'93. It is conceptually different from the conventional turbo decoders, where the iteration is based on the a posteriori probabilities (APP). The constituent Berrou SOVA decoders make the maximum likelihood (ML) decision on the correct path in the trellis, and they have lots of similarities with a conventional hard decision Viterbi decoder—their complexity is double that of the Viterbi due to extraction of the soft output. The iterative Berrou SOVA decoder is able to achieve a relatively high speed: the constituent decoders can work at the same pace as their conventional Viterbi counterparts, and no back tracing is needed. The performance is competitive with the traditional decoding algorithms. In comparison with Max‐Log‐MAP, we have attained a slightly better performance.
Original languageEnglish
Pages (from-to)245-254
Number of pages10
JournalEuropean Transactions on Telecommunications
Volume14
Issue number3
DOIs
Publication statusPublished - 2003
MoE publication typeA1 Journal article-refereed

Fingerprint

Viterbi algorithm
Turbo codes
Decoding
Maximum likelihood

Keywords

  • soft output Viterbi algorithm
  • decoders

Cite this

@article{62eebb3743114fb6b5f0ad470ef5ef52,
title = "Application of the Berrou SOVA algorithm in decoding of a turbo code",
abstract = "We present a turbo decoder that is based on a low complexity soft output Viterbi algorithm (SOVA) introduced by Claude Berrou et al. in ICC'93. It is conceptually different from the conventional turbo decoders, where the iteration is based on the a posteriori probabilities (APP). The constituent Berrou SOVA decoders make the maximum likelihood (ML) decision on the correct path in the trellis, and they have lots of similarities with a conventional hard decision Viterbi decoder—their complexity is double that of the Viterbi due to extraction of the soft output. The iterative Berrou SOVA decoder is able to achieve a relatively high speed: the constituent decoders can work at the same pace as their conventional Viterbi counterparts, and no back tracing is needed. The performance is competitive with the traditional decoding algorithms. In comparison with Max‐Log‐MAP, we have attained a slightly better performance.",
keywords = "soft output Viterbi algorithm, decoders",
author = "Risto Nordman",
year = "2003",
doi = "10.1002/ett.920",
language = "English",
volume = "14",
pages = "245--254",
journal = "European Transactions on Telecommunications",
issn = "1124-318X",
publisher = "Wiley-Blackwell",
number = "3",

}

Application of the Berrou SOVA algorithm in decoding of a turbo code. / Nordman, Risto (Corresponding Author).

In: European Transactions on Telecommunications, Vol. 14, No. 3, 2003, p. 245-254.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

T1 - Application of the Berrou SOVA algorithm in decoding of a turbo code

AU - Nordman, Risto

PY - 2003

Y1 - 2003

N2 - We present a turbo decoder that is based on a low complexity soft output Viterbi algorithm (SOVA) introduced by Claude Berrou et al. in ICC'93. It is conceptually different from the conventional turbo decoders, where the iteration is based on the a posteriori probabilities (APP). The constituent Berrou SOVA decoders make the maximum likelihood (ML) decision on the correct path in the trellis, and they have lots of similarities with a conventional hard decision Viterbi decoder—their complexity is double that of the Viterbi due to extraction of the soft output. The iterative Berrou SOVA decoder is able to achieve a relatively high speed: the constituent decoders can work at the same pace as their conventional Viterbi counterparts, and no back tracing is needed. The performance is competitive with the traditional decoding algorithms. In comparison with Max‐Log‐MAP, we have attained a slightly better performance.

AB - We present a turbo decoder that is based on a low complexity soft output Viterbi algorithm (SOVA) introduced by Claude Berrou et al. in ICC'93. It is conceptually different from the conventional turbo decoders, where the iteration is based on the a posteriori probabilities (APP). The constituent Berrou SOVA decoders make the maximum likelihood (ML) decision on the correct path in the trellis, and they have lots of similarities with a conventional hard decision Viterbi decoder—their complexity is double that of the Viterbi due to extraction of the soft output. The iterative Berrou SOVA decoder is able to achieve a relatively high speed: the constituent decoders can work at the same pace as their conventional Viterbi counterparts, and no back tracing is needed. The performance is competitive with the traditional decoding algorithms. In comparison with Max‐Log‐MAP, we have attained a slightly better performance.

KW - soft output Viterbi algorithm

KW - decoders

U2 - 10.1002/ett.920

DO - 10.1002/ett.920

M3 - Article

VL - 14

SP - 245

EP - 254

JO - European Transactions on Telecommunications

JF - European Transactions on Telecommunications

SN - 1124-318X

IS - 3

ER -