会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Compression algorithm incorporating a feedback loop for dynamic selection of a predefined Huffman dictionary
    • 包含用于动态选择预定霍夫曼字典的反馈回路的压缩算法
    • US08610604B2
    • 2013-12-17
    • US13304326
    • 2011-11-24
    • Lior GlassGiora BiranAmit Golander
    • Lior GlassGiora BiranAmit Golander
    • H03M7/30H03M7/40
    • H03M7/40H03M7/3086H03M7/6076
    • A system and method of selecting a predefined Huffman dictionary from a bank of dictionaries. The dictionary selection mechanism of the present invention effectively breaks the built-in tradeoff between compression ratio and compression rate for both hardware and software compression implementations. A mechanism is provided for automatically creating a predefined Huffman dictionary for a set of input files. The dictionary selection mechanism achieves high compression rate and ratio leveraging predefined Huffman dictionaries and provides a mechanism for dynamically speculating which predefined dictionary to select per input data block, thereby achieving close to a dynamic Huffman ratio at a static Huffman rate. In addition, a feedback loop is used to monitor the ongoing performance of the preset currently selected for use by the hardware accelerator. If the current preset is not optimal it is replaced with an optimal preset.
    • 从一组字典中选择一个预定义霍夫曼字典的系统和方法。 本发明的字典选择机制有效地破坏了硬件和软件压缩实现之间的压缩比和压缩率之间的内在折中。 提供了一种用于自动为一组输入文件创建预定义霍夫曼字典的机制。 词典选择机制通过利用预定义的霍夫曼词典实现了高压缩率和比例,并且提供了一种动态地推测每个输入数据块选择哪个预定义词典的机制,从而以静态霍夫曼速率实现接近于动态赫夫曼比。 另外,反馈回路用于监视当前选择供硬件加速器使用的预设的持续性能。 如果当前的预设值不是最佳的,则用最优的预设置换。
    • 5. 发明申请
    • COMPRESSION ALGORITHM INCORPORATING A FEEDBACK LOOP FORDYNAMIC SELECTION OF A PREDEFINED HUFFMAN DICTIONARY
    • 包含反馈回路的压缩算法动态选择预测的霍夫曼词典
    • US20130135122A1
    • 2013-05-30
    • US13304326
    • 2011-11-24
    • Lior GlassGiora BiranAmit Golander
    • Lior GlassGiora BiranAmit Golander
    • H03M7/40
    • H03M7/40H03M7/3086H03M7/6076
    • A system and method of selecting a predefined Huffman dictionary from a bank of dictionaries. The dictionary selection mechanism of the present invention effectively breaks the built-in tradeoff between compression ratio and compression rate for both hardware and software compression implementations. A mechanism is provided for automatically creating a predefined Huffman dictionary for a set of input files. The dictionary selection mechanism achieves high compression rate and ratio leveraging predefined Huffman dictionaries and provides a mechanism for dynamically speculating which predefined dictionary to select per input data block, thereby achieving close to a dynamic Huffman ratio at a static Huffman rate. In addition, a feedback loop is used to monitor the ongoing performance of the preset currently selected for use by the hardware accelerator. If the current preset is not optimal it is replaced with an optimal preset.
    • 从一组字典中选择一个预定义霍夫曼字典的系统和方法。 本发明的字典选择机制有效地破坏了硬件和软件压缩实现之间的压缩比和压缩率之间的内在折中。 提供了一种用于自动为一组输入文件创建预定义霍夫曼字典的机制。 词典选择机制通过利用预定义的霍夫曼词典实现了高压缩率和比例,并且提供了一种动态地推测每个输入数据块选择哪个预定义词典的机制,从而以静态霍夫曼速率实现接近于动态赫夫曼比。 另外,反馈回路用于监视当前选择供硬件加速器使用的预设的持续性能。 如果当前的预设值不是最佳的,则用最优的预设置换。
    • 9. 发明申请
    • METHOD OF CONSTRUCTING AN APPROXIMATED DYNAMIC HUFFMAN TABLE FOR USE IN DATA COMPRESSION
    • 构建用于数据压缩的大致动态霍夫曼表的方法
    • US20100253556A1
    • 2010-10-07
    • US12418896
    • 2009-04-06
    • Giora BiranHubertus FrankeAmit GolanderHao Yu
    • Giora BiranHubertus FrankeAmit GolanderHao Yu
    • H03M7/40
    • H03M7/40
    • A novel and useful method of constructing a fast approximation of a dynamic Huffman table from a data sample comprising a subset of data to be compressed. The frequency of incidence of each symbol in the sample is calculated, and the symbols are then allocated to predefined bins based on their frequency of incidence. The bins are then transformed into binary sub-trees, where the leaf nodes of the binary sub-trees comprise the symbols of the bin associated with the binary sub-trees. The binary sub-trees are then combined via nesting, thereby creating a coarse grained binary tree, where all leaves are mapped to a specified number of depths. The coarse grained binary tree is then traversed, thereby yielding a canonical code for each symbol, thereby defining the entries for a dynamic Huffman table.
    • 一种从包括要压缩的数据的子集的数据样本构建动态霍夫曼表的快速近似的新颖且有用的方法。 计算样本中每个符号的入射频率,然后根据其入射频率将符号分配给预定义的分组。 然后,将这些分组转换成二进制子树,其中二进制子树的叶节点包括与二进制子树相关联的bin的符号。 然后通过嵌套组合二进制子树,从而创建粗粒度二叉树,其中所有叶被映射到指定数量的深度。 然后遍历粗粒二进制树,从而为每个符号产生规范代码,从而为动态霍夫曼表定义条目。
    • 10. 发明授权
    • Method and apparatus for data decompression in the presence of memory hierarchies
    • 在存在层次结构的情况下进行数据解压缩的方法和装置
    • US07692561B2
    • 2010-04-06
    • US12175214
    • 2008-07-17
    • Giora BiranHubertus FrankeAmit GolanderHao Yu
    • Giora BiranHubertus FrankeAmit GolanderHao Yu
    • H03M7/34
    • H03M7/3086
    • A method for decompressing a stream of a compressed data packet includes determining whether first data of a data-dictionary for a first decompression copy operation is located in a history buffer on a remote memory or a local memory, and when it is determined that the first data is located in the remote memory, stalling the first decompression copy operation, performing a second decompression operation using second data that is located in the history buffer on the local memory and fetching the first data from the remote memory to the history buffer on the local memory. The method further includes performing the first decompression operation using the first data in the history buffer on the local memory.
    • 用于对压缩数据分组的流进行解压缩的方法包括:确定用于第一解压缩复制操作的数据字典的第一数据是否位于远程存储器或本地存储器上的历史缓冲器中,以及当确定第一 数据位于远程存储器中,停止第一次解压缩复制操作,使用位于本地存储器上的历史缓冲器中的第二数据执行第二次解压缩操作,并将第一数据从远程存储器读取到本地的历史缓冲区 记忆。 该方法还包括使用本地存储器上的历史缓冲器中的第一数据来执行第一解压缩操作。