The invention relates to a invention relates to a method and decoding device for receiving an input bit-stream comprising a sequence of n-bit pattern symbols as well as a unique n-bit comma symbol for synchronization, and for generating therefrom a synchronized output comprising a sequence of m-bit pattern words, with m<n. The comma symbol allows detection of bit-skip in the input bit-stream, so that the output to be synchronized to compensate for the bit-skip. The decoding device and method of decoding are particularly simple and may be applied in devices, e.g. in a beam modulator array comprising a plurality of decoding devices, and/or in a lithography system comprising such a beam modulator array, in which space and computational resources are scarce while still providing a synchronization capability.

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.

The invention relates to a invention relates to a method and decoding device for receiving an input bit-stream comprising a sequence of n-bit pattern symbols as well as a unique n-bit comma symbol for synchronization, and for generating therefrom a synchronized output comprising a sequence of m-bit pattern words, with m<n. The comma symbol allows detection of bit-skip in the input bit-stream, so that the output to be synchronized to compensate for the bit-skip. The decoding device and method of decoding are particularly simple and may be applied in devices, e.g. in a beam modulator array comprising a plurality of decoding devices, and/or in a lithography system comprising such a beam modulator array, in which space and computational resources are scarce while still providing a synchronization capability.

Compression and decompression technology within a solid-state device (SSD) is disclosed that provides a good compression ratio while taking up less on-chip area. An input interface receives an input stream to be compressed. An output interface provides a compressed stream. A history buffer is of a fixed size that is a fraction of a size of a data buffer. Processing logic encodes into the compressed stream element types, literals and pointers, the latter which reference copies of data found elsewhere within the history buffer during compression. The history buffer may be multiple banks in width, where the data is loaded from the input stream sequentially across rows of the banks. The decompression side may be similarly designed, optionally with a different number of banks. The pointers may be a fixed two bytes including four bits for length and eleven bits for offset of back reference to a copy (or other combination).

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).

An encoder for encoding input data to generate corresponding encoded data includes data processing hardware which is operable: to determine at least partial reoccurrences of data blocks or data packets within the input data, wherein the data blocks or data packets include a plurality of bytes; 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; 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 and a change of data values of changed data elements; and to encode the at least one reference symbol and the plurality of change symbols into the encoded data.

A method of encoding input data in an encoder to generate corresponding encoded data includes splitting and/or transforming the input data into data chunks, analyzing symbols present in the input data and compressing the symbols as a function of occurrence of the symbols in the data chunks; generating code tables, frequency tables, and/or length of code word tables for the symbols present in the data chunks; computing sets of indices relating the symbols in each data chunk and/or the compressed symbols to entries in the code tables, the frequency tables, and/or the length of code word tables; and assembling the sets of indices, together with the frequency tables, the code tables, and/or information indicative of such tables, for generating the encoded data. An encoder that utilizes the method, together with a corresponding decoder, wherein the encoder and the decoder in combination form a codec.

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.

Systems and methods are presented for retrieving, by a server computer, raw data received from one or more client devices; aggregating, by the server computer, the raw data to create aggregated raw data; adding, by the server computer, the aggregated raw data to previously aggregated data; generating, by the server computer, heat map data from the aggregated data; compressing, by the server computer, the heat map data; and storing, by the server computer, the compressed heat map data.

The present disclosure is directed to memory saving systems and methods for buffer overflow that occurs during image compression. In example embodiments, when an overflow occurs during image compression, the overflow data is written to an allocated designated overflow memory by an overflow handler. This memory can be designed to be rewritten multiple times during the image compression process, and can therefore occupy less memory than would be required in possible alternative solutions that comprise expanding the size of each unit of compression destination memory to account for the worst case compression scenario in each instance. Various embodiments that utilize the designated overflow memory to conserve memory when buffer overflow occurs during image compression are illustrated and described.