An exploration of the relationship between the Baum-Welch algorithm and turbo decoding

Abstract

It is shown that the problem of APP decoding of single and parallel concatenated codes can be recast in terms of parameter estimation for one or more nonstationary hidden Markov processes. It is then shown that simple extensions of the Baum-Welch algorithm provide solutions to these problems, including solutions that provide channel-matching turbo decoding algorithms.