Answers are grounded in this paper and cite their sources.
We extend the MAP decoding algorithm of Bahl et al. (1974) to the case of tail-biting trellis codes. An algorithm is given that is based on finding an eigenvector, and another that avoids this. Several examples are given. The algorithm has application to turbo decoding and source-controlled channel decoding.
No takes yet. Share an insight, caveat, or question.
Anderson et al. (1998) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: