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

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.