A fast algorithm for reduced complexity sequence estimation achieving the optimum error exponent

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.