DMCA
An Intuitive Justification and a Simplified Implementation of the MAP Decoder for Convolutional Codes
BibTeX
@MISC{An_anintuitive,
author = {Abstract An},
title = {An Intuitive Justification and a Simplified Implementation of the MAP Decoder for Convolutional Codes},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
intuitive shortcut to understanding the maximum a posteriori (MAP) decoder is presented based on an approximation. This is shown to correspond to a dual-maxima computation combined with forward and backward recursions of Viterbi algorithm computations. The logarithmic version of the MAP algorithm can similarly be reduced to the same form by applying the same approximation. Conversely, if a correction term is added to the approximation, the exact MAP algorithm is recovered. It is also shown how the MAP decoder memory can be drastically reduced at the cost of a modest increase in processing speed. Index Terms—Dual-maxima, MAP decoder, soft-decision metric, Viterbi algorithm.
Keyphrases
map decoder intuitive justification simplified implementation convolutional code viterbi algorithm computation modest increase intuitive shortcut dual-maxima computation correction term exact map algorithm viterbi algorithm index term dual-maxima logarithmic version map decoder memory map algorithm backward recursion
