【24h】

Multiplier with Parallel CSA Using CRT's Specific Moduli (2~k-1,2~k,2~k+1)

机译:使用CRT的特定模数与并行CSA相乘(2〜k-1,2〜k,2〜k + 1)

获取原文
获取原文并翻译 | 示例

摘要

Recently, RNS has received increased attention due to its ability to support high-speed concurrent arithmetic. Applications such as fast fourier transform, digital filtering, and image processing utilize the efficiencies of RNS arithmetics in addition and multiplication; they do not require the difficult RNS operations such as division and magnitude comparison of digital signal processor. RNS have computational advantages since operation on residue digits are performed independently and so these processes can be performed in parallel. There are basically two methods that are used for residue to binary conversion. The first approach uses the mixed radix conversion algorithm, and the second approach is based on the Chinese remainder theorem. In this paper, the new design of CRT conversion is presented. This is a derived method using an overlapped multiple-bit scanning method in the process of CRT conversion. This is achieved by a general moduli form(2~k-1, 2~k, 2~k+1). Then, it simulates the implementation using an overlapped multiple-bit scanning method in the process of CRT conversion, In conclusion, the simulation shows that the CRT method which is adopted in this research, performs arithmetic operations faster that the traditional approaches, due to advantages of parallel processing and carry-free arithmetic operation.
机译:最近,由于RNS支持高速并发算术,因此已引起越来越多的关注。快速傅里叶变换,数字滤波和图像处理等应用程序利用RNS算术的加法和乘法效率。它们不需要困难的RNS操作,例如数字信号处理器的除法和幅度比较。 RNS具有计算优势,因为对残基数字的运算是独立执行的,因此可以并行执行这些过程。基本上有两种方法可用于残基到二进制的转换。第一种方法使用混合基数转换算法,第二种方法基于中文余数定理。本文介绍了CRT转换的新设计。这是在CRT转换过程中使用重叠多位扫描方法的派生方法。这可以通过一般的模数形式(2〜k-1、2〜k,2〜k + 1)来实现。然后,在CRT转换过程中使用重叠多位扫描方法对实现进行了仿真,总的来说,仿真结果表明,由于本发明的优势,本研究中采用的CRT方法比传统方法执行运算速度更快。并行处理和无进位算术运算的概念。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号