Abstract
The application of the stack algorithm of sequential decoding and some of its multiplepath variants to the ISI problem, especially over long memory channels are presented. The proper metric to use is analysed and computer simulation with channels having memory lengths up to nine symbols show that the achieved error performances fall within the theoretical upper and lower bounds of an optimal decoder at only a small fraction of the computational effort of an optimal decoder. As for the computational variability, it can be totally circumvented by simultaneously extending a sufficient number of paths. Finally with a simplified multiple path sequential decoder, all the drawbacks of sequential decoding may be avoided at a cost of a very slight error performance degradation.
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 callMore From: IEE Proceedings I Communications, Speech and Vision
Disclaimer: 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.
