2002Unpublished venueRequires access

Threshold decoding of turbo-codes

Y.V. Svirid, S. Riedel

Open publisher page 19 citations

Abstract

The idea of iterative decoding of two-dimensional systematic convolutional codes-so-called turbo-codes-is extended to threshold decoding, which is presented in "soft-in/soft-out" form. The computational complexity of the proposed decoder is very low. Surprisingly good simulation results are shown for the Gaussian channel.

About this research paper

What this paper is about

The idea of iterative decoding of two-dimensional systematic convolutional codes-so-called turbo-codes-is extended to threshold decoding, which is presented in "soft-in/soft-out" form. The computational complexity of the proposed decoder is very low. Surprisingly good simulation results are shown for the Gaussian channel.

Why it matters

OpenAlex reports 19 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 idea of iterative decoding of two-dimensional systematic convolutional codes-so-called turbo-codes-is extended to threshold decoding, which is presented in "soft-in/soft-out" form. The computational complexity of the proposed decoder is very low. Surprisingly good simulation results are shown for the Gaussian channel.

Key concepts: Serial concatenated convolutional codes, Turbo code, Convolutional code, Sequential decoding, Computer science, Decoding methods, Turbo equalizer, Concatenated error correction code

Related papers

Back to paper searchBrowse research topicsOriginal source
Threshold decoding of turbo-codes — Research Paper | ScholarLens