DocumentCode :
2329315
Title :
A new decoder for binary quadratic residue code with irreducible generator polynomial
Author :
Jing, Ming-Haw ; Chang, Yaotsu ; Chen, Jian-Hong ; Chen, Zih-Heng ; Chang, Jia-Hao
Author_Institution :
Dept. of Inf. Eng., I-Shou Univ., Kaohsiung
fYear :
2008
fDate :
Nov. 30 2008-Dec. 3 2008
Firstpage :
1518
Lastpage :
1521
Abstract :
The binary quadratic residue (QR) codes have nice distance property, but they are difficult to decode for the insufficient consecutive syndromes. The author used the Lagrange interpolation formula to calculate the needed primary unknown syndrome for the binary QR code. In this paper, we propose an efficient hardware architecture to implement this method, and decode the binary QR code by using the well-developed Berlekamp-Massey algorithm and Chien search.
Keywords :
algebraic codes; binary codes; decoding; interpolation; polynomials; residue codes; Berlekamp-Massey algorithm; Chien search; Lagrange interpolation formula; binary quadratic residue code; decoder hardware architecture; irreducible generator polynomial; primary unknown syndrome; Circuits; Decoding; Equations; Error correction; Error correction codes; Hardware; Interpolation; Lagrangian functions; Mathematics; Polynomials;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Circuits and Systems, 2008. APCCAS 2008. IEEE Asia Pacific Conference on
Conference_Location :
Macao
Print_ISBN :
978-1-4244-2341-5
Electronic_ISBN :
978-1-4244-2342-2
Type :
conf
DOI :
10.1109/APCCAS.2008.4746321
Filename :
4746321
Link To Document :
بازگشت