会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 45. 发明授权
    • Leading 0/1 anticipator (LZA)
    • 领先0/1预期者(LZA)
    • US4926369A
    • 1990-05-15
    • US255089
    • 1988-10-07
    • Erdem HokenekRobert K. Montoye
    • Erdem HokenekRobert K. Montoye
    • G06F7/485G06F5/01G06F7/00G06F7/508G06F7/74
    • G06F7/74G06F5/012
    • A method and system for performing a leading 0/1 anticipation (LZA) in parallel with the floating-point addition of two operands (A and B) in a computer to significantly reduce the Addition-Normalization time. A combinational network is used to process appropriate XOR (P), AND (G) and NOR (Z) state signals resulting from the comparison of the bits in corresponding bit positions of the operands (A and B), starting with the most significant bit (MSB) side of the addition. The state of the initial state signal is detected and shift amount signals are produced and counted for each successive state signal detected, as long as the state remains TRUE. When the state becomes NOT TRUE, adjustments are made depending on the initial state and the successive state, and production of the shift amount signals is halted and an adjustment signal is produced. To determine the exponent of the sum of the floating-point addition, the shift amount count is summed with the adjustment signal. The latter sum will be the exponent of the sum of the operands thus providing a normalized result. The adjustment signal may be based on the CARRY at the NOT TRUE bit position, and the state at the NOT TRUE position may be used to determine whether the result of the addition is positive or negative. In addition to a serial network, an implementing network of a parallel form which accepts appropriate state inputs as blocks of n bits in length, is disclosed, along with certain special implementations.
    • 46. 发明授权
    • Programmable regular expression and context free grammar matcher
    • 可编程正则表达式和上下文无关语法匹配器
    • US09093151B2
    • 2015-07-28
    • US13495535
    • 2012-06-13
    • Richard F. FreitasRobert K. MontoyeRajendra Shinde
    • Richard F. FreitasRobert K. MontoyeRajendra Shinde
    • G06F17/27G11C15/04G11C13/00
    • G11C15/046G11C13/0004
    • A regular expression matcher system, including: a deterministic finite state machine (DFSM); a ternary content addressable memory (TCAM) matcher to compare a word stored at the TCAM matcher to an input stream, wherein the word determines a state-to-state transition of the DFSM from a comparison result; a programmable logic connected to an output of the TCAM matcher to identify a next state in the DFSM based on the comparison result; a state register to update a current state of the DFSM to the next state; and a collection data structure coupled to the TCAM matcher and the programmable logic to store a sequence of required state transitions for the DFSM, wherein the programmable logic determines a next required state transition to be matched from the sequence.
    • 正则表达式匹配器系统,包括:确定性有限状态机(DFSM); 三进制内容可寻址存储器(TCAM)匹配器,用于将存储在TCAM匹配器中的字与输入流进行比较,其中该字从比较结果确定DFSM的状态到状态转换; 连接到TCAM匹配器的输出的可编程逻辑基于比较结果识别DFSM中的下一状态; 状态寄存器,用于将DFSM的当前状态更新为下一状态; 以及耦合到所述TCAM匹配器和所述可编程逻辑以存储所述DFSM的所需状态转换序列的收集数据结构,其中所述可编程逻辑确定要从所述序列匹配的下一个所需状态转换。
    • 48. 发明授权
    • Shared parallel adder tree for executing multiple different population count operations
    • 共享并行加法器树,用于执行多个不同的群体计数操作
    • US08661072B2
    • 2014-02-25
    • US12193782
    • 2008-08-19
    • Bartholomew BlanerTodd R. IglehartRobert K. Montoye
    • Bartholomew BlanerTodd R. IglehartRobert K. Montoye
    • G06F7/50
    • G06F7/505
    • A shared parallel adder tree for executing multiple different population count operations on a single datum includes a number of carry-save adders (CSAs) and/or half adders (HAs), arranged in rows, where certain CSAs and HAs are dedicated to a single population count operation, while other CSAs and HAs are shared among two or more population count operations. The datum is applied to the first row in the tree. Partial sums of the number of ones at various locations within the tree are routed to certain CSAs and/or HAs “down” the tree to propagate the particular population count operations. Carry-propagate adders generate at least a portion of the final sum of the number of ones in certain population count operations. An “AND” operation on a particular number of the bits in the datum provides the high order bit of the resulting sum of the particular population count operation.
    • 用于在单个数据上执行多个不同总体计数操作的共享并行加法器树包括排列成行的多个进位保存加法器(CSA)和/或半加法器(HA),其中某些CSA和HA专用于单个 人口计数操作,而其他CSA和HA在两个或多个人口计数操作之间共享。 基准应用于树中的第一行。 树中不同位置处的数量的部分和被路由到特定的CSA和/或HAs“树”,以传播特定的群体计数操作。 携带传播加法器产生某些人口计数操作中的数量的最后总和的至少一部分。 数据中特定位数的“与”运算提供特定总体计数操作的结果总和的高位。