Title :
A fast algorithm for reduced complexity sequence estimation achieving the optimum error exponent
Author :
Kratochwil, Konrad
Author_Institution :
Inst. of Comput. Technol., Wien Univ., Austria
fDate :
7/1/1999 12:00:00 AM
Abstract :
A reduced complexity sequence estimator is presented which discards certain trellis paths based on their path metric and the minimum Euclidean distance in the trellis. An upper bound for the average number of retained paths is derived and the receiver is shown to achieve the optimum error exponent of the maximum likelihood sequence estimator. A fast implementation is proposed and simulation results are presented.
Keywords :
computational complexity; error analysis; intersymbol interference; maximum likelihood sequence estimation; telecommunication channels; ISI channels; average retained paths; computational complexity; fast algorithm; fast implementation; maximum likelihood sequence estimator; minimum Euclidean distance; optimum error exponent; path metric; receiver; reduced complexity sequence estimation; simulation results; trellis paths; upper bound; Delay estimation; Error correction; Estimation error; Euclidean distance; Intersymbol interference; Maximum likelihood estimation; Nearest neighbor searches; State estimation; Upper bound; Viterbi algorithm;
Journal_Title :
Communications Letters, IEEE
DOI :
10.1109/4234.775258
