ScholarLens Back to search
2002•Unpublished venueRequires access

Comprehensive comparison of turbo-code decoders

Peter Jung, M. Naßhan

Open publisher page 23 citations

Abstract

The decoding of turbo-codes (a novel class of binary parallel concatenated recursive systematic convolutional codes) relies on the application of soft input/soft output decoders. Such decoders can be realized either using maximum-a-posteriori (MAP) symbol estimators or MAP sequence estimators, e.g. the a-priori soft output Viterbi algorithm (APRI-SOVA). The structure of turbo-codes encoders as well as decoders is described. In particular, four different decoder structures suitable for decoding turbo-codes are illustratively described and their error rate performance capabilites compared in both AWGN as well as flat Rayleigh fading channels based on extensive simulation results.

About this research paper

What this paper is about

The decoding of turbo-codes (a novel class of binary parallel concatenated recursive systematic convolutional codes) relies on the application of soft input/soft output decoders. Such decoders can be realized either using maximum-a-posteriori (MAP) symbol estimators or MAP sequence estimators, e.g. the a-priori soft output Viterbi algorithm (APRI-SOVA). The structure of turbo-codes encoders as well as decoders is described. In particular, four different decoder structures suitable for decoding turbo-codes are illustratively described and their error rate performance capabilites compared in both AWGN as well as flat Rayleigh fading channels based on extensive simulation results.

Why it matters

OpenAlex reports 23 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The decoding of turbo-codes (a novel class of binary parallel concatenated recursive systematic convolutional codes) relies on the application of soft input/soft output decoders. Such decoders can be realized either using maximum-a-posteriori (MAP) symbol estimators or MAP sequence estimators, e.g. the a-priori soft output Viterbi algorithm (APRI-SOVA). The structure of turbo-codes encoders as well as decoders is described. In particular, four different decoder structures suitable for decoding turbo-codes are illustratively described and their error rate performance capabilites compared in both AWGN as well as flat Rayleigh fading channels based on extensive simulation results.

Key concepts: Convolutional code, Turbo code, Turbo equalizer, Serial concatenated convolutional codes, Viterbi decoder, Computer science, Algorithm, Concatenated error correction code

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Comprehensive comparison of turbo-code decoders — Research Paper | ScholarLens