首页> 外文期刊>Journal of circuits, systems and computers >Novel Binary Signed-Digit Addition Algorithm for FPGA Implementation
【24h】

Novel Binary Signed-Digit Addition Algorithm for FPGA Implementation

机译:FPGA实现的新型二进制签名数字添加算法

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

摘要

Signed-digit (SD) number representation systems have been studied for high-speed arithmetic. One important property of the SD number system is the possibility of performing addition without long carry chain. However, many numbers of logic elements are required when the number representation system and such an adder are realized on a logic circuit. In this study, we propose a new adder on the binary SD number system. The proposed adder uses more circuit area than the conventional SD adders when those adders are realized on ASIC. However, the proposed adder uses 20% less number of logic elements than the conventional SD adder when those adders are realized on a field-programmable gate array (FPGA) which is made up of 4-input 1-output LUT such as Intel Cyclone IV FPGA.
机译:已经研究了签名的数字(SD)数表示系统的高速算法。 SD编号系统的一个重要属性是没有长途链路执行加法的可能性。然而,当在逻辑电路上实现数字表示系统和这种加法器时需要许多数量的逻辑元素。在这项研究中,我们向二进制SD系统提出了一个新的加法器。当那些加法器在ASIC上实现时,所提出的加法器使用比传统SD加法器更多的电路区域。然而,当在现场可编程门阵列(FPGA)上实现那些加法器,所提出的加法器使用比传统的SD加法器更少的逻辑元素多于传统的SD加法器。 FPGA。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号