In this paper, a new decoding algorithm, called modified reduced lookup table decoding (MRLTD) algorithm, is proposed for decoding [47, 24, 11] quadratic residue (QR) code which needs lower memory requirement compared with the algorithm based on the full lookup table and the cyclic weight decoding algorithm (CWDA). Although the memory requirements (space complexity) of the proposed algorithm are the same with a newly optimized cyclic weight (OCW) decoding algorithm, the proposed MRLTD algorithm is faster, i.e. the running-time complexity of the proposed algorithm is lower than OCW algorithm. The idea behind this decoding technique is based on the existence of a one-to-one relation between the syndromes and correctable error patterns, reported in a lookup table containing 300 syndromes which are searched by a binary search algorithm. Moreover, by a bit modification on MRLTD algorithm, it can be applied to decode effectively the extended [47, 24, 11] QR code, i.e. [48, 24, 12] QR code, applicable for correcting five errors and detecting six errors.
展开▼
