DocumentCode
2075188
Title
A connection between the Baum-Welch algorithm and turbo decoding
Author
Kim, Saejoon ; Wicker, Stephen B.
Author_Institution
Sch. of Electr. Eng., Cornell Univ., Ithaca, NY, USA
fYear
1998
fDate
22-26 Jun 1998
Firstpage
12
Lastpage
13
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 (1966, 1968, 1970) algorithm provide solutions to these problems, including solutions that duplicate the forward-backward and turbo decoding algorithms
Keywords
concatenated codes; decoding; hidden Markov models; parameter estimation; turbo codes; APP decoding; Baum-Welch algorithm; HMM; forward-backward decoding algorithm; nonstationary hidden Markov processes; parallel concatenated codes; parameter estimation; statistical analysis; turbo decoding; Decoding; Hidden Markov models; Inference algorithms; Iterative algorithms; Markov processes; Maximum likelihood estimation; Parameter estimation; Probability distribution; Random variables; Stochastic processes;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Workshop, 1998
Conference_Location
Killarney
Print_ISBN
0-7803-4408-1
Type
conf
DOI
10.1109/ITW.1998.706376
Filename
706376
Link To Document