Patent classifications
H03M7/6058
Three dimensional grid compression storage
Various embodiments for data compression by a processor. Levels of data distribution are configured for data processing, including a first level of the data distribution incorporating a GRID network of data storage nodes, and a second level of the data distribution incorporating a GRID network of compressive nodes in communication with the GRID network of data storage nodes. Input/output (I/O) for an associated storage volume is load balanced between the data storage nodes, as data passes through the first level into the second level to be compressed or uncompressed.
DATA RECOVERY UTILIZING OPTIMIZED CODE TABLE SIGNALING
A computer-implemented method, system, and apparatus for storing binary data is disclosed. A processor receives a digital bit stream and transforms the digital bit stream to an encoded digital bit stream. The encoded digital bit stream comprises a data message encoded by an OCTS-expanded table for storage. The processor stores the encoded digital bit stream on a digital data storage device or system.
8x8 BINARY DIGITAL MULTIPLIER
An 88 binary digital multiplier reduces the height of partial product columns to be no more than 7 bits high. The six 7-bit high middle columns are each input to a (7:3) counter. An ascending triangle compressor operates on the lesser significant bit columns. A descending triangle compressor operates on the greater significant bit columns. The counter and compressor outputs are combined for a final stage of compression, followed by partial product addition.
ENCODER, DECODER AND METHOD
An encoder for encoding input data (D1) to generate corresponding encoded data (E2) includes data processing hardware which is operable: (a) to determine at least partial reoccurrences of data blocks or data packets within the input data (D1), wherein the data blocks or data packets include a plurality of bytes; (b) to employ at least one reference symbol to relate reoccurrences of mutually similar data blocks or data packets and/or to indicate whether or not there are reoccurrences of mutually similar data blocks or data packets within the input data (D1); (c) to employ a plurality of change symbols, for example a plurality of mask bits, to indicate changed and unchanged data elements of partial reoccurrences of data blocks or data packets within the input data (D1) and a change of data values of changed data elements; and (d) to encode the at least one reference symbol and the plurality of change symbols into the encoded data (E2).
There are provided methods of using the encoder to encode input data (D1) to generate the corresponding encoded data (E2). Moreover, there are provided a corresponding decoder, and a corresponding method of decoding the encoded data (E2) to generate corresponding decoded data (D3).
Digital work compression
Various embodiments are directed to systems and methods for compressing digital works, such as books, magazines and similar works. Compressing a digital work may comprise finding an entry for a first string from the digital work in a compression dictionary and replacing a string value of the first string from the digital work with a first string reference associated with the first string at the entry for the first string. The compression dictionary may be generated, for example, from digital works associated with a user or user device that requested the digital work. Also, in some embodiments, the digital work itself may be used as a compression dictionary.
Method and Apparatus for Calculating Estimated Data Compression Ratio
A method and an apparatus for calculating an estimated data compression ratio relate to the field of data processing technologies. In the solutions, an estimated data compression ratio is calculated using a related indicator that represents a distribution pattern of symbols in a symbol sequence, where the related indicator that represents the distribution pattern of the symbols in the symbol sequence is relatively closely related to the estimated data compression ratio.
Data compression and decompression method
A data compression and decompression algorithm performing the function of data compression and decompression by using the steps of: dividing a main data stream into sub data streams, calculating frequency of occurrence of sub data streams in the main data stream, repeating the process of calculating frequency of occurrence by changing the number of digits in sub data stream and by changing the starting digit position in main data stream, assigning codes to sub data streams based on their frequency occurrence values, calculating group dimension index for each group, selecting the group with the lowest group dimension index and placing codes of the group with the lowest group dimension index in a multi dimensional space wherein vector placement is utilized to eliminate the need to use digits that are common to neighboring codes therefore providing an additional compression.
LOSSLESS DATA COMPRESSION
An analytical instrument includes a data acquisition system that produces data. The analytical instrument includes a data compression system/process that utilizes a lossless data compression technique that can be implemented using minimal hardware and software resources. The process may be implemented in such a way that it can be split into many parallel operations. The process can be implemented utilizing software and/or processing devices such as Field-Programmable Gate Arrays (FPGAs) or Graphics Processing Units (GPUs).
MANAGING DATA RECORDS
Data records may be managed in a relational database by monitoring, a record length for a first data record in a page of memory, an amount of free space in the page, and a page length. In response to receiving an operator command to replace the first data record with a second data record, a database management system may determine whether an estimated record length of a compressed second data record is outside of the amount of free space in the page. In response to determining the estimated record length of a compressed second data record is outside of the amount of free space in the page, the database management system may determine whether an estimated length of a compressed page is outside of the page length. In response to determining the estimated length of a compressed page is within the page length, the page may be compressed.
MANAGING DATA RECORDS
Data records may be managed in a relational database by monitoring, a record length for a first data record in a page of memory, an amount of free space in the page, and a page length. In response to receiving an operator command to replace the first data record with a second data record, a database management system may determine whether an estimated record length of a compressed second data record is outside of the amount of free space in the page. In response to determining the estimated record length of a compressed second data record is outside of the amount of free space in the page, the database management system may determine whether an estimated length of a compressed page is outside of the page length. In response to determining the estimated length of a compressed page is within the page length, the page may be compressed.