A method for data compression includes reading first data representing sensor data capture, compressing the data with a lossless algorithm, transmitting the compressed data as a reference frame, reading subsequent data, calculating a delta between the first data and the subsequent data, compressing the data delta, and determining if the compression ratio of the compressed data delta is within a predetermined tolerance threshold. If the compression ratio is within the threshold, transmitting the compressed data delta frame, and repeating the calculating, compressing, and determining steps for subsequent data; Else if the compression ratio is not within the threshold, compressing the current subsequent data and transmitting the result as an updated reference frame. Then repeating the calculating, compressing, and determining steps for subsequent data. A system and a non-transitory computer-readable medium for implementing the method are also disclosed.

A circuit for correcting time encoder errors including a time encoder having a time encoder input, a time encoder output, and a current summing point, and a pulse width modifier coupled to the time encoder output, the pulse width modifier having a current output coupled to the current summing point, and having a corrected output. The pulse width modifier is configured to calibrate duty cycle errors and nonlinearity errors on the time encoder output, to correct the duty cycle errors and the nonlinearity errors on the time encoder output, and to output the corrected output.

An aspect includes receiving a symbol translation table (STT) that includes input symbols and their corresponding codewords. An entropy encoding descriptor (EED) that specifies how many of the codewords have each of the different lengths is also received. Contents of one or both of the STT and the EED are modified to generate a test case and an entropy encoding test is executed. The executing includes performing a lossless data compression process based on contents of an input data string that includes one or more of the input symbols, and on contents of the STT and the EED; or performing a data expansion process based on contents of an input data string that includes one or more of the codewords, and on contents of the STT and the EED. A result of the entropy encoding test is compared to an expected result.

The transmission of broadcast data, such as financial data and news feeds, is accelerated over a communication channel using data compression and decompression to provide secure transmission and transparent multiplication of communication bandwidth, as well as reduce the latency. Broadcast data may include packets having fields. Encoders associated with particular fields may be selected to compress those particular fields.

A system, method and computer program product for encoding an input string of binary characters representing alphanumeric characters. A system includes: a character writing engine for writing a binary character to an empty cell of a multi-dimensional shape beginning with a starting empty cell; a next cell determination engine for determining a next empty cell by traversing neighboring cells in the multi-dimensional shape until an empty cell is located; a loop facilitator for looping back to the character writing engine and the next cell determining engine until there are no more data characters or a next empty cell is not determined; and a serialization engine for serializing the cells into a one dimensional binary string of characters representing an encoded string of alphanumeric characters.

A system and method for low-power digital signal processing, for example, comprising adjusting a digital representation of an input signal.

Operation of a multi-slice computer processor that includes a plurality of execution slices. Operation of such a computer processor includes: matching one or more sub strings of a data string to one or more substrings of a data set; determining that a particular substring of the one or more substrings of the data string corresponds to a highest priority value among one or more priority values mapped to one or more encodings for the one or more substrings of the data string; and encoding, in dependence upon the particular substring of the data string corresponding to the highest priority value, the data string into an encoding that encodes the particular substring of the one or more substrings of the data string.

A method of encoding data includes determining a magnitude of change between a first value associated with first data and a second value associated with second data based on a comparison of the first value and the second value. The first value is encoded into a first set of bits having a first number of bits. The method also includes encoding the magnitude of change into a second set of bits utilizing a sign-interspersed two's complement encoding scheme. The second set of bits has a second number of bits that is less than the first number of bits.

Devices and methods of reducing quantization noise using a pyramid stream encoder are generally described. Groups of D digital symbols are iteratively computed for a digital signal such that each group of symbols minimizes a norm of a weighted residue vector. The weighted residue vector is formed by applying predetermined weighting coefficients to components of a residue vector. Each component is a difference between a sample of the digital signal and a linear combination of different groups of digital symbols with predefined filter coefficients. The norm of the weighted residue vector evaluated at a rate D times slower than a sampling rate of an output signal. The groups of D digital symbols are provided as the output signal.

A system and method for comparing a character from a search space simultaneously to each of a set of search characters. The set of search characters may correspond to a regular expression. In one embodiment, the search space character is encoded to a short binary presentation (e.g., to an 8-bit representation), which is then converted to a long binary representation one bit of which is set, at a first position in the long binary representation corresponding to the value of the short representation. Each character of the set of search characters is similarly encoded and converted to a respective long binary representation. If the bit in one of the long binary representations corresponding to the set of search characters is set, it indicates that the search character matches the corresponding character of the set of search characters.