Using Hash Table for the (71, 36, 11) Quadratic Residue Code

碩士 === 義守大學 === 資訊工程學系 === 102 === An efficient hash table algorithm for the binary systematic the decoding of the (71,36,11) Quadratic Residue Code (QR Code) is presented in this Thesis. The key idea of decoding technique is based on one-to-one mapping between the syndromes and error patterns. By l...

Full description

Bibliographic Details
Main Authors: Yong-Long Huang, 黃永隆
Other Authors: Yan-Haw Chen
Format: Others
Language:zh-TW
Published: 2014
Online Access:http://ndltd.ncl.edu.tw/handle/65175413559718072561
Description
Summary:碩士 === 義守大學 === 資訊工程學系 === 102 === An efficient hash table algorithm for the binary systematic the decoding of the (71,36,11) Quadratic Residue Code (QR Code) is presented in this Thesis. The key idea of decoding technique is based on one-to-one mapping between the syndromes and error patterns. By looking up a pre-computed table, the syndrome with only the operations of addition in , determines the locations of errors directly by table lookup. Moreover, the method dramatically speed up 56% approximately. The algorithm has been verified thorough a software simulation that program in C language. It is readily adaptable for use in Digital Signal Processing (DSP) applications.