Reduced-Complexity Iterative Maximum-Likelihood Sequence Estimation on Channels with Memory
- 24 August 2005
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Existing maximum-likelihood sequence estimation (MLSE) schemes for channels with memory, resulting in intersymbol interference (ISI), have typically been implemented using the viterbi algorithm (VA). For memoryless modulation schemes the resulting search complexity is O(M/sup L/), where M is the alphabet size and L is the length of the ISI span in channel signaling intervals. This complexity renders the VA impractical for large M and/or L. In this paper we describe the structure and properties of a novel reduced-complexity iterative MLSE scheme based upon the expectation-maximization (EM) algorithm. This reduced-complexity iterative MLSE scheme is shown to have complexity O(LM) at each iteration. The approach provides an attractive alternative to the VA for large signaling alphabets and/or ISI span.Keywords
This publication has 4 references indexed in Scilit:
- Use of the mean-field approximation in an EM-based approach to unsupervised stochastic model-based image segmentationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Digital Image RestorationSpringer Series in Information Sciences, 1991
- Parameter estimation of superimposed signals using the EM algorithmIEEE Transactions on Acoustics, Speech, and Signal Processing, 1988
- The role of likelihood and entropy in incomplete-data problems: Applications to estimating point-process intensities and toeplitz constrained covariancesProceedings of the IEEE, 1987