ERROR ANALYSIS OF APPROXIMATE CHINESE-REMAINDER-THEOREM DECODING

作     者：HUNG, CY PARHAMI, B 

作者机构：UNIV CALIF SANTA BARBARADEPT ELECT & COMP ENGNSANTA BARBARACA 93106 

出 版 物：《IEEE TRANSACTIONS ON COMPUTERS》 (IEEE Trans Comput)

年 卷 期：1995年第44卷第11期

页      面：1344-1348页

核心收录：

学科分类：0808[工学-电气工程] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：COMPUTATION ERRORS COMPUTER ARITHMETIC RESIDUE NUMBERS RNS REPRESENTATION SCALED DECODING 

摘      要：Approximate Chinese-remainder-theorem decoding of residue numbers is a useful operation in residue arithmetic. The decoding yields an approximation to (X mod M)/M, in the range [0, 1), where X is the input number and M is the product of all moduli. We show the error distribution and worst-case errors for both the truncation and rounding versions of the approximate decoding procedure. We also prove that, contrary to some published accounts, limiting the dynamic range is ineffective in reducing the maximal error.