基于二进制冗余数的递归余数和算法

Recursive Sums of Residues Algorithm Based on Binary Redundant Representations

摘要: 介绍了递归余数和(RSR)算法,在此基础上又提出了一种改进的算法。理论分析表明,改进算法的迭代步数平均减少了17.2%。与传统的二进制算法(BR算法)相比,新算法的计算速度平均提高了约58.6%。

Abstract: Recursive sums of residues algorithm(RSR algorithm) is briefly introduced in this paper An improved RSR algorithm is presented, which bases on binary redundant representations (BRR algorithm). It is shown by theoretical analysis that the proposed algorithm decreases the recursive steps by 17.2% on average. Compared with traditional BR algorithm, the new algorithm obtains the speed improvement by about 58.6% on average.