Decompression Engine for Decompressing Compressed Input Data that Includes Multiple Streams of Data

    公开(公告)号:US20230153111A1

    公开(公告)日:2023-05-18

    申请号:US18099621

    申请日:2023-01-20

    发明人: Vinay Patel

    IPC分类号: G06F9/38 H03M7/30 H03M7/40

    摘要: An electronic device that includes a decompression engine that includes N decoders and a decompressor decompresses compressed input data that includes N streams of data. Upon receiving a command to decompress compressed input data, the decompression engine causes each of the N decoders to decode a respective one of the N streams from the compressed input data separately and substantially in parallel with others of the N decoders. Each decoder outputs a stream of decoded data of a respective type for generating commands associated with a compression standard for decompressing the compressed input data. The decompressor next generates, from the streams of decoded data output by the N decoders, commands for decompressing the data using the compression standard to recreate the original data. The decompressor next executes the commands to recreate the original data and stores the original data in a memory or provides the original data to another entity.

    Real-time reduction of CPU overhead for data compression
    7.
    发明授权
    Real-time reduction of CPU overhead for data compression 有权
    实时降低数据压缩的CPU开销

    公开(公告)号:US09564918B2

    公开(公告)日:2017-02-07

    申请号:US13738300

    申请日:2013-01-10

    IPC分类号: G06F17/00 H03M7/40 H03M7/30

    摘要: Real-time reduction of CPU overhead for data compression is performed by a processor device in a computing environment. Non-compressing heuristics are applied on a randomly selected data sample from data sequences for determining whether to compress the data sequences. A compression potential is calculated based on the non-compressing heuristics. The compression potential is compared to a threshold value. The data sequences are either compressed if the compress threshold is matched, compressed using Huffman coding if Huffman coding threshold is matched, or stored without compression.

    摘要翻译: 用于数据压缩的CPU开销的实时降低由计算环境中的处理器设备执行。 将非压缩启发式应用于从数据序列中随机选择的数据样本,以确定是否压缩数据序列。 基于非压缩启发式计算压缩电位。 将压缩电位与阈值进行比较。 如果压缩阈值匹配,则数据序列被压缩,如果霍夫曼编码阈值匹配则使用霍夫曼编码进行压缩,或者不压缩地存储。

    Calibration data
    8.
    发明授权
    Calibration data 有权
    校准数据

    公开(公告)号:US09404995B2

    公开(公告)日:2016-08-02

    申请号:US14889576

    申请日:2013-05-31

    发明人: Xianjun Jiao

    摘要: Apparatus is provided for: storing a four-dimensional matrix of fixed point calibration data; rearranging the four-dimensional matrix of fixed point calibration data into a one-dimensional sequence; calculating a differential sequence of the one-dimensional sequence; saving the differential sequence and a first element of the one-dimensional sequence into a binary file; and compressing the binary file using a DEFLATE algorithm. Apparatus is provided for corresponding decompression also.

    摘要翻译: 提供装置:存储固定点校准数据的四维矩阵; 将固定点校准数据的四维矩阵重排为一维序列; 计算一维序列的差分序列; 将差分序列和一维序列的第一元素保存为二进制文件; 并使用DEFLATE算法压缩二进制文件。 还提供了相应的减压装置。

    EFFICIENT DATA ENCODING
    9.
    发明申请
    EFFICIENT DATA ENCODING 有权
    有效的数据编码

    公开(公告)号:US20160191075A1

    公开(公告)日:2016-06-30

    申请号:US14977712

    申请日:2015-12-22

    IPC分类号: H03M7/40

    摘要: A source data set is processed to produce a symbol table and a distribution without using a tree construct or any tree-related processing. The symbol table and the distribution outputted for encoding the data set and decoding encoded versions of the data set.

    摘要翻译: 处理源数据集以产生符号表和分布,而不使用树构造或任何与树相关的处理。 输出的符号表和分配数据组进行编码并对数据集的编码版本进行解码。

    VLSI efficient Huffman encoding apparatus and method
    10.
    发明授权
    VLSI efficient Huffman encoding apparatus and method 有权
    VLSI高效霍夫曼编码装置及方法

    公开(公告)号:US09337862B2

    公开(公告)日:2016-05-10

    申请号:US14299990

    申请日:2014-06-09

    IPC分类号: H03M7/40

    摘要: A compression algorithm based on Huffman coding is disclosed that is adapted to be readily implemented using VLSI design. A data file may be processed to replace duplicate data with a copy commands including an offset and length, such as according to the LV algorithm. A Huffman code may then be generated for parts of the file. The Huffman code may be generated according to a novel method that generates Huffman code lengths for literals in a data file without first sorting the literal statistics. The Huffman code lengths may be constrained to be no longer than a maximum length and the Huffman code may be modified to provide an acceptable overflow probability and be in canonical order. Literals, offsets, and lengths may be separately encoded. The different values for these data sets may be assigned to a limited number of bins for purpose of generating usage statistics used for generating Huffman codes.

    摘要翻译: 公开了一种基于霍夫曼编码的压缩算法,适用于使用VLSI设计来实现。 可以处理数据文件以用包括偏移和长度的复制命令来替换重复数据,例如根据LV算法。 然后可以为文件的部分生成霍夫曼代码。 霍夫曼代码可以根据一种新颖的方法生成,该方法为数据文件中的文字生成霍夫曼代码长度,而无需先对文字统计进行排序。 霍夫曼代码长度可以被限制为不长于最大长度,并且可以修改霍夫曼代码以提供可接受的溢出概率并且以规范的顺序。 文字,偏移量和长度可以单独编码。 为了产生用于生成霍夫曼码的使用统计信息,可以将这些数据集的不同值分配给有限数量的箱。