Name
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.ins.2012.02.020 | Inf. Sci. |
Keywords | Field | DocType |
cyclic weight algorithm,decoding complexity,lookup table,decoding speed,cw decoding algorithm,novel table lookup,decoding algorithm,quadratic residue code,new algorithm,previous table lookup method,proposed lookup table,proposed algorithm,information sciences | Quadratic residue code,Discrete mathematics,Lookup table,Quadratic residue,Sequential decoding,Berlekamp–Welch algorithm,Computer science,CPU time,Algorithm,Decoding methods,List decoding | Journal |
Volume | ISSN | Citations |
197, | 0020-0255 | 1 |
PageRank | References | Authors |
0.38 | 8 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tsung-Ching Lin | 1 | 74 | 14.69 |
| Hung-Peng Lee | 2 | 30 | 5.14 |
| Hsin-Chiu Chang | 3 | 33 | 7.58 |
| Trieu-Kien Truong | 4 | 382 | 59.00 |