会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明公开
    • M-Bit carry select adder
    • M位进位选择加法器
    • EP1662374A3
    • 2006-08-02
    • EP06003317.2
    • 2001-09-19
    • STMicroelectronics, Inc.
    • Ballachino, William Elliott
    • G06F7/50
    • G06F7/507G06F7/50G06F2207/3876
    • An M-bit adder (300) capable of receiving a first M-bit argument (A0-A31), a second M-bit argument (B0-B31), and a carry-in (CI) bit comprising M adder cells (C0-C31) arranged in R rows, wherein each row generates a carry-out bit that is the carry-in bit to the next higher row, wherein a least significant adder cell (C0) in a first one of said rows of adder cells receives a first data bit, A x , from said first M-bit argument and a first data bit, B x , from said second M-bit argument, and generates a first conditional carry-out bit, C x (1), and a second conditional carry-out bit, C x (0), wherein said C x (1) bit is calculated assuming a row carry-out bit from a second row of adder cells preceding said first row is a 1 and said C x (0) bit is calculated assuming said row carry-out bit from said second row is a 0, characterised in that the least significant adder cell (C0) generates a first conditional sum bit S x (1) calculated assuming said row carry-out bit from said second row is a 1, and a second conditional sum bit S x (0) assuming said row carry-out bit from said second row is a 0, and wherein each row of adder cells contains N adder cells and said preceding row of adder cells contains less than N adder cells and physically locating the least significant adder cell of each of the 2nd to the R'th rows at the end of the preceding row.
    • 能够接收包括M个加法器单元(C0)的第一M位自变量(A0-A31),第二M位自变量(B0-B31)和进位(C1)位的M位加法器(300) 其中每行产生一个进位比特,它是进位比特到下一个更高的行,其中所述加法器单元的第一行中的最低有效加法器单元(C0)接收 来自所述第一M位自变量的第一数据位Ax和来自所述第二M位自变量的第一数据位Bx,并且生成第一条件执行位Cx(1)和第二条件进位 (0),其中假定来自所述第一行之前的第二行加法器单元的行输出位是1并且所述Cx(0)位是假定所述Cx 其特征在于最低有效加法器单元(C0)产生假设来自所述第二行的所述行输出位为1而计算的第一条件和位Sx(1) 和一秒钟 假定来自所述第二行的所述行输出位为0,并且其中每行加法器单元包含N个加法器单元,并且所述前一行加法器单元包含少于N个加法器单元并物理定位 在前一行结尾的第二行到第R行中每一行的最低有效加法单元。
    • 7. 发明公开
    • Logic circuit and method for designing the same
    • 逻辑电路及其设计方法
    • EP0769738A2
    • 1997-04-23
    • EP96116589.1
    • 1996-10-16
    • KABUSHIKI KAISHA TOSHIBA
    • Kondo, Yoshihisa
    • G06F7/48G06F7/50G06F7/52
    • G06F7/535G06F7/48G06F7/5052G06F7/507G06F9/3867G06F17/5045G06F2207/3884G06F2207/5353
    • A logic circuit with a pipelined structure has a plurality stage of combinational circuits and memory circuits such as flip-flops connected among the pipeline combinational circuits. The pipeline combinational circuits constituting a logic circuit is operated at a cycle time shorter than a signal propagation time for the critical path of the pipeline combinational circuit. For the case of activation of the path not covered by this cycle time, another combinational circuit and its peripheral circuits are additionally provided for generating a correction signal. Another combinational circuit has substantially the same logic. The cycle time is determined so as to cover the critical path including another combinational circuit. A comparator circuit compares an output signal of another combinational circuit and an output signal of the combinational circuit. If both the signals are not coincident, a selector is controlled to correct the signal by using the output signal of another combinational circuit.
    • 具有流水线结构的逻辑电路具有多级组合电路和存储器电路,例如连接在流水线组合电路之间的触发器。 构成逻辑电路的流水线组合电路在比流水线组合电路的关键路径的信号传播时间短的周期时间内工作。 对于未被该周期时间覆盖的路径激活的情况,另外提供另一个组合电路及其外围电路用于产生校正信号。 另一个组合电路具有基本相同的逻辑。 周期时间被确定为覆盖包括另一个组合电路的关键路径。 比较器电路比较另一个组合电路的输出信号和组合电路的输出信号。 如果两个信号不一致,则控制选择器以通过使用另一个组合电路的输出信号来校正该信号。
    • 8. 发明公开
    • Method and apparatus for generating carry out signals
    • 用于生成信号的方法和装置
    • EP0508627A3
    • 1994-07-13
    • EP92302413.7
    • 1992-03-20
    • SUN MICROSYSTEMS, INC.
    • Patel, Samir
    • G06F7/50
    • G06F7/507
    • A circuit for determining the carry out from the addition of two numbers independent of the determination of the sum of the two numbers including apparatus for determining a first carry out from each bit position for a carry in of a first value, apparatus for determining a second carry out from each bit position for a carry in of a second value, a plurality of apparatus for utilizing the first and second carry out values from two or more adjacent bit positions to produce a first carry out from each plurality of bit positions for a carry in of a first value, and second carry out from each plurality of bit positions for a carry in of a second value, and apparatus for selecting between the first and second values based on the actual values of the carry ins.
    • 一种电路,用于从独立于两个数字的和的确定确定进位,包括用于确定第一值的进位的每个比特位置的第一进位的装置,用于确定第二值的装置 从每个比特位置执行用于第二值的进位,多个装置,用于利用来自两个或更多个相邻比特位置的第一和第二进位值从多个比特位置产生用于进位的第一进位 并且从用于第二值的进位的每个多个位位置进行第二次执行,以及用于基于进位输入的实际值在第一和第二值之间进行选择的装置。
    • 10. 发明公开
    • Plural dummy select chain logic synthesis network
    • 多余的选择链逻辑综合网络
    • EP0394610A3
    • 1992-07-15
    • EP90100775.7
    • 1990-01-16
    • International Business Machines Corporation
    • Bechade, Robert Albert
    • G06F7/50
    • G06F7/507
    • A logic synthesis network for efficiently combining respective bit pairs of first and second operands to produce respective sum bits and a carry bit associated with the most significant sum bit. A dummy generator receives the respective bit pairs and generates first and second dummy sum signals, and first and second pairs of dummy carry signals. A first dummy selector chain selects the appropriate dummy sum and carry signals of all the bits other than the least signifi­cant bit, as a function of the state of the first pair of dummy carry signals generated for the least signifi­cant bit pair. A second dummy select chain selects the appropriate dummy sum and carry signals for all the bit pairs other than the least signficant bit pair, as a function of the state of the second pair of dummy carry signals generated for the least signifi­cant bit pair. Sum generators associated with each bit pair choose between the selected dummy sum signals from the first and second dummy select chains in accordance with the state of the carry-in signal asso­ciated with the least significant bit pair. Carry generators associated with each bit pair choose between the first and second pairs of dummy carry signals at the ends of the first and second dummy select chains, again in accordance with the state of the carry-in signal associated with the least signifi­cant bit pair.