会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • Multiplier Engine Apparatus and Method
    • 乘法器发动机装置及方法
    • US20090013022A1
    • 2009-01-08
    • US11773558
    • 2007-07-05
    • Douglas H. BradleyOwen ChiangSherman M. Dance
    • Douglas H. BradleyOwen ChiangSherman M. Dance
    • G06F7/523
    • G06F7/5338G06F7/5318
    • A multiplier engine that reduces the size of the circuitry used to provide the multiplier engine, as well as increases the speed at which the multiplication algorithm is performed, are provided. The illustrative embodiments may comprise a M*8 multiplication engine having one or more 4:2 compressors that comprise only two full adders, as opposed to the three full adders in the known 5:2 compressor based architecture. The 4:2 compressors are able to achieve the same operation as the known 5:2 compressor based architecture by virtue of using the unused bits in a least significant portion of the partial product inputs to store the negate bit values. Moreover, a negate bit value that is not fused with the partial product inputs may be input to the 4:2 compressors for a bit 0 position.
    • 提供了减少用于提供乘法器引擎的电路的大小以及增加执行乘法算法的速度的乘法器引擎。 示例性实施例可以包括具有一个或多个仅包括两个全加器的4:2压缩机的M * 8乘法引擎,与已知的5:2基于压缩机的架构中的三个全加器相反。 4:2压缩机能够通过使用部分乘积输入的最不重要部分中的未使用位来存储否定位值来实现与已知的5:2基于压缩器的架构相同的操作。 此外,与部分积输入不融合的否定位值可以输入到位0位置的4:2压缩器。
    • 2. 发明授权
    • Conditional carry encoding for carry select adder
    • 进位选择加法器的条件进位编码
    • US06742014B2
    • 2004-05-25
    • US10259015
    • 2002-09-27
    • Douglas H. Bradley
    • Douglas H. Bradley
    • G06F750
    • G06F7/507
    • The inventive mechanism encodes the carry in as well as the operand bits for each place in a binary addition of two streams of bits. The carry ins are encoded as Propagate (Pin), Kill (Kin), and Generate (Gin), with respect to the carry in to a block of bits. Only one of the signals would be high at any time, and the other two would be low. The Pin signal for a bit is true where the bit has a carry in that is the same as the carry in to the block of bits, i.e., the carry in to the block is propagated up to the particular bit. The Kin signal for a bit is true where a carry in to the bit is zero regardless of the carry in to the block, i.e., any carry in to the block is killed before it gets to the bit. The Gin signal for a bit is true where the bit has a carry in of one regardless of carry in to the block, i.e., the carry in to the bit is generated within the block. These signals are used in the calculation of the sum of the operand bits.
    • 本发明的机构以两位流的二进制加法对每个地方的进位和操作数位进行编码。 相对于一个位块的进位,进位被编码为传播(Pin),Kill(Kin)和Generate(Gin)。 任何时候只有一个信号会很高,另外两个信号会很低。 位的Pin信号是真实的,其中该位具有与进位到位的进位相同的进位,即,到该块的进位传播到特定位。 一个位的Kin信号是正确的,其中进位到该位是零,而不管进位到块,即,到达该块的任何进位在它到达位之前被杀死。 一位的Gin信号是真的,其中该位具有一个进位,而不管进位到该块,即在该块内产生该位的进位。 这些信号用于计算操作数位的和。
    • 3. 发明授权
    • Conditional carry encoding for carry select adder
    • 进位选择加法器的条件进位编码
    • US06496846B1
    • 2002-12-17
    • US09352259
    • 1999-07-13
    • Douglas H. Bradley
    • Douglas H. Bradley
    • G06F750
    • G06F7/507
    • The inventive mechanism encodes the carry in as well as the operand bits for each place in a binary addition of two streams of bits. The carry ins are encoded as Propagate (Pin), Kill (Kin), and Generate (Gin), with respect to the carry in to a block of bits. Only one of the signals would be high at any time, and the other two would be low. The Pin signal for a bit is true where the bit has a carry in that is the same as the carry in to the block of bits, i.e., the carry in to the block is propagated up to the particular bit. The Kin signal for a bit is true where a carry in to the bit is zero regardless of the carry in to the block, i.e., any carry in to the block is killed before it gets to the bit. The Gin signal for a bit is true where the bit has a carry in of one regardless of carry in to the block, i.e., the carry in to the bit is generated within the block. These signals are used in the calculation of the sum of the operand bits.
    • 本发明的机构以两位流的二进制加法对每个地方的进位和操作数位进行编码。 相对于一个位块的进位,进位被编码为传播(Pin),Kill(Kin)和Generate(Gin)。 任何时候只有一个信号会很高,另外两个信号会很低。 位的Pin信号是真实的,其中该位具有与进位到位的进位相同的进位,即,到该块的进位传播到特定位。 一个位的Kin信号是正确的,其中进位到该位是零,而不管进位到块,即,到达该块的任何进位在它到达位之前被杀死。 一位的Gin信号是真的,其中该位具有一个进位,而不管进位到该块,即在该块内产生该位的进位。 这些信号用于计算操作数位的和。
    • 4. 发明授权
    • Multiplier engine
    • 乘法引擎
    • US07958180B2
    • 2011-06-07
    • US11773558
    • 2007-07-05
    • Douglas H. BradleyOwen ChiangSherman M. Dance
    • Douglas H. BradleyOwen ChiangSherman M. Dance
    • G06F7/52
    • G06F7/5338G06F7/5318
    • A multiplier engine that reduces the size of the circuitry used to provide the multiplier engine, as well as increases the speed at which the multiplication algorithm is performed, are provided. The illustrative embodiments may comprise a M*8 multiplication engine having one or more 4:2 compressors that comprise only two full adders, as opposed to the three full adders in the known 5:2 compressor based architecture. The 4:2 compressors are able to achieve the same operation as the known 5:2 compressor based architecture by virtue of using the unused bits in a least significant portion of the partial product inputs to store the negate bit values. Moreover, a negate bit value that is not fused with the partial product inputs may be input to the 4:2 compressors for a bit 0 position.
    • 提供了减少用于提供乘法器引擎的电路的大小以及增加执行乘法算法的速度的乘法器引擎。 示例性实施例可以包括具有一个或多个仅包括两个全加器的4:2压缩机的M * 8乘法引擎,与已知的5:2基于压缩机的架构中的三个全加器相反。 4:2压缩机能够通过使用部分乘积输入的最不重要部分中的未使用位来存储否定位值来实现与已知的5:2基于压缩器的架构相同的操作。 此外,与部分积输入不融合的否定位值可以输入到位0位置的4:2压缩器。