会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 99. 发明授权
    • Multi-level compressed look-up tables formed by logical operations to compress selected index bits
    • 通过逻辑运算形成的多级压缩查找表来压缩选定的索引位
    • US08356020B2
    • 2013-01-15
    • US12190692
    • 2008-08-13
    • Millind Mittal
    • Millind Mittal
    • G06F7/00
    • G06F17/30961Y10S707/99942Y10S707/99943
    • A lookup is performed using multiple levels of compressed stride tables in a multi-bit Trie structure. An input lookup key is divided into several strides including a current stride of S bits. A valid entry in a current stride table is located by compressing the S bits to form a compressed index of D bits into the current stride table. A compression function logically combines the S bits to generate the D compressed index bits. An entry in a prior-level table points to the current stride table and has a field indicating which compression function and mask to use. Compression functions can include XOR, shifts, rotates, and multi-bit averaging. Rather than store all 2S entries, the current stride table is compressed to store only 2D entries. Ideally, the number of valid entries in the current stride table is between 2D−1 and 2D for maximum compression. Storage requirements are reduced.
    • 在多位Trie结构中使用多级压缩步幅表进行查找。 输入查找键被分成包括S位的当前步幅的多个步骤。 通过压缩S位来形成当前步幅表中的有效条目,以形成D位的压缩索引到当前步幅表中。 压缩函数逻辑组合S位以产生D压缩索引位。 前一级表中的条目指向当前步幅表,并具有指示要使用的压缩函数和掩码的字段。 压缩功能可以包括XOR,移位,旋转和多位平均。 而不是存储所有2S条目,当前步幅表被压缩以仅存储2D条目。 理想情况下,当前步幅表中有效条目的数量在2D-1和2D之间用于最大压缩。 存储要求降低。