会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • STRING MATCHING ENGINE
    • STRING匹配发动机
    • US20080065639A1
    • 2008-03-13
    • US11550320
    • 2006-10-17
    • Ashwini ChoudharyPranav AsharJitendra Kulkarni
    • Ashwini ChoudharyPranav AsharJitendra Kulkarni
    • G06F7/00
    • G06F7/02G06F2207/025
    • String matching a first string to a string stored in a string dictionary is performed by k-way hashing the first string and locating corresponding k hash locations in a first memory. When any of the k hash locations has a zero Bloom bit, the first string is deemed to not match any of the strings in the string dictionary. Otherwise, a sub-set of the k hash locations identified as those k hash locations having non-zero Bloom bits and a unique bit set to 1 each include a pointer that points to a string in the string dictionary that is fetched and compared to the first string wherein the fetches from the string dictionary are interleaved over the addresses from the first memory. A match signal is issued when the first string matches at least one of the strings stored in the dictionary.
    • 将第一个字符串与存储在字符串字典中的字符串进行匹配的字符串通过k-way散列第一个字符串并在第一个存储器中定位相应的k个哈希位置来执行。 当k个哈希位置中的任何一个具有零布隆比特时,第一个字符串被认为与字符串字典中的任何字符串不匹配。 否则,被识别为具有非零布隆比特的k个哈希位置和设置为1的唯一比特的k个哈希位置的子集包括指向字符串字典中的字符串的指针,该字符串被提取并与 第一个字符串,其中来自字符串字典的提取被交织在来自第一存储器的地址上。 当第一个字符串匹配字典中存储的字符串中的至少一个字符串时,发出匹配信号。
    • 2. 发明申请
    • STRING MATCHING ENGINE FOR ARBITRARY LENGTH STRINGS
    • STRING匹配发动机用于仲裁长度
    • US20080052644A1
    • 2008-02-28
    • US11558061
    • 2006-11-09
    • Pranav AsharJitendra KulkarniAshwini Choudhary
    • Pranav AsharJitendra KulkarniAshwini Choudhary
    • G06F17/50
    • G06F16/90344
    • An efficient finite state machine implementation of a string matching that relies upon a Content Addressable Memory (CAM) or a CAM-equivalent collision-free hash-based lookup architecture with zero false positives used as a method for implementing large FSMs in hardware using a collision-free hash-based look up scheme with low average case bandwidth and power requirements that overcomes prior art limitations by providing the ability to match an anchored or unanchored input stream against a large dictionary of long and arbitrary length strings at line speed. It should be noted that in the context of the described embodiments, a string could take many forms, such as a set of characters, bits, numbers or any combination thereof.
    • 一个有效的有限状态机实现的字符串匹配依赖于内容可寻址内存(CAM)或CAM等效的无冲突的基于哈希的查找架构,零假想正用作在硬件中使用冲突实现大型FSM的方法 - 基于散列的查找方案,具有低平均情况带宽和功率需求,通过提供将锚定或未锚定输入流与线速度的长字符和任意长度字符串的大字典相匹配的能力来克服现有技术的限制。 应当注意,在所描述的实施例的上下文中,字符串可以采取许多形式,诸如一组字符,位,数字或其任何组合。