Data compression using a combination of content independent data compression and content dependent data compression. In one aspect, a system for compressing data comprises: a processor, and a plurality of data compression encoders wherein at least one data encoder utilizes asymmetric data compression. The processor is configured to determine one or more parameters, attributes, or values of the data within at least a portion of a data block containing either video or audio data, to select one or more data compression encoders from the plurality of data compression encoders based upon the determined one or more parameters, attributes, or values of the data and a throughput of a communications channel, and to perform data compression with the selected one or more data compression encoders on at least the portion of the data block.

A system is disclosed comprising a transceiver, transcoder, memory, and a processor for receiving raw data, partitioning the raw data into substrings of predetermined length, assigning each substring to a corresponding predetermined frequency based upon a data set or first lookup table based on the substring's given pattern, and transmitting said frequency using an antenna. Embodiments include a compression component for receiving raw data as input, breaking the raw data into subsets of predetermined length, comparing the raw data to a second lookup table, the second lookup table comprising all possible bit patterns for a file of the length of the raw data, wherein the possible bit patterns are partitioned in n-bit partitions, the n-bit partitions having a corresponding assigned value, the values of which are assembled by a given function so as to produce a code for each possible bit pattern.

The invention introduces a method for accelerating hash-based compression, performed in a compression accelerator, comprising: fetching a string to be compressed from a data buffer; storing instances corresponding to the string in an intermediary buffer; issuing a hash request to a hash matcher for each instance, issuing a data request to an LSM (longest string matcher) according to a first reply sent by the hash matcher, and updating a state, a match length and a match offset of the instance according to a second reply sent by the LSM; and outputting the result to a formatter according to the state, the match length and the match offset of each instance in the original order of the associated substrings that appeared in the string.

An encoding device 100 encodes a plurality of input text files to a plurality of encoded files by using a static dictionary unit 121 and a dynamic dictionary unit 122. The dynamic dictionary unit 122 is generated in accordance with word appearance frequencies in the plurality of text files. The encoding device 100 generates a coupled encoded file that includes the plurality of encoded files, information on the dynamic dictionary unit 122, and position information that indicates positions of the respective plurality of encoded files.

A parallel decompression engine has separate hardware paths for sequence processing and repeated byte copying/placement. Literal byte extraction logic obtains literal bytes from a selected sequence. Literal byte write logic writes the obtained literal bytes into an uncompressed data set that is being generated. Offset and length extraction logic obtains the offset and length of repeated bytes from the selected sequence. In a separate hardware path, copying and placement logic uses the offset and length to find and copy the length of repeated bytes at the specified offset in the uncompressed data set, and place the copied repeated bytes back into the uncompressed data set adjacent to the literal bytes.

The following description is directed to decompression using cascaded history buffers. In one example, an apparatus can include a decompression pipeline configured to decompress compressed data comprising code words that reference a history of decompressed data generated from the compressed data. The apparatus can include a first-level history buffer configured to store a more recent history of the decompressed data received from the decompression pipeline. The apparatus can include a second-level history buffer configured to store a less recent history of the decompressed data received from the first-level history buffer.

A method for performing polar coding is disclosed in the application. A data block is segmented into a plurality of first blocks. Difference in bit length between any two first blocks is not more than one bit. For each first block, one or more consecutive padding bits is added to obtain a second block of a bit length K if the bit length of the first block is less than K, so as to obtain a plurality of second blocks corresponding to the first blocks. NK consecutive bits are added to each of the second blocks to obtain a plurality of third blocks. Polar encoding is performed on the third blocks.

Methods, devices, and computer programs are provided for character conversion. An original file is compressed, for instance, by a source or target device, to obtain a compressed file. Then, characters in the compressed file are converted from a source code page to a target code page to obtain a converted compressed file. The converted, compressed file may, where applicable, be sent to a target device. Also, the target device may decompress the converted compressed file to obtain a file in the target code page.

Methods and systems are provided for the compression and decompression of data. The compression and decompression of data may include partitioning the data into chunks, analyzing the individual chunks to determine the best compression and decompression encoders to utilize for the next data chunk of a data file. In compressing and decompressing using the mentioned technique, the data is delivered to the requesting client in an efficient and speedy manner.

A system and method for event-driven data communication using codebooks with protocol adaption. The system initiates with a request for propagation information from an application to a first transaction manager. The first transaction manager configures a packet describing its location, potentially containing one or more protocol appendices, or encoded data using a codebook. This packet is provided to the application for transmission to another application with a second transaction manager. Upon receiving a protocol request from the second transaction manager, the first transaction manager communicates using a selected protocol decoded from the protocol appendix. If the selected protocol is supported, the transaction proceeds, completing successfully. This system enables transparent encoding, negotiation, and selection of communication protocols, allowing efficient transactions between different transaction managers.