Turbo decoding as an instance of expectation maximization algorithm

Citations

WEB OF SCIENCE

0
Citations

SCOPUS

0

초록

The Baum-Welch algorithm is a technique for the maximum likelihood parameter estimation of probabilistic functions of Markov processes. We apply this technique to nonstationary Markov processes and explore a relationship between the Baum-Welch algorithm and the BCJR algorithm. Furthermore, we apply the Baum-Welch algorithm to two nonstationary Markov processes and obtain the turbo decoding algorithm.

키워드

PROBABILISTIC FUNCTIONSMARKOV CHAINS
제목
Turbo decoding as an instance of expectation maximization algorithm
저자
Kim, Saejoon
발행일
2006
유형
Article; Proceedings Paper
저널명
Lecture Notes in Computer Science
4232
페이지
371 ~ 378