Abstract: Provided are a method and apparatus for quantization encoding and de-quantization decoding using a trellis. Unlike a trellis coded quantization (TCQ) index, by classifying quantization levels to which cosets are allocated and allocating indexes to the quantization levels so that a coset corresponding to a specific branch in a predetermined state in the trellis can be selected with only indexes without encoding or decoding information on paths, quantization encoding and de-quantization decoding are performed by using a new index.

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: A CABAC-type encoding device for encoding an initial flow of binary digital information for generating an output flow for forming video images after decoding, includes: elements for analyzing successive sequences of bits of the initial binary flow, bit-by-bit, and for deducing, for each bit, an interval representing the occurrence probability associated with the bit, the interval being defined by the size thereof and the lower boundary thereof; elements for analyzing the interval and ensuring a renormalization thereof. The elements for ensuring the renormalization include: a reference table containing, for each possible value of the lower boundary and the size, sequences of bits to be inserted into the output flow, and the number of unknown bits waiting to be inserted for this specific renormalization step; and elements for determining the address of the data, in this reference table.

Abstract: A system for reducing storage requirements for content-adaptive binary arithmetic coding (CABAC) is provided. The system includes a transcode engine performing CABAC on a video data stream. The transcode engine receives save data, stops CABAC, and converts the video data stream into sub-network abstraction layer (NAL) unit state data. An entropy state data storage system receiving the sub-NAL unit state data and stores the sub-NAL unit state data. The transcode engine subsequently receives restore data, extracts the sub-NAL unit state data from the entropy state data storage system, and re-starts CABAC on the video stream data.

Abstract: A denoising process or system uses convex optimization to determine characteristics of a clean signal. In one embodiment, a noisy signal that represents a set of symbols can be scanned to determine an empirical vector with components respectively indicating respective empirical probabilities of symbols in the noisy signal that occur in a particular context. A convex optimization process can then identify a vector such that a difference between the empirical vector and a product of the identified vector and a channel matrix is minimized. The identified vector can be used to determine when a symbol in the noisy signal should be replaced when assembling a reconstructed signal.

Abstract: A context-based adaptive binary arithmetic coding (CABAC) method. The CABAC method for a bitstream comprises: detecting a control signal (Sig_first); decoding a first bin representing one of a first coefficient flag (Sig) and a second coefficient flag (Last) from the bitstream according to the control signal (Sig_first); decoding a second bin representing one of the second coefficient flag (Last) and a next first coefficient flag (Sig) from the bitstream according to the decoded first bin and the control signal (Sig_first); and updating the control signal (Sig_first) according to the decoded first and second bins. The first and second bins are decoded in one clock cycle, the first coefficient flag (Sig) indicates whether a corresponding coefficient value is zero, and the second coefficient flag (Last) indicates whether a coefficient map decoding process is finished.

Abstract: A modem architecture and applicable method use microlet transforms to encode and exchange data or information. An encoder determines the probability states of a quantum representation, and uses the states to represent data in lossless manner. A block of data is reduced to a smaller size of data by the encoding, in some instances, to single bit. The encoder can be used in conjunction with existing networks and infrastructure.

Abstract: Methods and apparatus for entropy decoding are disclosed. Compressed input data representing one or more signals is loaded into one or more registers. A first candidate value for a most probable signal case is prepared from the input data. A second candidate value for a least probable signal case is prepared from the input data. A final signal value for the one or more signals is selected from the first and second candidate values and an output bin value is generated based on the final signal value. A processor readable medium having embodied therein processor readable instructions for implementing the method for entropy decoding is also disclosed. In addition, a method of avoiding a branch instruction in an electronic processing algorithm is disclosed.

Abstract: A method for coding spatial and quality enhancement information in scalable video coding using variable length codes. Conventional systems have been capable of using variable length codes only with nonscalable video coding, In the present invention, the coded block pattern for each block of information, significance passes, and refinement passes can all be coded with different types of variable length codes. The present invention also provides for a variable length encoder/decoder that dynamically adapts to the actual symbol probability. The encoder/decoder of the present invention counts the number of times each symbol is coded. Based upon these counts, the encoder/decoder selects how many symbols to group when forming a code word. The encoder also uses these counts to select the specific codeword that should be used.

Abstract: An image coding apparatus includes a variable length coding section, an arithmetic coding section and a common buffer memory. The variable length coding section inputs image data and outputs a binarized code sequence applied with variable length coding. The arithmetic coding section applies arithmetic coding to the binarized code sequence outputted from the variable length coding section. The common buffer memory transmits and receives data between the variable length coding section and the arithmetic coding section.

Abstract: A method of coding audio and/or video data. A data symbol may be coded using an exponent and a residual, in which the exponent is coded using a variable length code, such as but not limited to a Huffman code or a Golomb code. The variable length code may be adaptive and may code according to probabilities or frequencies of occurrence of the data symbol.

Abstract: Disclosed herein is an arithmetic decoding apparatus that decodes encoded data while updating first and second state variables based on first and second context variables. The first context variable represents a probability state. The second context variable represents a most probable symbol. The arithmetic decoding apparatus includes: a decoding information table that stores transitions of a range of the most probable symbol and a range of a least probable symbol within a range identified by the first context variable, and a number of a symbol for which the range of the most probable symbol becomes less than a specific value; a number-of-symbols determination section configured to determine the number of symbols in the encoded data that are to be decoded collectively; and an output section configured to decode and output a symbol corresponding to the number of symbols that are to be decoded collectively.

Abstract: An apparatus for processing a signal and method thereof are disclosed. Data coding and entropy coding are performed with interconnection, and grouping is used to enhance coding efficiency. The present invention includes the steps of obtaining index information and data and entropy-decoding the index information and identifying an entropy table corresponding to the entropy-decoded index information and entropy-decoding the data using the identified entropy table.

Abstract: A system and method that process encoded data, wherein the encoded data is an encoded video stream. The encoded data may be buffered and the characteristics of the buffered encoded data may be determined and used to select a decoding table from a plurality of decoding tables. An encoded word may then be decoded using the selected decoding table. The output of the decoding table may be the corresponding decoded word and the size of the encoded word. The size of the encoded word may be utilized to shift the buffered encoded data. The decoded word may be sent to the appropriate portion of the system.

Abstract: A system for, and method of, entropy coding. In one embodiment, the system includes: (1) a memory configured to contained initialized accumulated statistics coding variable values and (2) a processor configured to employ the initialized accumulated statistics coding variable values to context-adaptive encode multiple symbols until an accumulated statistics update condition occurs and updating and store the accumulated statistics coding variable values in the memory only upon occurrence of the accumulated statistics update condition.

Abstract: The performance (compression ratio) of an entropy coding compressor can be improved by separating its output into two streams: encoded output symbols compressed according to a probability model, and literal symbols that were not present in the probability model when the corresponding input symbol was to be encoded. The literal symbols are collected into a group and compressed separately. The compressed literals are stored at a discernable place relative to the encoded output symbols (e.g., at the beginning or end of the sequence of encoded output symbols).

Abstract: Apparatus and method for generating multiple descriptions of compressed data is disclosed. In the apparatus and method, transform coefficients are generated from input data and quantized. An energy distribution of the quantized transform coefficients is generated. Based on the energy distribution, the transform coefficients are grouped into layers. By entropy coding different number of layers, multiple descriptions of compressed data are generated.

Abstract: A binary coding and decoding method and apparatus for MVD (Motion Vector Difference) absolute values, includes: dividing symbols for MVD absolute values to be coded into a plurality of subsets according to probability distribution properties; assigning a binary codeword for each subset; assigning a binary codeword for each symbol in each subset; concatenating and outputting the binary codeword for each subset and the binary codeword for each symbol in the subset, as the binary coding result. At the decoding side, decoding operations are performed by using a principle corresponding to that at the coding side. In this manner, the invention makes full use of the source properties on one hand, and effectively prevents the codeword length from being too long on the other hand. It has been experimentally testified that a better compression effect may be achieved during arithmetic coding process and thus the image coding performance may be improved effectively.

Abstract: A method for compressing information is provided that includes receiving a plurality of bits associated with a communications flow and determining if a match exists between the plurality of bits and a selected one of a plurality of bit patterns. A header bit segment that corresponds to the selected bit pattern may be communicated in place of the plurality of bits associated with the communications flow.

Abstract: During high performance renormalization for video encoding, renormalization may involve detecting a leading number of ‘0’s in a range value of an input stream of symbols, a run of ‘1’s in an offset value of the input stream of symbols, and a run of ‘0’s following the run of ‘1’in the offset value. A bitstream may be outputted based on an iteration window for a number of renormalization iterations. The iteration window may comprise a bit range after the run of ‘1’s in the offset value, and the number of renormalization iterations may be based on the leading number of ‘0’s in the range value. A run of ‘1’s followed by one or more ‘0’s may be identified as a particular pattern.

Abstract: A decoding method is adapted to be implemented using a Context-based Adaptive Binary Arithmetic Coding (CABAC) decoding apparatus, and includes: initializing a plurality of context variables; storing the context variables; performing arithmetic decoding of a syntax element according to the context variables so as to output a decoded syntax element and an update signal; and updating at least one of the context variables according to the update signal. At least one of the context variables is pre-initialized in the initializing step before a bit stream ready.

Abstract: Apparatus and methods are described for network content in dictionary-based (de)compression. Content for compression is parsed into discrete constructions, such as phrases, words, etc. The discrete constructions are passed to a searching engine to locate network information at one or more network locator identities, such as URI's (URL's, URNs) that correspond to the discrete constructions. Upon locating the network information, a dictionary of entries corresponding to the content is created. The content is encoded from the dictionary by indicating raw or relative offsets into the network information per each of the network locator identities. Decoding occurs anti-symmetrically to the encoding. In this manner, the vastness of network content, e.g., the world wide web, is leveraged to provide relevant dictionaries for de-/encoding. Searching for candidate dictionaries, scoring same and safeguarding against volatile dictionary content are other noteworthy features.

Abstract: Methods and apparatus for entropy decoding are disclosed. Compressed input data representing one or more signals is loaded into one or more registers. A first candidate value for a most probable signal case is prepared from the input data. A second candidate value for a least probable signal case is prepared from the input data. A final signal value for the one or more signals is selected from the first and second candidate values and an output bin value is generated based on the final signal value. A processor readable medium having embodied therein processor readable instructions for implementing the method for entropy decoding is also disclosed. In addition, a method of avoiding a branch instruction in an electronic processing algorithm is disclosed.

Abstract: Methods and apparatus for decoding codewords using message passing decoding techniques which are particularly well suited for use with low density parity check (LDPC) codes and long codewords are described. The described methods allow decoding graph structures which are largely comprised of multiple identical copies of a much smaller graph. Copies of the smaller graph are subject to a controlled permutation operation to create the larger graph structure. The same controlled permutations are directly implemented to support message passing between the replicated copies of the small graph. Messages corresponding to individual copies of the graph are stored in a memory and accessed in sets, one from each copy of the graph, using a SIMD read or write instruction. The graph permutation operation may be implemented by simply reordering messages, e.g.

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

Abstract: The performance (compression ratio) of an entropy coding compressor can be improved by separating its output into two streams: encoded output symbols compressed according to a probability model, and literal symbols that were not present in the probability model when the corresponding input symbol was to be encoded. The literal symbols are collected into a group and compressed separately. The compressed literals are stored at a discernable place relative to the encoded output symbols (e.g., at the beginning or end of the sequence of encoded output symbols).

Abstract: An entropy encoder module (350) is configured to completely perform normalization of each binary input in a single clock cycle for Context Adaptive Binary Arithmetic Coding (CABAC). Outstanding bits are separated out from other bits of a portion of a frame for Context Adaptive Binary-Arithmetic Coding (CABAC). The outstanding bits are parsed responsive to location marking, counting, and bit masking to provide insert bits. The insert bits are inserted into the encoded bitstream for output. A Context Adaptive Binary Arithmetic Coding (“CABAC”) system includes: digital information storage (301) having digital video information stored therein; and a CABAC encoder (200) coupled to the digital information storage (301) to receive a portion of the digital video information at a time.

Abstract: Encoding and decoding of an audio signal or a video signal. By performing entropy encoding and decoding based on a tree structure, coding efficiency is increased, complexity is reduced, and additional information can be reduced.

Abstract: A decoding apparatus for arithmetically decoding input coded data into symbol data by using a state variable and a context variable includes: a first decoding unit executes arithmetic decoding processing by using the state variable and the context variable and outputs first symbol data, and outputs the state variable and the context variable, which are updated by the arithmetic decoding processing, as a first state variable and a first context variable; and a second decoding unit executes arithmetic decoding processing by using the first state variable and the first context variable and outputs second symbol data, and outputs the first state variable and the first context variable, which are updated by the arithmetic decoding processing, as a second state variable and a second context variable. Whether to employ the second symbol data as a decoding result is determined based on the value of the first state variable.

Abstract: A method for performing parallel processing of at least two bins in an arithmetic coded bin stream includes: utilizing a current range to calculate a range for a first bin in the bin stream; simultaneously utilizing the current range to forward predict a plurality of possible ranges and low values for a second bin in the bin stream when the first bin is an MPS; when the range for the first bin is calculated, utilizing the calculated range to select a resultant range from the plurality of possible ranges and low values for the second bin.

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 debinarizer and a hardware-based method for debinarizing a binary bit stream into symbols comprising predefined binary sequences are disclosed in which predefined binary sequences and their corresponding symbols are represented as tree structures. A binary sequence is debinarized by traversing one of the tree structures to determine a corresponding symbol. Similar tree structures may be combined to form a single tree structure. The tree structures may be implemented as a finite state machine.

Abstract: A digital decoding apparatus and method receives a compression-coded digital signal in predetermined units and decodes the received compression-coded digital signal in the predetermined units. The compressed-received digital signal is coded in the predetermined units with updating a table of probability of occurrence which is assigned for each coding symbol. An arithmetic decoding unit initializes a decoding process when decoding of signal in the predetermined units is started, based on information of initializing the table of probability of occurrence which is multiplexed on a header of data for the predetermined units and information of initializing a register value which shows the arithmetic decoding process.

Abstract: Briefly, within a computer or digital data processing system, embodiments describe a method, article and apparatus for compressing data is described, 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 communicating between two or more computers or digital data processing systems via an interconnection medium such as a network.

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: An entropy encoding apparatus comprises: a binarization unit configured to convert an input syntax element into binarized data; a context calculation unit configured to generate a context index; a context memory unit configured to hold context information; and an arithmetic coding unit configured to perform arithmetic coding using context information output corresponding to the generated context index, and the binarized data, is provided. The context memory unit comprises: a storage unit, an initial value generation unit configured to generate an initial value of context information, a control unit configured to output a control signal specifying which to select between the initial value and the context information which corresponds to the generated context index, a selection unit configured to select either of the initial value or the context information which corresponds to the generated context index, an updating unit configured to generate updated context information.

Abstract: Various embodiments of decoding systems and methods are disclosed. One system embodiment, among others, comprises a macroblock decode module configured to decode a plurality of context adaptive binary arithmetic coding (CABAC) encoded symbols corresponding to a slice without processor intervention.

Abstract: A method and systems are provided for efficiently implementing content adaptive variable length coding on a modern processor. Some embodiments comprise encoding a non-zero coefficient in an array of coefficients in an iteration of an encoding loop. The code value of the encoded non-zero coefficient is determined, at least in part, by the magnitude of another non-zero coefficient in the array of coefficients. A run of zero coefficients preceding a non-zero coefficient in the array of coefficients is also encoded in the iteration of the encoding loop. The encoded non-zero coefficient is appended to an encoded video bitstream when encoded. The encoded run of zero coefficients is stored in a storage device and appended to the encoded video bitstream after all non-zero coefficients in the array of coefficients have been encoded.

Abstract: Techniques for optimizing the Context-based Adaptive Binary Arithmetic Coding (CABAC) bitstream decoding are disclosed. In one configuration, a device has a first processing circuit operative to decode a Context-based Adaptive Binary Arithmetic Coding (CABAC) bitstream into an intermediate signal having a CABAC decoded standard format and a decoded order. A second processing circuit decodes the intermediate signal using a non-CABAC decoding standard. A buffer is provided between the first and second processing circuits to improve processing speeds.

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: Denoising such as discrete universal denoising (DUDE) that scans a noisy signal in an attempt to characterize probabilities of finding symbol values in a particular context in a clean signal can perform a rough denoising on the noisy signal and identify contexts from a roughly denoised signal. The rough denoising improves estimation of the statistical properties of the clean signal by reducing the false differentiation of contexts that noise can otherwise create. Statistical information regarding occurrences of symbols in the noisy signal and corresponding contexts in the roughly denoised signal can then be used to denoise the noisy signal. The specifics of the rough denoising can be chosen based on knowledge of the noise or of the clean data. Alternatively, the DUDE can be used in an iterative fashion where the denoised signal produced from a prior iteration provides the contexts for the next iteration.

Abstract: A method and device to arithmetically decode scalable bit sliced arithmetic coding (BSAC) audio data are provided. The arithmetic decoding method includes checking whether all side information of a last layer of the BSAC audio data is to be decoded, and performing BSAC smart decoding and terminating the decoding when all the side information of the last layer is not decoded, and terminating decoding of the last layer when all the side information of the last layer is decoded. The BSAC smart decoding includes checking whether a symbol to be decoded is determined regardless of data read after the truncated bitstream, continuing the decoding when decoding can be performed regardless of data read after the truncated bitstream, and determining that ambiguity occurs and terminating the decoding, when the symbol to be decoded is determined dependent on the data read after the truncated bitstream. Accordingly, byte level scalability can be provided in a MPEG-4 BSAC decoder.

Abstract: A decoding apparatus includes a state variable calculation unit which calculates a second state variable based on a first context variable and a first state variable which are stored in a first memory unit and a second memory unit, respectively, and determines a selection signal representing a symbol as a result of arithmetic decoding processing. A context variable calculation unit calculates a second context variable based on the first context variable and the selection signal and updates the first memory unit. A re-normalization unit calculates a third state variable by using the coded data and the second state variable and updates the second memory unit. The state variable calculation unit outputs the determined selection signal that is usable in processing of a succeeding step without waiting for the operations of the context variable calculation unit and the re-normalization unit.

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: A method, a component, a system, and a computer program for changing an encoding mode of an encoded data stream from a first encoding mode to a second encoding mode are disclosed. The encoded data stream at the first encoding mode is represented by first encoding parameters. For the encoding mode change the steps of selecting (20) a first set of the first encoding parameters to be used unchanged at the second encoding mode, selecting (30) a second set of the first encoding parameters, changing (40) the second set according to an algorithm being adapted to change the second set to match to the second encoding mode when combined with the first set, and combining (50) the first set and the changed second set for representing the encoded data stream by second encoding parameters at the second encoding mode are performed.

Abstract: A string matching system includes a text string, a plurality of patterns, an m-byte search window and a plurality of Bloom filters, wherein the m-byte search window stands for an m-byte sub-string in the text string under inspection. Every Bloom filter comprises sub-strings of a plurality of patterns. These Bloom filters are queried for membership of the rightmost block in the search window to determine the shift length. The acceleration efficiency of matching many bytes can be achieved simultaneously by shifting the search window for many bytes. Meanwhile, the patterns are stored into an embedded memory through a memory-efficient mechanism —the Bloom filter.

Abstract: A novel method and apparatus for wireless communication systems for simplifying the maximum likelihood (ML) Dual Carrier Modulated (DCM) demodulation for received DCM signals over frequency selective channels are disclosed. The disclosed method and apparatus are based on the Minimum Euclidean Distance (MED) decoding, which is equivalent to the maximum likelihood (ML) decoding for a frequency-selective wireless channel with Additive White Gaussian Noise (AWGN). Compared to the traditional ML decoder, the disclosed method and apparatus reduce the hypothesis testing from that of a 16 Quadrature Amplitude Modulation (16 QAM) to that of a 4 QAM, or Quadrature Phase Shift Keying (QPSK). Thus computation and hardware complexity can be reduced.

Abstract: A plurality of compression schemes are provided that achieve improved compression ratios. A first embodiment provides for compression of each pixel by one of a plurality of different entropy-based compression schemes based upon a probability cost analysis. A second embodiment provides for compression of each pixel based on a hybrid context formed using a plurality of compression schemes for improved probability determination, and thus improved entropy encoding. In embodiments of the invention, a context compression scheme similar to JBIG is applied, as well as an inverse scheme. The context scheme forms a statistical context from a concatenated sequence of previous pixel values. The inverse scheme provides a gray value estimation method based upon previous pixel values and respective threshold values. Statistics are maintained with respect to the actual current pixel value and the difference between an estimated gray value and the current pixel threshold value.

Abstract: A variable length decoder and its decoding method utilizing a reordered index decoding look-up-table, and that is utilized to incorporate a plurality of decoding LUT's into a single reordered index decoding LUT for use in decoding by making use of the output correlation rule obtained through integrating a plurality of decoding LUT's. Thus, when proceeding with the variable length decodings, the multiplexer has only to select the correct reordered index value from among a plurality of reordered index values as based on the previous decoding results, and then find out the corresponding remapping index value and compensation value, thus searching and obtaining the corresponding reordered index output result in the reordered index decoding LUT through utilizing the remapping index value, hereby obtaining the output result through proceeding with the operations required by making use of the compensation value.

Abstract: According to one embodiment, an encoding circuit includes a taking-over unit which takes over probability tables of divided regions of a previous frame image of a frame image having divided regions to divided regions of a present frame image, respectively, an acquiring unit which acquires a parameter of an adjacent macro block of the previous frame image when the macro block is located on a boundary between the divided regions, a selecting unit which calculates the parameter of the macro block to select one of probability models in the probability table, and an encoding unit which arithmetically encodes a residual signal in the frame image on the basis of the selected probability model to generate an encoded bit string.