DocumentCode :
2700435
Title :
Efficient Decoding of Systematic (41, 21, 9) Quadratic Residue Code
Author :
Chen, Y.H. ; Lee, C.-D. ; Chien, C.H. ; Tai, S.H.
Author_Institution :
Dept. of Inf. Eng., I-Shou Univ., Kaohsiung
fYear :
2008
fDate :
9-12 Dec. 2008
Firstpage :
128
Lastpage :
133
Abstract :
A new effective lookup table for decoding the binary systematic (41, 21, 9) quadratic residue (QR) code up to 4 errors is presented in this paper. The key ideas behind this decoding technique are based on one to one mapping between the syndromes ldquoS1rdquo and the error correctable patterns. Such an algorithm determines the error locations directly by lookup tables without the operations of multiplication over a finite field. Moreover, the methods to dramatically reduce the memory requirement are given. The new algorithm has been verified through a software simulation by C language. The new approach is modular, regular and naturally suitable for SOC software implementation.
Keywords :
decoding; error correction codes; residue codes; table lookup; C language; SoC software; binary systematic quadratic residue code; decoding technique; efficient decoding; error correctable patterns; finite field; lookup table; memory requirement; multiplication; software simulation; Communication industry; Computer errors; Computer industry; Conference management; Decoding; Error correction; Galois fields; Microprogramming; Software algorithms; Table lookup; Error Pattern; Finite Field; Quadratic Residue; SOC; Syndrome;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Asia-Pacific Services Computing Conference, 2008. APSCC '08. IEEE
Conference_Location :
Yilan
Print_ISBN :
978-0-7695-3473-2
Electronic_ISBN :
978-0-7695-3473-2
Type :
conf
DOI :
10.1109/APSCC.2008.49
Filename :
4780664
Link To Document :
بازگشت