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

详细信息	查看全文 | 推荐本文 |

• 作者：Tsung-Ching Lin^a ; ^{joe@isu.edu.tw} ; Hung-Peng Lee^b ; ^{hpl@center.fotech.edu.tw} ; Hsin-Chiu Chang^a ; ^{d9403005@stmail.isu.edu.tw} ; Trieu-Kien Truong^a ; ^{truong@isu.edu.tw} ; Fellow ; IEEE
• 关键词：Quadratic residue code ; Compact lookup table ; Cyclic weight algorithm ; Syndrome decoder ; Error pattern
• 刊名：Information Sciences
• 出版年：2012
• 期刊代码：62_00200255
• 类别：cp
• 出版时间：15 August, 2012
• 卷：197
• 期：Complete
• 页码：215-222
• 文件大小：199 K

摘要

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.43 Kbytes. 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鈥檚 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.