Referenced Items are not available for this document.
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
- Page(s):
- 1788 - 1792 Vol.2
- Print ISBN:
- 0-7803-8104-1
- INSPEC Accession Number:
- 8547944
- Digital Object Identifier :
- 10.1109/ACSSC.2003.1292291
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
