A Viterbi algorithm with soft-decision outputs and its applications

Hagenauer, J.; Hoeher, Peter Adam

doi:10.1109/glocom.1989.64230

Cited by 1,096 publications

(447 citation statements)

References 9 publications

Supporting

Mentioning

437

Contrasting

Unclassified

Order By: Relevance

“…1 can be viewed as employing a serially concatenated convolutional code (turbo code), where the inner code is taken over the reals (by means of the ISI channel), and further developed in a number of articles, including [27]- [30]. In some of these systems, MAP-based techniques, as well as a Viterbi algorithm producing soft output information [31], were used for both equalization and decoding [2], [27]. The more complex BCJR algorithm [7] was implemented in [27].…”

Section: Turbo Equalization Overviewmentioning

confidence: 99%

Turbo Equalization: An Overview

Tüchler

Singer

2011

IEEE Trans. Inform. Theory

175

160

View full text Add to dashboard Cite

Abstract-Turbo codes and the iterative algorithm for decoding them sparked a new era in the theory and practice of error control codes. Turbo equalization followed as a natural extension to this development, as an iterative technique for detection and decoding of data that has been both protected with forward error correction and transmitted over a channel with intersymbol interference (ISI). In this paper, we review the turbo equalization approach to coded data transmission over ISI channels, with an emphasis on the basic ideas, some of the practical details, and many of the research directions that have arisen from this offshoot, introduced by Douillard, et al. of the original turbo decoding algorithm. The subsequent relaxation of the maximum a posteriori (MAP) equalization algorithm to include linear and other simpler receivers sparked a decade and a half of research into iterative algorithms, spanning research problems ranging from trellis coded modulation to underwater acoustic communications.Index Terms-Equalization, iterative decoding, minimum mean square error, turbo equalization.

show abstract

Section: Turbo Equalization Overviewmentioning

confidence: 99%

Turbo Equalization: An Overview

Tüchler

Singer

2011

IEEE Trans. Inform. Theory

175

160

View full text Add to dashboard Cite

show abstract

“…In this section, we discuss an example of turbo decoding using the SOVA algorithm [9], [19] detailed in Section VI. This example serves to illustrate the details of the SOVA algorithm and the iterative decoding of turbo codes discussed in Section IV.…”

Section: Turbo Decoding Examplementioning

confidence: 99%

“…This means that as well as providing the decoded output bit sequence, the component decoders must also give the associated probabilities for each bit that it has been correctly decoded. Two 0018-9545/00$10.00 © 2000 IEEE suitable decoders are the so-called SOVA proposed by Hagenauer and Hoeher [19] and the MAP [6] algorithm of Bahl et al which are described in Sections VI and III, respectively.…”

Section: Iterative Decoder Structurementioning

confidence: 99%

“…In this section, we describe a variation of the Viterbi algorithm, referred to as the SOVA [9], [19]. This algorithm has two modifications over the classical Viterbi algorithm which allow it to be used as a component decoder for turbo codes.…”

Section: A Mathematical Description Of the Sova Algorithmmentioning

confidence: 99%

“…In the forthcoming section, we first describe two related algorithms, the Max-Log-MAP [25], [26] and the Log-MAP [7], which are derived from the MAP algorithm, and then another, referred to as the SOVA [8], [9], [19], derived from the Viterbi algorithm.…”

Section: B Iterative Turbo Decodingmentioning

confidence: 99%

See 2 more Smart Citations

Comparative study of turbo decoding techniques: an overview

Woodard

Hanzo

2000

IEEE Trans. Veh. Technol.

258

140

View full text Add to dashboard Cite

Abstract-In this contribution, we provide an overview of the novel class of channel codes referred to as turbo codes, which have been shown to be capable of performing close to the Shannon Limit. We commence with a brief discussion on turbo encoding, and then move on to describing the form of the iterative decoder most commonly used to decode turbo codes. We then elaborate on various decoding algorithms that can be used in an iterative decoder, and give an example of the operation of such a decoder using the so-called Soft Output Viterbi Algorithm (SOVA). Lastly, the effect of a range of system parameters is investigated in a systematic fashion, in order to gauge their performance ramifications.

show abstract

The Art of Error Correcting Coding

Morelos-Zaragoza¹

2002

232

View full text Add to dashboard Cite

A Viterbi algorithm with soft-decision outputs and its applications

Cited by 1,096 publications

References 9 publications

Turbo Equalization: An Overview

Turbo Equalization: An Overview

Comparative study of turbo decoding techniques: an overview

The Art of Error Correcting Coding

Contact Info

Product

Resources

About