首页> 外国专利> Improved Wells-Tree Adder, Structure, and Method for High-Speed Binary Multipliers

Improved Wells-Tree Adder, Structure, and Method for High-Speed Binary Multipliers

机译:用于高速二进制乘法器的改进的Wells-tree加法器,结构和方法

摘要

The present invention relates to a rounding-preserving adder having a reduced number of full adder stages for use in a binary multiplier, wherein the rounding-preserving adder of the present invention sums binary rows of data and stores a plurality of 1-bit (30) bits. And 2-bit 60 full adders. 1-bit 30 and 2-bit 60 full adders add a number of interconnected improved welles-trees that sum binary data from one or more rows to produce a subtotal 74 and a round-up number 76. Arranged with an adder. Each improved well-tree adder has a plurality of stages 70, 110, 130, 150 that include 1-bit 30 and 2-bit 60 full adders that reduce the number of multiple binary data bits, where the final stage ( 36,122,142,162. Multiple conductors interconnect the stages of each improved well-tree adder with the stages in the same well-tree adder and the stages in another improved well-tree adder.
机译:本发明涉及在二进制乘法器中使用的具有减少数量的全加法器级的保留舍入加法器,其中本发明的保留舍入加法器对数据的二进制行求和并存储多个1位(30 )位。和2位60个全加法器。 1位30位和2位60位全加法器添加了许多相互连接的改进的Welles树,这些树对来自一行或多行的二进制数据求和,以得出小计74和向上舍入的数字76。并安排了加法器。每个改进的井树加法器都有多个级70、110、130、150,其中包括1位30和2位60个全加法器,它们减少了多个二进制数据位的数量,其中最后一级(36,122,142,162。将每个改进的井树加法器的级与同一井树加法器中的级和另一个改进的井树加法器中的级互连。

著录项

  • 公开/公告号KR960704266A

    专利类型

  • 公开/公告日1996-08-31

    原文格式PDF

  • 申请/专利权人 에스. 케이. 박;

    申请/专利号KR19960700549

  • 发明设计人 래릭 레오나르드 데니스;

    申请日1996-02-02

  • 分类号G06F7/52;

  • 国家 KR

  • 入库时间 2022-08-22 03:44:23

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号