会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 31. 发明申请
    • Hardware Accelerator
    • 硬件加速器
    • US20080148024A1
    • 2008-06-19
    • US11610871
    • 2006-12-14
    • Gilbert M. WolrichWilliam HasenplaughWajdi FeghaliDaniel CutterVinodh GopalGunnar Gaubatz
    • Gilbert M. WolrichWilliam HasenplaughWajdi FeghaliDaniel CutterVinodh GopalGunnar Gaubatz
    • G06F9/302
    • G06F9/30014G06F21/72
    • The present disclosure provides a method for instruction processing. The method may include adding a first operand from a first register, a second operand from a second register and a carry input bit to generate a sum and a carry out bit. The method may further include loading the sum into a third register and loading the carry out bit into a most significant bit position of the third register to generate a third operand. The method may also include performing a single bit shift on the third operand via a shifter unit to produce a shifted operand and loading the shifted operand into the fourth register. The method may further include loading a least significant bit from the sum into the most significant bit position of the fourth register to generate a fourth operand. The method may additionally include generating a greatest common divisor (GCD) of the first and second operands via the fourth operand and generating a public key based on, at least in part, the GCD. Of course, many alternatives, variations and modifications are possible without departing from this embodiment.
    • 本公开提供了一种用于指令处理的方法。 该方法可以包括从第一寄存器,第二操作数,第二寄存器和进位输入位添加第一操作数,以产生和和执行位。 该方法还可以包括将和加载到第三寄存器中,并且将进位位加载到第三寄存器的最高有效位位置以产生第三操作数。 该方法还可以包括经由移位器单元在第三操作数上执行单位移位以产生移位的操作数,并将移位的操作数加载到第四寄存器中。 该方法还可以包括将最小有效位加载到第四寄存器的最高有效位位置以产生第四操作数。 该方法可以另外包括经由第四操作数生成第一和第二操作数的最大公约数(GCD),并且至少部分地基于GCD生成公钥。 当然,在不脱离本实施例的情况下,可以进行许多替代,变化和修改。
    • 32. 发明申请
    • Multiplier
    • 乘数
    • US20080140753A1
    • 2008-06-12
    • US11636016
    • 2006-12-08
    • Vinodh GopalGilbert M. WolrichWajdi FeghaliRobert P. Ottavi
    • Vinodh GopalGilbert M. WolrichWajdi FeghaliRobert P. Ottavi
    • G06F17/00
    • G06F7/5324
    • An electronically implemented method includes multiplying a number A, and a number B, where A is composed of segments ai and B is composed of segments bj where i and j are integers greater than 1. The multiplying includes determining partial product values for at least some of aibj and determining a sum of partial product values for aibj and ajbi where ai=bj and bj=ai for respective values of i and j, by multiplying one of (1) aibj and (2) ajbi by two. A sum is determined and stored in a memory storage element of the determined partial product values and the determined sum of partial product values for aibj and ajbi.
    • 电子实现的方法包括将数字A和数字B相乘,其中A由段α1和B组成,并且B由分段b和j分别组成,其中i和j是 大于1的整数。乘法包括确定对于第一个子集的至少一些的部分乘积值,并且确定第一个子集的部分乘积值的和, / SUB> j< i>和< i< i< i< i< i< 并且对于i和j的各个值,通过将(1)a个子集合中的一个来代替,并且对于i和j的各个值,b< i< i< 和(2)第二个和第二个。 确定和并将其存储在所确定的部分乘积值的存储器存储元件中,并且将所确定的部分乘积值的总和存储到第一和第二 b
    • 35. 发明申请
    • CRYPTOGRAPHIC SYSTEM, METHOD AND MULTIPLIER
    • CRYPTOGRAPHIC系统,方法和乘法器
    • US20110264720A1
    • 2011-10-27
    • US11323994
    • 2005-12-30
    • Wajdi FeghaliWilliam C. HasenplaughGilbert M. WolrichDaniel R. CutterVinodh GopalGunnar Gaubatz
    • Wajdi FeghaliWilliam C. HasenplaughGilbert M. WolrichDaniel R. CutterVinodh GopalGunnar Gaubatz
    • G06F7/52G06F5/01
    • G06F7/5275
    • In general, in one aspect, the disclosure describes a multiplier that includes a set of multiple multipliers configured in parallel where the set of multiple multipliers have access to a first operand and a second operand to multiply, the first operand having multiple segments and the second operand having multiple segments. The multiplier also includes logic to repeatedly supply a single segment of the second operand to each multiplier of the set of multiple multipliers and to supply multiple respective segments of the first operand to the respective ones of the set of multiple multipliers until each segment of the second operand has been supplied with each segment of the first operand. The logic shifts the output of different ones of the set of multiple multipliers based, at least in part, on the position of the respective segments within the first operand. The multiplier also includes an accumulator coupled to the logic.
    • 通常,在一个方面,本发明描述了一种乘法器,其包括并行配置的一组多个乘法器,其中多个乘法器的组具有访问第一操作数和第二操作数以乘以具有多个段的第一操作数和第二操作数 具有多个段的操作数。 所述乘法器还包括逻辑以将所述第二操作数的单个段重复地提供给所述多个乘法器集合的每个乘法器,并且将所述第一操作数的多个相应段提供给所述多个乘法器组中的相应一个,直到所述第二 操作数已被提供给第一个操作数的每个段。 该逻辑至少部分地基于第一操作数内的相应段的位置来移动多个乘法器中的不同乘法器的输出。 乘法器还包括耦合到逻辑的累加器。
    • 36. 发明授权
    • Hardware accelerator
    • 硬件加速器
    • US08020142B2
    • 2011-09-13
    • US11610871
    • 2006-12-14
    • Gilbert M. WolrichWilliam HasenplaughWajdi FeghaliDaniel CutterVinodh GopalGunnar Gaubatz
    • Gilbert M. WolrichWilliam HasenplaughWajdi FeghaliDaniel CutterVinodh GopalGunnar Gaubatz
    • G06F9/44G06F9/45G06F7/38
    • G06F9/30014G06F21/72
    • A method for instruction processing may include adding a first operand from a first register, a second operand from a second register and a carry input bit to generate a sum and a carry out bit, loading the sum into a third register and loading the carry out bit into a most significant bit position of the third register to generate a third operand, performing a single bit shift on the third operand via a shifter unit to produce a shifted operand and loading the shifted operand into the fourth register, loading a least significant bit from the sum into the most significant bit position of the fourth register to generate a fourth operand, generating a greatest common divisor (GCD) of the first and second operands via the fourth operand and generating a public key based on, at least in part, the GCD. Many alternatives, variations and modifications are possible.
    • 一种用于指令处理的方法可以包括从第一寄存器,第二操作数,第二寄存器和进位输入位添加第一操作数,以产生和和执行位,将所述和加载到第三寄存器并加载进位 位到第三寄存器的最高有效位位置以产生第三操作数,经由移位器单元在第三操作数上执行单位移位以产生移位操作数,并将移位的操作数加载到第四寄存器中,加载最低有效位 从总和到第四寄存器的最高有效位位置以产生第四操作数,经由第四操作数产生第一和第二操作数的最大公约数(GCD),并且至少部分地基于第二操作数生成公钥, GCD。 许多替代方案,变化和修改是可能的。
    • 38. 发明授权
    • Storage accelerator
    • 存储加速器
    • US07797612B2
    • 2010-09-14
    • US11617966
    • 2006-12-29
    • Vinodh GopalYogesh BansalGilbert M. WolrichWajdi FeghaliKirk Yap
    • Vinodh GopalYogesh BansalGilbert M. WolrichWajdi FeghaliKirk Yap
    • G11C29/00
    • G06F11/1076G06F2211/1057
    • The present disclosure provides a method for generating RAID syndromes. In one embodiment the method may include loading a first data byte of a first disk block and a first data byte of a second disk block from a storage device to an arithmetic logic unit. The method may further include XORing the first data byte of the first disk block and the first data byte of the second disk block to generate a first result and storing the first result in a results buffer. The method may also include iteratively repeating, loading intermediate data bytes corresponding to the first disk block and intermediate data bytes corresponding to the second disk block from the storage device to the arithmetic logic unit. The method may additionally include XORing the intermediate data bytes corresponding to the first disk block and the intermediate data bytes corresponding to the second disk block to generate intermediate results and generating a RAID syndrome based on, at least in part, the intermediate results. Of course, many alternatives, variations and modifications are possible without departing from this embodiment.
    • 本公开提供了一种用于生成RAID综合征的方法。 在一个实施例中,该方法可以包括将第一磁盘块的第一数据字节和第二磁盘块的第一数据字节从存储设备加载到算术逻辑单元。 该方法还可以包括将第一磁盘块的第一数据字节和第二磁盘块的第一数据字节进行异或,以产生第一结果并将第一结果存储在结果缓冲器中。 该方法还可以包括将对应于第一磁盘块的中间数据字节和对应于第二磁盘块的中间数据字节从存储设备反复重复加载到算术逻辑单元。 该方法还可以包括对与第一磁盘块相对应的中间数据字节和对应于第二磁盘块的中间数据字节进行异或,以产生中间结果,并至少部分地基于中间结果生成RAID综合征。 当然,在不脱离本实施例的情况下,可以进行许多替代,变化和修改。