Abstract
A reduced-state sequence estimator for linear dispersive channels is described. The estimator is based on partitioning the set of all possible channel states in a way that defines a trellis with fewer states, and thus reduces complexity. Such a set partitioning approach provides a good performance/complexity tradeoff. The new technique is a generalisation of that described by Duel-Hallen and Heegard . The Viterbi algorithm (VA) is used to search for the best path through the reduced state trellis.

This publication has 0 references indexed in Scilit: