会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明专利
    • Combined adder circuit array and and/or plane
    • 组合式ADR电路阵列和/或平面
    • JP2010009592A
    • 2010-01-14
    • JP2009134314
    • 2009-06-03
    • Panasonic Corpパナソニック株式会社
    • STANSFIELD ANTHONY
    • G06F7/50G06F7/503G06F7/508G06F7/533
    • G06F7/53H03K19/17708
    • PROBLEM TO BE SOLVED: To provide a method which modifies a group of full adder circuits to compute a logic function of a set number of input bits.
      SOLUTION: Each full adder circuit has first and second data inputs, a data output, a carry input and a carry output. The full adder circuits are interconnected so as to form a carry chain. The method includes the step of setting the first input of each full adder circuit to the same fixed value, the step of connecting each respective input bit of the set number of input bits to the second input of a respective one of the full adder circuits, and the step of using the output of the carry chain of the array of the full adder circuits as the result of the logic function.
      COPYRIGHT: (C)2010,JPO&INPIT
    • 要解决的问题:提供一种修改一组全加器电路以计算设定数量的输入位的逻辑功能的方法。 解决方案:每个全加器电路具有第一和第二数据输入,数据输出,进位输入和进位输出。 全加器电路互连以便形成一个进位链。 该方法包括将每个全加器电路的第一输入设置为相同的固定值的步骤,将设定数量的输入比特的每个相应输入比特连接到全加器电路的相应一个的第二输入的步骤, 作为逻辑功能的结果,使用全加器电路的阵列的进位链的输出的步骤。 版权所有(C)2010,JPO&INPIT
    • 6. 发明专利
    • Adding circuit
    • 增加电路
    • JP2005182346A
    • 2005-07-07
    • JP2003420513
    • 2003-12-18
    • Texas Instr Japan Ltd日本テキサス・インスツルメンツ株式会社
    • AWAKA KAORUTAKEGAMA AKIHIROTOYONO YUTAKAMURAMATSU SHIGETOSHI
    • G06F7/50G06F7/508G06F7/52G06F7/523G06F7/53
    • G06F7/506G06F7/507
    • PROBLEM TO BE SOLVED: To provide an adding circuit for quickly executing addition without increasing power consumption, and a multiplying circuit and a multiplying/adding circuit having the adding circuit in the final stage. SOLUTION: The delay of a signal to be inputted from a Wallace tree to an adding circuit in the final stage is maximized in a middle rank bit range, and made smaller in low rank and high rank bit ranges. In the low order bit range, addition is performed by a carry increment adder 1 of level 1 whose carry propagation to a higher digit is relatively slow, and in the middle rank bit range, addition is performed by the carry increment adder 1 of level 2 whose carry propagation is quicker, and in the high rank bit range, addition is performed by a high speed carry selector adder 3. Thus, the addition is performed by an addition system suited to the delay trend of a signal input timing in each bit range so that the circuit scale and power consumption can be suppressed, and that the arithmetic operation can be quickened. COPYRIGHT: (C)2005,JPO&NCIPI
    • 要解决的问题:提供一种用于在不增加功耗的情况下快速执行加法的加法电路,以及在最后阶段具有加法电路的乘法电路和乘法/加法电路。 解决方案:从华莱士树到最后阶段的加法电路输入的信号的延迟在中间位位置范围内最大化,在低位和高位位范围内变小。 在低位比特范围内,通过进位增量加法器1执行加法运算,其进位传播到较高数字相对较慢,而在中间位比特范围内,加法由进位增量加法器1执行2级 其进位传播更快,并且在高位比特范围内,由高速进位选择器加法器3执行加法。因此,通过适合于每个比特范围中的信号输入定时的延迟趋势的相加系统来执行相加 从而可以抑制电路规模和功耗,并且可以加快算术运算。 版权所有(C)2005,JPO&NCIPI
    • 8. 发明专利
    • Parity prediction circuit for full adder
    • JP2004234110A
    • 2004-08-19
    • JP2003019036
    • 2003-01-28
    • Fujitsu Ltd富士通株式会社
    • IKE ATSUSHI
    • G06F11/10G06F7/38G06F7/508
    • PROBLEM TO BE SOLVED: To construct a parity prediction circuit of a full adder from a small number of inputs and a small number of elements. SOLUTION: The parity prediction circuit has computing units, each with a first selector which receives the inputs of carry four parity CP [k-1, 0] and CP [k-1, 1] when carry-in Cin=0 and 1 (k is an integer of not more than n) and which outputs either the input CP [k-1, 0] or CP [k-1, 1] as a carry four parity cp [k, 0] according to a generation bit g[k-2] resulting from addition inputs A[k-2] and B[k-2], and a second selector which receives the inputs of the carry four parity CP [k-1, 0] and CP [k-1, 1] and which outputs either the input CP [k-1, 0] or CP [k-1, 1] as an inverted signal of the carry four parity cp [k, 1] according to a propagation bit p [k-2] resulting from the addition inputs A[k-2] and B[k-2]. The computing units are interconnected in a plurality of rows, and either the carry four parity cp [n, 0] or cp [n, 1] is output as a carry four parity CPn according to the carry in Cin at the final selector. COPYRIGHT: (C)2004,JPO&NCIPI