By Topic

Optimal threshold sequential decoding algorithms for 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

3 Author(s)
Chen Jun ; Nat. Key Lab. of ISN, Xidian Univ., Xi'an, China ; Sun Rong ; Wang Xinmei

Optimal threshold sequential decoding algorithms for binary linear block codes which combine the sequential decoding with the threshold decoding are presented. They use the stack algorithm to search through the trellis of the block codes for a path which has the optimal value of the Fano metric function. When a new candidate codeword is found, an optimality check is performed on it by using the Fano-optimal threshold. If checked successfully, the candidate codeword is the most likely (ML) codeword and the search stops. Otherwise the search process continues until either an optimal path is found, which also represents the ML codeword, or the memory buffer of the decoder overflows, in which case the hard decision word is output. Simulation results show that compared with the decoding algorithms available, the proposed decoding algorithms significantly reduce the decoding complexity without losing the decoding performance

Published in:

Vehicular Technology Conference Proceedings, 2000. VTC 2000-Spring Tokyo. 2000 IEEE 51st  (Volume:1 )

Date of Conference: