| Class / Patent application number | Description | Number of patent applications / Date published |
|---|
| 341107000 | To or from code based on probability | 54 |
| 20080218390 | ENTROPY ENCODING AND DECODING APPARATUS AND METHOD BASED ON TREE STRUCTURE - 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. | 09-11-2008 |
| 20080231483 | BINARIZING METHOD AND DEVICE THEREOF - 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. | 09-25-2008 |
| 20080252498 | Coding data using different coding alphabets - Coding unsigned integer data of a sequence. A plurality of segments of the sequence are identified, wherein a segment of the plurality of segments comprises at least one unsigned integer of the unsigned integer data, and wherein the plurality of segments are based in part on context within the sequence. The plurality of segments are coded, wherein each segment of the plurality of segments is coded using a different coding alphabet, wherein a coding alphabet is constrained at least by unsigned integers of a corresponding segment. | 10-16-2008 |
| 20080252499 | METHOD AND SYSTEM FOR THE COMPRESSION OF PROBABILITY TABLES - 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. A first probability element reconstructed using the first compressed probability table is thereafter merged with a second probability element reconstructed using the second compressed probability table in order to produce a merged probability element. | 10-16-2008 |
| 20080266151 | Method of CABAC Coefficient Magnitude and Sign Decoding Suitable for Use on VLIW Data Processors - This invention decodes coefficient magnitudes in compressed video data using a selected context and speculatively decodes a coefficient sign. The next context selection depends upon a number of iterations. This invention confirms the speculatively decoded coefficient sign upon completion of the magnitude decode. This invention operates in a loop until reaching the number of significant coefficients within the block. The method exits the loop and decodes an escape code if an iteration count is greater than a predetermined number. An embodiment of this invention collects both a count up and a count down in an escape code decode in one loop. An embodiment of this invention estimates the number of significant coefficients in a block and selects the inventive or a prior art decode. | 10-30-2008 |
| 20080291065 | Wyner-Ziv Coding with Multiple Side Information - A Wyner-Ziv coding scheme jointly utilizes multiple side information at the decoder is described. A new probability model is introduced based on an extended turbo decoding trellis, so that the transitional probability is calculated from the probabilities conditioned on multiple side information. The proposed scheme handles multiple side information in a multi-dimensional manner to potentially achieve coding performance better than either selecting one side information or generating a single side information by averaging several side information. When the decoder receives multiple streams of parity bits, the conditional probabilities on the parity bits from the multiple streams all contribute in turbo decoding. The errors existing in some of the streams can be automatically eliminated during the decoding process. | 11-27-2008 |
| 20080309526 | Method and apparatus for a simplified maximum likelihood demodulator for dual carrier modulation - 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. | 12-18-2008 |
| 20090058695 | ARCHITECTURE FOR MULTI-STAGE DECODING OF A CABAC BITSTREAM - 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. | 03-05-2009 |
| 20090079601 | ENTROPY ENCODING APPARATUS, ENTROPY ENCODING METHOD, AND COMPUTER PROGRAM - 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. | 03-26-2009 |
| 20090079602 | N-BIN Arithmetic Coding for Context Adaptive Binary Arithmetic Coding - 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 2 | 03-26-2009 |
| 20090096645 | METHOD AND APPARATUS FOR ENTROPY CODING AND DECODING - 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. | 04-16-2009 |
| 20090146853 | Scalable context adaptive binary arithmetic coding - One embodiment of the invention concerns performing renormalization in content adaptive binary arithmetic coding (CABAC) only after multiple bins are processed. | 06-11-2009 |
| 20090219183 | ARITHMETIC DECODING APPARATUS - 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. | 09-03-2009 |
| 20090231173 | SYSTEM AND METHOD FOR USING A MICROLET-BASED MODEM - 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. | 09-17-2009 |
| 20090322573 | CABAC TYPE ENCODING DEVICE AND METHOD - 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.2 | 12-31-2009 |
| 20100007534 | ENTROPY DECODER WITH PIPELINED PROCESSING AND METHODS FOR USE THEREWITH - 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. | 01-14-2010 |
| 20100052956 | Apparatus and method for lossless coding and decoding - 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. | 03-04-2010 |
| 20100085224 | ADAPTIVE COMBINATORIAL CODING/DECODING WITH SPECIFIED OCCURRENCES FOR ELECTRICAL COMPUTERS AND DIGITAL DATA PROCESSING SYSTEMS - 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. | 04-08-2010 |
| 20100097250 | Parallel CABAC Decoding for Video Decompression - 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. | 04-22-2010 |
| 20100127904 | IMPLEMENTATION OF A RAPID ARITHMETIC BINARY DECODING SYSTEM OF A SUFFIX LENGTH - 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. | 05-27-2010 |
| 20100231426 | DEVICE AND METHOD FOR CODING A DATA SIGNAL AND DEVICE AND METHOD FOR DECODING A DATA SIGNAL - 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. | 09-16-2010 |
| 20100238056 | CODE AMOUNT ESTIMATING DEVICE, IMAGE CODING APPARATUS INCLUDING THE CODE AMOUNT ESTIMATING DEVICE, AND CODE AMOUNT ESTIMATING METHOD - 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. | 09-23-2010 |
| 20100259427 | ENTROPY CODING APPARATUS - An entropy coding apparatus configured to categorize each binarized symbol according to a corresponding bit position and a target arithmetic coding mode, and configured to parallelly perform arithmetic coding of a plurality of symbols belonging to an identical category is provided. | 10-14-2010 |
| 20100265111 | CODING METHOD, DECODING METHOD, AND APPARATUSES, PROGRAMS AND RECORDING MEDIA THEREFOR - An object of the present invention is to achieve high coding efficiency for a companded signal sequence and reduce the amount of codes. A coding method according to the present invention includes an analysis step and a signal sequence transformation step. The analysis step is to check whether or not there is a number that is included in a particular range but does not occur in a second signal sequence (a number sequence that indicates the magnitude (magnitude relationship) of original signals) and output information that indicates the number that does not occur. The signal sequence transformation step is to output a transformed second signal sequence (which is formed by assigning new numbers to indicate the magnitudes of original signals (the magnitude relationship among original signals) excluding the magnitude of the original signal indicated by the number that does not occur and replacing the numbers in the second signal sequence with the newly assigned numbers) in the case where it is determined in the analysis step that there is a number that does not occur. The particular range is defined as a number that indicates a positive value having a minimum absolute value and a number that indicates a negative value having a minimum absolute value, for example. | 10-21-2010 |
| 20110095922 | DIGITAL SIGNAL CODING METHOD AND APPARATUS, DIGITAL SIGNAL DECODING APPARATUS, DIGITAL SIGNAL ARITHMETIC CODING METHOD AND DIGITAL SIGNAL ARITHMETIC DECODING METHOD - 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. | 04-28-2011 |
| 20110102213 | DIGITAL SIGNAL CODING METHOD AND APPARATUS, DIGITAL SIGNAL DECODING APPARATUS, DIGITAL SIGNAL ARITHMETIC CODING METHOD AND DIGITAL SIGNAL ARITHMETIC DECODING METHOD - 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. | 05-05-2011 |
| 20110115656 | DIGITAL SIGNAL CODING METHOD AND APPARATUS, DIGITAL SIGNAL DECODING APPARATUS, DIGITAL SIGNAL ARITHMETIC CODING METHOD AND DIGITAL SIGNAL ARITHMETIC DECODING METHOD - 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. | 05-19-2011 |
| 20110122004 | METHOD OF DECODING A SIGNAL IMPLEMENTING A PROGRESSIVE CONSTRUCTION OF A DECODING TREE, CORRESPONDING COMPUTER PROGRAM AND DECODING DEVICE - A method of decoding a data signal includes progressively constructing a decoding tree, implementing at least two iterations of the following steps: selecting at least one child node of a current node belonging to a selection interval; storing the child nodes in a first stack; deleting the current node from the first stack; selecting a new current node from the first stack; and if the new current node is a leaf node, storing the path between the root node and the leaf node, in the second stack, and deleting the leaf node from the first stack; otherwise, return to the step of selecting a child node for the new current node. Moreover, the method assigns a probability of likelihood to the bits of at least one symbol of the data signal, taking account of the paths stored in the second stack, and determines a probabilistic estimation of the signal. | 05-26-2011 |
| 20110148674 | DIGITAL SIGNAL CODING METHOD AND APPARATUS, DIGITAL SIGNAL DECODING APPARATUS, DIGITAL SIGNAL ARITHMETIC CODING METHOD AND DIGITAL SIGNAL ARITHMETIC DECODING METHOD - 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. | 06-23-2011 |
| 20110260896 | APPARATUS FOR PARALLEL ENTROPY ENCODING AND DECODING - An entropy encoder block for use in a context adaptive encoder and an entropy decoder block for use in a context adaptive decoder are provided. | 10-27-2011 |
| 20110285560 | CONTEXT-BASED ADAPTIVE BINARY ARITHMETIC CODING (CABAC) DECODING DEVICE AND DECODING METHOD THEREOF - A context-based adaptive binary arithmetic coding (CABAC) decoding device and a coding method thereof are provided. The device comprises: a context memory address calculator, calculating an address identifying a memory location in a context model memory for storage of a context model in next cycle; a mixed context memory, in which the context model of the context memory address calculator is stored and from which the context model is read; a two-bin context adaptive binary arithmetic decoder, outputting several parameters for updating the range and offset of the context model, based on the context model of the mixed context memory and deciding several bins; and a binary syntax element comparator, judging whether a current binary sequence corresponds to the value of syntax elements, based on the bins so as to select a correct memory address. | 11-24-2011 |
| 20110291867 | ENCODING AND DECODING METHODS AND DEVICES USING A SECONDARY CODEWORD INDICATOR - A method for encoding an input sequence of symbols as a plurality of codewords including primary codewords and secondary codewords, and a method of decoding the plurality of codewords. The codewords are output as a bitstream including an associated codeword type indicator, which specifies whether its associated plurality of consecutive codewords includes at least one secondary codeword and, if so, the location of the first of the at least one secondary codewords. The decoder selects between a primary codeword decoding tree and a secondary codeword decoding tree, and decodes one of the plurality of codewords using the selected decoding tree. | 12-01-2011 |
| 20120044099 | DIGITAL SIGNAL CODING METHOD AND APPARATUS, DIGITAL SIGNAL DECODING APPARATUS, DIGITAL SIGNAL ARITHMETIC CODING METHOD AND DIGITAL SIGNAL ARITHMETIC DECODING METHOD - A digital decoding apparatus for receiving and decoding a compression-coded digital signal in predetermined transmission units is disclosed. The decoding apparatus includes an initialization unit for initializing an entropy coding process based on information of initializing a table of probability of occurrence which is multiplexed on a header of data for the predetermined transmission units, a context model determination unit for determining a context model to be used for each type of decoded data among a plurality of context models, a probability of occurrence generation unit for providing a probability of occurrence corresponding to the context model, and an entropy decoding unit for entropy decoding based on the generated probability of occurrence. A digital signal coding apparatus for making a compression coding of a digital signal is also disclosed. | 02-23-2012 |
| 20120081241 | Methods and Systems for Context Initialization in Video Coding and Decoding - Aspects of the present invention are related to systems and methods for context model initialization in entropy encoders and decoders. | 04-05-2012 |
| 20120081242 | METHODS AND DEVICES FOR PARALLEL ENCODING AND DECODING USING A BITSTREAM STRUCTURED FOR REDUCED DELAY - Methods and devices for encoding and decoding that involve sorting bins according to their respective estimated probabilities to form subsequences, each subsequence having an associated estimated probability. Subsequences are encoded to form codewords. Ordered sets of phrases of known length are then formed from the codewords. Each first of the phrases in a set contains at least part of one codeword. The first phrase has an associated estimated probability and the probability estimates associated with each of the other phrases in the set are determined based upon the probability estimate associated with the first phrase, which permits the phrases to be decoded in parallel. | 04-05-2012 |
| 20120086587 | SYSTEM AND METHOD FOR OPTIMIZING CONTEXT-ADAPTIVE BINARY ARITHMETIC CODING - A system and method is provided for ordering intervals rLPS and rMPS of a range to increase speed of binary symbol decoding in a binary arithmetic decoder. The method comprises the steps of: placing rLPS at a bottom of the range; enabling subtraction for rMPS to occur in parallel with comparison of rLPS and offset; and, reducing time that it takes to decode a bin. A method is also provided for performing context selection for a given syntax element, comprising the steps of: first, comparing information regarding properties of neighboring pixels with a threshold; second, adding results of threshold comparison of neighboring pixels, to provide a secondary result; and using the secondary result to select a context. | 04-12-2012 |
| 20120098682 | METHOD AND DEVICE FOR BUFFER-BASED INTERLEAVED ENCODING OF AN INPUT SEQUENCE - A method for encoding an input sequence of symbols. The method includes, sequentially, for each symbol in the input sequence, determining an estimated probability for that symbol based on a context model, identifying a codeword associated with a sequence of symbols resulting from appending that symbol to a previous sequence of symbols associated with that estimated probability, using an encoding tree associated with that estimated probability, and storing the codeword in a buffer element of a first-in-first-out buffer, wherein the buffer element is associated with the estimated probability. Stored codewords are output from the buffer in a first-in-first-out order. | 04-26-2012 |
| 20120133533 | Storage of probability values for contexts used in arithmetic coding - Arithmetic coding utilises probability values associated with contexts and context indexed values. The probability values are stored within a random access memory | 05-31-2012 |
| 20120182165 | Digital to analog converter (DAC) with ternary or tri-state current source - Digital to analog converter (DAC) with ternary or tri-state current source. A DAC including a number of ternary or tri-state devices operates based upon codewords provided thereto. Generally, each respective codeword bit directs operation of one of the respective ternary or tri-state devices within the DAC. Each ternary or tri-state device operates in at least three respective operational states (e.g., based upon the respective values of +1, −1, or 0 being provided thereto). In a current source implementation, each respective current source is implemented to deliver current, draw current, or neither delivered or draw current. In a voltage source implementation, each respective voltage source is implemented to provide a positive voltage, a negative voltage, or provide no voltage. A DAC coding table may be designed based upon characterization of codewords provided to one or more DACs (e.g., based upon a distribution, a probability density function (PDF), etc. of such codewords). | 07-19-2012 |
| 20120218131 | METHODS FOR ARITHMETIC CODING AND DECODING - A method for arithmetic coding of symbols in a stream is described. The method comprises the following steps:
| 08-30-2012 |
| 20120299757 | ENTROPY DECODING METHODS AND APPARATUS USING MOST PROBABLE AND LEAST PROBABLE SIGNAL CASES - An entropy decoding apparatus may include a data structure stored in memory. The data structure may include a decoding engine vector or context engine vector. The decoding engine vector many have a first set of bits representing a value corresponding to a state of a coding engine, a second set of bits representing an offset value, and a third set of bits representing the contents of an input stream buffer. The context vector may have a first set of bits representing an addresses of a context most probable state, a second set of bits representing a plurality of possible values corresponding to a least probable symbol state of a coding engine, a third set of bits representing an addresses of a context least probable state, a fourth set of bits representing a binary most probable symbol value, and a fifth set of bits representing a binary least probable symbol value. | 11-29-2012 |
| 20130027230 | ENTROPY CODING - An encoder for encoding a sequence of symbols is described which includes an assigner configured to assign a number of parameters to each symbol of the sequence of symbols based on information contained within previous symbols of the sequence of symbols; a plurality of entropy encoders each of which is configured to convert the symbols forwarded to the respective entropy encoder into a respective bitstream; and a selector configured to forward each symbol to a selected one of the plurality of entropy encoders, the selection depending on the number of parameters assigned to the respective symbol. | 01-31-2013 |
| 20130241752 | METHODS AND DEVICES FOR CODING AND DECODING THE POSITION OF THE LAST SIGNIFICANT COEFFICIENT - Methods and devices are described for entropy coding data using an entropy coder to encode quantized transform domain coefficient data. Last significant coefficient information is signaled in the bitstream using two-dimensional coordinates for the last significant coefficient. The context for bins of one of the coordinates is based, in part, upon the value of the other of the coordinates. In one case, instead of signaling last significant coefficient information, the number of non-zero coefficients is binarized and entropy encoded. | 09-19-2013 |
| 20130307710 | COMPRESSION MATCH ENUMERATION - In embodiments of compression match enumeration, a trie structure can be searched to enumerate data sequence matches after the trie structure is generated. The trie structure can be generated by overwriting a suffix array of data sequences stored in a memory buffer, where the suffix array includes an array of buffer positions sorted alphabetically by a data string that begins a data sequence at a respective buffer position. The trie structure can then be traversed to determine the data sequence matches from nodes in the trie structure. The trie structure can also be updated while being traversed to bypass multiple enumerations of the data sequence matches that have the same match length. | 11-21-2013 |
| 20130328705 | DECODING METHOD AND DECODER FOR UNARY/Kth ORDER EXPONENTIAL GOLOMB CODES - A decoding method for unary/k | 12-12-2013 |
| 20140062733 | METHOD FOR DECODING A SPATIALLY MULTIPLEXED DATA SIGNAL USING A MAXIMUM LIKELIHOOD DETECTION - The disclosure relates to a method for decoding a received signal in a MIMO communication system and in at least one layer, each layer carrying at least one data symbol belonging to a signal constellation. The method includes, for one of the at least one layer, a maximum likelihood detection step. This step includes:
| 03-06-2014 |
| 20140077977 | Method and Decoder for Reconstructing a Source Signal - In a method for reconstructing a source signal, which is encoded by a set of at least two descriptions, the method comprises: receiving a subset of the set of descriptions; reconstructing a reconstructed signal at an operating bitrate of a set of operating bitrates upon the basis of the subset of descriptions, the reconstructed signal having a second probability density, wherein the second probability density comprises a first statistical moment and a second statistical moment; and manipulating the reconstructed signal, wherein the reconstructed signal is manipulated such that, irrespective of the operating bitrate, a predetermined minimum similarity between the first statistical moment of the third probability density and the first statistical moment of the first probability density and between the second statistical moment of the third probability density and the second statistical moment of the first probability density is maintained. | 03-20-2014 |
| 20140191888 | ESTIMATOR FOR ESTIMATING A PROBABILITY DISTRIBUTION OF A QUANTIZATION INDEX - The invention relates to an estimator for estimating a probability distribution of a quantization index generated from a source coder encoding a source signal, into a sequence of quantization indices, the source signal being described by a signal model, the source coder providing a current quantization index and current side information, the estimator being configured to obtain auxiliary parameters based on a configuration of the source coder and the current available side information and the signal model, the estimator being further configured to adaptively update the probability distribution of a quantization index upon the basis of a probability density function relating to a previous state of the estimator, the auxiliary parameters, the current quantization index and the current side information. | 07-10-2014 |
| 20140327559 | SYSTEMS AND METHODS FOR ORDERING CODEWORDS BASED ON POSTERIOR INFORMATION IN SUCCESSIVE INTERFERENCE CANCELLATION (SIC) RECEIVERS - Systems and methods are provided for determining a decoding order in a successive interference cancellation receiver. The method includes receiving, using control circuitry, a plurality of codewords. The method further includes computing at least one ordering metric for at least one of the plurality of codewords based on posterior information associated with the plurality of codewords, and determining the decoding order based on the at least one ordering metric. | 11-06-2014 |
| 20150295590 | Method and Decoder for Reconstructing a Source Signal - In a method for reconstructing a source signal, which is encoded by a set of at least two descriptions, the method comprises: receiving a subset of the set of descriptions; reconstructing a reconstructed signal at an operating bitrate of a set of operating bitrates upon the basis of the subset of descriptions, the reconstructed signal having a second probability density, wherein the second probability density comprises a first statistical moment and a second statistical moment; and manipulating the reconstructed signal, wherein the reconstructed signal is manipulated such that, irrespective of the operating bitrate, a predetermined minimum similarity between a first statistical moment of a third probability density and a first statistical moment of a first probability density and between a second statistical moment of the third probability density and a second statistical moment of the first probability density is maintained. | 10-15-2015 |
| 20150311915 | FIELD LEVEL COMPRESSION IN PARALLEL DATA FLOWS - According to one embodiment of the present invention, a system selectively compresses data fields in a parallel data flow. The system identifies within an execution plan for the parallel data flow a first instance of a data field within a stage of the parallel data flow. The system traces the identified data field through stages of the parallel data flow and determines a score value for the identified data field based on operations performed on the identified data field during traversal of the stages. The system compresses the identified data field based on the score value indicating a performance gain with respect to the compressed data field. Embodiments of the present invention further include a method and computer program product for selectively compressing data fields in a parallel data flow in substantially the same manners described above. | 10-29-2015 |
| 20150349796 | DEDICATED ARITHMETIC ENCODING INSTRUCTION - A method includes executing, at a processor, a dedicated arithmetic encoding instruction. The dedicated arithmetic encoding instruction accepts a plurality of inputs including a first range, a first offset, and a first state and produces one or more outputs based on the plurality of inputs. The method also includes storing a second state, realigning the first range to produce a second range, and realigning the first offset to produce a second offset based on the one or more outputs of the dedicated arithmetic encoding instruction. | 12-03-2015 |
| 20160043735 | SIMPLIFIED RANGE AND CONTEXT UPDATE FOR MULTIMEDIA CONTEXT-ADAPTIVE BINARY ARITHMETIC CODING DESIGN - In some aspects, the disclosure is directed to methods and systems for a context-adaptive binary arithmetic encoder and decoder utilizing a fixed point design for range and context updates. Symbol probabilities and probability adaptation factors can be scaled to a predetermined range, such as an 8-bit range, reducing the need for complex and operationally costly table look-ups. | 02-11-2016 |
| 20160065963 | BINARIZATION OF DQP USING SEPARATE ABSOLUTE VALUE AND SIGN (SAVS) IN CABAC - Video coding systems or apparatus utilizing context-based adaptive binary arithmetic coding (CABAC) during encoding and/or decoding, are configured according to the invention with an enhanced binarization of non-zero Delta-QP (dQP). During binarization the value of dQP and the sign are separately encoded using unary coding and then combined into a binary string which also contains the dQP non-zero flag. This invention capitalizes on the statistical symmetry of positive and negative values of dQP and results in saving bits and thus a higher coding efficiency. | 03-03-2016 |
