首页> 外文会议>Computer Arithmetic (ARITH), 1987 IEEE 8th Symposium on >Design of high speed MOS multiplier and divider using redundant binary representation
【24h】

Design of high speed MOS multiplier and divider using redundant binary representation

机译:利用冗余二进制表示的高速MOS乘法器和除法器设计

获取原文

摘要

A high speed multiplier and divider for MOS LSI based on a new algorithm is presented. When we implement the multiplier and the divider in LSI, the features such as high speed operation, small number of transistors and easy layout are the most important factors. A computational algorithm using a redundant binary representation has several excellent features such as high speed addition operations. We improved the algorithm and the method of implementation, and designed an advanced multiplier and divider with the above mentioned features. We expect mat our multiplier and divider are excellent compared with multipliers using the Booth algorithm and the Wallace tree, and with divider using the SRT method, respectively.
机译:提出了一种基于新算法的MOS LSI高速倍增除法器。当我们在LSI中实现乘法器和除法器时,诸如高速操作,晶体管数量少和易于布局等特性是最重要的因素。使用冗余二进制表示的计算算法具有多个出色的功能,例如高速加法运算。我们改进了算法和实现方法,并设计了具有上述功能的高级乘法器和除法器。我们希望与使用Booth算法和Wallace树的乘法器以及使用SRT方法的除法器相比,我们的乘法器和除法器都非常出色。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号