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

陈运, 龚耀寰

陈运, 龚耀寰. 基于二进制冗余数的递归余数和算法[J]. 电子科技大学学报, 2000, 29(1): 1-4.
引用本文: 陈运, 龚耀寰. 基于二进制冗余数的递归余数和算法[J]. 电子科技大学学报, 2000, 29(1): 1-4.
Chen Yun, Gong Yaohuan. Recursive Sums of Residues Algorithm Based on Binary Redundant Representations[J]. Journal of University of Electronic Science and Technology of China, 2000, 29(1): 1-4.
Citation: Chen Yun, Gong Yaohuan. Recursive Sums of Residues Algorithm Based on Binary Redundant Representations[J]. Journal of University of Electronic Science and Technology of China, 2000, 29(1): 1-4.

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

基金项目: 

电子部预研基金资助项目

详细信息
    作者简介:

    陈运 女 41岁 硕士 副教授

  • 中图分类号: TN9l1.2;TN911.7

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.
计量
  • 文章访问数:  4613
  • HTML全文浏览量:  180
  • PDF下载量:  109
  • 被引次数: 0
出版历程
  • 收稿日期:  1999-02-28
  • 刊出日期:  2000-02-14

目录

    /

    返回文章
    返回