An efficient decoding algorithm for block turbo codes

doi:10.1109/26.898249

Return

An efficient decoding algorithm for block turbo codes

2001-01-01

PRE

Jung-Hwan Kim

DOI：10.1109/26.898249

Original

Original request for help

Save

Abstract

En 中文

In this paper an efficient soft-input soft-output iterative decoding algorithm for block turbo codes (BTCs) is proposed. The proposed algorithm utilizes Kaneko's decoding algorithm for soft-input hard-output decoding. These hard outputs are converted to soft-decisions using reliability calculations. Three different schemes for reliability calculations incorporating different levels of approximation are suggested, The algorithm proposed here presents a major advantage over existing decoding algorithms for BTCs by providing ample flexibility in terms of performance-complexity tradeoff. This makes the algorithm well suited for wireless multimedia applications, The algorithm can be used for optimal as well as suboptimal decoding, The suboptimal versions of the algorithm can be developed by changing a single parameter (the number of error patterns to be generated). For any performance, the computational complexity of the proposed algorithm is less than the computational complexity of similar existing algorithms, Simulation results for the decoding algorithm for different two-dimensional BTCs over an additive white Gaussian noise channel are shown. A performance comparison of the proposed algorithm with similar existing algorithms is also presented.

Keywords:

iterative decoding

Kaneko's algorithm

reliability calculation

turbo codes

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.