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...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/65175413559718072561 |
| id |
ndltd-TW-102ISU05392034 |
|---|---|
| record_format |
oai_dc |
| spelling |
ndltd-TW-102ISU053920342015-10-14T00:23:51Z http://ndltd.ncl.edu.tw/handle/65175413559718072561 Using Hash Table for the (71, 36, 11) Quadratic Residue Code 使用雜湊表於(71,36,11)平方剩餘碼 Yong-Long Huang 黃永隆 碩士 義守大學 資訊工程學系 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. Yan-Haw Chen 陳延華 2014 學位論文 ; thesis 74 zh-TW |
| collection |
NDLTD |
| language |
zh-TW |
| format |
Others
|
| sources |
NDLTD |
| description |
碩士 === 義守大學 === 資訊工程學系 === 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.
|
| author2 |
Yan-Haw Chen |
| author_facet |
Yan-Haw Chen Yong-Long Huang 黃永隆 |
| author |
Yong-Long Huang 黃永隆 |
| spellingShingle |
Yong-Long Huang 黃永隆 Using Hash Table for the (71, 36, 11) Quadratic Residue Code |
| author_sort |
Yong-Long Huang |
| title |
Using Hash Table for the (71, 36, 11) Quadratic Residue Code |
| title_short |
Using Hash Table for the (71, 36, 11) Quadratic Residue Code |
| title_full |
Using Hash Table for the (71, 36, 11) Quadratic Residue Code |
| title_fullStr |
Using Hash Table for the (71, 36, 11) Quadratic Residue Code |
| title_full_unstemmed |
Using Hash Table for the (71, 36, 11) Quadratic Residue Code |
| title_sort |
using hash table for the (71, 36, 11) quadratic residue code |
| publishDate |
2014 |
| url |
http://ndltd.ncl.edu.tw/handle/65175413559718072561 |
| work_keys_str_mv |
AT yonglonghuang usinghashtableforthe713611quadraticresiduecode AT huángyǒnglóng usinghashtableforthe713611quadraticresiduecode AT yonglonghuang shǐyòngzácòubiǎoyú713611píngfāngshèngyúmǎ AT huángyǒnglóng shǐyòngzácòubiǎoyú713611píngfāngshèngyúmǎ |
| _version_ |
1718089177533251584 |