The expectation-maximization algorithm for symbol unsynchronized sequence detection
暂无分享,去创建一个
The expectation-maximization (EM) algorithm for maximizing likelihood functions, combined with the Viterbi algorithm, is applied to the problem of sequence detection when symbol timing information is not present. Although the EM algorithm is noncausal, results obtained using the algorithm on the problem of nonsynchronized sequence detection indicate that it converges most of the time in three iterations, making it both of theoretical and of practical interest. A practical algorithm based on the EM algorithm is introduced. It reduces the computational burden and improves performance by making use of timing estimates in previous observation windows. >
[1] D. Rubin,et al. Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .
[2] New York Dover,et al. ON THE CONVERGENCE PROPERTIES OF THE EM ALGORITHM , 1983 .
[3] Costas N. Georghiades. Optimum delay and sequence estimation from incomplete data , 1990, IEEE Trans. Inf. Theory.