MAP decoding in channels with memory |
| |
Authors: | Turin W |
| |
Affiliation: | Dept. of Commun. Res., AT&T Labs.-Res., Florham Park, NJ; |
| |
Abstract: | The expectation-maximization (EM) algorithm is popular in estimating the parameters of various statistical models. We consider applications of the EM algorithm to the maximum a posteriori (MAP) sequence decoding assuming that sources and channels are described by hidden Markov models (HMMs). The HMMs can accurately approximate a large variety of communication channels with memory and, in particular, wireless fading channels with noise. The direct maximization of the a posteriori probability (APP) is too complex. The EM algorithm allows us to obtain the MAP sequence estimation iteratively. Since each step of the EM algorithm increases the APP, the algorithm can improve the performance of any decoding procedure |
| |
Keywords: | |
|
|