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 (1989). The Viterbi algorithm (VA) is used to search for the best path through the reduced state trellis.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
