By Topic

A fast algorithm for reduced complexity sequence estimation achieving the optimum error exponent

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 $13
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

1 Author(s)
K. Kratochwil ; Inst. of Comput. Technol., Wien Univ., Austria

A reduced complexity sequence estimator is presented which discards certain trellis paths based on their path metric and the minimum Euclidean distance in the trellis. An upper bound for the average number of retained paths is derived and the receiver is shown to achieve the optimum error exponent of the maximum likelihood sequence estimator. A fast implementation is proposed and simulation results are presented.

Published in:

IEEE Communications Letters  (Volume:3 ,  Issue: 7 )