## Optimal and Sub-Optimal Maximum A Posteriori Algorithms Suitable for Turbo Decoding (1997)

Venue: | ETT |

Citations: | 129 - 25 self |

### BibTeX

@ARTICLE{Robertson97optimaland,

author = {Patrick Robertson and Peter Hoeher and Emmanuelle Villebrun},

title = {Optimal and Sub-Optimal Maximum A Posteriori Algorithms Suitable for Turbo Decoding},

journal = {ETT},

year = {1997},

volume = {8},

pages = {119--125}

}

### Years of Citing Articles

### OpenURL

### 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 low SNR (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 forming the basis for simulations, we consider Turbo decoding, where recursive systematic convolutional component codes are decoded with the three algorithms, and we also demonstrate the practical suitability of the Log-MAP by including quantization effects. The SOVA is, at 10

### Citations

1421 | Near Shannon limit error-correcting coding and decoding
- Berrou, Glavieux, et al.
- 1993
(Show Context)
Citation Context ...vely in the logarithmic domain; values and operations (addition and max-function) are easier to handle. However, both algorithms are suboptimal at low signal-to-noise ratios, where we use Turbo-Codes =-=[6, 7, 8, 9]-=-, for example. In this paper, we will modify the Max-Log-MAP algorithm through the use of a simple correction function at each max-operation [9, 10]. This algorithm, to be called Log-MAP algorithm, is... |

1290 |
Optimal decoding of linear codes for minimizing symbol error rate
- Bahl, Cocke, et al.
- 1974
(Show Context)
Citation Context ...ons. The Bahl-Jelinek algorithm, also known as the symbol-bysymbol MAP algorithm (MAP algorithm for short), is optimal for estimating the states or outputs of a Markov process observed in white noise =-=[1]-=-. However, this algorithm is perhaps too difficult in practice, basically because of the numerical representation of probabilities, non-linear functions and because of mixed multiplications and additi... |

806 | The Viterbi algorithm
- Forney
- 1973
(Show Context)
Citation Context ...mma1 ) is either one or zero depending on whether bit i is associated with the transition from state S k\Gamma1 to S k or not. It is in the last component that we use a priori information for bit d k =-=[11]-=-: In our case of no parallel transitions, PrfS k jS k\Gamma1 g = Prfd k = 1g if q (d k = 1jS k ; S k\Gamma1 ) = 1; and PrfS k jS k\Gamma1 g= Prfd k = 0g if q (d k = 0jS k ; S k\Gamma1 ) = 1. 2.3 The M... |

274 |
A comparison of optimal and sub-optimal map decoding algorithms operating in the log domain
- Robertson, Villebrun, et al.
- 1995
(Show Context)
Citation Context ...gnal-to-noise ratios, where we use Turbo-Codes [6, 7, 8, 9], for example. In this paper, we will modify the Max-Log-MAP algorithm through the use of a simple correction function at each max-operation =-=[9, 10]-=-. This algorithm, to be called Log-MAP algorithm, is equivalent to the MAP algorithm in terms of performance, but without its problems of implementation. The correction needs just an additional one-di... |

259 |
A Viterbi algorithm with soft-decision outputs and its applications
- Hagenauer, Hoeher
- 1989
(Show Context)
Citation Context ..., non-linear functions and because of mixed multiplications and additions of these values. Some approximations of the MAP algorithm have been derived, such as the soft-output Viterbi algorithm (SOVA) =-=[2]-=- and the Max-Log-MAP algorithm [3, 4, 5]. In both algorithms, processing is exclusively in the logarithmic domain; values and operations (addition and max-function) are easier to handle. However, both... |

74 |
Illuminating the structure of code and decoder of parallel concatenated recursive systematic (turbo) codes
- Robertson
- 1994
(Show Context)
Citation Context ...vely in the logarithmic domain; values and operations (addition and max-function) are easier to handle. However, both algorithms are suboptimal at low signal-to-noise ratios, where we use Turbo-Codes =-=[6, 7, 8, 9]-=-, for example. In this paper, we will modify the Max-Log-MAP algorithm through the use of a simple correction function at each max-operation [9, 10]. This algorithm, to be called Log-MAP algorithm, is... |

37 |
Optimum and sub-optimum detection of coded data disturbed by time-varying inter-symbol interference
- Koch, Baier
- 1990
(Show Context)
Citation Context ... of mixed multiplications and additions of these values. Some approximations of the MAP algorithm have been derived, such as the soft-output Viterbi algorithm (SOVA) [2] and the Max-Log-MAP algorithm =-=[3, 4, 5]-=-. In both algorithms, processing is exclusively in the logarithmic domain; values and operations (addition and max-function) are easier to handle. However, both algorithms are suboptimal at low signal... |

22 |
Reduced complexity symbol detectors with parallel structures for ISI channels
- Erfanian, Pasupathy, et al.
- 1994
(Show Context)
Citation Context ... of mixed multiplications and additions of these values. Some approximations of the MAP algorithm have been derived, such as the soft-output Viterbi algorithm (SOVA) [2] and the Max-Log-MAP algorithm =-=[3, 4, 5]-=-. In both algorithms, processing is exclusively in the logarithmic domain; values and operations (addition and max-function) are easier to handle. However, both algorithms are suboptimal at low signal... |

5 |
Optimal subblock-by-subblock detection
- Hoeher
- 1995
(Show Context)
Citation Context ...d encoder and inner channel, the channel capacity of the outer channel, which is equal to or less than the channel capacity of the inner channel, is a performance index for the quality of the decoder =-=[12]-=-. In the following, we assume the encoder consists of a Turbo--Code with two rate 1/2 component codes with memory M = 4 each. The component codes are separated by a random interleaver of length N = 10... |

4 |
Implementierungsaspekte zur Symbol-by-Symbol MAP Decodierung von Faltungscodes
- Petersen
- 1994
(Show Context)
Citation Context ... of mixed multiplications and additions of these values. Some approximations of the MAP algorithm have been derived, such as the soft-output Viterbi algorithm (SOVA) [2] and the Max-Log-MAP algorithm =-=[3, 4, 5]-=-. In both algorithms, processing is exclusively in the logarithmic domain; values and operations (addition and max-function) are easier to handle. However, both algorithms are suboptimal at low signal... |

4 |
Iterative ("TURBO") decoding of systematic convolutional codes with the MAP and SOVA algorithms
- Hagenauer, Robertson, et al.
- 1994
(Show Context)
Citation Context ...vely in the logarithmic domain; values and operations (addition and max-function) are easier to handle. However, both algorithms are suboptimal at low signal-to-noise ratios, where we use Turbo-Codes =-=[6, 7, 8, 9]-=-, for example. In this paper, we will modify the Max-Log-MAP algorithm through the use of a simple correction function at each max-operation [9, 10]. This algorithm, to be called Log-MAP algorithm, is... |

1 |
Turbo-decoding with close-to-optimal MAP algorithms." Diploma thesis
- Villebrun
- 1994
(Show Context)
Citation Context |