Abstract: To provide a code amount estimating device which can perform, at high speed and with high precision, estimation of code amount obtained after arithmetic coding. The code amount estimating device includes a context index calculation unit which calculates a context index of a binary symbol included in binary data, and an estimate code amount calculation unit which calculates an estimate code amount for the binary data based on symbol occurrence probability information stored in association with the calculated context index and on a held probability interval range. The estimate code amount calculation unit estimates the code amount for the binary data according to code amount information indicating an association between (i) a combination of a binary symbol string including one or more binary symbols, symbol occurrence probability information, and a probability interval range and (ii) an estimate code amount for the binary symbol string.

Abstract: A method and system are provided for encoding a plurality of integers with variable-length code tables constructed by combining a plurality of structured code tables. Each code table has an associated set of integer values; the sets are disjoint and exhaustive, so that every integer appears in exactly one set. An integer is encoded using the codebook associated with the set in which the integer appears.

Abstract: In a method for encoding and an encoder statistical information is generated and said statistical information (LSB=F(MSB) about the reconstruction values to be used during reconstruction (sometimes called “inverse quantization”) is added to the encoded data signal. The encoded data signal comprises data information providing information on the relation between parts of the original input data removed during quantization and the quantized data. The decoder and decoding method use the information data during reconstruction. This enables reconstruction values to be used during reconstruction that can adapt to the input data statistics thereby improving data reconstruction and reducing the quantization error. The reconstruction at the decoder is guided by information data which is gathered at the encoder, this information data being derived from determining statistical information on the removed parts of the input data in relation to the after quantization remaining quantized data.

Abstract: Incoming decoded data (1), for example from an H264 decoder, is fed to an encoder unit (2) that entropy encodes the decoded data using a parallel encoding scheme that includes context-based arithmetic encoding. The syntax is chosen so that the context does not depend on the immediately previously encoded symbol. The output of the encoder (2) is fed to a FIFO memory whose output is fed to a complimentary decoder (4) whose output produces a delayed copy of the incoming decoded data (1).

Abstract: The invention relates to systems for a transmission of images via channels of communication with a limited capacity by means of application of compression of the images. The technical result consists in an increase of the compression degree upon encoding, and it allows to fulfill the transmission of such encoded images via the channel of communication with the limited capacity, therewith a high degree of the compression is provided without of increase of computational power of encoding device and without of distortions upon decoding. The result is obtained by the usage of more effective method of interpolation of restored subsamples, in this method there is used an adaptive and applicative set of samples, which restore a quantized signal, and this set of the samples allows to improve an accuracy of the interpolation with a number of the subsamples, which is necessary for the right interpolation that is simultaneously decreased one.

Abstract: Embodiments described herein may include example embodiments of a method, article and apparatus for compressing data utilizing a combinatorial encoder with specified occurrences which may be used for communicating between two or more components connected to an interconnection medium (e.g., a bus) within a single computer or digital data processing system, and/or for communication between computing platforms via a network or other interconnection medium.

Abstract: Embodiments described herein may include example embodiments of a method, article and apparatus for compressing data utilizing combinatorial coding with specified occurrences which may be used for communicating between two or more components connected to an interconnection medium (e.g., a bus) within a single computer or digital data processing system, and/or for communication between computing platforms via a network or other interconnection medium.

Abstract: Provided are a method and an apparatus for selectively encoding/decoding point sequences to maximize bit efficiency of a lightweight application scene representation (LASeR) binary stream. The point sequence encoding method includes the steps of: for each point sequence, (a) selecting one of exponential-Golomb (EG) encoding and fixed length (FL) encoding schemes; (b) when the FL encoding scheme is selected, encoding the point sequence using the FL encoding scheme to generate a binary stream; and (c) when the EG encoding scheme is selected, encoding the point sequence using the EG encoding scheme to generate a binary stream. The binary stream includes a flag indicating which encoding scheme is selected and a parameter k, with which the EG encoding can be most effectively performed, when the EG encoding scheme is selected. According to the encoding method, LASeR point sequences can be efficiently encoded and, during a decoding process, a large overhead is not incurred to a decoder (terminal).

Abstract: A system is disclosed for context-based adaptive binary arithmetic encoding and decoding. The system comprises a calculating device configured to calculate an index value for one of a first bin to be encoded and a second bin to be decoded, a memory device to store context models in cluster, wherein the index value for one of the first bin and the second bin is related to one of the context models, and a binary arithmetic unit configured to serve as one of an encoder for encoding the first bin based on the one context model and a decoder for decoding the second bin based on the one context model.

Abstract: The present invention provides methods for universal lossy compression that provide performance at or near the rate-distortion limit and that are based on universal, implementable lossy source coding algorithms.

Abstract: A method for communicating data is provided that includes receiving a plurality of bits associated with a communications flow and applying a variable size codebook for stateful compression or for stateless compression. The method also includes determining if a match exists between the plurality of bits and a selected one of a plurality of bit patterns and communicating a payload present (PP) header bit pattern corresponding to the selected bit pattern in place of the plurality of bits associated with the communications flow.

Abstract: A method and apparatus to scalably encode or decode an audio signal or a video signal. A signal distribution is considered after binarization is performed based on a tree structure. Thus, a decoding end can minimize generation of quantization errors and restore an original signal. In addition, only frequency components perceptually important in terms of human hearing are set to an upper layer and encoded without decreasing a bandwidth which is restored from an upper layer. Therefore, sound quality can be increased by decreasing quantization noise while maintaining a relatively large frequency bandwidth, and the degradation of a compression performance is prevented.

Abstract: The present invention relates to a data compression and decompression system and method for lossless compressing digital data. In one preferred embodiment, the method for handling a data stream having a number of data objects comprising a step of performing a compressing process on a data object based on a compression based value to obtain at least one compressed data result, wherein the data object is considered as one numerical value. The device for handling the data stream comprising a compression means for compressing the data objects according to a compression base value. In another preferred embodiment, the method for handling data having a number of data objects comprising a step of performing a compressing process on a data object by obtaining a compression code for the data object according to a compression coding table, wherein the data object is considered as one numerical value.

Abstract: An input stream of characters is received. A new string entry is added to a data structure based on a current portion of the input stream if the current portion fails to match any of a plurality of existing string entries in the data structure. An additional string entry is added to the data structure based on a combination of the current portion and a previous portion of the input stream, wherein the additional string entry corresponds to a subset of the combination that fails to match any of the plurality of existing string entries in the data structure. An output stream is generated that includes literal values of the characters and index values corresponding to string entries in the data structure that match portions of the input stream.

Abstract: The present invention relates to a system for the parallel processing of a number of binstream bins comprising: (a) inputs for receiving the codIOffset, the codIRange and the bitstream suffix bits; (b) a first circuit for the parallel processing of said number of said bitstream suffix bits, said codIOffset, and said codIRange for producing an indication of the binstream suffix length magnitude; (c) a second circuit for the parallel processing of said number of said bitstream suffix bits, said codIOffset, and said codIRange for producing said number of speculative codIOffsets; (d) a third circuit for combining the products of said first circuit and the products of said second circuit for producing a new codIOffset; and (e) a fourth circuit for combining the products of said first circuit with said number of constants for producing a number indicative of the binstream suffix length.

Abstract: An entropy decoding module includes a binary arithmetic coding module that generates a bin string by pipeline processing a bit stream, based on a clock signal and based on context model information. A binarization and context modeling module generates a stream of syntax elements and the context model information based on the bin string.

Abstract: One embodiment of the invention concerns performing renormalization in content adaptive binary arithmetic coding (CABAC) only after multiple bins are processed.

Abstract: A method of context adaptive binary arithmetic coding and decoding groups a plurality N binary symbols in corresponding syntax elements and divides a range into 2N subranges based upon corresponding contexts. The invention encodes data by selecting an offset determined by the probability states of the context of the N binary symbols. Decoding is similar with the place of the coded offset within the 2N subranges determining the syntax decoding. When the total number of binary symbols to be coded does not equal an integral multiple of N, the invention codes dummy binary symbols at the end of a grouping of a plurality N binary symbols. Probability state updates occur only following every N binary symbols.

Abstract: This apparatus includes a generator which generates a reference matrix having a correlation with an information matrix to be coded from the information matrix. A classifier classifies matrix components around the ith row component of the reference matrix, and generates a set of matrix components equal in distance from the ith row component. A calculator forms a context tree including a plurality of internal nodes corresponding to the matrix components of the set, and a plurality of branches and a plurality of leaf nodes which have one-to-one correspondence with the symbols of the components, associates a sequence of the symbols with a path extending from the leaf node to the root node of the context tree, and calculates the coding probability of the ith row/jth column component of the information matrix. A coder arithmetically codes the ith row/jth column component of the information matrix in accordance with the coding probability.

Abstract: A method and apparatus for audio signal processing by applying log companding on spectral domain or time domain representations of the audio signals to provide an encoded audio signal, which is decoded upon receipt. A frequency domain representation or time domain representation of the audio signal is computed by separating the audio signal into specific frequency bands, each having a coefficient. Log companding with different compression ratios is performed on each coefficient to provide an encoded signal. Upon receipt of the encoded signal, inverse log companding and time frequency or time scale reconstruction are performed to provide the audio signal.

Abstract: The present invention relates to a method, computer program product and system for the compression of a probability table and the reconstruction of one or more probability elements using the compressed data and method. After determining a probability table that is to be compressed, the probability table is compressed using a first probability table compression method, wherein the probability table compression method creates a first compressed probability table. The first compressed probability table contains a plurality of probability elements. Further, the probability table is compressed using a second probability table compression method, wherein the probability table compression method creates a second compressed probability table. The second compressed probability table containing a plurality of probability elements.

Abstract: A method of video decoding is provided that includes receiving a data stream comprising a sequence of syntax elements that were compressed using context-adaptive binary arithmetic coding (CABAC), such that the encoding of each bin of a bin string representative of a syntax element was performed by arithmetic encoding. Two consecutive bins of a syntax element are decoded in parallel. Speculative computation and prefetching is used to reduce the critical path and thereby improve processing speed.

Abstract: Embodiments described herein may include example embodiments of a method, article and apparatus for compressing data utilizing adaptive combinatorial encoding with either specified occurrences or specified data length which may be used for communicating between two or more components connected to an interconnection medium (e.g., a bus) within a single computer or digital data processing system, and/or for communication between computing platforms via a network or other interconnection medium.

Abstract: Embodiments described herein may include example embodiments of a method, article and apparatus for compressing data utilizing a combinatorial encoder with specified occurrences which may be used for communicating between two or more components connected to an interconnection medium (e.g., a bus) within a single computer or digital data processing system, and/or for communication between computing platforms via a network or other interconnection medium.

Abstract: Embodiments described herein may include example embodiments of a method, article and apparatus for compressing data utilizing combinatorial coding with specified occurrences which may be used for communicating between two or more components connected to an interconnection medium (e.g., a bus) within a single computer or digital data processing system, and/or for communication between computing platforms via a network or other interconnection medium.

Abstract: A coding apparatus that codes video data using an arithmetic coding scheme such as the AVC standard includes an orthogonal transformation unit, a quantizer, an arithmetic coder, and a controller. The arithmetic coder includes a binarization unit, a binary arithmetic coder, and a code length predictor. The code length predictor outputs a predicted number of bits by evaluating a predictive function using, as the argument of the function, the bin size of the binary symbols generated from input data during coding. The controller controls the coding bit rate by changing the quantization scale of the quantizer on the basis of the predicted number of bits. The predictive function is defined such that the predicted number of bits increases as the bin size increases, and furthermore such that the polynomial degree of the function changes when the bin size exceeds a predefined threshold value.

Abstract: A method and apparatus for compressing data is described. In one embodiment, a processor receives one or more strings of data to be compressed. Duplicate strings are replaced with pointers using a first compression algorithm. An output of the first compression algorithm is processed with a second compression algorithm using a variable context dynamic encoder to generate a tree of non-overlapping bit-sequences where the length of each sequence is being inversely proportional of the likelihood of that symbol needing to be encoded. Unused symbols are not generated on the tree.

Abstract: A method for multiple image restoration includes receiving a plurality of images corrupted by noise, and initializing a reduced noise estimate of the plurality of images. The method further includes estimating a probability of distributions of noise around each pixel and the probability of the signal, estimating mutual information between noise on the plurality of images based on the probabilities of distributions of noise around each pixel and the joint distribution of noise, and updating each pixel within a search range to determine a restored image by reducing the mutual information between the noise on the plurality of images.

Abstract: Disclosed is a method for constructing Slepian-Wolf codes, wherein the designed Slepian-Wolf codes are robust to mismatched decoding. The disclosed method for constructing Slepian-Wolf codes includes the steps of: choosing representative probability distributions from a set of possible probability distributions; choosing a probability distribution as a decoding metric; converting the chosen decoding metric to a cyclic-symmetric channel; computing the initial message value given the cyclic-symmetric channel; computing a set of probability distributions of the initial message given the initial message values and the representative probability distributions; optimizing the degree distribution given the set of probability distributions of the initial message; optimizing the decoding metric.

Abstract: A method for improving variable length decoding performance is provided. A variable length decoding module decodes a coded data to obtain a decoded data and a subsequent module receives the decoded data to perform further processing. A buffering module is coupled between the variable length decoding module and the subsequent module, and buffers the decoded data decoded by the variable length decoding module. A read part of the buffering module is cleared so that a content of an unused area of the buffering module is a predetermined value when the subsequent module reads the decoded data from the buffering module, wherein the unused area is a part of the buffering module except for the unread decoded data. The variable length decoding module does not write zero values of the decoded data into the buffering module when the variable length decoding module reads a zero output instruction among the coded data.

Abstract: A lossless coding and/or decoding apparatus and method. The lossless coding apparatus may read a probability model corresponding to each of a plurality of context groups. Here, the probability model stored in a memory may be generated by grouping a context. The lossless coding apparatus may code a symbol using the probability model and generate a bitstream. The lossless coding apparatus may enhance coding efficiency and reduce an amount of space utilized by the memory.

Abstract: An encryption device and method and decryption device and method which implement a bit-based encryption scheme and hardware design. The encryption device includes a random number generator, receiving a main key, determining a working key using at least one random number and outputting a working key, a model, receiving the main key, the working key and plain text to be encoded and generating at least two frequency counts. The encryption device further includes an encoder, which outputs encoded text based on the working key, the plain text and the at least two frequency counts. The encryption device and method and decryption device and method process encrypted text that is based upon a stream structure with an unlimited key length and may be compressed by 50%. The encoded text is changeable with different environments even for the same plain text and the same key. Operations of the hardware design are based on arithmetic additions and shifts, and not multiplications and divisions.

Abstract: A method for coding a message of a plurality of m-state symbols into a coded message of n-state symbols wherein n>m is disclosed. A method to make the distribution of states of n-state symbols a uniform distribution is also disclosed. A coding rule is initiated based on a distribution of states of m-state symbols. A method of coding the coding rule by transposition is also provided. In one embodiment a coded message of n-state symbols has symbols that each have a unique state. A system for executing the coding and decoding methods is also disclosed.

Abstract: A lossless audio coding and/or decoding method and apparatus are provided. The coding method includes: mapping the audio signal in the frequency domain having an integer value into a bit-plane signal with respect to the frequency; obtaining a most significant bit and a Golomb parameter for each bit-plane; selecting a binary sample on a bit-plane to be coded in the order from the most significant bit to the least significant bit and from a lower frequency component to a higher frequency component; calculating the context of the selected binary sample by using significances of already coded bit-planes for each of a plurality of frequency lines existing in the vicinity of a frequency line to which the selected binary sample belongs; selecting a probability model by using the obtained Golomb parameter and the calculated contexts; and lossless-coding the binary sample by using the selected probability model.

Abstract: Techniques for improving encoding and decoding data are described herein. According to one embodiment, it is determined whether a current context can encode a retrieved symbol. The current context includes a plurality entries, each representing an encoded symbol, including a count value representing a frequency of the entry being used. A code is generated to a code stream, where the code represents a difference between an index of an entry in the current context associated with the retrieved symbol and a previous index used for encoding a previous symbol, if the current context can encode the retrieved symbol. A count value corresponding to the entry associated with the retrieved symbol is incremented in the current context. The current context is sorted based on count values of all entries in the current context, where the code stream and the literal stream are to be compressed and encoded by a compressor.

Abstract: Embodiments of decoding systems and methods are disclosed. One system embodiment, among others, comprises a software programmable core processing unit having a context-adaptive binary arithmetic (CABAC) unit configured to execute a shader, the shader configured to implement CABAC decoding of a video stream and provide a decoded data output.

Abstract: A system for the context-based for the context-based encoding of an input signal includes a domain transform module and a context-based coding module. The domain transform module is operable to convert the input signal into a sequence of transform coefficients c[i]. The context-based coding module includes a bit-plane scanning module, and context modeling module, and a statistical encoding module. The bit-plane scanning module is operable to produce a bit-plane symbol bps [i,bp] for each transform coefficient c[i] and each bit-plane [bp]. The context modeling module is operable to assign one or more context values to each of the received bit plane symbols bps [i,bp]. The statistical coding module is operable to code each of the bit plane symbols bps [i,bp] as a function of one or more of the corresponding context values to produce a context-based encoded symbol stream.

Abstract: What is disclosed is a novel system and method for performing renormalization in a data entropy reduction process of an image in a compression path. An accumulator is used for one of arithmetic encoding and decoding according to an arithmetic coding process and a number of most significant bits of the accumulator represents an output segment. If processing an input data symbol is determined to be able to cause a change in a value of the output segment, the encoding range is changed. If the size of the encoding range portion that can cause the output segment value to change is less than the size of the portion of the encoding range that fails to cause the change, the encoding range is limited to the size that can cause the change. Otherwise, the encoding range is set to the size that fails to cause the change.

Abstract: A method for designing a keyboard for efficient data entry. A user inputs data from a predefined set of characters such as letters or symbols on an input device by pressing one or more keys, in a sequential fashion, for each character. Based on the frequency of occurrence for each character, a prefix-free coding is used to generate an optimal or near-optimal key sequence mapping for the given character set. In one exemplary embodiment, eight to twelve keys from a phone keypad are used to generate English alphabets, which substantially reduces the average number of keystrokes per character. The present invention enables the user to efficiently input typical data from a given probability distribution of characters using a limited number of keys.

Abstract: A system and method for realizing a Wyner-Ziv encoder may involve the following steps: (a) apply nested quantization to input data from an information source in order to generate intermediate data; and (b) encode the intermediate data using an asymmetric Slepian-Wolf encoder in order to generate compressed output data representing the input data. Similarly, a Wyner-Ziv decoder may be realized by: (1) applying an asymmetric Slepian-Wolf decoder to compressed input data using side information to generate intermediate values, and (b) jointly decoding the intermediate values using the side information to generate decompressed output data.

Abstract: An entropy decoding module includes a binary arithmetic coding module that generates a bin string by pipeline processing a bit stream, based on a clock signal and based on context model information. A binarization and context modeling module generates a stream of syntax elements and the context model information based on the bin string.

Abstract: An encoding device and method, of CABAC type, for an initial stream of binary digital information intended to generate an outgoing stream to form video images, after decoding, the method included the following steps: bit-by-bit analysis of the successive series of bits of the initial binary stream so as to deduce therefrom, for each bit, an interval representing the probability of occurrence associated with this bit, this interval being defined by its size CIR and its lower bound CIL, analysis of this interval so as to ensure, if necessary, a renormalization thereof. The renormalization is non-iterative and for each bit of the initial stream is compliant with the appended figure in which: M is the length of the sequence S of high-order bits common to CIL and CIR, N is the integer number such that CIR.2N-1<0.25?CIR.2N, BO is the number of bits waiting to be inserted.

Abstract: A scalable quantizer is generated from a plurality of context models for each of a plurality of bit rates used in coding a source. A context model for a lower bit rate quantizes conditioning states when there is no compression gain in coding the image using child conditioning states in the higher bit rate context model over a parent conditioning state to which they may be quantized. The scalable quantizer includes a basic context model for a lowest anticipated bit rate and enhancement bits indicating how to adapt the basic context model to derive context models for higher bit rates. For image data transformed with embedded wavelet coding, context events are selected from corresponding or neighboring pixels at different resolutions and in different bit planes, and the order of the context events is optimized to reduce conditional entropy between the context events and the current value.

Abstract: A decoder comprises a grouping module that groups an input signal into a plurality of blocks and a plurality of permutation symbols, wherein the plurality of blocks include N symbols and wherein each of said N symbols has one of q symbol values, where q and N are integers greater than two. A permutation module inverse permutes a first block of the plurality of blocks based on one of the plurality of permutation symbols and generates a decoded output signal based on the permutation.

Abstract: An embodiment of the invention relates to a process for compression of executable code by a microprocessor, comprising steps consisting of decomposing the executable code into words; compressing each word of executable code, each compressed word of executable code comprising a part of predefined fixed length and a part of variable length whereof the length is defined by the part of fixed length; and combining all the parts of fixed length and all the parts of variable length of the words respectively into a block of parts of fixed length and in a block of parts of variable length, the respective positions of at least certain parts of variable length in the block of parts of variable length being saved in an addressing table.

Abstract: Disclosed herein is an arithmetic decoding device including: an arithmetic decoding unit configured to decode coded data resulting from arithmetic coding on a basis of a context variable indicating a probability state and a most probable symbol; a plurality of arithmetic registers configured to supply the context variable to the arithmetic decoding unit and retain a result of operation by the arithmetic decoding unit; and a plurality of save registers configured to save contents retained in the arithmetic registers.

Abstract: The invention is directed at a method and apparatus for determining compression state information which is to be used in the compression of data being transmitted between two communicating parties. The method of determining the compression state information for use in interactively compressing data comprises the steps parsing the data to determine a hierarchical data structure of the data; traversing a shared hierarchical node index to determine common compression state information entries between the hierarchical data structure and the hierarchical node index; and selecting at least one of the common compression state information entries for use in compressing the data.

Abstract: A system that encodes a sequence of integers using a variable-length compression technique is described. During operation, the system scans the sequence of integers and observes the sizes of the integers to determine a threshold value K from the observed sizes. For a given integer which is N bits in length, if N?K is greater than or equal to zero, the system generates a tag for the encoded integer which comprises a sequence of N?K zeros followed by a one, and generates a set of remaining bits for the encoded integer as a sequence of the N bits which make up the integer. Otherwise, if N?K is less than zero, the system generates a tag for the encoded integer as a single one, and generates a set of remaining bits for the encoded integer by padding the N bits which make up the integer with zeros so that the set of remaining bits is K bits in length.

Abstract: Systems and methods for optimizing system performance in variable length decoding systems are described. Embodiments are described in which decode tables are analyzed and elements of the tables sorted by probability of occurrence. Storage of elements can be determined by probability of occurrence and embodiments of the present invention can optimize system efficiency by storing most likely entries into fast-memory and least likely entries in slowest memory. In certain embodiments, a single large table is provided that cannot fit into decoder fast-memory. In some embodiments, individual elements can be optimized for storage in fast-memory by selecting more frequently occurring entries or groups of entries into decoder memory.

Abstract: In a bit stream syntax containing compressed video slice data for compressed video data of a slice structure, a slice header for compressed video slice data has attached thereto a slice start code, a register reset flag indicating whether a register value, which designates a status of a codeword occurring in an arithmetic coding process, should be reset in the next transmission unit, an initial register value which indicates a register value to be used to start arithmetic coding/decoding to build/decompose the next transmission unit, only when the register reset flag indicates that the register should not be reset.