会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明授权
    • Method and apparatus for performing a FFT computation
    • 用于执行FFT计算的方法和装置
    • US09582474B2
    • 2017-02-28
    • US14313132
    • 2014-06-24
    • INTERNATIONAL BUSINESS MACHINES CORPORATION
    • Hoi Sun NgJan Van Lunteren
    • G06F17/14
    • G06F17/142
    • A method, apparatus, and computer program product for performing an FFT computation. The method includes: providing first and second input data elements in multiple memory areas of a memory unit; in each of a number of consecutive computation stages, performing multiple butterfly operations based on a first and second input data element to obtain two output data elements, wherein first and second input data elements for a plurality of multiple butterfly operations are simultaneously retrieved from predetermined memory locations of a first and second of memory areas; for each stage, storing two output data elements in the memory unit as input data elements for a next stage according to a mapping scheme configured to store output data elements at memory locations in first and second memory areas so that they are simultaneously retrievable as input data elements for a plurality of butterfly operations of subsequent computation stage.
    • 一种用于执行FFT计算的方法,设备和计算机程序产品。 该方法包括:在存储器单元的多个存储区域中提供第一和第二输入数据元素; 在多个连续计算阶段的每一个中,基于第一和第二输入数据元素执行多个蝶形运算以获得两个输出数据元素,其中用于多个多蝶形运算的第一和第二输入数据元素从预定存储器同时检索 第一和第二存储区的位置; 对于每个级,根据映射方案将存储器单元中的两个输出数据元素存储在存储器单元中作为输入数据元素,该映射方案被配置为将输出数据元素存储在第一和第二存储器区域中的存储器位置,使得它们可以作为输入数据同时检索 用于后续计算阶段的多个蝴蝶操作的元件。
    • 6. 发明申请
    • SCANNING DATA STREAMS IN REAL-TIME AGAINST LARGE PATTERN COLLECTIONS
    • 扫描数据流实时对大型图案收集
    • US20140172766A1
    • 2014-06-19
    • US13714910
    • 2012-12-14
    • INTERNATIONAL BUSINESS MACHINES CORPORATION
    • Jan Van Lunteren
    • G06N5/02
    • G06F9/444G06F9/4498G06N5/047H04L45/00
    • Embodiments of the disclosure include a method for partitioning a deterministic finite automaton (DFA) into a plurality of groups. The method includes selecting, with a processing device, a subset of the plurality of states and mapping each state of the subset onto a group of the plurality of groups by assigning one or more transition rules associated with each state to a rule line of the group, wherein each rule line is assigned at most two transition rules and an extended address associated with one of the at most two transition rules. The method also includes iteratively processing each state of the subset mapped onto the group by removing the extended address from each rule line in the group with transition rules referring to a current state if the transition rules in the rule line branch within the group.
    • 本公开的实施例包括用于将确定性有限自动机(DFA)划分成多个组的方法。 该方法包括使用处理设备选择多个状态的子集,并通过将与每个状态相关联的一个或多个过渡规则分配给组的规则行来将子集的每个状态映射到多个组的组上 其中每个规则线被分配至多两个转换规则和与至多两个转换规则之一相关联的扩展地址。 该方法还包括迭代地处理映射到组上的子集的每个状态,通过从组中的每个规则行移除扩展地址,其中转移规则参考当前状态,如果规则行中的转移规则在组内分支。