Computational savings and implementation of maximum likelihood detectors (Corresp.)

A further analysis of maximum likelihood sequence estimation algorithms for Gaussian channels with finite intersymbol interference is presented. It is shown that several maximum likelihood survivor paths cannot occur simultaneously, and hence that searching some of the nodes of the state trellis diagram can be avoided. An efficient algorithm is given that updates the metrics while avoiding redundant parts of the search.