Optimal and sub‐optimal maximum a posteriori algorithms suitable for turbo decoding

Publisher Website
Google Scholar
Abstract
For estimating the states or outputs of a Markov process, the symbol‐by‐symbol maximum a posteriori (MAP) algorithm is optimal. However, this algorithm, even in its recursive form, poses technical difficulties because of numerical representation problems, the necessity of non‐linear functions and a high number of additions and multiplications. MAP like algorithms operating in the logarithmic domain presented in the past solve the numerical problem and reduce the computational complexity, but are suboptimal especially at lowSNR(a common example is the Max‐Log‐MAP because of its use of the max function). A further simplification yields the soft‐output Viterbi algorithm (SOVA). In this paper, we present a Log‐MAP algorithm that avoids the approximations in the Max‐Log‐MAP algorithm and hence is equivalent to the true MAP, but without its major disadvantages. We compare the (Log‐)MAP, Max‐Log‐MAP and SOVA from a theoretical point of view to illuminate their commonalities and differences. As a practical example, we consider Turbo decoding, and we also demonstrate the practical suitability of the Log‐MAP by including quantization effects. The SOVA is, at 10−4, approximately 0.7 dB inferior to the (Log‐)MAP, the Max‐Log‐MAP lying roughly in between. The channel capacities of the three algorithms ‐when employed in a Turbo decoder‐ are evaluated numerically.

This publication has 8 references indexed in Scilit: