Source: http://www.google.com/patents/US6501801?dq=5,867,764
Timestamp: 2015-01-26 13:41:45
Document Index: 735718830

Matched Legal Cases: ['art 101', 'art 21', 'art 22', 'art 22', 'art 21', 'art 22', 'art 213', 'art 202', 'arts 203', 'arts 203', 'art 204', 'art 214', 'Application No. 7', 'art 703', 'art 707', 'art 903', 'art 903', 'art 903', 'art 110', 'art 21', 'art 23', 'art 21', 'art 22', 'art 703', 'art 707', 'art 803', 'art 803', 'art 803', 'art 703']

Patent US6501801 - Moving picture coding and/or decoding systems, and variable-length coding ... - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inAdvanced Patent SearchPatentsA coding and/or decoding system includes: a code-word table for storing therein a plurality of code words, which are capable of being decoded both in forward and backward directions and which are formed so that delimiters of the code words are capable of being identified by a predetermined weight of...http://www.google.com/patents/US6501801?utm_source=gb-gplus-sharePatent US6501801 - Moving picture coding and/or decoding systems, and variable-length coding and/or decoding systemAdvanced Patent SearchPublication numberUS6501801 B2Publication typeGrantApplication numberUS 09/915,402Publication dateDec 31, 2002Filing dateJul 27, 2001Priority dateMar 15, 1995Fee statusLapsedAlso published asUS6104754, US6256064, US6317461, US7376187, US7388914, US20010053184, US20040071451, US20040101054, US20070160148, US20070160149, US20070160150, US20070188359, US20070188360, US20070205928Publication number09915402, 915402, US 6501801 B2, US 6501801B2, US-B2-6501801, US6501801 B2, US6501801B2InventorsTakeshi Chujoh, Toshiaki Watanabe, Yoshihiro Kikuchi, Takeshi NagaiOriginal AssigneeKabushiki Kaisha ToshibaExport CitationBiBTeX, EndNote, RefManPatent Citations (22), Non-Patent Citations (5), Referenced by (11), Classifications (41), Legal Events (4) External Links: USPTO, USPTO Assignment, EspacenetMoving picture coding and/or decoding systems, and variable-length coding and/or decoding systemUS 6501801 B2Abstract A coding and/or decoding system includes: a code-word table for storing therein a plurality of code words, which are capable of being decoded both in forward and backward directions and which are formed so that delimiters of the code words are capable of being identified by a predetermined weight of the code words, so that the code words correspond to different source symbols; an encoder for selecting code words corresponding to inputted source symbols from the code-word table; and a synchronization interval setting part for preparing coded data every predetermined interval using the code words selected by the encoder and for inserting stuffing codes capable of being decoded in the backward direction. Thus, it is possible to decrease useless bit patterns to enhance the coding efficiency by smaller amounts of calculation and storage, and to decode variable length codes both in the forward and backward directions even if the synchronization interval is set every interval using the stuffing bits.
What is claimed is: 1. A moving picture decoding system, comprising:
input means for inputting a first code string which is arranged in the forward direction from the prefix to the suffix, and a second code string which is arranged in the backward direction from the suffix to the prefix; and decoding means for decoding said first code string in the forward direction from the head to the end, and said second code string in the backward direction from end to the head. 2. A moving picture decoding system as set forth in claim 1, comprises:
input means for inputting code string which have been divided into a plurality of regions every frame to be coded; decoding means for decoding the code string of each of the regions supplied from said input means; and reordering means for reordering the data of each of the regions supplied from said decoding means, in correct order. 3. A variable-length decoding system for decoding coding data of a variable-length code which is able to be decoded in either of the forward and backward directions, and in which synchronizing codes are inserted at regular intervals, said variable-length decoding system comprising:
forward decoding means for decoding said variable-length code in the forward direction and for detecting an error in a code word of said variable-length code; backward decoding means for decoding said variable-length code in the backward direction and for detecting an error in a code word of said variable-length code; and decoded-value deciding means for deciding a decoded value on the basis of the decoded results of said forward decoding means and said backward decoding means, wherein said decoded-value decoding means decides a decoded value at a position in which said error is detected in accordance with the detected result of the error by said forward decoding means and said backward decoding means. 4. A variable-length decoding system for decoding coding data of a variable-length code which is able to be decoded in either of the forward and backward directions, said variable-length decoding system comprising:
forward decoding means for decoding said variable-length code in the forward direction; backward decoding means for decoding said variable-length code in the backward direction; and fixed-length code decoding means for decoding a fixed-length code, wherein when said variable-length code is decoded by said forward decoding means and said backward decoding means, if specific codes representative of the head and end of the said fixed-length code are decoded, the subsequent coding data are decoded by said fixed-length decoding means. 5. A variable-length decoding system for decoding coding data obtained by coding an orthogonal transform coefficient, which has been produced by the orthogonal transform for each of blocks by means of a moving picture encoder, into a variable-length code which is able to be decoded in either of the forward and backward directions, said variable-length decoding system comprising:
forwarding decoding means for decoding said variable-length code in the forward direction; backward decoding means for decoding said variable-length code in the backward direction; and deciding means for deciding the last of a block on a basis of an appearance of a code word representative of the last orthogonal transform coefficient of the block when said forward decoding means decodes said variable-length code, and for deciding the head of a block by a code word representative of the last orthogonal transform coefficient of the last block. 6. A moving picture decoding system, comprising:
an input for inputting a first code string which is arranged in the forward direction from the prefix to the suffix, and a second code string which is arranged in the backward direction from the suffix to the prefix; and a decoder for decoding said first code string in the forward direction from the head to the end, and said second code string in the backward direction from end to the head. 7. A variable-length decoding system for decoding coding data of a variable-length code which is able to be decoded in either of the forward and backward directions, and in which synchronizing codes are inserted at regular intervals, said variable-length decoding system comprising:
a forward decoder for decoding said variable-length code in the forward direction and for detecting an error in a code word of said variable-length code; a backward decoder for decoding said variable-length code in the backward direction and for detecting an error in a code word of said variable-length code; and a logic circuit for deciding a decoded value on the basis of the decoded results of said forward decoder and said backward decoder, wherein said logic circuit decides a decoded value at a position in which said error is detected in accordance with the detected result of the error by said forward decoder and said backward decoder.
This application is a continuation of U.S. patent application Ser. No. 09/476,117 filed Jan. 3, 2000 (now U.S. Pat. No. 6,317,461), which is a continuation of U.S. application Ser. No. 08/924,387 filed on Sep. 5, 1997 (now U.S. Pat. No. 6,104,754), which is a continuation-in-part of U.S. patent application Ser. No. 08/616,809 filed on Mar. 15, 1996 (now U.S. Pat. No. 5,852,469).
A variable length code is a code system of a short code length on average, which is obtained by assigning a short code length of codes to a frequently appearing symbol and a long code length of codes to a rarely appearing symbol. Therefore, if a variable length code is used, the amount of data can be considerably compressed in comparison with the amount of data before being coded. As a method for forming such a variable length code, the Huffman algorithm suitable for memoryless sources is known.
SUMMARY OF THE INVENTION It is therefore an object of the present invention to provide a moving picture decoding system which can restrain the quality of a decoded image from greatly deteriorating even if an error occurs in any portion of a code, and which can efficiently decode the code even if only a part of the code can be decoded due to the error.
According to a first aspect of the present invention, a moving picture decoding system comprises: input means for inputting a first code string arranging in order from the prefix to the suffix, and a second code string arranging in order from the suffix to the prefix in the backward direction: and decoding means for decoding the first code string in order from the prefix to the suffix and for decoding the second code string in order from suffix to prefix in the backward direction. In this system, the first code string arranging in the forward direction from the prefix to the suffix and the second row arranging in the backward direction from the suffix to the prefix are decoded. Therefore, even if an error occurs in one of the rows, the decoding can be carried out without influencing the other row.
According to a second aspect of the present invention, a moving picture decoding system comprises: input means for inputting code string which have been divided into a plurality of regions with respect to each of frames; decoding means for decoding the code string of each of the regions supplied from the input means; and rearranging means for rearranging the data of each of the regions supplied from the decoding means, in correct order. In this system, the code string wherein the regions is arranged in order of importance of the rearranged image. Therefore, even if an error occurs in a part of data, the region which has been able to be decoded is an important portion, so that it is possible to restrain the lack of the important portion of the image in comparison with the conventional system.
According to a third aspect of the present invention, the moving picture decoding system as set forth includes detection means for detecting an error with respect to the first and second code string and the coded data/signal, respectively, wherein the decoding is carried out using only the data wherein no error has been detected by the error detection means. In this system, the detection of error is carried out when the divided code string is decoded. Therefore, it is possible to form a reproduced image by means of only the correctly decoded data. It is also possible to predict and complement the data which has not been able to be decoded, by means of the correctly decoded data.
According to a fourth aspect of the present invention, the moving picture decoding system includes error detecting means for detecting an error with respect to the code string and the decoded data/signal; and predicting means for predicting the region which as not been able to be decoded, on the basis of the decoded region when an error is detected by means of the error detecting means. In this system, the regions of a higher probability of decoding in both of the code string divided into two parts, can complement the regions of a lower probability of decoding in both of the code string divided into two parts. Therefore, it is possible to predict and complement the data of the data lacking region.
According to a fifth aspect of the present invention, the moving picture decoding system as set forth in the fourth aspect includes means for rearranging and decoding regions in accordance with the region rearranging data included in the code string. In this system, the code string that the coding order has been changed in accordance with the image is decoded. Therefore, even if the data have not been able to be fully decoded due to errors, it is possible to increase the probability of decoding with respect to the important portion of the coding data.
It is another object of the present invention to provide a practical variable-length decoding system which can be decoded in either of the forward and backward directions.
Specifically, it is an object of the present invention to provide a variable-length decoding system which can be decoded in either of the forward and backward directions and wherein the number of useless bit patterns is small and the coding efficiency is high.
It is a further object of the present invention to provide a variable-length decoding system which can be decoded in either of the forward and backward directions and which is unnecessary for a great memory capacity even if the number of source symbols is great.
In order to accomplish the aforementioned and other objects, according to a sixth aspect of the present invention, a variable-length coding system which assigns code words to a plurality of source symbols, the code words having a code length in accordance with the probability of the source symbols, and which outputs as coding data, the code words corresponding to the inputted source symbols, comprises: a code-word table for storing a plurality of code words so as to correspond to the source symbols, the code words being configured so as to be able to determine the pause between codes by the weights of the code words; and coding means for selecting a code word corresponding to the inputted source symbol from the code-word table and for outputting the selected code word as coding data.
The term �weight of code word� corresponds to a hamming distance from the minimum or maximum value of the code word. When the code word is a binary code, the minimum value of the code word is �0� in all cases and the maximum value of the code word is �1� in all cases, so that the weight of the code word corresponds to the number of � 1� or �0�. The position wherein the weight of the code word is a predetermined value indicates the pause between codes in the variable-length code.
With respect to the plurality of code words stored in the code-word table, a fixed-length code, i.e. a constant length of code, is unnecessary to be added to at least one of the prefix and suffix thereof.
In addition, unlike a code wherein bits are added to the suffix of a variable-length code decodable in only the forward direction such as reversible code disclosed in the aforementioned Japanese Patent Laid-Open, a reversible code is originally configured without the addition of excessive bits, so that it is possible to obtain a variable-length code wherein the number of useless bit patterns is small and wherein the coding efficiency is great.
According to a seventh aspect of the present invention, a variable-length decoding system which can decode in either of the forward and backward directions and which decodes a variable-length code to which synchronizing codes are inserted at regular intervals, comprises: a forward decoding means for decoding a variable-length code in the forward direction and for detecting an error of a code word of the variable-length code; a backward decoding means for decoding the variable-length code in the backward direction and for detecting an error of a code word of the variable-length code; and decoded-value deciding means for deciding a decoded value on the basis of the decoded results by the forward decoding means and the backward decoding means, wherein the decoded value at the position in which the error is detected in accordance with the results of detection of the error by the forward decoding means and the backward decoding means.
Specifically, in the decoded-value deciding means, (a) when errors have been detected by both of the forward decoding means and the backward decoding means and when the detected positions of the errors have not passed each other, only the decoded result wherein no error has not been detected, is used as the decoded value, (b) when errors have been detected by both of the forward decoding means and backward decoding means and when the detected positions of the errors have not passed each other, the decoded result wherein no error has not been detected by both of the forward decoding means and the backward decoding means, is used as the decoded value, (c) when an error has been detected by one of the forward decoding means and the backward decoding means, the decoded value with respect to the code word at the position wherein the error has been detected is abandoned, and the decoded result in the backward direction is used as the decoded value with respect to the subsequent code word, and (d) when errors have been detected with respect to the same code word by means of the forward decoding means and the backward decoding means, the decoded value with respect to the code word at the position wherein an error has been detected is abandoned, and the decoded result in the backward direction is used as the decoded value with respect to the subsequent code word.
In this variable length decoding system, when the decoded value is decided on the basis of the decoded results by the forward decoding means and the backward decoding means which use a function for detecting errors in code words of a variable-length code, it is possible to effectively decode the reversible code outputted from the aforementioned variable-length coding system, against the errors such as channel errors, by deciding the decoded value at the position wherein the errors have been detected in accordance with the detected results of errors by the forward decoding means and the backward decoding means and the backward decoding means.
According to an eighth aspect of the present invention, a variable-length decoding system which can be adapted to the variable-length coding system according to the present invention and which decodes coding data of variable-length codes decodable in either of the forward and backward directions, comprises: forward decoding means for decoding a variable-length code in the forward direction; backward decoding means for decoding a variable-length code in the backward directions; and fixed-length code decoding means for decoding a fixed-length code, wherein when specific codes (escape codes) representative of the prefix and suffix of the fixed-length code have been decoded when the variable-length code is decoded by the forward decoding means and the backward decoding means, the subsequent coding data is decoded by the fixed-length code decoding means.
According to a ninth aspect of the present invention, there is provided a variable-length decoding system which decodes coding data of a variable-length code decodable in either of the forward and backward directions. In this system, the code-length of a variable-length code is derived on the basis of the number of a predetermined �1� or �0� of the code word, and the value determined by a Pascal's triangle is assigned to the value of a joint. Then, the rank order values of different code words of the same code-length is derived by means of a directed graph wherein the arrows from each joint to the next joint correspond to �1� and �0� of the code words, and a decoded value is calculated by means of the rank order value and the directed graph.
In this variable-length decoding system, it is possible to determine the pause between the codes by the number of the weights of the code words, i.e. the code length, similar to the variable-length coding system according to the present invention. In addition, this system uses variable-length code words configured by code words decodable in either of the forward and backward directions, the value determined by a Pascal's triangle is assigned to the value of a joint, and the decoded value is calculated by the directed graph (decoding graph) wherein the arrows from each joint to the next joint corresponds to �1 � and �0� of the code words. Therefore, it is possible to decode the variable-length code by a small memory capacity even if the number of source symbol is great.
According to a tenth aspect of the present invention, a variable-length decoding system which can be adapted to the variable-length coding system according to the present invention and wherein a moving picture decoder decodes coding data decoded into a variable-length code which can decode an orthogonal transform coefficient produced by the orthogonal transform every blocks by means of a moving picture encoder, in either of the forward and backward directions, comprises: forward decoding means for decoding a variable-length code in the forward direction; and backward decoding means for decoding a variable-length code in the backward direction, wherein when the forward decoding means decodes the variable-length code, the last of the block is determined on the basis of the appearance of a code word representative of the orthogonal transform coefficient of the last of the block, and when the backward decoding means decodes the variable-length code, the head of the block is determined by the code word representative of the last orthogonal coefficient of the last block.
In the variable-length decoding system according to the present invention, the first code-word table corresponding to the orthogonal transform coefficient other than the last of the block is configured with respect to each of the plurality of coding modes. However, the second code-word table corresponding to the orthogonal transform coefficient of the last of the block is used for the respective coding modes in common, so that it is possible to cope with the change of the code-word tables by the coding mode, and to find the pause between blocks by the appearance of the code word representative of the last orthogonal transform coefficient of the last block, so that the decoding can be syntactically in either direction.
FIG., 39 is a diagram showing an example of a decoded-value determining method in a decoded-value determining part of FIG. 37;
FIG. 7 is a black diagram of the coded-word table preparing part 101. A code selecting part 21 receives information on the occurrence probability of source symbols, and selects a code system having a shortest average code length from selectable code systems to transmit the selected result to a code-word forming part 22. The code-word forming part 22 forms code word of a code selected by the code-word selecting part 21.
On the other hard, in a moving picture 710, the coded data transmitted tom the transmission or storage system 705 are stored in a receiving buffer 706. Then, the multiplexing separation and variable length decoding of the coded data are carried out by means of a moving picture multiplexing separator 707 to be transmitted to a source decoder 708, in which the moving picture information is finally decoded. To the moving picture multiplexer 703 and the moving picture multiplexing separator 707, the first preferred embodiment of a variable length coding and/or decoding system according to the present invention is applied.
FIGS. 19 through 21 and 22 through 23 show examples of code-word tables used for the lower-layer variable length encoder 902. The codes stored in these code tables are obtained bad adding 2-bit fixed-length codes to the suffix of each of the codes prepared by the first forming method for the code words of the reversible code in the code-word forming part 22.
In the coding part 213, the source symbols being input data are divided, by means of a data layering part 202, into layers 1 through n (n is a natural number being not less than 2) in accordance with importance. The divided source symbols in the respective layers i (i=1, 2, . . . n) are inputted to variable length coding parts 203-i prepared every layer i to be coded. The coded data of the respective layers i obtained by the variable length coding parts 203-i are multiplexed by means of a multiplexing part 204 to be transmitted to the decoding part 214 via the transmission or storage system 205.
As shown in FIG. 52, motion vectors are obtained by one-dimensional predictions, and predicted values are represented by differential values. The predicting directions of the motion vector is shown by arrows in FIG. 52. As shown in FIG. 52, a macro block (shown by a greater rectangle in FIG. 52) has one motion vector or four motion vectors, each of which exists in each of luminance blocks (shown by smaller rectangles in FIG. 52).
The one-dimensional prediction is carried out with respect to these blocks, and predicted values are described by variable length codes in accordance with the coding tables shown in FIGS. 44 through 51. This corresponds to the motion vector information at the end of FIG. 40A. On the other hand, as shown in FIG. 40B, the lower layer has DCT coefficient information other than the INTRA DC. For example, the lower layer is described by reversible codes, which are shown in FIGS. 19 through 25 or disclosed in Japanese Patent Application No. 7-260383.
The syntax shown in FIGS. 41A and 41B will be described. In this syntax, as shown in FIG. 41A, a header information and a mode information 1 indicative of the number of motion vectors for each macro coding are arranged on the side of the prefix of the upper layer to be described by variable length codes capable of being decoded in the usual forward direction, and the variable length codes of the motion vectors are described after the header information and the mode information. The variable length codes of the motion vector information are the same as those of the syntax of FIG. 40A. As shown in FIG. 41B, a mode information 2 indicative of the presence of DCT coefficients in the respective blocks and the INTRA DC are arranged on the side of the prefix of the lower layer to be described by variable length codes capable of being decoded in the usual forward direction, and a DCT coefficient information other than the INTRA DC is described by reversible codes after the DCT coefficient information similar to the syntax of FIG. 40B The syntax shown in FIGS. 42A and 42B will be described. In this syntax, only variable length codes capable of being decoded in the forward direction are used for the upper layer. That is, as shown in FIG. 42A, in the upper layer, a header information, a mode information and a motion vector information are described by variable length codes capable of being decoded in the forward direction. In the lower layer, as shown in FIG. 42B, a DCT coefficient information is described by reversible codes similar to the syntax of FIG. 40B.
In the fifth preferred embodiment, although the basic constructions of the moving picture multiplexing part 703 and the moving picture multiplexing separating part 707 are the same as those of FIGS. 18A and 18B, the constructions of the upper-layer variable length encoder 901, the lower-layer variable length encoder 903, the upper-layer variable length decoder 905 and the lower-layer variable length decoder 906 are different from those in the second preferred embodiment. That is, out of data coded by the source encoder 702, the upper layer data indicated by, e.g., the syntax of FIGS. 40A or 41A, are variable-length coded by means of the upper-layer variable length encoder 901 to be transmitted to the multiplexing part 903. In addition, out of data coded by the source encoder 702, the lower layer data indicated by the syntax of FIG. 40B or 41B are variable-length coded by means of the lower-layer variable length encoder 903 to be transmitted to the multiplexing part 903. In the multiplexing part 903, the coded data in the upper and lower layers are multiplexed to be transmitted to the transmission buffer 704.
In the fifth preferred embodiment, the decoded-value determining part 110 (shown in FIG. 37) in the upper-layer variable length decoder 905 and the lower-layer variable length decoder 906 determines decoded values on the basis of the forward decoded result obtained by the forward decoder 108, to output a final decoded result. In the error detection in the forward decoder 108 and the backward decoder 109 in the respective layers, when a bit pattern, which does not exist as code words, appears or when an error is detected is by a check bit or the like, the position of the bit pattern or the error is regarded as a detected position. When no error is detected by the above described determining method and when the number of decoded bits is not coincident with the bit number of coded data in the synchronization interval, the first decoding position is regarded as an error detected position.
θi: Information Source (i=1, . . . , n) X: Source Symbols of Information Source X=(x 1, x 2, . . . , xm) P(X|θi): Frequency Distribution of θi As an example, a plurality of test images may be used as information sources, and the frequency distribution obtained by coding the test images may be considered.
A designed stochastic model Q(X) is derived by weighting and averaging the frequency distribution obtained by the plurality of information source.  Q  ( X ) = w  ( θ   1 )  P  ( X  θ   1 ) + � + w  ( θ   n )  P  ( X  θ   n ) = ∑ i = 1 n  w  ( θ   i )  P  ( X  θ   n ) w(θi): Weighting Factor w(θl)+ . . . +w(θ1)=1
In this case, it is a problem how to derive the weighting factor w(θi). When the information source θi is coded by Q(X), an ideal code length L(X|θi) is as follows. L   ( X  θ   i ) = ∑ i = 1 m   P   ( X  θ   i )   log   2   ( Q   ( X ) ) In order to minimize the ideal code lengths L(X|θi) of the respective information sources on average, assuming that  U  ( X ) = ( 1 / n )  ∑ i = 1 n  P  ( X  θ   i ) , M  ( X ) = - ( 1 / n )  ∑ i = 1 n  ∑ i = 1 m  P ( X  θ   i )  log   2  ( Q  ( X ) ) = ∑ i = 1 m  U  ( X )  log   2  ( Q  ( X ) ) When U(X)=Q(X), this function is minimum as follows.
When the information source θi is coded by Q(X), redundancy R(X|θi) is as follows. R  ( X   θ   i ) = L ( X   θ   i ) + ∑ i = 1 m   P  ( X   θ   i )  log   2  ( P ( X   θ   i ) ) A weighting mean S(X) of these redundancy with respect to the respective information sources is a function indicative of a mutual information of event X and event θ as follows.  S  ( X ) = ∑ i = 1 n  w  ( θ   i )  R ( X  θ   i ) = ∑ i = 1 n  w  ( θ   i )  ∑ i = 1 m  P ( X  θ   i )  log   2  ( P  ( X  θ   i ) / ∑ i = 1 n  w  ( θ   i )  P  ( X  θ   i ) ) As a method for deriving the maximum value of this function, there is known Arimoto-Blahut's algorithm, which is disclosed in �An algorithm for computing the capacity of arbitrary discrete memoryless channels� (S. Arimoto, IEEE Trans. Inform. Theory, Vol. IT-18, pp.14-20, 1972), and �Computation of channel capacity and rate-distortion functions� (R. E. Blahut, IEEE Trans. Inform. Theory, Vol. IT-18, pp.460-473, 1972). By this algorithm or the like, it is possible to derive w(θi) (i=1, . . . , n) having the maximum S(X), i.e., the worst w(θi).
The code selecting part 21 shown in FIG. 55 prepares Q(Y), which is obtained by sorting the source symbols X in order of probability in the stochastic models Q(X) prepared by the stochastic model preparing part 23. The code selecting part 21 also prepares F(Z), which is obtained by sorting the code lengths of the reversible codes prepared by the code forming part 22 in order of shorter length, to calculate ∑ i = 1 m   Q  ( Y )  F  ( Z ) to select one of the minimum value to prepare a code-word table, in which source symbols correspond to code words.
The coding and decoding of the upper and lower layers shown in FIGS. 57A through 58B are carried out by means of a moving picture multiplexing part shown in FIG. 59. These constructors are the same as those of a coding and/or decoding system in the fifth preferred embodiment. That is, although the basic constructions of the moving picture multiplexing part 703 and the moving picture multiplexing separating part 707 of FIG. 56 are the same as those shown in FIGS. 57A through 58B, the constructions of an upper-layer variable length encoder 801, a lower-layer variable length encoder 803, an upper-layer variable length decoder 805 and a lower-layer variable length decoder 806 are different from those in the second preferred embodiment. That is, out of data coded by the source encoder 702, the upper layer data indicated by, e.g., the syntax of FIGS. 57A or 58A, are variable-length coded by the upper-layer variable length encoder 801 to be transmitted to the multiplexing part 803. In addition, out of data coded by the source encoder 702, the lower later data indicated by, e.g., the syntax of FIGS. 57B or 58B, are variable-length coded by the variable length encoder 802 to be transmitted to the multiplexing part 803. The coded data of the upper and lower layers are multiplexed by the multiplexing part 803 to be transmitted to a transmission buffer 704.
In an information source encoder 702 shown in FIG. 56, 8�8 blocks of DCT coefficients after quantization are scanned in the block's to derive LASTs (0: non-zero coefficient, which is not the last of the block, 1: non-zero coefficient of the last of the block), RUNs (the number of zero runs before the non-zero coefficient) and LEVELs (quantized value of the coefficient), which are transmitted to a moving picture multiplexing part 703.
As shown in FIG. 76(d), when an error is detected in the stuffing code and the decoding can not be decoded in the backward direction, the decoding is carried out only in the forward direction. When the error is detected, the decoded results of the upper layer with respect to the macro blocks after the error detected position are rewritten on the basis of the decoded results of the mode information of the upper layer so that the INTPA macro blocks are directly indicated by the last frame and the INTER macro blocks are indicated only by the motion compensation using the last frame.
Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS4569050Jan 14, 1983Feb 4, 1986Honeywell Inc.Data communication system with fixed weight error correction and detection codeUS5168356Dec 20, 1991Dec 1, 1992General Electric CompanyApparatus for segmenting encoded video signal for transmissionUS5302949Oct 28, 1992Apr 12, 1994Sony CorporationSignal encoding with reverse run length and variable length codingUS5392037May 20, 1992Feb 21, 1995Matsushita Electric Industrial Co., Ltd.Method and apparatus for encoding and decodingUS5469273Jan 24, 1994Nov 21, 1995Kabushiki Kaisha ToshibaDecoding system having parallel-processing capability thereinUS5488616Apr 9, 1993Jan 30, 1996Kokusai Denshin Denwa Co., Ltd.System for providing reversible variable length codesUS5563593Mar 18, 1994Oct 8, 1996Lucent Technologies Inc.Video coding with optimized low complexity variable length codesUS5608396Feb 28, 1995Mar 4, 1997International Business Machines CorporationEfficient Ziv-Lempel LZI data compression system using variable code fieldsUS5621466Jan 30, 1996Apr 15, 1997Seiko Epson CorporationMethod and apparatus for compressing and decompressing image data using two dimensional orthogonal transform with improved compression rateUS5625356Feb 28, 1995Apr 29, 1997Korea Telecommunication AuthorityMethod for re-synchronizing variable length code at high speed using parallel-processing pattern matchingUS5742243Feb 14, 1996Apr 21, 1998Pioneer Electric CorporationMethod and apparatus for reducing DC component of RLL codesUS5761345Dec 23, 1996Jun 2, 1998Canon Kabushiki KaishaImage processing apparatus suitable for multistage compressionUS5781131Dec 12, 1995Jul 14, 1998Sony CorporationData encoding method and data decoding methodUS5835034Jun 24, 1997Nov 10, 1998Hewlett-Packard CompanySystem and method for lossless image compressionUS6008744Sep 11, 1997Dec 28, 1999Nec CorporationProcessing unitEP0267578A1Nov 10, 1987May 18, 1988Kokusai Denshin Denwa Co., LtdEncoding system capable of accomplishing a high efficiency by anterior and/or posterior processing to quantizationEP0453229A2Apr 16, 1991Oct 23, 1991Matsushita Electric Industrial Co., Ltd.Method for transmission of variable length codeEP0499303A2Jan 24, 1992Aug 19, 1992Ampex Systems CorporationMethod and apparatus for shuffling and deshuffling dataEP0554871A2Feb 4, 1993Aug 11, 1993Sony CorporationMethod and apparatus for encoding a digital image signalEP0595242A2Oct 26, 1993May 4, 1994Matsushita Electric Industrial Co., Ltd.Versatile escape run-level coder for digital video signal processing apparatusJPH05300027A Title not availableWO1993018616A1Mar 10, 1993Sep 16, 1993Teledirektoratets ForskningsavPicture data encoding methodNon-Patent CitationsReference1A Reversible Code Over; Kbemetika-vol. 22 (1986), No. 1; Sunil Kumar Muttoo.2A Reversible Code Over; Kbemetika�vol. 22 (1986), No. 1; Sunil Kumar Muttoo.3Bidrectional Huffman Coding: The Computer Journal, vol. 33, No. 4, 1990; A.S. Fraenkel and T. Klein.4Enhancement of One-Dimensional Variable-Length DPCM Images Corrupted by Transmission Errors; I.E.E.E. Trans. On Communications 37 Apr., 1989, No. 4, New York, New York; Kenneth M. Rose.5New Binary Encoding Schemes of Positive Integers, 2334 The Transactions of the Institute of Electronics, Information and Comm. Engineers E74; Sep. 1991, No. 9, Toyko, Japan; Yoko Miyakawa.Referenced byCiting PatentFiling datePublication dateApplicantTitleUS6552674 *Feb 15, 2002Apr 22, 2003Texas Instruments IncorporatedAutomatic configuration of universal variable length code for video codingUS6741651 *Jan 20, 1999May 25, 2004Matsushita Electric Industrial Co., Ltd.Variable-length encoderUS6794996 *Feb 8, 2002Sep 21, 2004Sony CorporationContent supply system and information processing methodUS6856264 *Apr 16, 2004Feb 15, 2005Texas Instruments IncorporatedMethod for decoding reversible variable length code using leading-zeros variable length decoding techniquesUS7218251 *Mar 7, 2003May 15, 2007Sony CorporationSignal reproducing method and device, signal recording method and device, and code sequence generating method and deviceUS7372375May 14, 2007May 13, 2008Sony CorporationSignal reproducing method and device, signal recording method and device, and code sequence generating method and deviceUS7659839 *Aug 8, 2008Feb 9, 2010Ternarylogic LlcMethods and systems for modifying the statistical distribution of symbols in a coded messageUS7864087Dec 21, 2009Jan 4, 2011Ternarylogic LlcMethods and systems for modifying the statistical distribution of symbols in a coded messageUS8072358 *Jul 31, 2009Dec 6, 2011Fujitsu LimitedVariable length decoder, encoder, and variable length decoding methodUS8218703Dec 3, 2009Jul 10, 2012Battelle Memorial InstituteMethods of processing a wireless communication signal, wireless communication synchronization methods, and a radio frequency identification device communication methodUS8577026Dec 29, 2010Nov 5, 2013Ternarylogic LlcMethods and apparatus in alternate finite field based coders and decoders* Cited by examinerClassifications U.S. Classification375/240.23, 375/E07.263, 375/E07.212, 375/E07.28, 375/E07.279, 341/67International ClassificationH04N7/66, H04N7/64, H04N7/50, G06T9/00, H04N7/36Cooperative ClassificationH04N19/00218, H04N19/00193, H04N19/00278, H04N19/00321, H04N19/00545, H04N19/00696, H04N19/00884, H04N19/00781, H04N19/00957, H04N19/00454, H04N19/00878, H04N19/0086, H04N19/00854, H04N19/00933European ClassificationH04N7/26A4V, H04N7/26A6S2, H04N7/26A8Y, H04N7/26E4, H04N7/50, H04N7/26A10S, H04N7/26A8B, H04N7/26Y, H04N7/26Z12, H04N7/26A6E6, H04N7/26M6E2, H04N19/00R, H04N19/00R1, H04N19/00R4, H04N7/64, H04N7/66Legal EventsDateCodeEventDescriptionFeb 22, 2011FPExpired due to failure to pay maintenance feeEffective date: 20101231Dec 31, 2010LAPSLapse for failure to pay maintenance feesAug 9, 2010REMIMaintenance fee reminder mailedJun 5, 2006FPAYFee paymentYear of fee payment: 4RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services