By Topic

Simplified correlation decoding by selecting possible codewords using erasure information (Corresp.)

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

2 Author(s)

Correlation decoding is an optimal scheme of soft-decision decoding for error-correcting codes in the sense of minimum block-error probability. However, it is very difficult to apply the scheme when the number of information digits is large because of decoding complexity. A new algorithm for soft-decision decoding is presented, simplifying the correlation scheme by selecting certain codewords and decreasing decoding complexity by using erasure information. Any desired block-error probability between the error Probabilities of correlation and hard-decision decoding can be realized by setting up a suitable threshold value 0 for erasure decision. Computer simulation has been performed for Golay(23,12,7)code and BCH(15,7,5)code.

Published in:

Information Theory, IEEE Transactions on  (Volume:29 ,  Issue: 5 )