By Topic

Reduced search soft-decision minimum-distance decoding for binary 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 $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)
M. A. El-Agamy ; University of Kent, Electronics Laboratories, Canterbury, UK ; E. Munday

A reduced search soft-decision decoding algorithm for binary block codes is presented. It is based on the weight distribution of the code and the transition probabilities of a binary input Q-ary output channel in sequencing the codeword classes during a table look-up operation. An upper bound is presented for the decoding time improvement factor of the reduced search algorithm compared to exhaustive table look-up decoding.

Published in:

Communications, Radar and Signal Processing, IEE Proceedings F  (Volume:133 ,  Issue: 1 )