Patent classifications
H03M7/6011
Data Compression and Transmission Technique
Disclosed herein is a method of transmitting data, the method comprising: obtaining a plurality of data blocks; determining a plurality of values of a transmission parameter for a transmitter; determining a plurality of values of a processing parameter of a processor; determining, for each of the obtained data blocks, one of a plurality of compression levels in dependence on at least one of the determined transmission parameter values and/or at least one processing parameter values; compressing each of a plurality data blocks in dependence on the determined compression level each block; and transmitting the data blocks; wherein: the transmitted data blocks comprise data blocks are compressed with different compression levels; and one of the compression levels is a determination to not compress data blocks such that the method does not compress some of the transmitted data blocks.
Locally varying numerical ranges for data compression
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.
METHOD OF COMPRESSING AND DECOMPRESSING A FILE VIA CELLULAR AUTOMATA PRE-PROCESSING
A method for pre-processing files that can improve file compression rates of existing general-purpose lossless file compression algorithms, particularly for files on which traditional algorithms perform poorly. The elementary cellular automata (CA) pre-processing technique involves finding an optimal CA state that can be used to transform an original file into a format (i.e., an intermediary file) that is more amenable to compression than the original file format. This technique is applicable to multiple file types and may be used to enhance multiple compression algorithms. Evaluation on generated files, as well as samples selected from online text repositories, finds that the CA pre-processing technique improves compression rates by up to 4% and shows promising results for assisting in compressing data that typically induce worst-case behavior in standard compression algorithms.
METHODS AND APPARATUS FOR MANAGING COMPRESSOR MEMORY
Aspects of the present disclosure include methods, apparatuses, and computer readable media for transmitting, to a receiving device, a first plurality of packets immediately after a first compression memory reset, transmitting, to the receiving device, a second plurality of packets different than the first plurality of packets, receiving, from the receiving device, a memory reset request associated with a second plurality of packets for a second compression memory reset, wherein the memory reset request comprises one or more recent sequence numbers of the second plurality of packets, and refraining from performing a second compression memory reset in response to determining that the at least one of the one or more recent sequence numbers is less than at least one of one or more reset sequence numbers of the first plurality of packets.
Data compression system and method of using
A system includes a non-transitory computer readable medium configured to store instructions thereon; and a processor connected to the non-transitory computer readable medium. The processor is configured to execute the instructions for generating a mask based on received data from a sensor, wherein the mask includes a plurality of importance values, and each region of the received data is designated a corresponding importance value of the plurality of importance values. The processor is configured to execute the instructions for encoding the received data based on the mask; and transmitting the encoded data to a decoder for defining reconstructed data. The processor is configured to execute the instructions for computing a loss based on the reconstructed data, the received data and the mask. The processor is configured to execute the instructions for providing training to an encoder for encoding the received data based on the computed loss.
System and method for data compaction and encryption of anonymized datasets
A system and method for encoding anonymized dataset. A dataset may be pre-processed by dividing into a plurality of sourceblocks at all reasonable sourceblock lengths, and then counting how many times each sourceblock occurs in the dataset, resulting in a tally record of tokens and their count value. This tally record may then be anonymized and transmitted as an anonymized tally record to a data deconstruction engine which combined with a library manager creates a codebook and performs optimization techniques on the codebook. The received anonymized tally record may be parsed into individual tokens by identifying the tokens with the highest count value. The tokens may then be sent, in descending order of count value, to the library manger where each token may be assigned a codeword. Then a half-backed codebook is created using the tokens and each token's unique codeword, before sending the half-backed codebook to a system user.
DATA COMPRESSION AND DECOMPRESSION
A computer-implemented method for compressing an n-bit data value, the method comprising dividing the n bits of the data value into a first subset of bits and a second subset of bits, the first subset comprising the n−2 most significant bits of the data value and the second subset comprising the two least significant bits of the data value; performing compression of the first subset using a first compression module; and performing compression of the second subset using a second compression module, the first and second compression modules implementing different compression schemes.
ENCODER, DECODER, ENCODING METHOD, DECODING METHOD AND PROGRAM
A sequence of integer values is encoded and decoded with a number of bits of a decimal value substantially assigned per sample or/and with a smaller memory amount or calculation processing amount than in the prior art. The encoder receives the sequence of integer values as input and outputs an integer code corresponding to the sequence of integer values. An integer transformer (11) obtains one integer value (transformed integer) through algebraically-representable bijective transformation for each of a plurality of sets of integer values included in the inputted sequence of integer values. An integer encoder (12) encodes the transformed integer to thereby obtain an integer code.
Compression And Decompression In Hardware For Data Processing
Methods, systems, and apparatus, including computer-readable storage media for hardware compression and decompression. A system can include a decompressor device coupled to a memory device and a processor. The decompressor device can be configured to receive, from the memory device, compressed data that has been compressed using an entropy encoding, process the compressed data using the entropy encoding to generate uncompressed data, and send the uncompressed data to the processor. The system can also include a compressor device configured to generate, from uncompressed data, a probability distribution of codewords, generate a code table from the probability distribution, and compress incoming data using the generated code table.
SYSTEM AND METHOD FOR DATA COMPACTION AND SECURITY USING MULTIPLE ENCODING ALGORITHMS WITH PRE-CODING AND COMPLEXITY ESTIMATION
A system and method for encoding data using a plurality of encoding libraries with pre-coding and complexity estimation. Portions of the data are encoded by different encoding libraries, depending on which library provides the greatest compaction for a given portion of the data. This methodology not only provides substantial improvements in data compaction over use of a single data compaction algorithm with the highest average compaction, but provides substantial additional security in that multiple decoding libraries must be used to decode the data. In some embodiments, each portion of data may further be encoded using different data block sizes, providing further security enhancements as decoding requires multiple decoding libraries and knowledge of the data block size used for each portion of the data. In some embodiments, encoding libraries may be randomly or pseudo-randomly rotated to provide additional security.