A Fast Algorithm for Redundant Residue Arithmetic Single Error Correction
碩士 === 逢甲大學 === 資訊工程學系 === 86 === We develop a new algorithm for single error correction on the redundant residue number system (RRNS). This algorithm is fully based on the redundant residue remainders. It requires only two redundant residu...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1998
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/52602466279123617526 |
| Summary: | 碩士 === 逢甲大學 === 資訊工程學系 === 86 === We develop a new algorithm for single error correction on the
redundant residue number system (RRNS). This algorithm is fully
based on the redundant residue remainders. It requires only two
redundant residue moduli and at most half number of nonredundant
residue of linear congruence equations can be solved. After the
process of mixed radix conversion (MRC), we keep the two
redundant residue digits. We use the conditions of two redundant
residue digits by MRC to detect the error, then to correct it by
modulu
|
|---|