Paper Info
Title
High speed decoding of the binary (47,24,11) quadratic residue code
Abstract
An efficient table lookup decoding algorithm (TLDA) is presented to decode up to five possible errors in a binary systematic (47,24,11) quadratic residue (QR) code. The main idea of the TLDA is based on the weight of syndrome, the syndrome decoder together with a reduced-size lookup table (RSLT), and the shift-search method given by Reed et al. Thus, the size of the lookup table and computational complexity in a finite field can be significantly reduced. The memory size of the proposed condensed lookup table (CLT) consists of only 36.6Kbytes and is only about 0.24% of the full lookup table (FLT) and 3.2% of the lookup up table given by Chen et al., respectively. These facts lead to significant reduction of computational time and the decoding complexity. A simulation result shows that the decoding speed of the proposed TLDA is much faster than all existing decoding algorithms. Moreover, it can be extended to decode all QR codes, including the class of the cyclic codes when the code length is moderate. The CLT makes this new decoding algorithm suitable for hardware or firmware implementations.
Year
DOI
Venue
2010
10.1016/j.ins.2010.06.022
Inf. Sci.
Keywords
Field
DocType
qr code,decoding complexity,lookup table,existing decoding algorithm,decoding speed,reduced-size lookup table,quadratic residue code,proposed tlda,efficient table lookup,high speed,full lookup table,proposed condensed lookup table,cyclic code,information sciences,finite field,computational complexity,weight
Quadratic residue code,Lookup table,Discrete mathematics,Quadratic residue,Finite field,Sequential decoding,Computer science,Algorithm,Decoding methods,Computational complexity theory,Binary number
Journal
Volume
Issue
ISSN
180
20
0020-0255
Citations 
PageRank 
References 
4
0.47
11
Authors
5
Name
Order
Citations
PageRank
Tsung-Ching Lin17414.69
Hung-Peng Lee2305.14
Hsin-Chiu Chang3337.58
Shao-I Chu4389.36
Trieu-Kien Truong538259.00