By Topic

Information Set Based Soft-Decoding Algorithm for 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

3 Author(s)
Glauber Gomes de Oliveira Brante ; Univ. Tecnol. Fed. do Parana UTFPR, Curitiba, Brazil ; Daiana Nascimento Muniz ; Walter Godoy

In this paper we introduce a new sub-optimum soft-decoding algorithm for block codes, based on information sets and erasures, which showed to be very efficient in terms of bit error rate and computational complexity when compared to optimum decoding methods. Our results show that the proposed algorithm performs very close to the maximum likelihood decoder, in terms of bit error rate, with a much lower computational complexity. In addition, we compared the proposed algorithm to a soft-decision Viterbi algorithm for block codes, showing that the proposed method is much less complex than Viterbi. For a given C(n,k) block code, the number of candidate codewords is reduced from 2n-k to k+1, in the worst case. A set of variants of the proposed IS algorithm is also presented, introducing an interesting trade-off between bit error rate performance and complexity.

Published in:

IEEE Latin America Transactions  (Volume:9 ,  Issue: 4 )