By Topic

Generalized minimum distance decoding algorithms for Qary output channels (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)
Yu, C.C.H. ; Department of Electrical Engineering, Illinois Institute of Technology, Chicago, IL, USA ; Costello, D.J., Jr.

A new condition for a generalized minimum distance decoder to guarantee correct decoding is developed. Based on this condition, decoding algorithms for block codes, product codes, and completely orthogonalizable codes onQary output channels are presented. The results of computer simulations comparing the performance of these decoding algorithms with several other soft-decision decoding algorithma are also presented.

Published in:

Information Theory, IEEE Transactions on  (Volume:26 ,  Issue: 2 )