Encoding device and method, decoding device and method, editing device and method, recoding medium, and program

Technical Field

The present invention relates to encoding devices and methods, decoding devices and methods, editing devices and methods, storage media, and programs. In particular, the present invention relates to an encoding device and a method, a decoding device and a method, an editing device and a method, a storage medium, and a program which are preferably used for transmitting/receiving image information (bitstreams), compressed by motion compensation and orthogonal transformation, such as a discrete cosine transform or Karhunen-Loeve transform, through a network medium, such as satellite broadcast, cable television broadcast, or the Internet, or are preferably used for processing image information on a storage medium, such as an optical disk, a magnetic disk, or a flash memory.

Background Art

In recent years, devices that digitally process image information with an aim of efficient transmission and storage of information and that are compliant with an MPEG (Moving Picture Expert Group) standard or the like for compression by motion compensation and orthogonal transformation, such as a discrete cosine transform, using an image-information-specific redundancy are becoming widespread in both information distribution by broadcast stations and information reception by general homes.

In particular, MPEG-2(ISO/IEC 13818-2) is a standard that was defined as a universal image compression scheme and that covers both interlaced scan images and progressive scan images as well as standard resolution images and high-definition images. MPEG-2 is widely used in a wide variety of applications for professional and consumer applications, for example, as represented by a DVD (Digital Versatile Disk) standard.

Through the use of the MPEG-2 compression scheme, for example, assigning a bit rate (bit rate) of 4 to 8 Mbps to a standard-resolution interlaced scan image having 720 × 480 pixels and a bit rate of 18 to 22 Mbps to a high-resolution interlaced scan image having 1920 × 1088 pixels can achieve favorable images with high compression ratios.

MPEG-2 was mainly intended for high-quality coding suitable for broadcasting, but was not compatible with a coding scheme employing a higher compression ratio and thus an MPEG-4 coding scheme has been standardized. With regard to an image coding scheme, the scheme was approved as an ISO/IEC 14496-2 international standard in December, 1998.

In addition, in recent years, with an initial purpose of image coding for videoconferences, the standardization of what is called H.26L (ITU/T Q6/16 VCEG) by ITU-T (International Telecommunication Union - Telecommunication Standardization Sector) is in progress. H.26L requires a larger amount of computation for encoding and decoding, compared to MPEG-2 and MPEG-4 coding schemes, but is known as achieving higher coding efficiency.

Further, as part of MPEG-4 activities, the standardization of a coding technique for realizing higher coding efficiency based on H.26L is currently underway by JVT (Joint Video Team) in cooperation with ITU-T.

Now, a description is given of image compression using motion compensation and orthogonal transformation, such as a discrete cosine transform or Karhunen-Loeve transform. <figref idref="f0001">FIG. 1</figref> is a diagram showing the configuration of one example of a conventional image-information encoding device.

In an image-information encoding device 10 shown in <figref idref="f0001">FIG. 1</figref>, image information provided by an analog signal input from an input terminal 11 is converted by an A/D converter 12 into a digital signal. The screen rearranging buffer 13 rearranges frames in accordance with a GOP (Group of Pictures) structure of image information supplied from the A/D converter 12.

Here, with respect to an image on which intra (intra-image) encoding is performed, the screen rearranging buffer 13 supplies image information of an entire frame to an orthogonal transformation unit 15. The orthogonal transformation unit 15 performs a discrete cosine transform or Karhunen-Loeve transform on the image information and supplies a transform coefficient to a quantization unit 16. The quantization unit 16 performs quantization processing on the transform coefficient supplied from the orthogonal transformation unit 15.

Based on a quantization scale and a transform coefficient quantized and supplied by the quantization unit 16, a reversible encoding unit 17 determines an encoding mode, performs variable-length encoding or reversible encoding, such as arithmetic encoding, on the encoding mode to create information to be inserted into the header portion of an image encoding unit. The reversible encoding unit 17 then supplies the encoded encoding-mode to a storage buffer 18 for storage. The encoded encoding-mode is output from an output terminal 19 as compressed image information.

The reversible encoding unit 17 also performs variable-length encoding or reversible encoding, such as arithmetic encoding, on the quantized transform coefficient and supplies the encoded transform coefficient to the storage buffer 18 for storage. The encoded transform coefficient is output from the output terminal 19 as compressed image information.

The behavior of the quantization unit 16 is controlled by a rate controller 20 in accordance with the amount of data of transform coefficient stored in the storage buffer 18. The rate controller 20 also supplies a quantized transform coefficient to a dequantization unit 21. The dequantization unit 21 dequantizes the quantized transform coefficient. An inverse orthogonal transformation unit 22 performs inverse orthogonal transformation processing on the dequantized transform coefficient to generate decoded image information and supplies the information to a frame memory 23 for storage.

With respect to an image on which inter (inter-image) encoding is performed, the screen rearranging buffer 13 supplies image information to a motion prediction/compensation unit 24. The motion prediction/compensation unit 24 simultaneously retrieves image information that is referred to from the frame memory 23 and performs motion prediction/compensation processing on the image information to generate reference image information. The motion prediction/compensation unit 24 supplies the generated reference image information to an adder 14. The adder 14 converts the reference image information into a signal indicating a difference relative to corresponding image information. At the same time, the motion prediction/compensation unit 24 also supplies motion vector information to the reversible encoding unit 17.

The reversible encoding unit 17 determines an encoding mode from the quantization scale and the transform coefficient quantized and supplied by the quantization unit 16 and the motion vector information supplied from the motion prediction/compensation unit 24. The reversible encoding unit 17 performs variable-length encoding or reversible encoding, such as arithmetic encoding on the determined encoding mode to generate information to be inserted into the header portion of an image encoding unit. The reversible encoding unit 17 supplies the encoded encoding-mode to the storage buffer 18 for storage. The encoded encoding-mode is output as compressed image information.

The reversible encoding unit 17 performs variable-length encoding or reversible encoding processing, such as arithmetic encoding, on the motion vector information to generate information to be inserted into the header portion of an image encoding unit.

Unlike intra encoding, in the case of inter encoding, image information input to the orthogonal transformation unit 15 is a difference signal provided by the adder 14. Since other processing is analogous to that for the compressed image information on which intra encoding is performed, the description thereof is omitted.

Next, the configuration of one embodiment of an image-information decoding device corresponding to the above-described image-information encoding device 10 will be described with reference to <figref idref="f0002">FIG. 2</figref>. In an image-information decoding device 40 shown in <figref idref="f0002">FIG. 2</figref>, compressed image information input from an input terminal 41 is temporarily stored by a storage buffer 42 and is then transferred to a reversible decoding unit 43.

In accordance with a predetermined compressed-image-information format, the reversible decoding unit 43 performs processing, such as variable length decoding or arithmetic decoding, on the compressed image information. The reversible decoding unit 43 then obtains encoding mode information stored in a header portion and supplies the encoding mode information to a dequnatization unit 44. Similarly, the reversible decoding unit 43 obtains a quantized transform coefficient and supplies the coefficient to the dequnatization unit 44. When a frame to be decoded has been subjected to inter encoding, the reversible decoding unit 43 also decodes motion vector information stored in the header portion of compressed image information and supplies the information to a motion prediction/compensation unit 51.

The dequnatization unit 44 dequantizes the quantized transform coefficient supplied from the reversible decoding unit 43 and supplies the resulting transform coefficient to an inverse orthogonal transformation unit 45. In accordance with a predetermined compressed-image-information format, the inverse orthogonal transformation unit 45 performs inverse orthogonal transformation, such as inverse discrete cosine transform or Karhunen-Loeve transform, on the transform coefficient.

Here, when a frame of interest has been subjected to intra encoding, image information subjected to the inverse orthogonal transformation processing is stored in a screen rearranging buffer 47. After the image information is subjected to D/A conversion processing by a D/A converter 48, the resulting information is output from an output terminal 49.

Also, when a frame of interest has been subjected to inter encoding, the motion prediction/compensation unit 51 generates a reference image in accordance with motion vector information that has been subjected to reversible decoding processing and image information stored in a frame memory 50, and supplies the reference image to an adder 46. The adder 46 combines the reference image with the output from the inverse orthogonal transformation unit 45. Since other processing is analogous to that for the frame that has been subjected to intra encoding, the description thereof is omitted.

For a coding scheme (hereinafter referred to as "JVT Codec") being standardized by the above-mentioned Joint Video Team, various schemes have been under consideration in order to improve the coding efficiency of MPEG-2, MPEG-4, and so on. For example, for the transformation scheme of a discrete cosine transform, an integer-coefficient transform with a 4 × 4 block size is used. Further, the block size for motion compensation is variable, so that more optimum motion compensation can be performed. The basic scheme, however, can be realized in the same manner as the encoding scheme performed in the image-information encoding device 10 shown in <figref idref="f0001">FIG. 1</figref>.

Thus, the JVT codec can perform decoding using essentially the same scheme as the decoding scheme performed in the image-information decoding device 40 shown in <figref idref="f0002">FIG. 2</figref>.

Meanwhile, in order to maintain the compatibility between different encoding devices (decoders) and to prevent buffer overflow or underflow, The MPEG and ITU-T use a buffer model. A virtual decoder buffer model is standardized and an encoding device (encoder) performs encoding so that the virtual decoder buffer does not fail. This makes it possible to prevent buffer overflow or underflow at the decoder side and to maintain the compatibility.

A virtual buffer model according to the MPEG will be described with reference to <figref idref="f0003">FIG. 3</figref>. In the following description, R indicates an input bit rate for a decoder buffer, B indicates the size of the decoder buffer, F indicates the amount of buffer occupied when the decoder extracts a first frame from the buffer, and D indicates delay time therefor.

Bit amounts of each frame at time t0, t1, t2, ... are indicated by b0, b1, b2 ..., and so on.

When the frame rate is M, the following expression is satisfied: <maths id="math0001" num=""><math display="block"><msub><mi mathvariant="normal">t</mi><mrow><mi mathvariant="normal">i</mi><mo mathvariant="normal">+</mo><mn mathvariant="normal">1</mn></mrow></msub><mo mathvariant="normal">-</mo><msub><mi mathvariant="normal">t</mi><mi mathvariant="normal">i</mi></msub><mo mathvariant="normal">=</mo><mn mathvariant="normal">1</mn><mo mathvariant="normal">/</mo><mi mathvariant="normal">M</mi></math><img file="EP2403263A2_D0001.tif" /></maths>

When B_i indicates the amount of buffer occupancy immediately before bit amount b_i of a frame at time t_i is extracted, expression (1) below is satisfied: <maths id="math0002" num="(1)"><math display="block"><mtable columnalign="left"><mtr><mtd><msub><mi mathvariant="normal">B</mi><mn mathvariant="normal">0</mn></msub><mo mathvariant="normal">=</mo><mi mathvariant="normal">F</mi></mtd></mtr><mtr><mtd><msub><mi mathvariant="normal">B</mi><mrow><mi mathvariant="normal">i</mi><mo mathvariant="normal">+</mo><mn mathvariant="normal">1</mn></mrow></msub><mo mathvariant="normal">=</mo><mi>min</mi><mspace width="1em" /><mfenced separators=""><mi mathvariant="normal">B</mi><mo mathvariant="normal">,</mo><msub><mi mathvariant="normal">B</mi><mi mathvariant="normal">i</mi></msub><mo mathvariant="normal">-</mo><msub><mi mathvariant="normal">b</mi><mi mathvariant="normal">i</mi></msub><mo mathvariant="normal">+</mo><mi mathvariant="normal">R</mi><mo>⁢</mo><mfenced separators=""><msub><mi mathvariant="normal">t</mi><mrow><mi mathvariant="normal">i</mi><mo mathvariant="normal">+</mo><mn mathvariant="normal">1</mn></mrow></msub><mo mathvariant="normal">-</mo><msub><mi mathvariant="normal">t</mi><mi mathvariant="normal">i</mi></msub></mfenced></mfenced></mtd></mtr></mtable></math><img file="EP2403263A2_D0002.tif" /></maths>

In this case, for a fixed bit rate encoding scheme for MPEG-2, the encoder must perform encoding so as to satisfy condition (2) below: <maths id="math0003" num="(2)"><math display="block"><mtable columnalign="left"><mtr><mtd><mi>Bi</mi><mo mathvariant="normal">≤</mo><mi mathvariant="normal">B</mi></mtd></mtr><mtr><mtd><mi>Bi</mi><mo mathvariant="normal">-</mo><mi>bi</mi><mo mathvariant="normal">≥</mo><mn mathvariant="normal">0</mn></mtd></mtr></mtable></math><img file="EP2403263A2_D0003.tif" /></maths>

As long as such a condition is satisfied, the encoder should not perform encoding that causes buffer overflow and underflow.

Further, for a variable bit rate encoding scheme for MPEG-2, the input bit rate R is a maximum bit rate defined by a profile and a level and is given by F = B. Thus, expression (1) can be rewritten as expression (3) <maths id="math0004" num="(3)"><math display="block"><mtable columnalign="left"><mtr><mtd><msub><mi mathvariant="normal">B</mi><mn mathvariant="normal">0</mn></msub><mo mathvariant="normal">=</mo><mi mathvariant="normal">B</mi></mtd></mtr><mtr><mtd><msub><mi mathvariant="normal">B</mi><mrow><mi mathvariant="normal">i</mi><mo mathvariant="normal">+</mo><mn mathvariant="normal">1</mn></mrow></msub><mo mathvariant="normal">=</mo><mi>min</mi><mspace width="1em" /><mfenced separators=""><mi mathvariant="normal">B</mi><mo mathvariant="normal">,</mo><msub><mi mathvariant="normal">B</mi><mi mathvariant="normal">i</mi></msub><mo mathvariant="normal">-</mo><msub><mi mathvariant="normal">b</mi><mi mathvariant="normal">i</mi></msub><mo mathvariant="normal">+</mo><msub><mi mathvariant="normal">R</mi><mi>max</mi></msub><mo>⁢</mo><mfenced separators=""><msub><mi mathvariant="normal">t</mi><mrow><mi mathvariant="normal">i</mi><mo mathvariant="normal">+</mo><mn mathvariant="normal">1</mn></mrow></msub><mo mathvariant="normal">-</mo><msub><mi mathvariant="normal">t</mi><mi mathvariant="normal">i</mi></msub></mfenced></mfenced></mtd></mtr></mtable></math><img file="EP2403263A2_D0004.tif" /></maths>

In this case, the encoder must perform encoding so as to satisfy expression (4) below: <maths id="math0005" num="(4)"><math display="block"><msub><mi mathvariant="normal">B</mi><mi mathvariant="normal">i</mi></msub><mo mathvariant="normal">-</mo><msub><mi mathvariant="normal">b</mi><mi mathvariant="normal">i</mi></msub><mo mathvariant="normal">≥</mo><mn mathvariant="normal">0</mn></math><img file="EP2403263A2_D0005.tif" /></maths>

When this condition is satisfied, the encoder will perform encoding that does not cause buffer underflow at the decoder side. When the decoder buffer becomes full, the encoder buffer is empty and this indicates that no encoding bitstream is generated. Thus, there is no need for the encoder to perform monitoring so that the buffer overflow of the decoder does not occur.

In the MPEG, encoding is performed so as to comply with the above-described buffer restrictions in accordance with a buffer size and a bit rate defined by each profile and level. Thus, a decoder that conforms to each profile and level can perform decoding without causing failure of the bitstream.

In practice, however, without the use of a buffer size and a bit rate defined by a profile and a level, there are cases in that a bitstream can be decoded.

For example, a bitstream encoded with a bit rate R, a buffer B, and initial delay time F, i.e., (R, B, F), can be decoded by a decoder having a larger buffer size B' (B'&gt;B). The bitstream can also be decoded at a higher bit rate R' (R'&gt;R).

For example, when the decoding bit rate of a decoder is lower than an encoding bit rate, a decoder that has a sufficiently large buffer size can perform decoding.

In this manner, when a predetermined bitstream is given, a minimum buffer size B_min needed to decode the bitstream exists at each bit rate. Such a relationship is shown in <figref idref="f0004">FIG. 4</figref>.

The standardization of JVT Codec has been in progress so that decoding is possible not only with a fixed bit rate and a buffer size defined by each profile and level but also is possibly by a decoder having the condition shown in <figref idref="f0004">FIG. 4</figref>. This has the objective of allowing decoding even if the decoding bit rate and buffer size of an encoder and the decoding bit rate and buffer size of a decoder are not necessarily the same. By achieving the objective, for example, a decoder having a high decoding bit rate can reduce a buffer size.

However, such information varies in a bitstream with time. Thus, there is a problem in that, even when decoding is possible under a predetermined condition, decoding may be impossible under another condition, since the restrictions for decoder compatibility has been relaxed. For example, when such a characteristic of (R, B) varies with time, there is a problem in that, even when decoding is possible at predetermined time, decoding may be impossible at another time.

Further, there is a problem in that decoding is not always possible in the case of shifting to another scene or another channel due to random access or the like. There is also a problem in that the decoding possibility cannot be guaranteed when bitstream-level editing, such as splicing (splicing), is performed.

Disclosure of Invention

The present invention has been made in view of such situations, and an object of the present invention is to efficiently determine the decoding possibility of a bitstream and to simplify bitstream editing, such as splicing.

An encoding device of the present invention includes generating means for generating a header to which reference is made as needed during decoding; encoding means for encoding the header generated by the generating means and an input image signal, respectively; and outputting means for multiplexing the header and the image signal encoded by the encoding means and outputting a bitstream. The encoding device is characterized in that the generating means generates the header containing buffer characteristic information about buffering during decoding of the bitstream.

The generating means can generate the header containing the buffer characteristic information for each predetermined section randomly accessible in the bitstream.

The generating means can generate the header containing the buffer characteristic information for an entire sequence of the bitstream.

The buffer characteristic information can contain all of a minimum bit rate, a minimum buffer size B, and a minimum delay amount which are decodable during decoding of the bitstream.

An encoding method of the present invention includes a generating step of generating a header to which reference is made as needed during decoding; an encoding step of encoding the header generated in the generating step and an input image signal, respectively; and an output controlling step of controlling output of a bitstream in which the header and the image signal encoded by the processing in the encoding step are multiplexed. The encoding method is characterized in that the processing in the generating step generates the header containing buffer characteristic information about buffering during decoding of the bitstream.

A program for a first storage medium of the present invention includes a generating step of generating a header to which reference is made as needed during decoding; an encoding step of encoding the header generated by the processing in the generating step and an input image signal, respectively; and an output controlling step of controlling output of a bitstream in which the header and the image signal encoded by the processing in the encoding step are multiplexed. The program is characterized in that the processing in the generating step generates the header containing buffer characteristic information about buffering during decoding of the bitstream.

A first program of the present invention causes a computer to execute processing that includes a generating step of generating a header to which reference is made as needed during decoding; an encoding step of encoding the header generated in the generating step and an input image signal, respectively; and an output controlling step of controlling output of a bitstream in which the header and the image signal encoded by the processing in the encoding step are multiplexed. The program is characterized in that the processing in the generating step generates the header containing buffer characteristic information about buffering during decoding of the bitstream.

A decoding device of the present invention is characterized by including searching means for searching for a header in an input bitstream; and decoding means for reading buffer characteristic information about buffering, which information contained in the header found by the searching means, and for decoding the bitstream in accordance with the read buffer characteristic information.

The buffer characteristic information can contain all of a minimum bit rate, a minimum buffer size, and a minimum delay amount which are decodable during decoding of the bitstream.

A decoding method of the present invention is characterized by including a searching step of searching for a header in an input bitstream; and a decoding step of reading buffer characteristic information about buffering, which information contained in the header found by the processing in the searching step, and of decoding the bitstream in accordance with the read buffer characteristic information.

A program for a second storage medium of the present invention is characterized by including a searching step of searching for a header in an input bitstream; and a decoding step of reading buffer characteristic information about buffering, which information contained in the header found by the processing in the searching step, and of decoding the bitstream in accordance with the read buffer characteristic information.

A second program of the present invention is characterized by causing a computer to execute processing that includes a searching step of searching for a header in an input bitstream; and a decoding step of reading buffer characteristic information about buffering, which information contained in the header found by the processing in the searching step, and of decoding the bitstream in accordance with the read buffer characteristic information.

An editing device of the present invention includes searching means for searching for a header in an input bitstream; determining means for reading buffer characteristic information about buffering, which information contained in the header found by the searching means, and for determining whether or not the bitstream can be edited in accordance with the read buffer characteristic information; and editing means for editing the bitstream when the determining means determines that the bitstream can be edited. The editing device is characterized in that, when a characteristic curve created from the information contained in the header in a first bitstream is always located above or is the same as a characteristic curve created from the information contained in the header in a second bitstream, the determining means determines that editing using the first bitstream and the second bitstream is possible.

An editing method of the present invention includes a searching step of searching for a header in an input bitstream; a determining step of reading buffer characteristic information about buffering, which information contained in the header found by the processing in the searching step, and of determining whether or not the bitstream can be edited in accordance with the read information; and an editing step of editing the bitstream when the processing in the determining step determines that the bitstream can be edited. The editing method is characterized in that, when a characteristic curve created from the information contained in the header in a first bitstream is always located above or is the same as a characteristic curve created from the information contained in the header in a second bitstream, the processing in the determining step determines that editing using the first bitstream and the second bitstream is possible.

A program for a third storage medium of the present invention includes a searching step of searching for a header in an input bitstream; a determining step of reading buffer characteristic information about buffering, which information contained in the header found by the processing in the searching step, and of determining whether or not the bitstream can be edited in accordance with the read information; and an editing step of editing the bitstream when the processing in the determining step determines that the bitstream can be edited. The program is characterized in that, when a characteristic curve created from the information contained in the header in a first bitstream is always located above or is the same as a characteristic curve created from the information contained in the header in a second bitstream, the processing in the determining step determines that editing using the first bitstream and the second bitstream is possible.

A third program of the present invention causes a computer to execute processing that includes a searching step of searching for a header in an input bitstream; a determining step of reading buffer characteristic information about buffering, which information contained in the header found by the processing in the searching step, and of determining whether or not the bitstream can be edited in accordance with the read information; and an editing step of editing the bitstream when the processing in the determining step determines that the bitstream can be edited. The program is characterized in that, when a characteristic curve created from the information contained in the header in a first bitstream is always located above or is the same as a characteristic curve created from the information contained in the header in a second bitstream, the processing in the determining step determines that editing using the first bitstream and the second bitstream is possible.

According to the encoding device and the method as well as the first program of the present invention, buffer characteristic information about buffering during decoding of a bitstream is contained in a header that is encoded and multiplexed with the bitstream. This can prevent a decoding side from causing buffer failure.

According to the decoding device and the method as well as the second program of the present invention, buffer characteristic information about buffering during decoding, which information contained in a header in an input bitstream, is read and decoding is performed in accordance with the read information.

According to the editing device and the method as well as the third program of the present invention, a determination as to whether an input bitstream can be edited is made by determining whether a characteristic curve created from information contained in a header in a first bitstream is always located above or is the same as a characteristic curve created from information contained in a header in a second bitstream.

Brief Description of the Drawings

<ul id="ul0001" list-style="none" compact="compact"><li><figref idref="f0001">FIG. 1</figref> is a diagram showing the configuration of one example of a conventional image-information encoding device.</li><li><figref idref="f0002">FIG. 2</figref> is a diagram showing the configuration of one example of a conventional image-information decoding device.</li><li><figref idref="f0003">FIG. 3</figref> is a graph for describing the amount of buffer.</li><li><figref idref="f0004">FIG. 4</figref> is a graph for describing the relationship between a bit rate and the amount of buffer.</li><li><figref idref="f0005">FIG. 5</figref> is a diagram showing the configuration of one embodiment of an encoding device according to the present invention.</li><li><figref idref="f0006">FIG. 6</figref> is graph for describing the amount of buffer.</li><li><figref idref="f0007">FIG. 7</figref> is a diagram showing the configuration of one embodiment of a decoding device according to the present invention.</li><li><figref idref="f0008">FIG. 8</figref> is a diagram showing the configuration of one embodiment of an editing device according to the present invention.</li><li><figref idref="f0009">FIG. 9</figref> is a graph for describing the relationship between a bit rate and the amount of buffer.</li><li><figref idref="f0010">FIG. 10</figref> is a diagram for describing a medium.</li></ul>

Best Mode for Carrying Out the Invention

An embodiment of the present invention will be described below with reference to the accompanying drawings. <figref idref="f0005">FIG. 5</figref> is a diagram showing the configuration of one embodiment of an encoding device according to the present invention. An encoding device 70 shown in <figref idref="f0005">FIG. 5</figref> includes the image-information encoding device 10 shown in <figref idref="f0001">FIG. 1</figref>. Here, the configuration and so on of the image-information encoding device 10 has been described, the description thereof is omitted as appropriate.

Image information input to the image-information encoding device 10 is encoded and is output as compressed image information (BS: bitstream) to a buffer 71 and a bitstream analyzing unit 72. The buffer 71 temporarily stores the input bitstream and outputs the bitstream to a buffer-information adding unit 73 as needed. The bitstream analyzing unit 72 checks the buffer occupancy state of a predetermined section in a bitstream, for example, a section between GOPs or random access points, and supplies the information to the buffer-information adding unit 73 as buffer information BH. Here, the "random access point" refers to a predetermined section randomly accessible in a bitstream in a JVT standard. Similarly, the "GOP" refers to a predetermined section randomly accessible in an MPEG-2/MPEG-4 standard.

The buffer-information adding unit 73 adds the input buffer information BH to an input bitstream and outputs the resulting information.

In this case, as one example of analysis performed by the bitstream analyzing unit 72, a description is given of an exemplary case in which a buffer occupancy state is checked between random access points and the information of the buffer occupancy state is encoded as header information for each random access point to thereby constitute a bitstream. While the description here is described in such a manner, the encoding may be performed in units of GOP or another arbitrarily unit may be used. Thus, needless to say, the present invention is applicable to a case in which another unit is used in stead of a unit described below.

A method for determining the characteristic of (R_min, B_min) will be described with reference to <figref idref="f0006">FIG. 6</figref>. R_min herein indicates the minimum value of an input bit rate R for the buffer and B_min indicates the minimum value of a buffer size B.

When the bit rate R of a predetermined bitstream is given, the minimum buffer size B_min that is decodable by a decoding device (e.g., having a configuration shown in <figref idref="f0007">FIG. 7</figref>) for decoding the bitstream at the decoding bit rate R is determined, for example, in the following manner.

The number of frames between predetermined access points is indicated by N. The amount of bits generated for each frame is b(i) (i=1, N), the amount of buffer occupancy immediately before data of each frame is extracted from the buffer is B(i), and the amount of buffer occupancy immediately after the extraction is B2(i). The amount of buffer of the encoding device is indicated by B. Then, the following is given: <maths id="math0006" num="(5)"><math display="block"><mtable columnalign="left"><mtr><mtd><mi mathvariant="normal">B</mi><mo>⁢</mo><mn mathvariant="normal">2</mn><mfenced><mi mathvariant="normal">i</mi></mfenced><mo mathvariant="normal">=</mo><mi mathvariant="normal">B</mi><mfenced><mi mathvariant="normal">i</mi></mfenced><mo mathvariant="normal">-</mo><mi mathvariant="normal">b</mi><mfenced><mi mathvariant="normal">i</mi></mfenced></mtd></mtr><mtr><mtd><mi mathvariant="normal">B</mi><mo>⁢</mo><mfenced separators=""><mi mathvariant="normal">i</mi><mo mathvariant="normal">+</mo><mn mathvariant="normal">1</mn></mfenced><mo mathvariant="normal">=</mo><mi mathvariant="normal">B</mi><mo>⁢</mo><mn mathvariant="normal">2</mn><mfenced><mi mathvariant="normal">i</mi></mfenced><mo mathvariant="normal">+</mo><mi mathvariant="normal">R</mi><mo mathvariant="normal">/</mo><mfenced><mi>Frame Rate</mi></mfenced></mtd></mtr></mtable></math><img file="EP2403263A2_D0006.tif" /></maths> where if(B(i+1)&gt;B)B(i+1)=B and the maximum value of B(i) is B. Further, suppose a delay amount F satisfies F = B.

In this case, B_min can be determined by expression (6) below: <maths id="math0007" num="(6)"><math display="block"><msub><mi mathvariant="normal">B</mi><mi>min</mi></msub><mo mathvariant="normal">=</mo><mi mathvariant="normal">B</mi><mo mathvariant="normal">-</mo><mi>min</mi><mfenced separators=""><mi mathvariant="normal">B</mi><mo>⁢</mo><mn mathvariant="normal">2</mn><mfenced><mi mathvariant="normal">i</mi></mfenced></mfenced></math><img file="EP2403263A2_D0007.tif" /></maths> When R is assumed to be R_min in this case, the above described method can determine (R_min, B_min).

Next, one example of a method for determining (R_min, B_min, F_min) will be described. Let B=B_min' R=R_min. As in expression (5), expression (7) below is satisfied : <maths id="math0008" num="(7)"><math display="block"><mtable columnalign="left"><mtr><mtd><mi mathvariant="normal">B</mi><mo>⁢</mo><mn mathvariant="normal">2</mn><mfenced><mi mathvariant="normal">i</mi></mfenced><mo mathvariant="normal">=</mo><mi mathvariant="normal">B</mi><mfenced><mi mathvariant="normal">i</mi></mfenced><mo mathvariant="normal">-</mo><mi mathvariant="normal">b</mi><mfenced><mi mathvariant="normal">i</mi></mfenced></mtd></mtr><mtr><mtd><mi mathvariant="normal">B</mi><mo>⁢</mo><mfenced separators=""><mi mathvariant="normal">i</mi><mo mathvariant="normal">+</mo><mn mathvariant="normal">1</mn></mfenced><mo mathvariant="normal">=</mo><mi mathvariant="normal">B</mi><mo>⁢</mo><mn mathvariant="normal">2</mn><mfenced><mi mathvariant="normal">i</mi></mfenced><mo mathvariant="normal">+</mo><mi mathvariant="normal">R</mi><mo mathvariant="normal">/</mo><mfenced><mi>Frame Rate</mi></mfenced></mtd></mtr></mtable></math><img file="EP2403263A2_D0008.tif" /></maths> where monitoring for an underflow is performed in accordance with the following condition. <maths id="math0009" num=""><math display="block"><mi>if</mi><mfenced separators=""><mi mathvariant="normal">B</mi><mo>⁢</mo><mn mathvariant="normal">2</mn><mfenced><mi mathvariant="normal">i</mi></mfenced><mo mathvariant="normal">&lt;</mo><mn mathvariant="normal">0</mn></mfenced></math><img file="EP2403263A2_D0009.tif" /></maths><maths id="math0010" num=""><math display="block"><mtable columnalign="left"><mtr><mtd><msub><mi mathvariant="normal">F</mi><mi>min</mi></msub><mo>=</mo><msub><mi mathvariant="normal">F</mi><mi>min</mi></msub><mo mathvariant="normal">+</mo><mfenced separators=""><mn mathvariant="normal">0</mn><mo>-</mo><mi mathvariant="normal">B</mi><mo>⁢</mo><mn mathvariant="normal">2</mn><mfenced><mi mathvariant="normal">i</mi></mfenced></mfenced><mo mathvariant="normal">;</mo></mtd></mtr><mtr><mtd><mi mathvariant="normal">B</mi><mo>⁢</mo><mn mathvariant="normal">2</mn><mfenced><mi mathvariant="normal">i</mi></mfenced><mo mathvariant="normal">=</mo><mn mathvariant="normal">0</mn><mo mathvariant="normal">;</mo><mrow><mo mathvariant="normal">}</mo></mrow></mtd></mtr></mtable></math><img file="EP2403263A2_D0010.tif" /></maths>

F_min is initialized to "0" at the start of each random access point. Monitoring for an overflow is similarly performed in accordance with the following condition. <maths id="math0011" num=""><math display="block"><mi>if</mi><mo>⁢</mo><mfenced separators=""><mi mathvariant="normal">B</mi><mo>⁢</mo><mfenced separators=""><mi mathvariant="normal">i</mi><mo mathvariant="normal">+</mo><mn mathvariant="normal">1</mn></mfenced><mo>&gt;</mo><mi mathvariant="normal">B</mi></mfenced><mo>⁢</mo><mi mathvariant="normal">B</mi><mo>⁢</mo><mfenced separators=""><mi mathvariant="normal">i</mi><mo mathvariant="normal">+</mo><mn mathvariant="normal">1</mn></mfenced><mo mathvariant="normal">=</mo><mi mathvariant="normal">B</mi></math><img file="EP2403263A2_D0011.tif" /></maths>

(R_min, B_min, F_min) is determined by performing the above-described checking on every frame between random access points.

(R_min, B_min' F_min) described above may be checked by a predetermined number thereof or may be defined by only independent combinations thereamong. The characteristic determined as described above is as shown in <figref idref="f0004">FIG. 4</figref>. Portions between points are linearly interpolated. The values of (R_min, B_min, F_min) obtained as described above, i.e., buffer information BH, are inserted into a predetermined position in a bitstream by the buffer-information adding unit 73, are encoded, and are output.

Simultaneously with (R_min, B_min, F_min) between random accesses, as described above, the bitstream analyzing unit 72 performs similar analysis on the entire bitstream to determine the characteristic of the entire bitstream, i.e., (R_min, B_min, F_min) global. The bitstream analyzing unit 72 then supplies the values thereof to the buffer-information adding unit 73 as the buffer information BH.

The bitstream BS output from the image-information encoding device 10 is delayed by a predetermined amount of time by the buffer 71 and is then input to the buffer-information adding unit 73. The buffer-information adding unit 73 inserts the buffer information BH, supplied from the bitstream analyzing unit 72, into a predetermined position in the bitstream and outputs a final output bitstream BS.

In this case, the buffer information BH (or buffer characteristic information) is, for example, (R_min, B_min, F_min) and (R_min, B_min, F_min) global. The buffer-information adding unit 73 inserts the above-described information into a predetermined position in the bitstream BS. One example of syntax will be described below. <pre listing-type="program-listing"> RAP_header () { RAP_startcode; closed_GOP; broken_link; NumBufferParam; for (i=0 ; i&lt;NumBufferParam ; i++) { Rate [i] ; Buffer[i]; F [i] ; } }</pre>

(R_min, B_min' F_min) between random access points is recorded in, for example, in a random access point header immediately therebefore as the above-noted syntax. "RAP_startcode" is a code that indicates the presence of a RAP header and that indicates the start of the header.

"closed_GOP" is a flag indicating whether either all pictures in the GOP are independent without referring to any picture of another GOP or are dependent on a picture in another GOP while referring thereto. "broken_link" is a flag indicating whether or not a reference image for prediction exits when a bitstream is replaced in front of or behind the GOP by editing or the like.

NumBuffer_Param indicates the number of determined characteristic sets (R_min' B_min' F_min). Rate[i], Buffer[i], and F[i] indicate R_min, B_min, and F_min, respectively. In this case, for example, R_min is recorded in the increasing order.

(R_min, B_min, F_min) global of an entire bitstream is recorded in, for example, the first sequence header of the bitstream, as in the following syntax: <pre listing-type="program-listing"> Sequence_header () { Sequence_startcode; : : NumBufferParam; for (i=0 ; i&lt;NumBufferParam ; i++) { Rate [i] ; Buffer[i]; F [i] ; } }</pre> where NumBuffer_Param indicates the number of determined characteristic sets (R_min' B_min' F_min) global. Rate[i], Buffer [i], and F[i] indicate R_min, B_min, and F_min, respectively. In this case, R_min is recorded, for example in the increasing order.

After attaching the above-described buffer information BH, the buffer-information adding unit 73 outputs a final output bitstream BS.

In the embodiment of the present invention, as the buffer information BH, the minimum bit rate Rmin, the minimum buffer size Bmin, and the minimum delay amount Fmin are all added to a bitstream in the above description. However, the present invention is not limited to that example, and thus at least one of the minimum bit rate Rmin, the minimum buffer size Bmin, and the minimum delay amount Fmin may be added to a bitstream. For example, a combination of the minimum bit rate Rmin and the minimum buffer size Bmin may be added to a bitstream.

<figref idref="f0007">FIG. 7</figref> shows one embodiment of a decoding device according to the present invention. A decoding device 90 shown in <figref idref="f0007">FIG. 7</figref> corresponds to the encoding device 70 shown in <figref idref="f0005">FIG. 5</figref>. The decoding device 90 includes the image-information decoding device 40 shown in <figref idref="f0002">FIG. 2</figref> therein. A bitstream BS input to the decoding device 90 is supplied to a bitstream analyzing unit 91 a decoding-possibility determining unit 92.

The bitstream analyzing unit 91 decodes buffer information BH in the bitstream and outputs the resulting buffer information BH to the decoding-possibility determining unit 92. The bitstream analyzing unit 91 parses the bitstream to decode (R_min, B_min, F_min) global recorded in the sequence header. The bitstream analyzing unit 91 also decodes (R_min, B_min, F_min) recorded in each random access point header. Those pieces of information are output to the decoding-possibility determining unit 92.

The decoding-possibility determining unit 92 determines whether or not the input bitstream can be decoded without the input bitstream causing buffer failure, in accordance with the buffer information BH and decoder information DI supplied from the image-information decoding device 40. Examples of the decoder information DI include a decoder buffer size and a decoding bit rate.

The decoding-possibility determining unit 92 creates a characteristic curve as shown in <figref idref="f0004">FIG. 4</figref>, based on (R_min, B_min, F_min) global. Portions between points are linearly interpolated. In this case, a buffer of the decoder (decoding device 90) and the decoding bit rate are located above the characteristic curve formed from (R_min, B_min, F_min) global, it is possible to determine that the input bitstream is decodable. Thus, in such a case, the decoding-possibility determining unit 92 determines that the input bitstream is decodable and supplies the bitstream to the image-information decoding device 40.

The image-information decoding device 40 has essentially the same configuration as the image-information decoding device 40 shown in <figref idref="f0002">FIG. 2</figref>, and executes similar processing to decode the input bitstream and outputs image information to, for example, a television receiver which is not shown.

Whether or not an entire bitstream is decodable can be determined by checking the characteristic curve of (R_min, B_min, F_min) global, a decoder buffer size, and a decoding bit rate, as described above.

Also, when decoding of only a specific section from a predetermined random access point is desired due to random accessing, the decoding-possibility determining unit 92 similarly creates a characteristic curve as shown in <figref idref="f0004">FIG. 4</figref> from (R_min, B_min, F_min). Portions between points are linearly interpolated. In this case, when the decoder buffer and the decoding bit rate are located above the characteristic curve created from (R_min' B_min, F_min), the bitstream is decodable. Thus, in such a case, the decoding-possibility determining unit 92 determines that the bitstream is decodable and supplies the bitstream to the image-information decoding device 40.

Next, bitstream editing will be described. <figref idref="f0008">FIG. 8</figref> is a diagram showing the configuration of one embodiment of an editing device 110 for editing a bitstream according to the present invention. As an example of editing performed by the editing device 110, a description is given of a case in which splicing is performed to replace a portion of an input bitstream 1 with another input bitstream 2.

Now, splicing will be briefly described. Splicing is to perform editing by replacing a predetermined bitstream with another bitstream at a random access point. Such splicing is performed, for example, when a commercial broadcast is inserted into a television broadcast program. In this case, the input bitstream 1 corresponds to a bitstream of the television broadcast program and the input bitstream 2 corresponds to a bitstream of the commercial.

The input bitstream 1 is input to a bitstream analyzing unit 111-1 and the input bitstream 2 is input to a bitstream analyzing unit 111-2. The bitstream analyzing units 111-1 and 111-2 decode buffer information BH1 and BH2, contained in the input bitstreams 1 and 2, respectively, and output the resulting information to a bitstream editing unit 112.

In accordance with the buffer information BH1 and BH2, the bitstream editing unit 112 determines whether or not the input bitstream 2 can be inserted into the input bitstream 1 at a predetermined editing point. In this case, in order that an edited bitstream is decodable without a buffer failure of the decoder (the decoding device 90), it is necessary to satisfy a condition that the value of amount of buffer occupancy for the random access point and the value of amount of buffer occupancy for a portion immediately before the point are the same.

Decoders using MPEG-2 or -4 were designed so as to operate at a specific bit rate and a buffer size. On the other hand, with regard to decoders using a JVT scheme, restrictions for buffering has been relaxed so that decoding is possible when the characteristic curve is located above the characteristic curve of (R_min, B_min, F_min)even for other bit rates and buffer sizes, as shown in <figref idref="f0004">FIG. 4</figref>.

In order that bitstream editing does not cause the decoding possibility to be varied before and after the editing, it is sufficient to have the same (R_min, B_min, F_min) for the edit section. Thus, with respect to the input bitstreams 1 and 2, the bitstream editing unit 112 creates the characteristic (R_min, B_min, F_min) for a random access point header located in the edit section, and replaces the section with the bitstream 2 when those values match each other. When the values do not match each other, the bitstream editing unit 112 inserts padding bits to the bitstream 1 or 2 so that the values of (R_min, B_min, F_min) match each other and then replaces a corresponding section with the input bitstream 2.

Restrictions for buffering have been relaxed in the JVT, and the use of this advantage makes it possible to ease the buffer compatibility condition in splicing. In the JVT, when the decoder buffer size and the decoding bit rate are located above (R_min, B_min, F_min), it can be known that the bitstream is decodable. Thus, when (R_min, B_min, F_min) of a predetermined edit section of the input bitstream 2 to be inserted is always located below (R_min, B_min, F_min) of a predetermined edit section of the original input bitstream 1, a decoder that can decode the input bitstream 1 can also perform decoding even with that section being replaced with the bitstream 2.

<figref idref="f0009">FIG. 9</figref> illustrates the relationship. Curve 1 represents the characteristic of (R_min,B_min, F_min) of an edit section of the input bitstream 1. Curve 2 represents the characteristic of (R_min, B_min, F_min) of an edit section of the input bitstream 2. When the decoder buffer and the decoding bit rate are located above the curve, the bitstream is decodable. Thus, when curve 2 is always located below curve 1 as shown in <figref idref="f0009">FIG. 9</figref>, it is guaranteed that decoding is possible.

Accordingly, the bitstream editing unit 112 creates the characteristic of (R_min, B_min, F_min) for a random access point header located in an edit section with respect to the bitstreams 1 and 2. Then, when the characteristic curve of the bitstream 2 is located below the characteristic curve of the bitstream 1, the bitstream editing unit 112 replaces the corresponding section with the bitstream 2.

Conversely, when the characteristics do not match, the bitstream editing unit 112 makes a change by inserting padding bits to the bitstream 1 or 2 so that the characteristic curve of (R_min, B_min, F_min) of the bitstream 2 is located below the characteristic curve of the bitstream 1, and then replaces the section with the input bitstream 2.

When splicing is performed so as to satisfy such condition, a decoder that can decode the bitstream 1 will not fail. After splicing, the bitstream editing unit 112 outputs a final bitstream.

In this manner, containing such information (R_min,B_min, F_min), namely, a minimum bit rate, minimum buffer size, and minimum initial delay time, in the header of a randomly accessible point in a bitstream allows the decoding side to efficiently determine the decoding possibility of the bitstream. Further, this arrangement can facilitate bitstream editing, such as splicing, and can always decode the bitstream without causing buffer failure of a decoding side.

<figref idref="f0010">FIG. 10</figref> is a diagram showing an example of the internal configuration of a general-purpose personal computer. A CPU (Central Processing Unit) 211 of the personal computer executes various processing in accordance with a program stored in a ROM (Read Only Memory) 212. As appropriate, a RAM (Random Access Memory) 213 stores data and/or a program required for the CPU 211 to execute various processing. An input/output interface 215 is connected to an input unit 216, which is constituted by a keyboard and mouse, and outputs a signal, input through the input unit 216, to the CPU 211. The input/output interface 215 is also connected to an output unit 7, which is constituted by a display, speakers, and so on.

Further, the input/output interface 215 is connected to a storage unit 218, which includes a hard disk and so on, and a communication unit 219, which communicates data with another device through a network such as the Internet.

A drive 220 is used to write/read data to/from a storage medium, such as a magnetic disk 231, an optical disk 232, a magneto-optical disk 233, or a semiconductor memory 234.

As shown in <figref idref="f0010">FIG. 10</figref>, the storage medium is not only implemented by a package medium distributed separately from a personal computer to supply a program to a user, but is also implemented by a hard disk including the ROM 212 or the storage unit 218 that stores a program and that is supplied to a user after being pre-installed on a computer. An example of the package medium in which a program is recorded is the magnetic disk 231 (including a flexible disk), the optical disk 232 (including CD-ROM (Compact Disc-Read Only Memory), a DVD (Digital Versatile Disc), and the magneto-optical disk 233 (including an MD (Mini-Disc) (registered trademark)), or a semiconductor memory 234.

Herein, steps for writing the program supplied with a medium not only include processing that is time-sequentially performed according to the order described above but also include processing that is not necessarily performed time-sequentially but is executed in parallel or independently.

Herein, the system represents an entire device that is constituted by a plurality of devices.

Industrial Applicability

As described above, according to the encoding device and the method as well as the first program of the present invention, buffer characteristic information about buffering during decoding of a bitstream is contained in a header that is encoded and multiplexed with the bitstream. This can prevent a decoding side from causing buffer failure.

According to the decoding device and the method as well as the second program of the present invention, buffer characteristic information about buffering during decoding, which information contained in a header in an input bitstream, is read and decoding is performed in accordance with the read information. This can prevent buffer failure during the decoding.

Further, according to the editing device and the method as well as the third program of the present invention, a determination as to whether an input bitstream can be edited is made by determining whether a characteristic curve created from information contained in a header in a first bitstream is always located above or is the same as a characteristic curve created from information contained in a header in a second bitstream. This makes it possible to reduce processing required for editing, such as splicing, and to determine whether editing is readily possible. Particular aspects are given in the following enumeration: <ol id="ol0001" compact="compact" ol-style=""><li>1. An encoding device including: <ul id="ul0002" list-style="none" compact="compact"><li>generating means for generating a header to which reference is made as needed during decoding;</li><li>encoding means for encoding the header generated by the generating means and an input image signal, respectively; and</li><li>outputting means for multiplexing the header and the image signal encoded by the encoding means and outputting a bitstream;</li><li>the encoding device being characterized in that the generating means generates the header containing buffer characteristic information about buffering during decoding of the bitstream.</li></ul></li><li>2. The encoding device, characterized in that the generating means generates the header containing the buffer characteristic information for each predetermined section randomly accessible in the bitstream.</li><li>3. The encoding device, characterized in that the generating means generates the header containing the buffer characteristic information for an entire sequence of the bitstream.</li><li>4. The encoding device, characterized in that the buffer characteristic information contains all of a minimum bit rate R_min, a minimum buffer size B_min, and a minimum delay amount F_min which are decodable during decoding of the bitstream.</li><li>5. The encoding device, characterized in that the buffer characteristic information contains at least one of a minimum bit rate R_min, a minimum buffer size B_min, and a minimum delay amount F_min which are decodable during decoding of the bitstream.</li><li>6. An encoding method including: <ul id="ul0003" list-style="none" compact="compact"><li>a generating step of generating a header to which reference is made as needed during decoding;</li><li>an encoding step of encoding the header generated in the generating step and an input image signal, respectively; and</li><li>an outputting step of multiplexing the header and the image signal encoded in the encoding step and outputting a bitstream;</li><li>the encoding method being characterized in that the processing in the generating step generates the header containing buffer characteristic information about buffering during decoding of the bitstream.</li></ul></li><li>7. A storage medium in which a computer-readable program is stored, the program including: <ul id="ul0004" list-style="none" compact="compact"><li>a generating step of generating a header to which reference is made as needed during decoding;</li><li>an encoding step of encoding the header generated in the generating step and an input image signal, respectively; and</li><li>an outputting step of multiplexing the header and the image signal encoded in the encoding step and outputting a bitstream;</li><li>the storage medium being characterized in that the processing in the generating step generates the header containing buffer characteristic information about buffering during decoding of the bitstream.</li></ul></li><li>8. A program that causes a computer to execute processing including: <ul id="ul0005" list-style="none" compact="compact"><li>a generating step of generating a header to which reference is made as needed during decoding;</li><li>an encoding step of encoding the header generated in the generating step and an input image signal, respectively; and</li><li>an outputting step of multiplexing the header and the image signal encoded in the encoding step and outputting a bitstream;</li><li>the program being characterized in that the processing in the generating step generates the header containing buffer characteristic information about buffering during decoding of the bitstream.</li></ul></li><li>9. A decoding device characterized by including: <ul id="ul0006" list-style="none" compact="compact"><li>searching means for searching for a header in an input bitstream; and</li><li>decoding means for reading buffer characteristic information about buffering, which information contained in the header found by the searching means, and for decoding the bitstream in accordance with the read buffer characteristic information.</li></ul></li><li>10. The decoding device, characterized in that the buffer characteristic information is added to the header for each predetermined section randomly accessible in the bitstream.</li><li>11. The decoding device, characterized in that the buffer characteristic information about an entire sequence of the bitstream is added to the header.</li><li>12. The decoding device, characterized in that the buffer characteristic information contains all of a minimum bit rate R_min, a minimum buffer size B_min, and a minimum delay amount F_min which are decodable during decoding of the bitstream.</li><li>13. The decoding device, characterized in that the buffer characteristic information contains at least one of a minimum bit rate R_min, a minimum buffer size B_min, and a minimum delay amount F_min which are decodable during decoding of the bitstream.</li><li>14. The decoding device, characterized in that the decoding means creates a buffer characteristic curve from the information read from the bitstream, and the decoding device further includes determining means for determining that the input bitstream is decodable when a characteristic curve of the decoding device is located above the characteristic curve of the bitstream.</li><li>15. A decoding method characterized by including: <ul id="ul0007" list-style="none" compact="compact"><li>a searching step of searching for a header in an input bitstream; and</li><li>a decoding step of reading buffer characteristic information about buffering, which information contained in the header found by the processing in the searching step, and of decoding the bitstream in accordance with the read buffer characteristic information.</li></ul></li><li>16. A storage medium in which a computer-readable program is stored, the program being characterized by including: <ul id="ul0008" list-style="none" compact="compact"><li>a searching step of searching for a header in an input bitstream; and</li><li>a decoding step of reading buffer characteristic information about buffering, which information contained in the header found by the processing in the searching step, and of decoding the bitstream in accordance with the read buffer characteristic information.</li></ul></li><li>17. A program characterized by causing a computer to execute processing including: <ul id="ul0009" list-style="none" compact="compact"><li>a searching step of searching for a header in an input bitstream; and</li><li>a decoding step of reading buffer characteristic information about buffering, which information contained in the header found by the processing in the searching step, and of decoding the bitstream in accordance with the read buffer characteristic information.</li></ul></li><li>18. An editing device including: <ul id="ul0010" list-style="none" compact="compact"><li>searching means for searching for a header in an input bitstream;</li><li>determining means for reading buffer characteristic information about buffering, which information contained in the header found by the searching means, and for determining whether or not the bitstream can be edited in accordance with the read buffer characteristic information; and</li><li>editing means for editing the bitstream when the determining means determines that the bitstream can be edited,</li><li>the editing device being characterized in that, when a characteristic curve created from the information contained in the header in a first bitstream is always located above or is the same as a characteristic curve created from the information contained in the header in a second bitstream, the determining means determines that editing using the first bitstream and the second bitstream is possible.</li></ul></li><li>19. An editing method including: <ul id="ul0011" list-style="none" compact="compact"><li>a searching step of searching for a header in an input bitstream;</li><li>a determining step of reading buffer characteristic information about buffering, which information contained in the header found by the processing in the searching step, and of determining whether or not the bitstream can be edited in accordance with the read information; and</li><li>an editing step of editing the bitstream when the processing in the determining step determines that the bitstream can be edited,</li><li>the editing method being characterized in that, when a characteristic curve created from the information contained in the header in a first bitstream is always located above or is the same as a characteristic curve created from the information contained in the header in a second bitstream, the processing in the determining step determines that editing using the first bitstream and the second bitstream is possible.</li></ul></li></ol>