摘要:
A variable-length code decoder sequentially decodes a series of variable-length codewords included in a bit stream and outputs decoded symbols corresponding to the codewords. The decoder includes an interface section and a decoding section. The interface section accumulates various code lengths of the decoded codewords to obtain a sum. Next, the interface section selects an N-bit contiguous data sequence (where N is a maximum code length of the codewords) from a 2N- or (2N−1)-bit contiguous data sequence, included in the bit stream, in accordance with the sum and outputs the N-bit contiguous data sequence. The decoding section receives the output of the interface section and decodes a codeword included in a combination of the output and a previous output of the interface section by reference to a lookup table, thereby obtaining and outputting a decoded symbol and outputting a code length of the decoded codeword to the interface section.
摘要:
A variable-length encoder using a code table having a symbol/code-word re-association feature, which includes a first storing portion for storing previously generated code table information, a first re-associating portion for generating re-associated code table information and re-association information indicative of the relation between a symbol and a corresponding code word from a previously generated code table information stored in the first storing portion, based on the frequency of occurrence of externally applied symbols during a predetermined time period, a delay for delaying and outputting the same symbols as those input to the first re-associating portion during the predetermined time period, a re-association information storing portion for storing the re-associated code table information and re-association information and sequentially outputting the re-association information, a variable-length encoder for receiving the symbols stored in the delay and generating and sequentially outputting code words according to the re-associated code table information stored in the re-association information storing portion, and a multiplexer which outputs the re-association information from the re-association information storing portion and the code words output from the variable-length encoder, to thereby reduce the code length of code words generated by variable-length encoding even when the frequency of occurrence of symbols used in forming a previously generated code table is different from that of the symbols applied during the predetermined time period.
摘要:
A decoding device for Huffman codes, provided with an operation circuit for determining, from a Huffman code to be decode, the code length of the Huffman code and a predetermined code number thereof by calculation, and a conversion circuit for converting the code number into a fixed-length code prior to encoding.
摘要:
In an image coding method of the present invention, after a process such as DCT is performed to digital image data, quantization process is performed, and then, to resultant quantized transform coefficients, variable length coding process is performed with reference to a variable length code table showing how variable length codes are allocated, and in a comparison process between an event derived from the quantized transform coefficients and a reference event included in the variable length code table, transformation process is performed to increase a possibility of performing variable length coding with satisfactory coding efficiency.
摘要:
A method and apparatus for performing entropy coding and decoding of a sequence of coded symbols representative of, for example, a speech, audio or video signal, in which variable-size vectors are coded and decoded based on radix arithmetic. The encoding technique uses a first radix and the numerical values of individual symbols to be coded, in order to determine the length of a first subsequence of symbols, which is then coded with use of a single (a first) combined symbol, and uses a second radix and the numerical values of other individual symbols to be coded, in order to determine the length of a second subsequence of symbols, which is then also coded with a single (a second) combined symbol, wherein the length of the first and second subsequences of symbols are also based on the size of the set from which the combined symbols are selected. The number of symbols in the first subsequence and the second subsequence are unequal—that is, the vectors (i.e., subsequences) which are combined for coding have a variable size. The first radix and the second radix may be equal and fixed to a predetermined value, or they may each be determined based on the corresponding subsequence of symbols to be coded. Correspondingly, the decoding technique of the present invention determines from the bit stream the number of symbols which have been coded with use of a single combined symbol (i.e., the length of a coded subsequence), and based on that number, on the combined symbol itself, and on a given radix (which may be fixed or may also be determined from the bit stream), determines the values of the individual symbols which were coded together as the combined symbol.
摘要:
On the basis of a portion of the signal, a coder selects a parameter vector belonging to a reference library containing 2Q vectors each designated by an address of Q bits. This coder, or a transcoder located downstream, forms a digital data stream (&PHgr;) containing an index deduced from the address of the vector selected. For each rate value corresponding to an integer p≧0, the index contained in the digital data stream is formed of Q−p bits which, completed by p bits of predetermined positions, define indices of Q bits representing a group of 2p addresses including that of the vector selected from the reference library. The decoder receiving the digital data stream, or a transcoder located upstream, is capable of reconstructing appropriate parameter vectors on the basis of the truncated index. Thus very fine steps are obtained in the adjustment of the transmission rate.
摘要:
A method for compressing text, comprising the steps of splitting a main character string into component strings, and counting the frequency of occurrence of each component string in the main character string and ordering the component strings in their frequency of occurrence. The method also comprises a step of allocating to each component string a token value representative of the component string and determined by the frequency of occurrence of the component string, storing the token value so allocated as a token table in which tokens are associated with component strings, and allocating to each component string in the main character string the token value for that component string from the token table to generate a sequence of token values representing the main character string in a compressed format.
摘要:
In a transmission system a variable length encoder is used to reduce the average bitrate of a sequence of symbols. In order to limit the maximum length of the code it is proposed to transmit the sequence of symbols only in coded form if the length of the coded sequence is lower than a predetermined value
摘要:
A method and an apparatus for designing a codebook error resilient data transmission is disclosed. The present invention allows for creation of a robust yet compressive codebook for transmission of data. One embodiment of the present invention utilizes a combination of Huffman and Gray coding techniques to achieve both robustness and high compression ratios for data sets of single or multiple dimension. In particular, the present invention utilizes a series of Gray codes to improve the robustness of a Huffman code utilized by the MPEG-4 standard for motion video compression. The present invention may also be used to create codebooks for other forms of data, these codebooks can be designed to be robust or robust and compressive, and can encode data of single or multi-dimensional format.
摘要:
The invention relates to the coding of digital information signal blocks comprising representation symbols, such as sampled values, by means of an adaptive variable-length coding, such as Huffman coding. The JPEG Standard also utilizes adaptive Huffman coding but the coding in accordance with this standard is inefficient when a comparatively large number of Huffman coding tables are to be transmitted. According to the invention, in the case of a small number of representation symbols per information signal block, the probabilities of occurrence of each of the representation symbols are transmitted together with the variable-length-coded representation symbols, a similar (de)coding table being generated both in the encoder and in the decoder on the basis of said probabilities. In the case of a larger number of representation symbols per information signal block information about the number of code words of each length and/or the maximum code length in each series of variable-length-coded representation symbols is added to this series. By means of this information the decoder can unambiguously generate a coding table. The invention provides a substantial reduction of the number of bits required for specifying the Huffman code tables.