A predictive model utilizes a set of coefficients for processing received input data. To reduce memory usage storing the coefficients, a compression circuit compresses the set of coefficients prior to storage by generating a cumulative count distribution of the coefficient values, and identifying a distribution function approximating the cumulative count distribution. Function parameters for the determined function are stored in a memory and used by a decompression circuit to apply the function the compressed coefficients to determine the decompressed component values. Storing the function parameters may consume less memory in comparison to storing a look-up table for decompression, and may reduce an amount of memory look-ups required during decompression.

Methods and systems for encoding of integers are discussed. For example, various methods and systems may utilize Huffman coding, Tunstall coding, Arithmetic Coding, LZ77 coding, LZ78 coding, LW coding, or Shannon Fano Elias coding to encode the integers.

Provided is a technique for converting an integer value sequence for encoding/decoding which allows an integer value sequence having a distribution including small values other than a zero value and greatly biased to small values to be encoded with a small average bit number. Provided are: a unary coding unit which subjects an input sequence of non-negative integer values to unary coding to obtain a unary code sequence; a bit reversing unit which replaces a bit value 0 with a bit value 1 and a bit value 1 with a bit value 0 in the bits in the unary code sequence to obtain a replaced code sequence; and a unary decoding unit which subjects the replaced code sequence to unary decoding to obtain a sequence of non-negative integer values.

Mechanisms are disclosed for performing efficient lossless encryption and decryption to reduce power consumption and improve the efficiency of processing streams of digital data. An input data stream associated with a stream of input data is received. A discrete wavelet transform is applied to a first serial input data value in the input data stream. Distributed components of the first serial input data value are distributed by computing a cumulative probability that the first serial input data value is less than or equal to a power-of-two range value associated with a power-of-two probability distribution function. An entropy encoded encryption value is computed based on a range variant asymmetrical numeral system based on the power-of-two probability distribution function. The entropy encoded encryption value is unloaded based on one or more computed next states. Compressed serial output data streams are compressed based on the unloaded entropy encoded encryption value.

Methods and apparatus are provided for unified significance map coding. An apparatus includes a video encoder (400) for encoding transform coefficients for at least a portion of a picture. The transform coefficients are obtained using a plurality of transforms. One or more context sharing maps are generated for the transform coefficients based on a unified rule. The one or more context sharing maps are for providing at least one context that is shared among at least some of the transform coefficients obtained from at least two different ones of the plurality of transforms.

An encoder includes processing circuitry, a block memory, and a frame memory. The processing circuitry defines at least one parameter for each of plural types of segment_ids, splits an image into blocks, assigns, to each of the blocks, segment_id according to a type of the block, among the plural types of segment_ids, and sequentially encodes the blocks. In encoding the blocks, the processing circuitry identifies segment_id of a current block to be encoded, and encodes the current block using the at least one parameter defined for identified segment_id. The at least one parameter includes seg_context_idx for identifying probability information associated with context used in context-based adaptive binary arithmetic coding (CABAC).

Provided is, for example, an arithmetic coding device capable of coding, at high speed, a symbol sequence including a context symbol and a bypass symbol. The arithmetic coding device updates an occurrence probability of a context symbol for a symbol sequence including the context symbol and a bypass symbol; updates a numerical range for the symbol sequence based on the updated occurrence probability; updates the updated numerical range based on a predetermined probability, the numerical range being a basis of an arithmetic code, the numerical range being updated in accordance with the occurrence probability of the context symbol and the predetermined probability for the bypass symbol; and generates an arithmetic code of the symbol sequence based on the updated numerical range in accordance with a procedure of generating the arithmetic code.

An arithmetic encoder is provided for converting an event sequence comprised of a plurality of events to an information sequence comprised of at least one information piece, and includes a core engine for receiving an event of the event sequence, and a probability estimate from a probability estimator, and generating zero or more pieces of the information sequence responsive to the received event and the probability estimate by bounding the ratio of events to information pieces. An arithmetic encoder is provided that is capable of constraining a number of events in at least one event sequence as a function of the number of generated information pieces in at least one information sequence. An arithmetic decoder is provided for converting an information sequence comprised of at least one information piece to an event sequence comprised of a plurality of events, and includes a core engine for processing at least one information piece of the information sequence from the sequencer responsive to a probability estimate received from a probability estimator to generate at least one event by accounting for a bounded ratio of events to information pieces in the information sequence.

A compression coding method, apparatus, and program suitable for continuously coding pieces of fixed length data are provided. The compression coding method includes: dividing, into columns each with a predetermined bit width, records consisting of a fixed-length bit string that includes one or more fields, pieces of data of the same type being contained in the same field among fields determined in advance; and determining, for each column, a probability of occurrence of a bit value in the column at the same position among a plurality of records, and coding the plurality of records on the basis of the probability of occurrence using an entropy coding method.

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.