Decoding of the (47, 24, 11) Quadratic Residue Code with Hash Table

Author

Yan-Haw Chen ; Lui, Sai ; Huang, C.H. ; Chien, C.C.

Author_Institution

Dept. of Inf. Eng., I-Shou Univ., Kaohsiung, Taiwan

fYear

2010

fDate

10-12 Oct. 2010

Firstpage

346

Lastpage

351

Abstract

The key ideas behind this decoding technique are utilizing the shift search algorithm. Only those error patterns of weight less than 5 are necessary to be stored in the memory. By utilizing the hash search scheme for finding error pattern, the decrease of CPU time in decoding process is about 38% and the size of memory requirement is about 6% more than binary search scheme. Moreover, the new method could be utilized in real-time systems because of high speed and low memory requirement. It is readily adaptable suitable for use in automation link establish (ALE) system and Digital Signal Processing (DSP) systems.

Keywords

cryptography; decoding; digital signal processing chips; residue codes; search problems; CPU time; automation link establish system; binary search scheme; decoding process; digital signal processing system; error pattern; hash search; hash table; quadratic residue code; real-time system; shift search algorithm; Decoding; Generators; Indexes; Memory management; Polynomials; Search methods; Table lookup; DSP; binary search; decoding; quadratic residue code; shift search;

fLanguage

English

Publisher

ieee

Conference_Titel

Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC), 2010 International Conference on

Conference_Location

Huangshan

Print_ISBN

978-1-4244-8434-8

Electronic_ISBN

978-0-7695-4235-5

Type

conf

DOI

10.1109/CyberC.2010.101

Filename

5617096