By Topic

A new treatment of priority-first search maximum-likelihood soft-decision decoding of linear block codes

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)
Y. S. Han ; Dept. of Comput. Sci. & Inf. Eng., Nat. Chi Nan Univ., Taiwan

In this correspondence we present a new method to convert the maximum-likelihood soft-decision decoding problem for linear block codes into a graph search problem where the generalized Dijkstra's algorithm can still be applied to the decoding procedure. The cost assigned to every branch in the graph is based on a generalization of the Wagner rule which is an equivalent form of the maximum-likelihood decoding rule. The new decoding algorithm uses the properties of error patterns to reduce the search space

Published in:

IEEE Transactions on Information Theory  (Volume:44 ,  Issue: 7 )