By Topic

An optimal two-stage decoding algorithm 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
$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)
Wu, X. ; Dept. of ECE, Michigan Technol. Univ., Houghton, MI, USA ; Sadjadpour, H.R.

A new optimal two stages decoding algorithm for linear block codes is presented. At first stage, the minimum sufficient test set Sˆ is estimated. With the minimum sufficient test set, decoding complexity can be greatly reduced while maintaining the optimal performance. At the second stage, ordered processing is performed over the estimated minimum sufficient test set Sˆ to find the optimal solution. Ordered processing helps to find the optimal solution quickly and in the meanwhile enables complexity-reduced suboptimal solution with bounded block error rate. Simulation result shows that this algorithm achieves the optimal performance with low average computational complexity.

Published in:

Signals, Systems and Computers, 2004. Conference Record of the Thirty-Seventh Asilomar Conference on  (Volume:2 )

Date of Conference:

9-12 Nov. 2003