A cyclic weight algorithm of decoding the (47,24,11) quadratic residue code

Authors:
Tsung-Ching Lin;Hung-Peng Lee;Hsin-Chiu Chang;Trieu-Kien Truong
Affiliations:
Dept. of Information Engineering, I-Shou University, Kaohsiung City 840, Taiwan, ROC;Dept. of Information Science and Information Engineering, Fortune Institute of Technology, Kaohsiung City 831, Taiwan, ROC;Dept. of Information Engineering, I-Shou University, Kaohsiung City 840, Taiwan, ROC;Dept. of Information Engineering, I-Shou University, Kaohsiung City 840, Taiwan, ROC
Venue:
Information Sciences: an International Journal
Year:
2012

Citing 6
Cited 1

Algebraic decoding of the (23,12,7) Golay code

IEEE Transactions on Information Theory
Error control systems for digital communication and storage

Error control systems for digital communication and storage
A Lookup Table Decoding of systematic (47,24,11) quadratic residue code

Information Sciences: an International Journal
Algebraic decoding of the (41, 21, 9) Quadratic Residue code

Information Sciences: an International Journal
Decoding the (47,24,11) quadratic residue code using bit-error probability estimates

IEEE Transactions on Communications
Decoding the (47,24,11) quadratic residue code

IEEE Transactions on Information Theory

Efficient decoding of the (23, 12, 7) Golay code up to five errors

Information Sciences: an International Journal

Quantified Score

Hi-index	0.07

Visualization

Abstract

In this article, a novel table lookup decoding algorithm, called the cyclic weight (CW) decoding algorithm, is developed to facilitate faster decoding of the binary systematic (47,24,11) quadratic residue (QR) code. It is based on the property of cyclic codes together with the weight of syndromes. This new algorithm requires a lookup table which consists of 20.43Kbytes. The advantage of the CW decoding algorithm over the previous table lookup method is that the memory size of the proposed lookup table is only about 1.89% of the lookup table needed in the decoding algorithm of Chen's et al. These facts lead to significantly reduce the decoding complexity in terms of CPU time while maintaining the capability to correct up to five errors. Simulation results show that the decoding speed of the proposed algorithm is much faster than that of the algorithm of Chen et al.