LOCALLY VARYING NUMERICAL RANGES FOR DATA COMPRESSION

    公开(公告)号:US20230419553A1

    公开(公告)日:2023-12-28

    申请号:US18242416

    申请日:2023-09-05

    IPC分类号: G06T9/00 G06T3/40 H03M7/30

    摘要: Data compression techniques are described for saving memory space by using fewer bits to store information while achieving high fidelity. A data set may be partitioned into a plurality of regions. Locally varying numerical ranges of data values (e.g., the minimum and maximum extents) may be determined for the plurality of regions. The data in the individual regions may be encoded using a lower number of bits as interpolation values in reference to the local extents rather than being encoded using a higher number of bits as absolute values. Where there are multiple channels of data in the regions, the number of available bits for encoding the data may be dynamically allocated per region based on the relative degrees of variance in data among the multiple channels.

    Content-based dynamic hybrid data compression

    公开(公告)号:US11841829B2

    公开(公告)日:2023-12-12

    申请号:US17383555

    申请日:2021-07-23

    IPC分类号: H03M7/30 G06F16/174 G06N20/00

    摘要: An information handling system includes a processor configured to process a training data file to determine an optimal data compression algorithm. The processor may also perform a compression ratio analysis that includes compressing the training data file using data compression algorithms, calculating a compression ratio associated with each of the data compression algorithms, determining an optimal compression ratio from the compression ratio associated with the each data compression algorithm; and determining a desirable data compression algorithm associated with the training data file based on the optimal compression ratio. The processor may also perform a probability analysis that includes generating a symbol transition matrix based on the desirable data compression algorithm, extracting statistical feature data based on the symbol transition matrix, and generating probability matrices based on the statistical feature data to determine the optimal data compression algorithm for each segment of a working data file.

    Selective data compression based on data similarity

    公开(公告)号:US11748307B2

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

    申请号:US17500246

    申请日:2021-10-13

    摘要: Technology is disclosed for selectively compressing data based on similarity of pages within the data that is to be compressed. At least one corresponding hash value is generated for each one of multiple candidate pages to be compressed. In response to the hash values generated for the candidate pages, the technology selects a set of similar candidate pages from the candidate pages. The set of similar candidate pages are a subset of the candidate pages that includes less than all the candidate pages. The set of similar candidate pages are compressed as a single unit, separately from one or more other ones of the candidate pages that were not selected to be included in the set of similar candidate pages.

    Method and apparatus for adaptive data compression

    公开(公告)号:US10084477B2

    公开(公告)日:2018-09-25

    申请号:US15551377

    申请日:2016-02-17

    申请人: PARSTREAM GMBH

    发明人: Norbert Heusser

    摘要: Adaptively compressing an input string (10) comprising a sequence of symbols in order to create a plurality of segment dictionaries Dm, with the steps of: generating a lookup map (110); generating a key value segment Sm,n; searching the lookup map for each symbol received in the input string (120, 130); upon detecting a symbol is not stored in the lookup map, adding the symbol by storing the symbol at a next sequential key index in the lookup map lookup map (135) and assigning a next sequential key value entry to the symbol and adding this key value to the key value segment Sm,n (150); upon detecting the symbol is stored in the lookup map, adding the corresponding key value assigned to this symbol to the next sequential entry of the key value segment Sm,n (150); wherein a new key value segment Sm,n+1 of the lookup map is generated if the number of different symbols equals the number of available key values k=2n for the opened/current key value segment Sm,n (141, 142), and where-in the lookup map is converted into a segment dictionary Dm if the maximal key value size knmax=2nmax is reached (132, 133, 134), with n being any positive integral number 1 to nmax, nmax denoting the maximal bit size, and m being any positive integral number denoting the consecutive numbering of segment dictionaries Dm.

    Systems and methods for compression of high-frequency signals
    30.
    发明授权
    Systems and methods for compression of high-frequency signals 有权
    用于压缩高频信号的系统和方法

    公开(公告)号:US09559721B2

    公开(公告)日:2017-01-31

    申请号:US15064992

    申请日:2016-03-09

    IPC分类号: H03M7/30 G01H1/00 G06F15/02

    摘要: Systems and methods for compressing high-frequency signals are described in certain embodiments herein. According to certain embodiments, a high-frequency signal can be converted into a lower frequency signal so that it can be processed by one or more devices in a lower frequency infrastructure. In certain embodiments, the high-frequency signal can be compressed by certain signal conditioning components and an algorithm executed by a computer processor to at least receive a high-frequency signal, correct the high-frequency signal, determine a number of samples to be taken from the high-frequency signal (i.e., sample the high-frequency signal), store a value associated with the sampled signal, and generate a waveform that includes lower frequency content that may represent the original, high-frequency signal.

    摘要翻译: 在本文的某些实施例中描述了用于压缩高频信号的系统和方法。 根据某些实施例,高频信号可以被转换成较低频率信号,使得其可以由较低频率基础设施中的一个或多个设备来处理。 在某些实施例中,高频信号可被某些信号调理部件和由计算机处理器执行的算法压缩,以至少接收高频信号,校正高频信号,确定要采集的样本数 从高频信号(即,采样高频信号),存储与采样信号相关联的值,并产生包括可表示原始高频信号的较低频率内容的波形。