By Topic

Application of multiple path sequential decoding for intersymbol interference reduction problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
D. Haccoun ; Dept. of Electr. & Comput. Eng., Ecole Polytech. de Montreal, Que., Canada ; S. Kallel

The application of the stack algorithm of sequential decoding and some of its multiple-path 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.<>

Published in:

IEE Proceedings I - Communications, Speech and Vision  (Volume:138 ,  Issue: 1 )