JP3852777B2 - Recording / reproducing apparatus, recording apparatus, editing apparatus, information recording medium, recording / reproducing method, recording method, and editing method - Google Patents

Description

  The present invention relates to a recording / reproducing apparatus, a recording apparatus, an editing apparatus, an information recording medium, a recording / reproducing method, a recording method, and an editing method for seamlessly reproducing a plurality of real-time data.

  There is an optical disc as an information recording medium having a sector structure. In recent years, the density and capacity have increased, and the use of recording and editing of real-time data including audio data or video data has been expanded.

  As an example of the prior art, an explanation regarding the simultaneous reproduction condition of audio data and video data in cut editing is cited below.

  With reference to FIG. 16, a playback device 660 for simultaneously playing back two real-time data will be described. The reproduction device 660 shown in FIG. 16 includes a pickup 654 that records and reproduces real-time data on an information recording medium (optical disk) 655, a reproduction buffer A650 that accumulates real-time data 656 read from the information recording medium 655, and a reproduction. Decoder A651 for decoding real-time data 656 stored in buffer A650, playback buffer B652 for storing real-time data 657 read from information recording medium 655, and decoding real-time data 657 stored in playback buffer B652. Decoder B653.

  In simultaneous reproduction, when data is read from the information recording medium, the data is accumulated in the reproduction buffer, and real-time data reproduction is not interrupted unless the reproduction buffer becomes empty during the seek operation of the pickup. In the simultaneous reproduction apparatus shown in FIG. 16, Vt means the data transfer rate between the pickup 654 and the reproduction buffer A650 and between the pickup 654 and the reproduction buffer B652, and Vd is between the reproduction buffer A650 and the decoder A651. And the data transfer rate between the reproduction buffer B652 and the decoder B653 (the data transfer rate between the reproduction buffer A650 and the decoder A651 is Vd1, and the data transfer rate between the reproduction buffer B652 and the decoder B653 is Vd2 may also be used).

  Next, an example in which a continuously recorded area is cut and edited in units including a plurality of audio data and a plurality of video data will be described with reference to FIG. Cut editing is to set a reading start point (hereinafter “in point”) and a reading end point (hereinafter “out point”) in order in the recorded real-time data so that a plurality of recording sections can be reproduced in order. Say. Here, for example, each recording area of audio data and video data is not determined from the full seek time, but is determined from a short-distance access condition such as fine seek. In this case, when it is necessary to access from the innermost circumference to the outermost circumference in the cut editing, a full seek can be accessed after reproducing a plurality of recorded areas.

  In FIG. 17, from the inner circumference side to the outer circumference side of the information recording medium, recorded areas G10, G12, G14 in which video data is recorded and recorded areas G11, G13, G15 in which audio data are recorded. Are arranged alternately. However, although not shown, a plurality of recorded areas may exist between the recorded area G13 and the recorded area G14. The in points IG10 and IG11 are set to the data recorded in the recorded areas G10 and G11, respectively, and the out points OG14 and OG15 are set to the data recorded in the recorded areas G14 and G15, respectively. Yes. The recorded area G16 is a part of the recorded area G10, the recorded area G17 is a part of the recorded area G11, the recorded area G18 is a part of the recorded area G14, and the recorded area G19 is It is a part of the recorded area G15. The recorded area G16 is an area from the position where the data where the in point IG10 is set in the recorded area G10 to the end of the recorded area G10. The recorded area G17 is an area from the recorded position of the data where the in-point IG11 is set in the recorded area G11 to the end of the recorded area G11. The recorded area G18 is an area from the front end portion of the recorded area G14 to a position where the data in which the out point OG14 is set in the recorded area G14 is recorded. The recorded area G19 is an area from the front end portion of the recorded area G15 to the position where the data in which the out point OG15 is set in the recorded area G15 is recorded.

  Here, referring to FIG. 17A, the data recorded from the recorded areas G16, G17, G12, and G13 to the recorded areas G18 and G19 are reproduced and then accessed (FIG. 7B). However, let us consider a condition in which simultaneous reproduction of audio data and video data continues.

  FIG. 17B is a diagram schematically showing the access operation. The access time includes the read time R31 of the recorded area G16, the seek time Tf1, the read time R32 of the recorded area G17, the seek time Tfi, the read time RV of the recorded area G12, the seek time Tfj, and the read time of the recorded area G13. It includes RA, seek time Tf2, read time R33 of recorded area G18, seek time Tf3, read time R34 of recorded area G19, and seek time Ta. Here, assuming that a plurality of recorded areas further exist between the recorded area G13 and the recorded area G18, the read times of the recorded areas G12 and G13 and the plurality of recorded areas are set as follows. It is assumed that the read operation of the recorded areas G12 and G13 is equivalent to the time repeated P times. The seek time from the recorded area of video data to the recorded area of audio data is Tfj, and the seek time from the recorded area of audio data to the recorded area of video data is Tfi. The seek time Tfj and seek time Tfi shown in FIG. 17B are seek times according to the arrangement of the recorded areas existing between the recorded area G13 and the recorded area G18. This is expressed using i and j.

  The net data read times from the information recording medium corresponding to the read times R31, R32, RV, RA, R33, and R34 are defined as TinV, TinAa, TcV, TcAa, ToutV, and ToutAa, respectively.

The conditions for video data are:
YV ÷ VdV ≧ (TinV + Tf1 + TinAa + P × (TcV + Tfj + Tfi + TcAa) + Tf2 + ToutV + Tf3 + ToutAa) + Ta + (P + 2) × (a + b) × Ts)
YV = (TinV + P × TcV + ToutV) × Vt
It is represented by

The conditions regarding audio data are:
YA ÷ VdA ≧ (TinV + Tf1 + TinAa + P × (TcV + Tfj + Tfi + TcAa) + Tf2 + ToutV + Tf3 + ToutAa) + Ta + (P + 2) × (a + b) × Ts)
YA = (TinAa + P × TcAa + ToutAa) × Vt
It is represented by

The conditions for simultaneous playback of video data and audio data are as follows:
YV ÷ VdV ≧ (Tf1 + Tf2 + Tf3 + P × (Tfj + Tfi) + Ta + (P + 2) × (a + b) × Ts) × Vt ÷ (Vt−VdV−VdA),
YA ÷ VdA ≧ (Tf1 + Tf2 + Tf3 + P × (Tfj + Tfi) + Ta + (P + 2) × (a + b) × Ts) × Vt ÷ (Vt−VdV−VdA)
It is represented by

Since the time for reproducing the data of YA and YV is equal,
YA / VdA = YV / VdV
It becomes. Similarly, since the time for reproducing data corresponding to YcV and YcA is equal,
YcV ÷ VdV = YcA ÷ YdA,
YcV = TcV × Vt,
YcA = TcAa × Vt
It becomes.

here,
P: the number of recorded areas that are completely continuously read out in the cut-edited area (P ≧ 0),
YV: total size of video data to be played back,
YA: total size of audio data to be played back,
VdV: data rate of video data,
VdA: data rate of audio data,
Tf1: seek time from recorded area G16 to recorded area G17,
Tf2: seek time from the recorded area G13 to the recorded area G18,
Tf3: seek time from the recorded area G18 to the recorded area G19,
Ta: seek time from the recorded area G19 to the next recorded area,
a: Number of ECC blocks to be skipped in each of the recorded areas G16, G12, and G18 of the video data,
b: Number of ECC blocks to be skipped in each of the recorded areas G17, G13, G19 of the audio data,
Ts: time to read one ECC block,
Vt: data read rate from the disk,
YcV: the data size of the recorded area G12 of the video data,
YcA: the data size of the recorded area G13 of audio data.

  The value of P can be obtained from the above simultaneous reproduction conditions. The minimum size of the recorded area of each of the audio data and the video data is obtained in consideration of the obtained value of P and the short-distance access time. By recording the audio data and the video data while interleaving so that the number of recorded areas is smaller than the number indicated by the obtained P value, seamless reproduction can be performed.

In the example of FIG. 17, the audio data and the video data are recorded separately, but if the audio data and the video data are recorded in a continuous area, a seek operation between the audio data and the video data is performed. As a result, it can be seen that the conditions for seamless reproduction are relaxed (see, for example, Patent Document 1).
Japanese Patent Application No. 2002-252097 (FIGS. 17 and 20)

  However, the above-described conventional technology does not consider the delay time caused by the decoding operation of the compressed video data and audio data and the variable bit rate. Accordingly, there has been a problem that video and audio are interrupted and cannot be played back seamlessly when playback is actually performed, even though a judgment result has been obtained that some edited real-time data can be played back seamlessly.

  In view of the above problems, an object of the present invention is to accurately determine whether or not seamless playback is possible by determining seamless playback conditions in consideration of delay time and variable bit rate generated by decoding processing.

The recording / reproducing apparatus of the present invention includes a reading unit that reads first data and second data from an information recording medium, a first buffer unit that temporarily stores the read first data, and the read second data. A second buffer section for temporarily storing; a first decoding section for outputting first decoded data generated by decoding the stored first data; and decoding the stored second data A second decoding unit that outputs the second decoded data generated by the conversion, a first setting unit that sets a read end point of the first data, and a second setting unit that sets a read start point of the second data And a first time from the start of the seek operation of the read unit from the read end point to the read start point until the output of the first decoded data by the first decoder ends And a second time from the start of the seek operation until the second decoding unit can output the second decoded data, and the calculated length of the first time and the second time A control unit that compares the calculated second time length with the control unit, wherein the control unit is the same as the second time, or when the first time is the second time. If the time is longer than the time, it is determined that the first data and the second data can be reproduced and output continuously in time, thereby achieving the above object.

  The calculated first time is calculated from the time obtained by dividing the data amount from the read start point of the first data to the read end point by the bit rate associated with the first data. A time obtained by subtracting a time required for reading data from the data reading start point to the data reading end point may be included.

  The first data includes a plurality of partial data between a read start point of the first data and the read end point, and a bit rate is associated with each of the plurality of partial data, The first time is calculated from the time representing the sum of a plurality of times obtained by dividing the data amount of each of the plurality of partial data by the bit rate associated with each of the plurality of partial data. A time obtained by subtracting a time required for reading data from the reading start point of the first data to the reading end point may be included.

  The bit rate associated with the m (m is an integer) th partial data of the plurality of partial data is the n (n is an integer different from m) th partial data of the plurality of partial data. It may be different from the associated bit rate.

  The first data includes a plurality of partial data between a read start point of the first data and a read end point, and the calculated first time includes one of the plurality of partial data A time from when the first decoding unit is input to when the first decoding unit outputs decoded data generated by decoding one of the plurality of partial data may be included.

  The first buffer unit may include a track buffer unit and a VBV buffer unit, and the calculated first time may include a time during which one of the plurality of partial data is accumulated in the VBV buffer unit. .

The first data includes a plurality of partial data between a read start point of the first data and the read end point, and each of the plurality of partial data is associated with a bit rate. One buffer unit includes a track buffer unit and a VBV buffer unit. When TA is the calculated first time, TA is
TA = Σ (V (i) / VdV (i)) − Σ (TR (i) + a (i) × Ts) + TdlyA
Where, where
V (i) is the data amount of the i-th partial data (i is an integer) of the plurality of partial data,
VdV (i) is a bit rate associated with the i-th partial data,
TR (i) is a time required to read out the i-th partial data,
a (i) is the number of defective ECC blocks existing in the area where the i-th partial data is recorded in the information recording medium,
Ts is the time required to skip one ECC block,
TdlyA includes the time when one of the plurality of partial data is stored in the VBV buffer unit and the first decoding after one of the plurality of partial data is input to the first decoding unit. It may be a time that represents the sum of the time until the decoding unit generates decoded data generated by decoding one of the plurality of partial data.

  The calculated second time includes the time required for the seek operation of the readout unit from the readout end point to the readout start point, and at least a part of the second data are input to the second decoding unit. And the time until the second decoding unit outputs decoded data generated by decoding the at least part of the second data.

  The calculated second time may include a time during which the at least part of the second data is accumulated in the second buffer unit.

  The calculated second time includes the time required for the seek operation of the readout unit from the readout end point to the readout start point, and at least a part of the second data are input to the second decoding unit. And the time until the second decoding unit outputs decoded data generated by decoding the at least part of the second data.

  The calculated second time may include a time during which the at least part of the second data is accumulated in the second buffer unit.

  The calculated second time is the time required for the seek operation of the reading unit from the read end point to the read start point, and the data corresponding to the read start point of the second data is decoded. And a time required for predecoding processing for acquiring predetermined data used for the processing.

Assuming that the calculated second time is TB, TB is
TB = Tf + Tb + TdlyB + Tin
Where, where
Tf is the time required for the seek operation of the readout unit from the readout end point to the readout start point,
Tb is a time required for reading data read from the start time of the seek operation until data corresponding to the read start point is read,
TdlyB includes the time during which at least a part of the second data is stored in the second buffer unit, and the second decoding after the at least a part of the second data is input to the second decoding unit. A time that represents the sum of the time until the output of the decoded data generated by the unit decoding the at least part of the second data,
Tin may be a time required for predecoding processing for obtaining predetermined data used for decoding data corresponding to the read start point in the second data.

Assuming that the calculated second time is TB, TB is
TB = Tf + Tb + TdlyB + Tin
Where, where
Tf is the time required for the seek operation of the readout unit from the readout end point to the readout start point,
Tb is a time required for reading data read from the start time of the seek operation until data corresponding to the read start point is read,
TdlyB includes the time during which at least a part of the second data is stored in the second buffer unit, and the second decoding after the at least a part of the second data is input to the second decoding unit. A time that represents the sum of the time until the output of the decoded data generated by the unit decoding the at least part of the second data,
Tin may be a time required for predecoding processing for obtaining predetermined data used for decoding data corresponding to the read start point in the second data.

  The information recording medium further includes a writing unit that writes at least one of the first data and at least a part of the second data, and the control unit calculates the calculated first time length. Is determined to be shorter than the calculated second time length, at least one of the first data is set so that the first time length is equal to or greater than the second time length. The writing unit may be controlled so as to change a recording position on at least one of the information recording medium and at least one of the second data and the second data.

  The control unit may control the writing unit so as to change a recording position with a smaller data amount of at least a part of the first data and at least a part of the second data.

  The first data includes first audio data and first video data, the second data includes second audio data and second video data, and the control unit includes the first audio data and the second video data. The writing unit is controlled so that audio data is recorded on the information recording medium adjacent to each other, and the first video data and the second video data are recorded adjacent to each other on the information recording medium. The writing unit may be controlled as described above.

  The information recording medium may be an optical disk medium.

The information recording medium may be a magnetic disk medium.

The recording apparatus of the present invention is a recording apparatus for recording at least one of first data and second data to be reproduced by a reproducing apparatus on an information recording medium, and the reproducing apparatus is configured from the information recording medium. A reading unit for reading the first data and the second data; a first buffer unit for temporarily storing the read first data; and a second buffer unit for temporarily storing the read second data; A first decoding unit that outputs first decoded data generated by decoding the accumulated first data, and a second decoding generated by decoding the accumulated second data A second decoding unit that outputs data, and the recording apparatus includes a first setting unit that sets a reading end point of the first data, and a first setting unit that sets a reading start point of the second data. A first time from the start of the seek operation of the read unit from the read end point to the read start point to the end of the output of the first decoded data by the first decoder; Calculating the second time from the start of the seek operation until the second decoding unit can output the second decoded data, and calculating the length of the first time and the calculation A control unit that compares the length of the second time with the second time, or when the first time is the same as the second time, or when the first time is the second time. If it is longer, it is determined that the first data and the second data can be reproduced and output continuously in time, thereby achieving the above object.

  The information recording medium further includes a writing unit that writes at least one of the first data and at least a part of the second data, and the control unit has a length of the first time described above. Controlling the writing unit to write at least one of the first data and at least one of the second data to the information recording medium so as to be equal to or longer than a second time length. May be.

  The first data includes first audio data and first video data, the second data includes second audio data and second video data, and the control unit includes the first audio data and the second video data. The writing unit is controlled so that audio data is recorded on the information recording medium adjacent to each other, and the first video data and the second video data are recorded adjacent to each other on the information recording medium. The writing unit may be controlled as described above.

An editing apparatus according to the present invention is an editing apparatus that edits at least one of first data and second data recorded on an information recording medium to be reproduced by a reproducing apparatus, wherein the reproducing apparatus includes the information A read unit that reads the first data and the second data from the recording medium, a first buffer unit that temporarily stores the read first data, and a second buffer that temporarily stores the read second data A buffer unit; a first decoding unit that outputs first decoded data generated by decoding the accumulated first data; and a first decoding unit that is generated by decoding the accumulated second data. A second decoding unit that outputs two decoded data, wherein the editing device sets a first setting unit that sets a reading end point of the first data, and a reading start point of the second data. A second setting unit to be set, and a first time from the start of the seek operation of the read unit from the read end point to the read start point until the output of the first decoded data by the first decoder ends. 1 and a second time from the start of the seek operation until the second decoding unit can output the second decoded data, and the first time calculated above is calculated. A control unit that compares a length with the calculated second time length , wherein the control unit is the same as the second time or when the first time is the same as the second time. When the time is longer than the second time, it is determined that the first data and the second data can be reproduced and output continuously in time, thereby achieving the above object.

  An information recording medium of the present invention is an information recording medium on which first data and second data to be reproduced by a reproducing device are recorded, and the reproducing device receives the first data and the above-mentioned data from the information recording medium. A read unit for reading second data, a first buffer unit for temporarily storing the read first data, a second buffer unit for temporarily storing the read second data, and the stored first data A first decoding unit that outputs first decoded data generated by decoding one data; and a second decoding unit that outputs second decoded data generated by decoding the accumulated second data. A read end point is set in the first data, a read start point is set in the second data, and the read start is started from the read end point. The length of the first time from the start of the seek operation of the read unit to the end of the output of the first decoded data by the first decoder is from the start of the seek operation to the first The first data and the second data are arranged so as to be equal to or longer than the second time until the second decoding unit can output the second decoded data. The above objective is achieved.

The recording / reproducing method of the present invention includes a read step for reading first data and second data from an information recording medium, a first accumulation step for temporarily accumulating the read first data, and the read second data. A second accumulation step for temporarily accumulating; a first decoding step for outputting first decoded data generated by decoding the accumulated first data; and decoding the accumulated second data. A second decoding step for outputting the second decoded data generated by the conversion, a first setting step for setting the reading end point of the first data, and a first setting step for setting the reading start point of the second data 2 setting step and the output of the first decoded data in the first decoding step from the start of the seek operation from the reading end point to the reading start point. And a second time from when the seek operation starts until the second decoded data can be output in the second decoding step. A comparison step of comparing the length of the first time and the calculated second time, and if the result of the comparison is that the first time is the same as the second time, or the first time Determining that it is possible to reproduce and output the first data and the second data in terms of time if the time is longer than the second time, The above objective is achieved.

The recording method of the present invention is a recording method for recording at least one of first data and second data to be reproduced by a reproducing apparatus on an information recording medium, and the reproducing apparatus includes the information recording medium from the information recording medium. A reading unit for reading the first data and the second data; a first buffer unit for temporarily storing the read first data; and a second buffer unit for temporarily storing the read second data; A first decoding unit that outputs first decoded data generated by decoding the accumulated first data, and a second decoding generated by decoding the accumulated second data A second decoding unit for outputting data, wherein the recording method sets a first setting step for setting a reading end point of the first data, and sets a reading start point for the second data A second setting step, and a first time from the start of the seek operation of the read unit from the read end point to the read start point until the output of the first decoded data by the first decoder ends And the second time from when the seek operation starts until the second decoding unit can output the second decoded data, and the calculated first time length And a comparison step for comparing the calculated second time length, and if the first time is the same as the second time as a result of the comparison, or the first time is the second time If the time is longer than the time, the method includes the step of determining that the first data and the second data can be reproduced and output continuously in time, thereby achieving the above object.

  At least one of the first data and at least a part of the second data is stored in the information recording medium so that the length of the first time is equal to or longer than the length of the second time. A writing step may be further included.

  The first data includes first audio data and first video data, the second data includes second audio data and second video data, and the writing step includes the first audio data and the second video data. Recording at least one of the first audio data and the second audio data on the information recording medium so that the audio data is adjacent to each other; and the first video data and the second video data are adjacent to each other As described above, the method may include recording at least one of the first video data and the second video data on the information recording medium.

The editing method of the present invention is an editing method for editing at least one of first data and second data recorded on an information recording medium to be played back by a playback device, wherein the playback device includes the information A read unit that reads the first data and the second data from the recording medium, a first buffer unit that temporarily stores the read first data, and a second buffer that temporarily stores the read second data A buffer unit; a first decoding unit that outputs first decoded data generated by decoding the accumulated first data; and a first decoding unit that is generated by decoding the accumulated second data. A second decoding unit for outputting two decoded data, wherein the editing method includes a first setting step for setting a reading end point of the first data, and reading and opening of the second data. A second setting step for setting a point, and from the start of the seek operation of the read unit from the read end point to the read start point until the output of the first decoded data by the first decoder ends And the second time from when the seek operation starts until the second decoding unit can output the second decoded data, and the calculated first time is calculated. A comparison step of comparing a length of time with the calculated second time length, and if the comparison results in the first time being the same as the second time, or the first time Is longer than the second time, it is determined that the first data and the second data can be reproduced and output continuously in time. The objective is achieved.

  According to the present invention, the first time from the start of the seek operation of the read unit from the read end point to the read start point until the end of the output of the first decoded data by the first decoding unit, and the seek operation And the second time from when the second decoding unit can output the second decoded data to the second decoding unit, and the calculated first time length and the calculated second time length And whether or not seamless playback is possible is determined based on the comparison result. According to the present invention, the seamless playback condition is determined in consideration of the delay time generated by the decoding process of the compressed video data, the variable bit rate, and the like, and therefore it is possible to accurately determine whether or not seamless playback is possible.

  Embodiments of the present invention will be described below with reference to the drawings.

(Embodiment 1)
First, a description will be given of cut editing conditions when cut editing is performed on real-time data including video data compressed using a compression method. The compression method is, for example, the MPEG method, but is not limited thereto.

  FIG. 6 is a diagram showing a single decoder playback device 661. When an editing operation such as cut editing is performed on the data recorded on the information recording medium 602, it is necessary to decode the two discontinuous MPEG data and output the frame seamlessly. Such a process becomes difficult in the single decoder reproducing device 661 having one decoding unit. Therefore, a multi-decoder reproduction device 662 (FIG. 7) having a plurality of decoding units is required.

  FIG. 7 shows a multi-decoder playback device 662 of the present invention.

  Here, for example, it is assumed that an in point that is a read start point and an out point that is a read end point are set at specified positions in the GOP. “GOP” is an abbreviation for “Group of Pictures” and refers to a data group in which a plurality of picture frames are grouped. There are three types of picture frames: I frame, P frame, and B frame. GOP and picture frames are defined in the MPEG standard. Since these definitions are well known, detailed description thereof is omitted here. In order to seamlessly reproduce data between an in point set at a specified position in a GOP and an out point set at a specified position in another GOP, two decoding units are required. .

  The multi-decoder playback device 662 of the present invention includes a pickup 601, a first buffer unit 613, a second buffer unit 614, a first decoding unit 612, a second decoding unit 722, and a read data switching unit 730. And a decoding unit output switching unit 731.

  The information recording medium 600 is an optical disk medium, for example. In the information recording medium 600, first real-time data 615 and second real-time data 616 are recorded. The pickup 601 is a reading unit that reads the first real-time data 615 and the second real-time data 616 from the information recording medium 600. The first buffer unit 613 temporarily accumulates the first real-time data 615 read by the pickup 601. The second buffer unit 614 temporarily stores the second real-time data 616 read by the pickup 601. The first decoding unit 612 outputs first decoded data 617 generated by decoding the accumulated first real-time data 615. The second decoding unit 722 outputs the second decoded data 618 generated by decoding the accumulated second real-time data 616.

  The first buffer unit 613 includes a first track buffer unit 610 and a first VBV buffer unit 611. The second buffer unit 614 includes a second track buffer unit 720 and a second VBV buffer unit 721. The first track buffer unit 610 and the second track buffer unit 720 are provided in the multi-decoder playback device 662 to enable continuous data transfer even during the seek operation of the pickup 601 (that is, in a state where data is not read). It has been. The first VBV buffer unit 611 and the second VBV buffer unit 721 are provided in the multi-decoder playback device 662 in order to avoid data underflow in the decoding process in the first decoding unit 612 and the second decoding unit 722. .

  Thus, data reproduced from the information recording medium 600 is processed by two independent reproduction systems. By switching the output of the decoded data at a predetermined timing by the decoding unit output switching unit 731, two real-time data can be reproduced continuously.

  FIG. 2 shows an example of arrangement of two real-time data and an example of setting out points and in points in cut editing in this embodiment. FIG. 2A shows a recorded area on the information recording medium 600 (FIG. 7). The left side of the drawing shows the inner circumference side of the information recording medium, and the right side of the drawing shows the outer circumference side. On the information recording medium 600, recorded areas A1, A2, A3, A4, and A5 of audio data and recorded areas V1, V2, V3, V4, and V5 of video data are alternately arranged. The area including the recorded area A2 and the recorded area V2 may be repeated P times. Further, a plurality of recorded areas may exist between the recorded area V2 and the recorded area A3.

  The pr points (pre-roll point = read start point) of the video data and the audio data are set to the data recorded in the recorded areas A1 and V1, respectively. The out points are set in the data recorded in the recorded areas A3 and V3, respectively. The in points are set in the data recorded in the recorded areas A4 and V4, respectively. Each of the pr point, the out point, and the in point is represented by, for example, an address number of a position where data in which the point is set is recorded, and information indicating the address number is recorded on the information recording medium. (The pr point, the out point, and the in point are also points representing positions on the recorded area). Audio data and video data from the pr point to the out point are reproduced, and then audio data and video data starting from the in point are reproduced.

  In FIG. 2A, the area necessary for data reproduction is indicated by hatching. The hatched portions are the recorded area 121, the recorded area 122, the entire recorded area A2, the entire recorded area V2, the recorded area 123, the recorded area 124, the recorded area 131, the recorded area 132, The entire area of the recorded area A5 and the entire area of the recorded area V5, and these hatched portions are recorded areas that are reproduced after cut editing. The recorded area 121 is an area from the recording position of data in which the pr point PA1 in the recorded area A1 is set to the end of the recorded area A1. The recorded area 122 is an area from slightly before the recording position of the data in which the pr point PV1 in the recorded area V1 is set to the end of the recorded area V1. The recorded area 123 is an area from the start end of the recorded area A3 to the data recording position where the out point OA3 in the recorded area A3 is set. The recorded area 124 is an area from the start end of the recorded area V3 to the data recording position where the out point OV3 in the recorded area V3 is set. The recorded area 131 is an area from the recording position of data in which the in point IA4 in the recorded area A4 is set to the end of the recorded area A4. The recorded area 132 is an area from slightly before the recording position of the data where the in point IV4 in the recorded area V4 is set to the end of the recorded area V4.

  FIG. 2B is an enlarged view of the pr point PV1 (or the in point IV4 in the recorded area V4) in the recorded area V1 in FIG. In FIG. 2B, reference numerals I, P, and B denote an I frame, a P frame, and a B frame, respectively.

  When the pr point or the in point is set for a specific frame, MPEG may not be able to perform decoding processing only with the data of the specified frame, and other frames required for decoding the frame. It is also necessary to decrypt this data. For example, in FIG. 2B, it is assumed that the frame in which the pr point or the in point of the video data is set is the third B frame from the top in the GOP 221. In order to decode this B frame, it is necessary to decode not only the first I frame of the GOP 221 but also all the I frames and P frames of the previous GOP 220. Therefore, for example, in the vicinity of the in point IV4 in the recorded area V4 in FIG. 2B, strictly speaking, as shown in FIG. 2B, the GOP 221 one before the GOP 221 in which the in point IV4 is set. It is necessary to start reading from the head of the GOP 220 and obtain necessary I frames and P frames over the read times R21, R22, R23, R24, R25, and R26. Further, since it is not necessary to reproduce the B frame in the GOP 220, the B frame portion is skipped by using a seek operation such as fine seek, or if the data size of the B frame is small, the B frame is not read and is idle. The desired frame data can be accessed after waiting for rotation. The reference symbol Tf21 represents this time, and this time varies depending on the amount of unnecessary B frame data. Further, since it is not necessary to read the second B frame from the top in the GOP 221, the same processing is performed, and this time is represented by the reference symbol Tf22. Thereafter, data reproduction after the designated pr point PV1 (or in point IV4) is performed over the read time R27.

  When the in point is designated after the P frame, which is the fourth frame data of the GOP 221, it is not necessary to read the data in the GOP 220, and the I frame or P frame in the GOP 221 including the P frame is included. Using the data, the read data can be decoded.

  With reference to FIG. 1, a description will be given of the cut editing conditions of the present invention for continuously reproducing data designated by editing operations such as cut editing without interruption of video and audio. In FIG. 1, recorded areas A1 to A5 and recorded areas V1 to V5 are the same as those described with reference to FIG.

  1A shows an access operation in the recorded area where the first real-time data 615 is recorded, and FIG. 1B shows an access operation in the recorded area where the second real-time data 616 is recorded. The first real-time data 615 is distributed and recorded in recorded areas A1 to A3 and recorded areas V1 to V3. The second real time data 616 is distributed and recorded in the recorded areas A4 to A5 and the recorded areas V4 to V5. Reference symbols R11 to R19 indicate reading times, and reference symbols Tf1 and Tf2 indicate seek times.

  In FIG. 1C, the vertical axis indicates the remaining amount of buffer data in the first track buffer unit 610, and the horizontal axis indicates time. Reference numeral 140 represents a temporal change in the remaining buffer data. Similarly, in FIG. 1F, the vertical axis indicates the remaining amount of buffer data in the second track buffer unit 720, and the horizontal axis indicates time. Reference numeral 150 represents a temporal change in the remaining buffer data. FIG. 1D shows the first decoded data 617 output by the first decoding unit 612 with respect to the time on the horizontal axis in FIG. Similarly, FIG.1 (e) shows the 2nd decoding data 618 which the 2nd decoding part 722 outputs with respect to the time of the horizontal axis of FIG.1 (f).

  As a series of access operations, first, reproduction is started from the pr point PA1 in the recorded area A1 of FIG. 1A, and the recorded area 121 from the pr point PA1 of the recorded area A1 to the end of the recorded area A1. Play the data. Next, data is reproduced by accessing the recorded area 122 from slightly before the pr point PV1 in the recorded area V1 to the end of the recorded area V1. Thereafter, data reproduction of the recorded area A2 and the recorded area V2 is performed. In consideration of the case where there are a plurality of continuous recorded areas such as the recorded area A2 and the recorded area V2, the recorded area A2 and the recorded area V2 are recorded. It is assumed that the reproduction operation with the completed region V2 as a pair is repeated P times. Then, data in the recorded area 123 from the start point of the recorded area A3 to the out point OA3 in the recorded area A3 is reproduced, and recorded from the start point of the recorded area V3 to the out point OV3 in the recorded area V3. The data in the area 124 is reproduced. Note that there is audio data that does not need to be reproduced from the end of the region 123 to the start of the region 124. However, since the audio data has a small amount of data, the region from the end of the region 123 to the region without performing fine seek or the like. The pickup 601 may reach the start end of the region 124 by performing idle reading to the start end of 124. After data reproduction to the end of the recorded area 124, the pickup 601 seeks to the in point IA4 in the recorded area A4 in FIG. 1B.

  After the seek operation, first, data in the recorded area 131 from the in point IA4 in the recorded area A4 to the end of the recorded area A4 is reproduced. Next, the data in the recorded area 132 from just before the in point IV4 in the recorded area V4 to the end of the recorded area V4 is reproduced. Thereafter, the data in the recorded area A5 and the recorded area V5 are reproduced. Note that there is video data that does not need to be reproduced from the end of the recorded area 131 to the beginning of the recorded area 132, and since the video data has a large amount of data, fine seek may be executed. As described with reference to FIG. 2B, the recorded area 132 in the recorded area V4 includes pre-frame data necessary for decoding the frame data in which the in point is set.

  The initial state of the buffer data remaining amount 140 in FIG. 1C is 0, and playback starts from the beginning of the recorded area 122 in FIG. 1A, and video data in the recorded areas 122, V2, and 124 is played back. In this case, the buffer data remaining amount 140 increases due to the difference between the reading rate from the information recording medium and the bit rate of each video data. Conversely, when the seek operation is being performed or when the recorded area of audio data is being reproduced, the buffer data remaining amount 140 decreases. After reproduction to the out point OV3 in the recorded area V3 in FIG. 1A, the read data switching unit 730 in FIG. 7 is switched to the second track buffer unit 720. Therefore, as shown in FIG. 1C, the buffer data remaining amount 140 decreases simultaneously with the start of seeking, and finally the remaining amount becomes zero.

  On the other hand, the buffer data remaining amount 150 in FIG. 1F is 0 in the initial state, and when the video data in the recorded area 132 and V5 in FIG. Will increase.

  As the output of the first decoded data 617 in FIG. 1 (d), the frame data output is started after a predetermined time from the start of the reproduction of the recorded area 122 of the video data in FIG. 1 (a). . For the sake of explanation, FIG. 1D shows only the frame output from the start of seeking. Reference numeral 141 in FIG. 1C represents the remaining amount of the first track buffer unit 610 at the start of seeking. The data remaining in the first track buffer unit 610 at the start of seek is output as a frame after a predetermined delay time 180 shown in FIG. 1D (the hatched portion in FIG. 1D is shown at the start of seek). The output data from the first decoding unit 612 corresponding to the data remaining in the first track buffer unit 610 is shown). The data accumulated in the first track buffer unit 610 is decoded one after another, and at the same time the remaining amount decreases, and the first decoding unit 612 finally outputs a frame in which the out point OV3 is set. At this time, the decoding unit output switching unit 731 in FIG. 7 performs switching processing from the output data of the first decoding unit 612 to the output data of the second decoding unit 722. Just before the time when this switching process is executed, as described above, the read data switching unit 730 in FIG. 7 switches the data transfer destination to the second track buffer unit 720, and the second VBV buffer unit 721. 2, the second decoding unit 722 has started the decoding process. FIG. 1E shows the second decoded data 618 output from the second decoding unit 722. After the seek time 190, the second decoding unit 722 passes through a predetermined delay time 191, and after the I frame or P frame decoding time 192 necessary for frame decoding in which the in point IV4 is set, A frame in which the point IV4 is set is output. After that, the frames are decoded and output one after another while consuming the remaining buffer data in FIG.

  The cut editing condition of the present invention is a condition for preparing to output a frame with the in point set before outputting a frame with the out point set. Specifically, at the start of seeking, the time during which the first decoding unit 612 can output video data using the real-time data remaining in the first track buffer unit 610 is the in point of the second real-time data 616. Means that the recorded area is arranged so as to be longer than the time during which the output of the set frame is possible.

  Hereinafter, the cut editing conditions will be described. The data amount of the recorded area 122 is V1pr, and the bit rate of the recorded area 122 is VdV1pr. Since there are a plurality of similar areas in the recorded area A2 and the recorded area V2, it is considered that the reproduction is repeated P times in the calculation, and the data amount of the recorded area V2 is V2 (i). Here, i represents the number of repetitions, and changes from i = 1 to P. The bit rate of the recorded area V2 is VdV2 (i). The data amount of the recorded area V3 is V3out, and the bit rate of the recorded area V3 is VdV3out. Assuming that the time until all of the above data is consumed by the decoding unit (that is, the reproduction time when the above data is decoded) is TDEC, TDEC is expressed by the following equation.

TDEC = V1pr / VdV1pr + Σ (V2 (i) / VdV2 (i)) + V3out / VdV3out
(Where Σ is i = 1 to P)
Further, the time required to read the recorded area 122 is TprV1 + a × Ts. Here, a represents the number of defective ECC blocks to be skipped in the video data recorded area, and Ts represents the time required for skipping one ECC block. In the recorded area A2, if the time required to read audio data for one channel is TcA2, the number of channels of audio data is N, and the number of defective ECC blocks to be skipped in the audio data recorded area is b, the recorded area The time required to read A2 P times repeatedly is P × (N × TcA2 + b × Ts). Further, the time required to read the recorded area V2 P times repeatedly is P × a × Ts + ΣTcV2 (i), where TcV2 (i) is the time required to read the i-th recorded area V2. Σ is i = 1 to P). Further, if the time required to read audio data for one channel in the recorded area A3 is TcA, the time required to read the recorded area A3 is N × TcA + b × Ts. Further, the time required for reading the region 124 is ToutV3 + a × Ts. From the above formula, assuming that the time required from the start of playback to the seek is TREAD, TREAD is expressed by the following formula.

TREAD = TprV1 + a × Ts + P × (N × TcA2 + b × Ts + a × Ts) + ΣTcV2 (i) + N × TcA + b × Ts + ToutV3 + a × Ts
(Where Σ is i = 1 to P)
When the data remaining amount of the first track buffer unit 610 at the start of seek is converted to time, a time TDEC until all the read video data is consumed by the decoder and a time required from the start of reproduction to the start of seek This corresponds to the difference from TREAD. Therefore, if a value obtained by converting the remaining data amount of the first track buffer unit 610 into time at the start of seek is TBUFA, TBUFA is expressed by the following equation.
TBUFA = TDEC-TREAD
This TBUFA is represented by time 181 in FIG.

  Furthermore, there is a predetermined delay time TdlyA until the data remaining in the first track buffer unit 610 at the start of seeking is decoded by the first decoding unit 612 and output as a frame. This delay time is represented as a delay time 180 in FIG. Therefore, TA is expressed by the following equation, where TA is a time during which the first decoding unit 612 can output a frame using the remaining amount of the first track buffer unit 610 at the start of seek.

TA = TBUFA + TdlyA
Replacing TBUFA,
TA = TDEC-TREAD + TdlyA
Become. When TDEC and TREAD are replaced, TA is expressed by the following equation.
TA = V1pr / VdV1pr + Σ (V2 (i) / VdV2 (i)) + V3out / VdV3out− (TprV1 + a × Ts + P × (N × TcA2 + b × Ts + a × Ts) + ΣTcV2 (i) + N × TcA + b × T + TyVt + T + V + T + T + V
(Where Σ is i = 1 to P)
Next, the time from when the seek is started until the second decoding unit 722 can output a frame for which the in point is set is obtained. In FIG. 1, the time required for the seek Ta1 from the end of the area 124 to the start of the recorded area 131 is Tf (2). In the recorded area 131, assuming that the time required to read audio data for one channel is TinA, the number of channels of audio data is N, and the number of defective ECC blocks to be skipped in the audio data recorded area is b. The time required for reading 131 is N × TinA + b × Ts. Further, Tf (3) is a time required for fine seek from the end of the recorded area 131 to the start end of the recorded area 132.

From the above, the time from the start of seek to the arrival of the video data recorded area 132 is Tf (2) + N × TinA + b × Ts + Tf (3). This time is represented by a delay time 190 in FIG. Further, there is a predetermined delay time TdlyB until the read video data of the recorded area 132 is decoded by the second decoding unit 722 and output as a frame. TdlyB is represented by a delay time 191 in FIG. Furthermore, in order to output a frame in which the in point is set, since it is necessary to perform a prior frame data decoding process necessary for decoding the frame in which the in point is set, the time required for this prior decoding process Is Tin. Tin is represented by a delay time 192 in FIG. From the above, assuming that the time from when the seek starts until the frame in which the in point is set becomes output from the second decoding unit 722 is TB, TB is expressed by the following equation.
TB = Tf (2) + N × TinA + b × Ts + Tf (3) + TdlyB + Tin
When there is little effective video data in the recorded area 132, the period from the end of the recorded area 132 to the start of the next video data recorded area V5 is a section in which no video data is read. In this case, the time required for reading the audio recorded area A5, that is, N × TcA + b × Ts may be added to TB.

From the above, the cut editing condition includes the time TA that can be output by the first decoding unit 612 using the remaining amount of the first track buffer unit 610 at the start of seek and the frame in which the in point is set from the start of seek. The time TB until the output from the second decoding unit 722 can be output is TA ≧ TB
Then, the frame in which the out point output from the first decoding unit 612 is set and the frame in which the in point output from the second decoding unit 722 is set are seamlessly connected. From this formula and the formulas representing TA and TB, the cut edit conditions that can be seamlessly reproduced are represented by the following formula.

{V1pr / VdV1pr + Σ (V2 (i) / VdV2 (i)) + V3out / VdV3out− (TprV1 + a × Ts + P × (N × TcA2 + b × Ts) + ΣTcV2 (i) + N × TcA + b × Ts + Tout3) Tf (2) + N × TinA + b × Ts + Tf (3) + TdlyB + Tin + N × TcA + b × Ts}
(Where Σ is i = 1 to P)
This is the cut editing condition of the present invention. These equations are organized as follows.

Cut edit conditions that can be played seamlessly are TA ≧ TB
It is represented by TA is the first time from the start of the seek operation of the pickup 601 from the out point to the in point until the output of the first decoded data 617 by the first decoding unit 612 ends. TB is the second time from when the seek operation of the pickup 601 is started until the second decoded data 618 can be output by the second decoding unit 722. TA is
TA = TBUFA + TdlyA
It is represented by The first real-time data 615 includes a plurality of partial data from the pr point to the out point. The plurality of partial data are video data and audio data recorded in a distributed manner. The plurality of partial data is, for example, a frame or a GOP. TdlyA is the time when one of the plurality of partial data is accumulated in the first VBV buffer unit 611 and the first decoding unit after one of the plurality of partial data is input to the first decoding unit 612. Reference numeral 612 denotes a delay time that represents the sum of the time until the first decoded data 617 generated by decoding one of the plurality of partial data is output.
TBUFA
TBUFA = TDEC-TREAD
It is represented by A bit rate is associated with each of the plurality of partial data. For example, the bit rate associated with the m-th partial data (m is an integer) of the plurality of partial data is the n (n is an integer different from m) -th partial data of the plurality of partial data. Different from the associated bit rate.
TDEC is a time that represents the sum of a plurality of times obtained by dividing the data amount of each of the plurality of partial data by the bit rate associated with each of the plurality of partial data,
TDEC = Σ (V (i) / VdV (i))
It is represented by Here, V (i) is the data amount of the i-th partial data (i is an integer) among the plurality of partial data. VdV (i) is a bit rate associated with the i-th partial data.
TREAD is the time required to read data from the pr point to the out point of the first real-time data 615.
TREAD = Σ (TR (i) + a (i) × Ts)
It is represented by Here, TR (i) is a time required for reading out the i-th partial data. a (i) is the number of defective ECC blocks in the area where the i-th partial data is recorded. Ts is a time required for skipping one ECC block.
In summary, TA is
TA = Σ (V (i) / VdV (i)) − Σ (TR (i) + a (i) × Ts) + TdlyA
It is represented by

Next, the second time TB is
TB = Tf + Tb + TdlyB + Tin
It is represented by Here, Tf is a time required for the seek operation of the reading unit from the out point to the in point. Tb is a time required for reading data read from the start of the seek operation until data corresponding to the in point is read (for example, Tb includes N × TinA + b × Ts. Tb further includes Tf ( 3) may be included). TdlyB is the second decoding time after at least a part of the second real-time data 616 is stored in the second buffer unit 614 and at least a part of the second real-time data 616 is input to the second decoding unit 722. This is a delay time that represents the sum of the time until the decoding unit 722 outputs the decoded data 618 generated by decoding at least part of the second real-time data 616. Tin is a time required for predecoding processing for obtaining predetermined data (I frame, P frame, etc.) used for decoding data corresponding to the in point of the second real-time data 616. .

  As a first feature of the cut editing condition of the present invention, TdlyA and TdlyB are included in the equation as delay elements considering a decoding model in a compression method such as MPEG. Further, as a second feature of the cut editing condition of the present invention, it is considered that the video data has a variable bit rate (VBR). Specifically, considering the individual bit rate of each video data instead of the maximum bit rate of the video data, the reproduction time in a state where each video data is decoded is represented by separate terms. These two features are greatly different from the conventional model, and the accuracy of determining whether or not the edited data can be seamlessly reproduced is greatly improved as compared with the conventional model.

  In order to perform reproduction corresponding to the variable bit rate (VBR) of the video data, it is necessary to check the data amount for each predetermined section of the video data actually recorded on the information recording medium. In this regard, the present invention can be dealt with by preparing a table as shown in FIG. FIG. 11 will be described later.

  FIG. 14 is a flowchart for obtaining the above-described cut editing conditions of the present invention. In FIG. 14, step E10 represents the start point of processing, and step E20 represents processing for calculating the remaining buffer data at the out point. The process of step E20 corresponds to a process of obtaining a value TBUFA in which the remaining amount of the first track buffer unit 610 at the start of seek is converted into time in the description of deriving the above-described formula for cut editing conditions. Step E30 represents a process for calculating a reproducible time TA using the remaining buffer capacity. The process of step E30 corresponds to the process of obtaining TA = TDEC−TREAD + TdlyA in the description for deriving the above-described expression for the cut editing condition. Step E40 represents a process of calculating TB which is the sum of the delay time until outputting the data with the estimated seek time and the in point set. The process of step E40 corresponds to the process of obtaining TB = Tf (2) + N × TinA + b × Ts + Tf (3) + TdlyB + Tin in the description for deriving the above-described expression for the cut editing condition. Next, Step E50 is processing for comparing the TA calculated in Step E30 with the TB calculated in Step E40. This corresponds to the process of calculating TA ≧ TB in the description of deriving the above-described formula for the cut edit condition, and this determination is a determination process for determining whether the cut edit condition is satisfied. If the cut edit condition is satisfied as a result of the determination in step E50, the process branches to the process in step E60, and a determination result that seamless reproduction is possible is obtained in step E60. On the other hand, if the cut edit condition is not satisfied as a result of the determination in step E50, the process branches to the process in step E61. In step E61, a determination result that seamless reproduction is impossible is obtained.

  As described above, the editing method of the present invention includes the step of setting the out point in the first real-time data, the step of setting the in point in the second real-time data, and the start of the seek operation of the pickup from the out point to the in point. The first time from the time point until the output of the first decoded data by the first decoding unit ends, and the time point from the start of the seek operation until the second decoding data can be output by the second decoding unit And a comparison step of comparing the calculated first time length with the calculated second time length. In the comparison step, it is determined whether TA ≧ TB. When the cut edit condition (TA ≧ TB) is not satisfied, at least a part of the real-time data may be moved to an area where the access time is shortened so as to satisfy the cut edit condition.

  The information recording medium 600 of the present invention includes first real time data and second real time data arranged so as to satisfy the cut editing condition (TA ≧ TB). In the information recording medium 600, the out point is set as the first real-time data and the in point is set as the second real-time data so as to satisfy the cut editing condition (TA ≧ TB). In the reproducing method of the present invention, the first real-time data and the second real-time data are reproduced from the information recording medium of the present invention.

  In the recording method of the present invention, at least one of the first real-time data and at least a part of the second real-time data is stored in the information recording medium 600 so as to satisfy the cut editing condition (TA ≧ TB). Record. The recording method of the present invention includes a step of determining whether a free area can be set so as to satisfy the cut editing condition, and a step of recording real-time data in the free area determined to be settable.

  FIG. 15A is a block diagram showing an information recording / reproducing apparatus 663 having an editing function of the present invention. The information recording / reproducing device 663 includes a control unit F10, a multi-decoder reproducing device 662, a bus unit F20, and interface units F13, F31, F41, and F51.

  The control unit F10 includes a CPU F11 and a memory unit F12. The CPU F11 includes a first setting unit F14 that sets the out point of the first real-time data, and a second setting unit F15 that sets the in point of the second real-time data. The first setting unit F14 and the second setting unit F15 may be provided outside the control unit F10.

  The multi-decoder reproduction device 662 shown in FIG. 15A is different from the multi-decoder reproduction device 662 shown in FIG. 7 in that the first buffer unit 613, the second buffer unit 614, and the read data switching unit 730 are simplified for the sake of simplicity. It is omitted. The pickup 601 is provided inside the information recording medium driving unit F30 provided in the information recording / reproducing device 663. The information recording medium driving unit F30 is a disk drive, for example. The multi-decoder reproducing device 662 includes decoding unit output interfaces F42 and F52 and an output interface F61 to the monitor F70.

  The above-described editing method, recording method, and reproducing method can be executed by the information recording / reproducing apparatus 663 having the control unit F10. The control unit F10 calculates the first time TA and the second time TB, compares the calculated length of the first time TA with the calculated length of the second time TB, and TA ≧ TB. It is determined whether or not.

  The pickup 601 provided in the information recording medium driving unit F30 also functions as a writing unit that writes at least one of at least part of the first real-time data and at least part of the second real-time data to the information recording medium 600. Note that the writing unit may be provided separately from the pickup 601.

  The control unit F10 includes at least a part of the first real-time data 615 and at least a part of the second real-time data 616 so that the length of the first time TA is equal to or longer than the length of the second time TA. The pickup 601 is controlled so as to write at least one to the information recording medium 600.

  In addition, when the control unit F10 determines that the calculated length of the first time TA is shorter than the calculated length of the second time TB, the length of the first time TA is the second time. The pickup 601 is changed so that the recording position in at least one of the first real-time data 615 and at least a part of the second real-time data 616 is changed in the information recording medium 600 so as to be equal to or longer than the length of TB. Control.

  Further, the control unit F10 may control the pickup 601 so as to change the recording position with the smaller data amount of at least a part of the first real-time data 615 and at least a part of the second real-time data 616. .

  Further, when the first real-time data 615 includes the first audio data and the first video data and the second real-time data includes the second audio data and the second video data during the recording operation and the editing operation. The control unit F10 controls the pickup 601 so that the first audio data and the second audio data are recorded on the information recording medium 600 adjacent to each other, and the first video data and the second video data are The pickup 601 may be controlled so as to be recorded on the information recording medium 600 adjacently.

  Details of the rearrangement processing of the first audio data and the second audio data will be described later.

  The control unit F10 checks data arrangement information and editing information included in the information recording medium 600 stored in the information recording medium driving unit F30, and checks whether seamless reproduction is possible. Thereafter, the control unit F10 issues an instruction to the information recording medium driving unit F30 to reproduce desired data. The reproduced data is input to the multi-decoder reproduction device 662 via the bus unit F20. The input data is input to the first decoding unit 612 or the second decoding unit 722 via the first buffer unit 613 (FIG. 7) or the second buffer unit 614 (FIG. 7). The decoded data processed and output by the plurality of decoders is transmitted to the decoding unit output switching unit 731. The decoding unit output switching unit 731 switches the decoded data from the plurality of decoders at a desired timing, and the decoded data from the plurality of decoders are seamlessly connected and passed to the monitor F70 for display. The decoding unit output switching unit 731 may have an interface unit (not shown) with the bus unit F20 in order to exchange information with the decoding units 612 and 722 and the control unit F10. The decoding unit output switching unit 731 may adjust the time difference between the output signals from the decoders using a frame memory or the like and output the adjusted signal to the monitor F70. Although FIG. 15 shows two decoding units, there may be two or more decoding units.

  FIG. 15B is a block diagram showing a recording device 664 having an editing function of the present invention. Compared with the information recording / reproducing device 663 (FIG. 15A), the recording device 664 omits the components of the multi-decoder reproducing device 662. The recording device 664 includes a control unit F10, a bus unit F20, and interface units F13, F31, F41, and F51. The editing method and the recording method described above can be executed by the recording device 664 having the control unit F10. The operation of each component is as described with reference to FIG. 15A. The recording device 664 includes an information recording medium driving unit F30. When the recording device 664 and the multi-decoder reproduction device 662 are mounted on the same product, the information recording medium driving unit F30 is shared by the recording device 664 and the multi-decoder reproduction device 662. When the recording device 664 and the multi-decoder reproduction device 662 are separate products, the information recording medium driving unit F30 is provided in each of the recording device 664 and the multi-decoder reproduction device 662. The pickup 601 provided in the information recording medium driving unit F30 functions as a reading unit and a writing unit. Note that the reading unit and the writing unit may be provided separately.

  FIG. 15C is a block diagram showing an editing device 665 having an editing function of the present invention. The editing device 665 omits the components of the multi-decoder playback device 662 compared to the information recording / playback device 663 (FIG. 15A). The editing device 665 includes a control unit F10, a bus unit F20, and interface units F13, F31, F41, and F51. The editing method described above can be executed by the editing device 665 having the control unit F10. The operation of each component is as described with reference to FIG. 15A. The editing device 665 includes an information recording medium driving unit F30. When the editing device 665 and the multi-decoder playback device 662 are mounted on the same product, the information recording medium drive unit F30 is shared by the editing device 665 and the multi-decoder playback device 662. When the editing device 665 and the multi-decoder reproduction device 662 are separate products, the information recording medium driving unit F30 is provided in each of the editing device 665 and the multi-decoder reproduction device 662. The pickup 601 provided in the information recording medium driving unit F30 functions as a reading unit and a writing unit. Note that the reading unit and the writing unit may be provided separately.

The information recording medium 600 may be a semiconductor memory medium. The semiconductor memory medium is a non-volatile memory medium such as an SD memory card. In this case, the information recording medium driving unit F30 is, for example, a memory drive, and the pickup 601 is replaced with a memory reading unit that reads data from the semiconductor memory medium and a memory writing unit that writes data to the semiconductor memory medium. Even in a semiconductor memory medium, the access speed decreases at the time of random access between memory cells separated from each other. Therefore, the access speed can be improved by applying the present invention. In particular, the data rearrangement method of the present invention is also useful for semiconductor memory media.

  Further, the information recording medium driving unit F30 may be a hard disk device. In this case, the information recording medium 600 may be a magnetic disk medium, and the pickup 601 is replaced with a reading unit that reads data from the magnetic disk medium and a writing unit that writes data to the magnetic disk medium. The effects obtained by the present invention are the same as when the information recording medium 600 is an optical disk medium.

  FIG. 3 is a diagram for explaining an access operation at an in point and an out point of audio data. FIG. 3B shows a recorded area on the information recording medium 600, and the recorded areas A3 and A4 of the audio data in which the in point or the out point are set are the recorded areas shown in FIG. 1 and FIG. It is the same as regions A3 and A4.

  FIG. 3A is an enlarged view of the recorded area A3 of the audio data in which the out point OA3 is set. In FIG. 3A, multi-channel audio data (ch1 audio data 300, ch2 audio data 301, chN audio data 302) is recorded in the recorded area of the audio data. Here, when the out point is set in the audio recorded area, each channel has an out point, and the ch1 audio data 300 includes the audio data 310 up to the out point, and the ch2 audio data 301 is out. The audio data 311 up to the point is included, and the chN audio data 302 includes the audio data 312 up to the out point.

  The time required to reproduce the audio data of each channel up to the out point is as follows. First, after the access time Ta31 to reach the audio data, the head portion of the ch1 audio data is reached. When the immediately preceding data is continuous with the audio data, Ta31 may be set to 0. Next, the audio data 310 up to the out point of the ch1 audio data is reproduced. Next, the data 311 up to the out point of the ch2 audio data is reproduced. However, there is audio data that does not need to be reproduced after the out point of the ch1 audio data between the audio data 310 and the audio data 311. However, since the size of the audio data is smaller than that of the video data, an empty reading is performed as it is without accessing a fine seek or the like, and the head of the audio data 311 is reached. Thereafter, the same processing is performed for other channels, so that continuous reproduction is performed up to the end of the audio data 312 up to the out point of the last chN audio data. The time required for continuous reproduction from the start point of the audio data 310 to the end point of the audio data 312 is defined as Ra31. After that, seek is performed for Ta32 toward the next in point.

  FIG. 3C is an enlarged view of the recorded area A4 of the audio data in which the in point IA4 is set. In FIG. 3C, multi-channel audio data (ch1 audio data 340, ch2 audio data 341, chN audio data 342) is recorded in the recorded area of the audio data. Here, when the in point is set in the audio recorded area, each channel has an in point. The ch1 audio data includes the audio data 351 after the in point, and the ch2 audio data after the in point. Audio data 352, and the chN audio data includes audio data 353 after the in point.

  The time required to reproduce the audio data of each channel from the in point is as follows. First, after the access time Ta33 to reach the audio data, the head portion of the audio data 351 after the in point of the ch1 audio data is reached. Next, the audio data 351 after the in point of the ch1 audio data is reproduced. Next, the audio data 352 after the in point of the ch2 audio data is reproduced. Between the audio data 351 and the audio data 352, there is unnecessary audio data before the in point of the ch2 audio data. However, since the size of the audio data is smaller than that of the video data, the data is read as it is without accessing the fine seek or the like, and the head of the audio data 352 is reached. Thereafter, the same processing is performed for other channels, so that continuous reproduction is performed until the end of the audio data 353 after the in point of the last chN audio data. Ra32 is the time required for continuous playback from the start point of the audio data 351 to the end point of the audio data 353. After that, seek is performed in the time of Ta34 toward the next in point.

  FIG. 4 is a diagram for explaining the access operation at the out point of the video data. Since the data compressed and encoded in the MPEG format has a GOP structure, I frame data, P, arranged on the information recording medium. It is necessary to consider the order of each of the frame data and the B frame data and the order of the frame video output from the decoding unit.

  In FIG. 4A, video data necessary for reproduction from the beginning of the recorded area V3 to the out point OV3 is recorded in the recorded area 124 of the recorded video data area V3. GOP400 is the GOP immediately before the out point OV3. The GOP 401 is a GOP in which the out point OV3 is set. FIG. 4B shows outputs of frames 410 to 416 near the out point OV3 among the frames included in the GOP 400 and the GOP 401.

  As can be seen by comparing FIG. 4A and FIG. 4B, the order of the frames arranged on the information recording medium is different from the order of the frames output from the decoder. For example, when the frame 415 selected as the frame for setting the out point OV3 is a B frame, the I frame indicated by the frame 416 is arranged on the information recording medium, so that it is read before the B frame. However, in the order of frame output from the decoder, the B frame 415 read later is output first. The I frame 416 is a frame necessary for decoding the B frame at the out point OV3. However, since the display order is a frame after the out point OV3, the frame 416 is decoded, but the output is Will not be. When considering the seamless playback conditions, in order to display the frame output with the out point set and the frame output with the in point set uninterruptedly, when the frame with the out point set is output from the decoder Or that delay needs to be calculated accurately.

  In the model of the present invention, a delay due to the frame output order of these decoding units is also taken into consideration. Specifically, in the expression of the cut editing condition described with reference to FIG. 1, the delay element TdlyA of the first decoding unit 612 that decodes the out point includes a delay element caused by the frame output order. The actual MPEG data is added with DTS information representing the time to be decoded and PTS information representing the time to be output with respect to the data of each frame, so this time information is used. Thus, the delay element TdlyA can be specifically calculated.

  FIG. 5 is a diagram for explaining the access operation at the in point of the video data. Similar to FIG. 4, each of the frame data of I frame data, P frame data, and B frame data arranged on the information recording medium is shown. It is necessary to consider the order and the order of frame images output from the decoding unit.

  In FIG. 5A, an area 215 in the video data recorded area V4 represents an area from slightly before the in point IV4 in the recorded area V4 to the end of the recorded area V4. GOP 220 indicates the GOP immediately preceding the GOP including the frame in which the in point IV4 is set, and GOP 221 indicates the GOP including the frame in which the in point IV4 is set. FIG. 5B shows outputs of frames 510 to 519 near the in point IV4 among the frames included in the GOP 220 and the GOP 221.

  Similar to the description of FIG. 4, in FIG. 5, the order of frames arranged on the information recording medium is different from the order of frames output from the decoding unit. Furthermore, at the in point, as described with reference to FIG. 2B, in order to decode a frame in which the in point is set, it may be necessary to decode several frames before the in point in advance. FIG. 5 shows a case where the B frame 515 in which the in point IV4 is set is a B frame near the head of the GOP 221. In order to decode the frame 515, it is necessary to decode not only the I frame 516 of the GOP 221 in which the in point IV4 is set, but also the I frame and the P frame in the GOP 220. Therefore, the frames that need to be decoded in advance are the frames 510 to 514 and the frame 516. Among these, the frames 510 to 514 whose display order is before the in point IV4 are subjected to decoding processing but are not output. Following frame 515, frames 517-519 are decoded.

  As described above, for the frame output in which the in point is set, it is necessary to consider the delay due to the frame output order of the decoding unit, the delay due to the process of decoding several frames before the in point, and the like. In particular, in order to display seamlessly a frame in which the out point is set and a frame in which the in point is set in seamless playback, when the frame in which the in point is set is output from the decoding unit, The delay needs to be calculated accurately.

  In the model of the present invention, the delay due to the frame output order of these decoding units and the delay due to the decoding processing of several frames before the in point are also considered. Specifically, in the expression of the cut editing condition described with reference to FIG. 1, the delay element TdlyB of the second decoding unit 722 that decodes the in point includes a delay element caused by the frame output order. Tin of the same formula includes a delay element due to decoding processing of several frames before the in point. That is, Tin includes the time for decoding I frame 510, P frames 511 to 514, and I frame 516 in FIG.

  The actual MPEG data is added with DTS information representing the time to be decoded and PTS information representing the time to be output with respect to the data of each frame, so this time information is used. Thus, the delay element TdlyB can be specifically calculated. In addition, in a normal decoding unit, since the decoding process is performed in a frame cycle, the delay element Tin can be calculated by checking the number of I frames and P frames before the in point. is there.

  Next, the details of the output time until the video is output from the decoding unit in the multi-decoder playback device shown in FIG. 7 will be described.

  FIG. 8 is a diagram showing the image output time in the conventional decoding model. 8A, the vertical axis indicates the data amount of the track buffer unit, the horizontal axis indicates time, and FIG. 8B shows the data amount of the VBV buffer unit, and the horizontal axis indicates time. FIG. 8C shows the frame output from the decoding unit corresponding to the time on the horizontal axis.

  In FIG. 8, a solid line 800 represents a change in the amount of data in the track buffer unit. Data 810, 811 and 812 represent data corresponding to frame 1, frame 2 and frame 3 respectively stored in the VBV buffer unit. Data 820 and 821 represent frame 1 and frame 2 in the frame output from the decoding unit, respectively.

  Data read by the pickup from the information recording medium is accumulated in the track buffer unit based on the difference between the read bit rate Vr and the data transfer rate Vo from the track buffer unit to the VBV buffer unit in a steady state. In a decoding model that handles data in units of GOPs, as shown in FIG. 8 (a), data for one GOP is accumulated in the track buffer unit until the start of decoding, and then the VBV buffer is stored at a time indicated by reference numeral 801. Start data transfer to the department. Therefore, as for the data amount of the track buffer unit shown in FIG. 8A, data is accumulated with a slope Vr before the start of transfer, and data is accumulated with a slope Vr−Vo after the start of transfer. When the transfer to the VBV buffer unit is started, data is accumulated in the VBV buffer unit at the maximum MPEG bit rate, as shown in FIG. 8B. Thereafter, when a data amount corresponding to the first frame is accumulated in the VBV buffer unit, one frame of data is transferred from the VBV buffer unit to the subsequent decoding unit. At this time, assuming that the data transfer from the VBV buffer unit to the decoding unit is performed instantaneously, the data amount (data amount of the data 810) of the VBV buffer unit in FIG. Decreases instantaneously at the time indicated by reference numeral 802 (decoding start time). The data for one frame that has passed to the decoding unit is decoded and output as a video signal indicated by a frame output 820 after a predetermined delay time.

  As described above, in the conventional decoding model, data for one GOP is stored in the track buffer unit at the start of reproduction. For this reason, it takes a lot of time 822 from the start of data accumulation in the track buffer unit in FIG. 8A to the output of the first frame output 820 shown in FIG. 8C. . Therefore, there is a problem that it takes time until the video is output after the reproduction of the information recording medium is started.

  FIG. 9 is a diagram showing the image output time in the decoding model of the present invention, and the decoding method of the present invention will be described. 9A, the vertical axis indicates the data amount of the track buffer unit, the horizontal axis indicates time, and FIG. 9B shows the data amount of the VBV buffer unit, and the horizontal axis indicates time. FIG. 9C shows the frame output from the decoding unit corresponding to the time on the horizontal axis.

  In FIG. 9, a solid line 800 represents a change in the data amount in the track buffer unit in the conventional decode model, and a solid line 900 represents a change in the data amount in the track buffer unit in the decode model of the present invention. Data 810, 811 and 812 represent data corresponding to frame 1, frame 2 and frame 3 respectively stored in the VBV buffer unit. Data 820 and 821 represent frame 1 and frame 2 in the frame output from the decoding unit, respectively.

  As shown in FIG. 9 (a), in the decoding model of the present invention, a set of M frames (M is an integer of 1 or more), and when a set of data is accumulated in the track buffer unit, the VBV buffer unit The feature is that the transfer to the network is started. For example, when M = 3 frames, the VBV buffer unit at the time (time indicated by reference numeral 901) when data of three frames, that is, data of frame 1, frame 2, and frame 3, is accumulated in the track buffer unit. Start transferring to. Decoding is started at the time indicated by reference numeral 901. Therefore, as can be seen by comparing FIG. 8C and FIG. 9C, in the decoding model of the present invention, the time from the start of reproduction of the information recording medium to the output of the video is shortened. There is an effect that can be done.

  In the present embodiment, the example of M = 3 has been described. However, as shown in FIG. 10C, the present invention can be applied to other than M = 3.

  FIG. 10 is a conceptual diagram showing the data structure in the GOP in the decoding model of the present invention. FIG. 10A shows a GOP in a conventional decoding model, which is also shown in FIG. 10 for comparison with the present invention. FIG. 10B is an example of the decoding model of the present invention, and shows the unitization of each frame when M = 3 frames. FIG. 10C is a general form of the decoding model of the present invention, and shows the unitization of each frame when M is an integer of 1 or more.

  As shown in FIG. 10 (c), in the decoding model of the present invention, in addition to the conventional grouping of frames by GOP, a small group (unit) further including a subsequent B frame based on an I frame or a P frame. Is a feature. For example, FIG. 10A shows a group A00 with 15 frames as 1 GOP. In the present invention, out of the 15 frames in this GOP, first, an I frame and a plurality of B frames subsequent thereto are defined as one unit A10. Next, a P frame and a plurality of subsequent B frames are set as one unit A11. Similarly, units A12, A13, and A14 are divided. The addresses on the information recording medium of each unit are created as a table.

  FIG. 11 shows a configuration diagram of a table B20 for managing grouped frame data in the GOP of the present invention. In FIG. 11, the conventional table B10 is shown for comparison. As can be seen from FIG. 11, in the conventional table B10, the length and IPB identification information are stored as address information for each frame. This increases the size of the table and occupies the storage area of the information recording medium. On the other hand, in the decoding model table B20 of the present invention, the length of each unit, the number of frames to be unitized, and the size information of the I or P frame are stored as address information. Therefore, there is an effect that the size of the table can be reduced. The table B20 is also effective in special playback and editing processing, as will be described below.

  In special playback such as search and editing processing such as cut editing, video may be played from a frame in the middle of the GOP. However, in MPEG, for example, in order to decode a specific B frame, it is necessary to decode the original I frame or P frame. Therefore, in order to search the I frame and P frame necessary for decoding at high speed, the frame search is performed by the presence of position information indicating where the I frame and the P frame are recorded on the information recording medium. Time can be shortened.

  Here, the position information of the I frame and the P frame is shown in the table B20 of the present invention in FIG. That is, since the small grouping of each frame in the decoding model of the present invention is performed based on the I frame and the P frame, the address information of each unit directly represents the position information of the I frame and the P frame. Therefore, it can be understood that the small grouping of each frame in the decoding model of the present invention is also effective in the special reproduction and editing processing as described above.

  Next, the maximum bit rate of MPEG data will be described.

  FIG. 12 is a diagram showing the transition of the data amount in the VBV buffer unit in the conventional decoding model. In FIG. 12, the vertical axis represents the data amount of the VBV buffer unit, and the horizontal axis represents time. The data amount C10 represents the data amount of the first frame, the data amount C11 represents the data amount of the second frame, the data amount C12 represents the data amount of the third frame, and the maximum bit rate C20 is the maximum in this model. Represents the bit rate.

  In the conventional decoding model, in order to prevent the data amount of the VBV buffer unit from overflowing or underflowing, the bit rate at which data is accumulated in the VBV buffer unit is kept within the slope indicated by the maximum bit rate C20. There were restrictions. For this reason, for example, for a specific frame, even if the bit rate necessary to obtain the original image quality exceeds the maximum bit rate, the code amount of the frame is reduced in order to keep the above constraints, It was necessary to lower the bit rate slope. Lowering the bit rate gradient by reducing the code amount of the frame is equivalent to lowering the image quality of the frame, so the conventional decoding model cannot obtain the original image quality due to the maximum bit rate restriction. There was a problem.

  FIG. 13 is a diagram showing the transition of the data amount of the VBV buffer unit in the decoding model of the present invention. In FIG. 13, the vertical axis represents the data amount of the VBV buffer unit, and the horizontal axis represents time. The data amount D10 represents the data amount of the first frame, the data amount D11 represents the data amount of the second frame, the data amount D12 represents the data amount of the third frame, and the maximum bit rate C20 is a conventional decoding model. The maximum bit rate D20 represents the maximum bit rate in the decoding model of the present invention, the average bit rate D30 represents the average bit rate of a total of three frames from the first to the third frames, and the total code amount D31 represents the total code amount from the first to the third frame.

  In the decoding model of the present invention, as described with reference to FIG. 10, a small group (unit) including a subsequent B frame is formed with an I frame or a P frame as a base point. The maximum bit rate is limited in that M frames are one unit (M is an integer of 1 or more), and the average bit rate of each unit is within the range of the conventional maximum bit rate. It is.

  As an example, the case where M = 3 frames will be described with reference to FIG. In FIG. 13, the first frame D10 has a slope exceeding the conventional maximum bit rate C20. In the conventional decoding model, it is necessary to keep the slope of the first frame D10 within the range of the conventional maximum bit rate C20. However, in the decoding model of the present invention, M = 3 frames are taken as one set, and the average bit rate of the set is calculated. That is, the total code amount of the first frame D10, the second frame D11, and the third frame D12 corresponds to D31, and the gradient obtained by dividing the code amount by the time for three frames is the average bit rate D30 of three frames.

  Since the average bit rate D30 is within the range of the conventional maximum bit rate C20, the VBV buffer unit does not overflow. In addition, since the first frame D10 may have the maximum bit rate D20 that exceeds the conventional maximum bit rate C20, the original image quality can be obtained.

(Embodiment 2)
Hereinafter, the data rearrangement method according to the second embodiment of the present invention will be described with reference to FIG. 18, FIG. 19, FIG. 20, FIG. The rearrangement method described in the second embodiment is executed by, for example, the information recording / reproducing device 663 (FIG. 15A), the recording device 664 (FIG. 15B), and the editing device 665 (FIG. 15C).

  FIG. 19 shows the rearrangement process of the present invention. FIG. 19A shows a first rearrangement process in which one of the data with the out point set and the data with the in point set is rearranged. FIG. 19B illustrates a second rearrangement process in which rearrangement of both data set with the out point and data set with the in point is performed. Both processes represent a process for seamless reproduction of video and audio without interruption even when a seek occurs when connecting real-time data recorded on the information recording medium 600 by cut editing. Hereinafter, the two rearrangement processes will be described.

  FIG. 19A shows the first rearrangement process of the present invention, and real-time data indicating video, audio, etc. is recorded in the continuously recorded area K10. Real-time data is also recorded in the continuously recorded areas K20, K21, and K22. The continuously recorded areas K20 to K22 are on the same information recording medium 600 as the continuously recorded area K10, but are recorded at a distance from the continuously recorded area K10. The continuously recorded area K30 represents a reproduction area designated by cut editing. The continuously recorded area K30 is a part of the continuously recorded area K10. After the continuous recorded area K30 is reproduced, seek is performed from the end of the continuous recorded area K30 to the beginning of the continuous recorded area K20, and the reproduction after the continuous recorded area K20 is continuously performed. However, when the seek distance from the end of the continuously recorded area K30 to the start end of the continuously recorded area K20 is long, it may be determined that seamless playback is impossible in the seamless playback determination process described with reference to FIG. is there.

  Therefore, in the first rearrangement process of the present invention, first, an empty area in which the access time to the start end of the continuously recorded area K20 is shortened is searched on the information recording medium, and that area is set as the rearrangement destination. It is determined whether the rearrangement destination is included in a seek range where seamless reproduction is possible. The seek range in which seamless playback is possible can be obtained by the seamless playback determination process described with reference to FIG. When the rearrangement destination K30r satisfies the seamless reproduction condition, as shown in FIG. 19A, the data recorded in the continuously recorded area K30 is copied to the rearrangement destination, and this is used as data K30p. . By this rearrangement processing, the real-time data shown in FIG. 19A starts to be reproduced from the beginning of the data K30p, and seeks from the end of the data K30p to the beginning of the continuously recorded area K20 while continuing the reproduction seamlessly. Thus, it is possible to connect to the reproduction after the continuously recorded area K20. Note that in the embodiment of the present invention, copying data includes cutting and pasting of data.

  In FIG. 19A, the continuously recorded area K30 is an area where the out point OK10 is set, and the continuous recorded area K20 is an area where the in point IK20 is set. In the above description, since the continuously recorded area K30 where the out point OK10 is set is shorter than the continuous recorded area K20, the shorter data, that is, the data continuously recorded area K30 where the out point OK10 is set. As described above, the data recorded in the above example is rearranged. However, the first rearrangement process of the present invention is not limited to this, and when the data with the in point set is shorter, the data with the in point set may be rearranged.

  FIG. 19B shows the second rearrangement process of the present invention, and the continuously recorded areas K10, K20, K21, and K22 are the same as those in FIG. 19A. The continuously recorded area K50 represents a reproduction area designated by cut editing. The continuously recorded area K50 is a part of the continuously recorded area K10. The continuous recorded area K60 represents a part of the continuous recorded area K20. After playback of the continuous recorded area K50, seek from the end of the continuous recorded area K50 to the start of the continuous recorded area K60, that is, the start of the continuous recorded area K20, and playback after the continuous recorded area K20. To continue. However, when the seek distance from the end of the continuously recorded area K50 to the start end of the continuously recorded area K20 is long, it may be determined that seamless playback is impossible in the seamless playback determination process described with reference to FIG.

  In the second rearrangement process of the present invention, first, an empty area is searched from a location close to the continuously recorded area K20 on the information recording medium, and that area is set as a rearrangement destination candidate. Then, it is determined whether the rearrangement destination is included in a seek range where seamless reproduction is possible. The seek range in which seamless playback is possible can be obtained by the seamless playback determination process described with reference to FIG.

  However, if the rearrangement destination does not satisfy the seamless playback condition, as shown in FIG. 19B, the data recorded in the continuously recorded area K50 in which the out point OK10 is set is transferred to the rearrangement destination area K50r. It is assumed that data is copied to the data, and the assumed copy data is data K50q. Further, it is assumed that the data recorded in the continuously recorded area K20 in which the in point IK20 is set is copied to the relocation destination area K60r, and the assumed copy data is data K60q. The size of the data K60q can be obtained by calculating the seamless reproduction condition when seeking to the end of the continuously recorded area K60 after reproducing the data K50q and K60q. When the size of the free area at the rearrangement destination can sufficiently store K50q and K60q, the data is actually copied from the continuously recorded areas K50 and K60 to the rearrangement destination areas K50r and K60r. If the size of the free area is not sufficient, the same determination process is performed for other free areas. Accordingly, the cut-edited real-time data starts to be reproduced from the beginning of the data K50q, and a sufficient buffer amount is accumulated when the end of the data K60q is reached. The remaining amount of the buffer can be used to seek from the end of the data K60q to the end of the continuously recorded area K60 while maintaining seamless reproduction, and can be connected to subsequent reproduction.

  As described above, in the second rearrangement process of the present invention, when rearrangement of short real-time data as recorded in the continuously recorded area K50, when a rearrangement destination area capable of seamless reproduction is not found, The feature is that the data is rearranged so as to satisfy the seamless reproduction condition by further adding the data to be rearranged from the continuous recorded area K20.

  In the present embodiment, an example in which the continuously recorded area K50 is small has been described. However, if the continuous recorded area K50 is large, a part of the continuous recorded area K50 may be copied to an empty area instead of the entire area.

  FIG. 18 is a flowchart showing the rearrangement process of the present embodiment. In FIG. 18, step J10 represents the starting point of processing, and seamless playback determination processing is performed in step J20. In step J30, a relocation destination search process is performed. In step J40, a seamless reproduction determination process is performed in consideration of the rearrangement destination. In Step J50, the first rearrangement process is performed. In step J60, the second rearrangement process is performed. Step J70 represents the end point of the process.

  The determination process in step J20 represents the entire seamless reproduction determination process described in FIG. 14 as one processing unit. As shown in step E60 of FIG. 14, when it is determined that seamless playback is possible, seamless playback is possible without performing the subsequent rearrangement process.

  On the other hand, as shown in step E61 in FIG. 14, when it is determined that seamless reproduction is not possible, the process in step J30 in FIG. 18 is performed to search for a free area to be relocated. In the determination process of step J20 described above, a seek range that can be seamlessly reproduced can be obtained. In the determination process in step J40, it is determined whether the rearrangement destination obtained in step J30 is included in a seek range in which seamless playback is possible.

  As a result of the determination in step J40, if it is determined that the rearranged area is within the seek range where seamless reproduction is possible, the process branches to step J50. The process of step J50 represents a part of the first rearrangement process described with reference to FIG. 19A and copies data to the rearrangement destination. At this point, when the processing is completed in step J70, since the data is rearranged like the data K30p in FIG. 19A, seamless reproduction is possible.

  On the other hand, if it is determined as a result of the determination in step J40 that the rearranged area is outside the seek range where seamless reproduction is possible, the process branches to step J60. The process of step J60 represents a part of the second rearrangement process described with reference to FIG. 19B, and includes not only the data in which either the in point or the out point is set, but also both data. Copy it to the relocation destination and enable seamless playback. By this processing, when the processing is completed in step J70, since the data is rearranged like the data K50q and K60q in FIG. 19B, seamless playback is possible.

  FIG. 20 is a diagram illustrating the first rearrangement process of the present embodiment in more detail. In FIG. 20, recorded areas A1a, A2a, A3a, A4a of audio data and recorded areas V1a, V2a, V3a, V4a of video data are alternately arranged on one information recording medium. It is assumed that the distance between the recorded area V2a and the recorded area A3a is separated on the information recording medium. The pr points PA1a and PV1a, the out points OA2a and OV2a, and the in points IA3a and IV3a in the editing are set in the audio data and the video data, respectively. , The data section after the in point is reproduced. In FIG. 20, these data sections that are actually used as video and audio are represented by hatching.

  FIG. 22 is a diagram showing a recording state on the information recording medium 600. In FIG. 22, the information recording medium 600 includes a recorded area N10, a first empty area N11, and a second empty area N12. FIG. 22 shows the area and recording state of the information recording medium by enlarging the scope N20 when the data recording state of the information recording medium is viewed in the radial direction.

  The recorded areas A1a to A4a and V1a to V4a in FIG. 22 correspond to the recorded areas A1a to A4a and V1a to V4a in FIG. 20, respectively. Recorded areas A1a, V1a, A2a, V2a are arranged on the inner circumference side of the recorded area N10, and recorded areas A3a, V3a, A4a, V4a are arranged on the outer circumference side.

  First, reproduction is performed from the recorded area on the inner circumference side of the recorded area N10, and then seek is performed to reproduce the recorded area on the outer circumference side of the recorded area N10. As can be seen from FIG. 22, the inner-side recorded area and the outer-side recorded area of the recorded area N10 are separated from each other and it takes time to seek, so that there is a problem that seamless reproduction cannot be performed.

  In the first rearrangement process of the present invention, when seamless playback is impossible, the rearrangement destination is searched from the free area on the information recording medium. When the rearrangement destination is included in the seek range where seamless playback is possible, the shorter of the data set with the in point or the out point is copied to the rearrangement destination region. In the example of FIG. 20, assuming that the data with the out point set is shorter, the data with the out point set is rearranged. In the rearrangement destination area, the audio data and the video data are alternately arranged as in the other recorded areas.

  In FIG. 22, it is assumed that an empty area N11 is found in the vicinity of the outer periphery of the recorded area N10. The empty area N11 is close to the outer periphery of the recorded area N10. Therefore, it is determined that the empty area N11 is included in a seek range in which seamless reproduction is possible with reference to the outer peripheral area of the recorded area N10. In such a case, seamless reproduction is possible by rearranging the data recorded on the inner circumference side of the recorded area N10 in the empty area N11.

  The data to be rearranged in FIG. 20 includes audio data a stored in the area from the pr point PA1a in the recorded area A1a to the end of the recorded area A1a, and the recorded data in the recorded area A2a from the beginning of the recorded area A2a. The audio data b recorded in the area up to the out point OA2a and the audio data c recorded in the area from the in point IA3a in the recorded area A3a to the end of the recorded area A3a.

  The audio data a, b, and c are copied to the rearrangement destination in this order. If the total size of these data (that is, a + b + c) is halfway compared to a predetermined data delimiter, the padding data L10 may be added. Predetermined data delimiters are easy to process, such as ECC block unit of information recording medium, sector unit of information recording medium, video / audio data alternating unit, video / audio data frame unit, compressed data unit, etc. Data delimitation in units.

  The video data to be rearranged includes video data d recorded in an area from a position slightly before the pr point PV1a in the recorded area V1a to the end of the recorded area V1a, and recorded from the beginning of the recorded area V2a. The video data e is recorded in the area up to the out point OV2a in the area V2a. The reason why the video data d includes data recorded in an area slightly before the pr point is that, as described with reference to FIG. This is because an I frame or a P frame may be necessary. Considering this factor, the video data d includes data of a frame before the pr point necessary for decoding the frame in which the pr point is set. For the same reason, the in point IV3a in the recorded area V3a needs to be reproduced from data recorded in an area slightly before the in point IV3a.

  Since the audio data rearranged in this way is arranged from the head of the empty area N11, the audio data recording area becomes smaller if the amount of audio data is small. Further, since the rearranged audio data and video data are rearranged together, the access time from the end of the rearranged audio data to the start of the rearranged video data can be reduced.

  In this way, audio data and video data are copied to the rearrangement destination, and seamless reproduction becomes possible. Although not shown, padding data may be added to the end of the rearranged video data e in the same manner as the padding data L10. The rearranged state is shown in a region N11 in FIG. Audio data a, b, and c are recorded in the recorded areas A1p, A2p, and A3p in FIG. In addition, video data d and e are recorded in the recorded areas V1p and V2p in FIG.

  In addition, since the audio data c is a part of the longer data in the example of FIG. 20, it may not be rearranged. However, when the audio data c is not rearranged, the seek destination after reproducing the rearranged data becomes the in point IA3a in the recorded area A3a. Since there is a slight distance between the recorded area A3a and the position just before the in point IV3a in the video data recorded area V3a, a short distance fine seek L30 may occur. Since the audio data c is also rearranged, the seek destination after reproducing the rearranged destination data is a position slightly before the in point IV3a in the recorded area V3a, so that the fine seek L30 is not generated. Can continue. In this way, even when only one data is rearranged, the occurrence of an extra fine seek can be prevented by rearranging both the audio data only. If the unnecessary seek is reduced, the seamless playback condition is relaxed, and there is an advantage that the chance of seamless playback is increased.

  Further, as described with reference to FIG. 3, the audio data includes a number of audio channels. Therefore, when the audio data is copied to the rearrangement destination in the rearrangement process of FIG. 20, seamless reproduction is possible even if only the audio data of the specific channel to be used is copied to the rearrangement destination. In addition, when copying data to the relocation destination, not only the audio data of the specific channel to be used, but also all the audio channel data (including empty data) including unused areas for unused channels are copied. You may do it. As a result, additional recording of audio data can be performed later in the free area for unused channels in the rearrangement area by post-recording processing.

  FIG. 21 is a diagram illustrating the second rearrangement process of the present invention in more detail. The recorded areas A1a to A4a and recorded areas V1a to V4a in FIG. 21 are the same as the areas shown in FIG.

  FIG. 21 shows a rearrangement process in a case where it is determined that the rearrangement destination area searched from the empty area on the information recording medium is outside the seek range where seamless playback is possible. This case will be described with reference to FIG. Assume that as a result of searching for a free area near the outer periphery of the recorded area N10, other data has already been recorded in the free area N11, and a free area N12 has been found instead. Since the empty area N12 is separated from the outer peripheral side of the recorded area N10, it is determined that the empty area N12 is outside the seek range where seamless playback is possible when the outer peripheral side of the recorded area N10 is used as a reference. Is done. In such a case, seamless reproduction cannot be achieved simply by rearranging the data recorded on the inner circumference side of the recorded area N10 within the area of the empty area N12. Therefore, processing for further adding data to be rearranged in the area of the empty area N12 is performed.

  Referring to FIG. 21, since it is determined that the rearrangement destination area is outside the seek range where seamless playback is possible, the shorter one of the data set with the in point or the out point is rearranged. It is not possible to play seamlessly only by copying first. Therefore, a process of copying the longer data among the data set with the in point or the out point to the rearrangement destination is performed.

  First, the audio data to be rearranged in FIG. 21 is audio data a, audio data b, and audio data c.

  The audio data a, b, and c are copied to the rearrangement destination in the order, but if the total size (a + b + c) of these data is halfway compared to a predetermined data delimiter, the padding data M10 May be added. This predetermined data delimiter is the same as described above.

  On the other hand, the video data to be rearranged is video data d and video data e.

  In addition to the above rearrangement data, video data f of a predetermined length is added as rearrangement data from a position slightly before the in point IV3a in the recorded area V3a.

  Hereinafter, it will be described how much data amount can be rearranged as video data f to enable seamless reproduction.

  In FIG. 21, video data e and video data f are not continuous images. For this reason, when these are data compressed by MPEG, a multi-decoder as described with reference to FIG. 7 is required. FIG. 7 shows a first decoding unit 612 and a second decoding unit 722 as an example of a multi-decoder. In FIG. 21, since the video data d and the video data e are continuous images, the first decoding unit 612 decodes them. On the other hand, the video data f is decoded by the second decoding unit 722.

  FIG. 21B shows the video data d, e, and f in detail in GOP units. FIG. 21C shows the remaining data amount in the second track buffer unit 720 of FIG. The remaining data 210 is the remaining data at the end of reading the video data f. The video data f is decoded by the second decoding unit 722.

  As a seamless reproduction condition for the rearranged data, a condition in which the second buffer unit 614 does not underflow is considered. Note that the video data e decoded by the first decoding unit 612 and the video data f decoded by the second decoding unit 722 are continuously recorded at the rearrangement destination. It is self-evident that no seek occurs between 1 and f, and these video data can be seamlessly reproduced by the multi-decode model. Therefore, in this example, a description will be given of how much data should be rearranged among the data decoded by the second decoding unit 722.

The second decoding unit 722 processes the video data f without processing the video data d and e. Therefore, when the data M30 and the data M31 are reproduced from the information recording medium, the data is accumulated in the second track buffer unit 720. The data M30 is pre-frame data necessary for decoding a frame in which the in point is set, and the data amount of the data M30 is V3pr. The bit rate of the data M30 (video data) is set to VdV3pr. The data M31 represents data after the in point, and the data amount of the data M31 is V3in. The bit rate of the data M31 (video data) is set to VdV3in. The time taken to read the data M30 is assumed to be TprV3. The time required for reading the data M31 is assumed to be TinV3 + a × Ts. Here, a represents the number of defective ECC blocks to skip in the video data, and Ts represents the time required to skip one ECC block. After reading data M30 and data M31, seek M20 is performed. Assuming that the value obtained by converting the buffer data remaining amount of the second track buffer unit 720 immediately before the seek M20 into time is TBUF, TBUF is expressed by the following equation.
TBUF = V3pr / VdV3pr + V3in / VdV3in− (TprV3 + TinV3 + a × Ts)
On the other hand, the end of the rearranged data (that is, from the end of the rearranged video data f) is sought to the end position of the video data f in the recorded area V3a by the seek M20, and then reproduced as data M40 and M41. Consider the case. The data M40 is video data recorded in an area from the end recording position of the video data f in the recorded area V3a to the end of the recorded area V3a. Data M41 represents audio data recorded in the recorded area A4a. In this example, the data M40 is illustrated, but when most of the portion is rearranged from the video data recorded area V3a, the amount remaining as the data M40 may be extremely small. In this case, after the seek M20, the video data is hardly supplied by reproducing the data M40, and the audio data M41 may be reproduced as it is after the seek M20. Since the video data is not supplied while the audio data M41 is being reproduced on the information recording medium, the remaining buffer data in FIG. 21 (c) continues to decrease during this time. Therefore, the access time from the rearrangement destination, that is, the time from the end of the data M31 to the access to the next video data, includes not only the seek time but also the read time of the data M41 to which no video data is supplied. . When the time required for the seek M20 is Tf, the time required for reading one channel of audio data is TcA, the number of channels of audio data is N, and the number of defective ECC blocks to be skipped in the audio data is b, the end of the relocation destination The access time TACS from the start to the seek destination video data is expressed by the following equation.

TACS = Tf + N × TcA + b × Ts
Conditions for seamless playback from the rearrangement destination are the value TBUF obtained by converting the buffer data remaining amount of the second track buffer unit 720 shown in FIG. 21C into time, and seek from the end of the rearrangement destination. The result of comparing the access time TACS to the previous video data is
TBUF ≧ TACS
If it is good. Therefore, the conditional expression for seamless playback from the rearrangement destination is
V3pr / VdV3pr + V3in / VdV3in− (TprV3 + TinV3 + a × Ts) ≧ Tf + N × TcA + b × Ts
It is represented by By obtaining the data amount V3in of the data M31 that satisfies this conditional expression, the data amount of the video data f to be rearranged in FIG.

  When the data amount of the video data f obtained from the conditional expression is halfway with respect to the predetermined data delimiter, the data amount is adjusted within the range satisfying the conditional expression, and adjusted to a size suitable for the predetermined data delimiter. You may do it. This predetermined data delimiter is as described above.

  The arrangement state rearranged as described above is shown in a region N12 in FIG. The recorded areas A1q, A2q, and A3q in FIG. 22 record the audio data a, b, and c in FIG. 21, respectively. In addition, the recorded areas V1q, V2q, and V3q in FIG. 22 record the video data d, e, and f in FIG. 21, respectively.

  As described above, in the second rearrangement process according to the present embodiment, when the rearrangement destination is not included in the seek range that can be seamlessly reproduced, the data to be further rearranged and recorded in the rearrangement area It is characterized in that seamless playback is possible by increasing the amount of.

  It is assumed that the data M30 and the data M31 have different bit rates. This takes into account that the video data has a variable bit rate (VBR), and for data M30, decoding of a frame in which the in point is set without decoding all data in the GOP. This is because only the frames necessary for the data are decoded, so that both the bit rate of the data M30 and the bit rate of the data M31 are considered.

  In FIG. 21C, the gradient of the remaining amount of the second track buffer unit 720 is different from the data M30 and the data M31. The reason for this is that not all data in the GOP is decoded for the data M30, but only the frames necessary for frame decoding with the in point set are decoded. Data such as no B frame is erased in the second track buffer unit 720 or discarded without being decoded in the second decoding unit 722. Therefore, since the data M30 is consumed quickly, the difference between the read data from the information recording medium and the consumed data is reduced, and the rate of increase in the remaining amount of data is less than that when the data M31 is read.

  In FIG. 21A, if there is video data M40 that remains in the recorded area V3a without being rearranged, the audio data corresponding to this data M40 also remains in the area of the recorded area A3a. It will be. In this case, the remaining audio data in the area of the recorded area A3a is first accessed from the end of the rearranged video data f, and then the data M40 is accessed. Since there is a slight distance between the recording positions of the remaining data in the recorded area A3a and the recorded area V3a, a short distance fine seek may occur. Therefore, even when the video data M40 remains in the recorded area V3a, the audio data corresponding to the data M40 is included in the rearranged audio data c. Thus, since the seek destination after reproducing the rearranged data becomes the data M40 in the recorded area V3a, the reproduction can be continued without generating extra fine seek. Even when video data remains without being rearranged, the audio data corresponding to the video data can be rearranged to prevent generation of an extra fine seek.

  In FIG. 21A, the video data d and e to be rearranged are decoded by the first decoding unit 612 (FIG. 7). Since there is a difference between the data reading rate from the information recording medium 600 and the decoding rate of the first decoding unit 612, the first decoding is performed when the relocated video data d and e are read from the information recording medium 600. There is a slight remaining amount of buffer data in the first track buffer unit 610 of the conversion unit 612. If there is a remaining amount of data in the first track buffer unit 610, it is possible to delay the time until outputting a frame in which the in point is set. However, in the case where the rearrangement process as shown in FIG. 21 occurs, the video data d and e are often short, so that the remaining data in the first track buffer unit 610 is very small and can be ignored. Therefore, in order to simplify the conditional expression, in this embodiment, the elements of the first track buffer unit 610 are omitted in the conditional reproduction condition expression from the rearrangement destination. When more precise conditions are required, the calculation may be performed in consideration of the remaining data amount of the first track buffer unit 610 as described above.

  In FIG. 20, when the audio data c in the recorded area A3a is rearranged, the video data corresponding to the audio data c may be rearranged. As a result, since audio data and video data corresponding to each other exist at the rearrangement destination, it becomes easier to perform AV synchronization, and data editing at the rearrangement destination becomes easier.

  20 and 21, when discontinuous video data e and f are rearranged, such discontinuous video data may be once decoded into frame data and encoded again. At this time, by performing re-encoding processing so that the encoded data has a data size that satisfies the conditions for seamless playback, seamless playback is possible even with a single decoder playback device as shown in FIG.

  According to the recording / reproducing apparatus, the recording apparatus, the editing apparatus, the information recording medium, the recording / reproducing method, the recording method, and the editing method of the present invention, the first time from the start time of the seek operation of the read unit from the read end point to the read start point A first time until the output of the first decoded data by the decoding unit ends, and a second time from when the seek operation starts until the second decoding data can be output by the second decoding unit. Time is calculated, the calculated first time length is compared with the calculated second time length, and whether or not seamless reproduction is possible is determined based on the comparison result. According to the present invention, the seamless playback condition is determined in consideration of the delay time generated by the decoding process of the compressed video data, the variable bit rate, and the like, and therefore it is possible to accurately determine whether or not seamless playback is possible. The present invention capable of obtaining such effects is particularly useful for a recording / reproducing apparatus, a recording apparatus, an editing apparatus, an information recording medium, a recording / reproducing method, a recording method, and an editing method for seamlessly reproducing a plurality of real-time data. .

The figure explaining the cut edit conditions of this invention The figure which shows the example of arrangement | positioning of the real-time data of this invention, and the setting of out point and in point The figure explaining the access operation to the audio data of this invention The figure explaining the access operation | movement to the video data of this invention The figure explaining the access operation | movement to the video data of this invention The figure which shows the single decoder playback device The figure which shows the multi-decoder reproducing | regenerating apparatus of this invention The figure which shows the picture output time with the conventional decoding model The figure which shows the image output time in the decoding model of this invention Conceptual diagram showing the data structure of a GOP in the decoding model of the present invention The figure which shows the table for managing the grouped frame data in GOP of this invention The figure which shows transition of the data amount in the VBV buffer part in the conventional decoding model The figure which shows transition of the data amount of the VBV buffer part in the decoding model of this invention Flowchart showing cut editing of the present invention 1 is a block diagram showing an information recording / reproducing apparatus having an editing function according to the present invention. The block diagram which shows the recording device with the edit function of this invention Block diagram showing an editing apparatus having an editing function of the present invention Diagram showing simultaneous playback device The figure which shows the example in which the continuous recording area | region is cut-edited in the unit which consists of several audio data and video data The flowchart which showed the rearrangement process of this invention The figure which shows the rearrangement process of this invention The figure which shows the 1st rearrangement process of this invention The figure which shows the 2nd rearrangement process of this invention The figure which shows the recording state of the information recording medium of this invention

Explanation of symbols

180, 190, 191 Delay time 192 Decoding time 600 Information recording medium 601 Pickup 610 First track buffer unit 610
611 First VBV buffer unit 611
612 First decoding unit 612
720 Second track buffer unit 720
721 Second VBV buffer unit 721
722 Second decoding unit 722
730 Read data switching unit 731 Decoder output switching unit A1 to A5 Recorded area of audio data A10 to A14 Unit B20 Table F10 Control unit F11 CPU
F12 memory unit F13, F31, F41, F51 interface unit F20 bus unit F30 information recording medium drive unit F40 first decoding unit F50 second decoding unit F42, F52 decoder output unit 731 decoding unit output switching unit F61 to monitor Output unit F70 Monitor unit V1 to V5 Recorded area of video data

Claims (29)

A reading unit for reading the first data and the second data from the information recording medium;
A first buffer unit for temporarily storing the read first data;
A second buffer unit for temporarily storing the read second data;
A first decoding unit that outputs first decoded data generated by decoding the accumulated first data;
A second decoding unit for outputting second decoded data generated by decoding the accumulated second data;
A first setting unit for setting a reading end point of the first data;
A second setting unit for setting a reading start point of the second data;
A first time from the start of the seek operation of the read unit from the read end point to the read start point until the output of the first decoded data by the first decoder ends; and the seek operation And a second time from when the second decoding unit can output the second decoded data to the second decoding unit, and the calculated first time length and the calculated second time are calculated. A control unit for comparing the length of time ,
When the first time is the same as the second time, or when the first time is longer than the second time, the control unit sets the first data and the second data as time. Recording / reproducing apparatus which judges that continuous reproduction and output are possible .   The calculated first time is calculated from the time obtained by dividing the data amount from the read start point of the first data to the read end point by the bit rate associated with the first data. The recording / reproducing apparatus according to claim 1, comprising a time obtained by subtracting a time required for reading data from the read start point of data to the read end point. The first data includes a plurality of partial data between a read start point of the first data and the read end point,
A bit rate is associated with each of the plurality of partial data,
The calculated first time is calculated from a time representing a sum of a plurality of times obtained by dividing the data amount of each of the plurality of partial data by a bit rate associated with each of the plurality of partial data. The recording / reproducing apparatus according to claim 1, further comprising a time obtained by subtracting a time required for reading data from the read start point to the read end point of the first data.   The bit rate associated with the m (m is an integer) th partial data of the plurality of partial data is the n (n is an integer different from m) th partial data of the plurality of partial data. The recording / reproducing apparatus according to claim 3, wherein the recording / reproducing apparatus is different from the associated bit rate. The first data includes a plurality of partial data between a read start point of the first data and the read end point,
In the calculated first time, after one of the plurality of partial data is input to the first decoding unit, the first decoding unit decodes one of the plurality of partial data. The recording / reproducing apparatus according to claim 1, further comprising a time until outputting the decoded data generated by the conversion. The first buffer unit includes a track buffer unit and a VBV buffer unit,
6. The recording / reproducing apparatus according to claim 5, wherein the calculated first time includes a time during which one of the plurality of partial data is accumulated in the VBV buffer unit. The first data includes a plurality of partial data between a read start point of the first data and the read end point,
A bit rate is associated with each of the plurality of partial data,
The first buffer unit includes a track buffer unit and a VBV buffer unit,
If the calculated first time is TA, TA is
TA = Σ (V (i) / VdV (i)) − Σ (TR (i) + a (i) × Ts) + TdlyA
Where, where
V (i) is the data amount of the i-th partial data (i is an integer) of the plurality of partial data,
VdV (i) is a bit rate associated with the i-th partial data,
TR (i) is a time required to read out the i-th partial data,
a (i) is the number of defective ECC blocks existing in the area where the i-th partial data is recorded in the information recording medium,
Ts is the time required to skip one ECC block,
TdlyA includes the time when one of the plurality of partial data is stored in the VBV buffer unit and the first decoding after one of the plurality of partial data is input to the first decoding unit. 2. The recording / reproducing apparatus according to claim 1, which is a time that represents a sum of a time until a decoding unit generates decoded data generated by decoding one of the plurality of partial data. The calculated second time is
Time required for the seek operation of the readout unit from the readout end point to the readout start point;
After at least a part of the second data is input to the second decoding unit, the second decoding unit outputs decoded data generated by decoding the at least part of the second data. The recording / reproducing apparatus according to claim 1, further comprising:   9. The recording / reproducing apparatus according to claim 8, wherein the calculated second time includes a time during which the at least part of the second data is accumulated in the second buffer unit. The calculated second time is
Time required for the seek operation of the readout unit from the readout end point to the readout start point;
After at least a part of the second data is input to the second decoding unit, the second decoding unit outputs decoded data generated by decoding the at least part of the second data. The recording / reproducing apparatus according to claim 5, comprising:   The recording / reproducing apparatus according to claim 10, wherein the calculated second time includes a time during which the at least part of the second data is accumulated in the second buffer unit. The calculated second time is
Time required for the seek operation of the readout unit from the readout end point to the readout start point;
The recording / playback according to claim 1, further comprising: a time required for predecoding processing for acquiring predetermined data used for decoding data corresponding to the read start point of the second data. apparatus. Assuming that the calculated second time is TB, TB is
TB = Tf + Tb + TdlyB + Tin
Where, where
Tf is the time required for the seek operation of the readout unit from the readout end point to the readout start point;
Tb is a time required for reading data read from the start time of the seek operation until data corresponding to the read start point is read,
TdlyB includes the time during which at least a part of the second data is stored in the second buffer unit, and the second decoding after the at least a part of the second data is input to the second decoding unit. A time that represents the sum of the time until the output of the decoded data generated by the unit decoding the at least part of the second data,
2. The Tin according to claim 1, wherein Tin is a time required for predecoding processing for obtaining predetermined data used for decoding data corresponding to the read start point of the second data. Recording / playback device. Assuming that the calculated second time is TB, TB is
TB = Tf + Tb + TdlyB + Tin
Where, where
Tf is the time required for the seek operation of the readout unit from the readout end point to the readout start point;
Tb is a time required for reading data read from the start time of the seek operation until the data corresponding to the read start point is read,
TdlyB includes the time during which at least a part of the second data is stored in the second buffer unit, and the second decoding after the at least a part of the second data is input to the second decoding unit. A time that represents the sum of the time until the output of the decoded data generated by the unit decoding the at least part of the second data,
8. The Tin according to claim 7, wherein Tin is a time required for predecoding processing for obtaining predetermined data used for decoding data corresponding to the read start point in the second data. Recording / playback device. A writing unit for writing at least one of at least part of the first data and at least part of the second data to the information recording medium;
When the control unit determines that the calculated first time length is shorter than the calculated second time length, the first time length is equal to the second time length. Controlling the writing unit to change a recording position in the information recording medium of at least one of the first data and at least a part of the second data so as to be longer than the length; The recording / reproducing apparatus according to claim 1.   16. The control unit according to claim 15, wherein the control unit controls the writing unit so as to change a recording position having a smaller data amount of at least a part of the first data and at least a part of the second data. Recording and playback device. The first data includes first audio data and first video data;
The second data includes second audio data and second video data;
The control unit controls the writing unit such that the first audio data and the second audio data are recorded on the information recording medium adjacent to each other, and the first video data and the second video are recorded. The recording / reproducing apparatus according to claim 15, wherein the writing unit is controlled such that data is recorded on the information recording medium adjacent to each other.   The recording / reproducing apparatus according to claim 1, wherein the information recording medium is an optical disk medium. The recording / reproducing apparatus according to claim 1, wherein the information recording medium is a magnetic disk medium. A recording device for recording at least one of first data and second data to be reproduced by a reproducing device on an information recording medium,
The playback device
A reading unit for reading the first data and the second data from the information recording medium;
A first buffer unit for temporarily storing the read first data;
A second buffer unit for temporarily storing the read second data;
A first decoding unit that outputs first decoded data generated by decoding the accumulated first data;
A second decoding unit for outputting second decoded data generated by decoding the accumulated second data;
With
The recording device comprises:
A first setting unit for setting a reading end point of the first data;
A second setting unit for setting a reading start point of the second data;
A first time from the start of the seek operation of the read unit from the read end point to the read start point until the output of the first decoded data by the first decoder ends; and the seek operation And a second time from when the second decoding unit can output the second decoded data to the second decoding unit, and the calculated first time length and the calculated second time are calculated. A control unit for comparing the length of time ,
When the first time is the same as the second time, or when the first time is longer than the second time, the control unit sets the first data and the second data as time. Recording apparatus that determines that continuous reproduction and output are possible . A writing unit for writing at least one of at least part of the first data and at least part of the second data to the information recording medium;
The control unit has at least one of at least part of the first data and at least part of the second data so that the length of the first time is equal to or longer than the length of the second time. The recording apparatus according to claim 20, wherein the writing unit is controlled so as to write the information to the information recording medium. The first data includes first audio data and first video data;
The second data includes second audio data and second video data;
The control unit controls the writing unit such that the first audio data and the second audio data are recorded on the information recording medium adjacent to each other, and the first video data and the second video are recorded. The recording apparatus according to claim 21, wherein the writing unit is controlled such that data is recorded on the information recording medium adjacent to each other. An editing device for editing at least one of first data and second data recorded on an information recording medium to be played back by a playback device,
The playback device
A reading unit for reading the first data and the second data from the information recording medium;
A first buffer unit for temporarily storing the read first data;
A second buffer unit for temporarily storing the read second data;
A first decoding unit that outputs first decoded data generated by decoding the accumulated first data;
A second decoding unit for outputting second decoded data generated by decoding the accumulated second data;
With
The editing device
A first setting unit for setting a reading end point of the first data;
A second setting unit for setting a reading start point of the second data;
A first time from the start of the seek operation of the read unit from the read end point to the read start point until the output of the first decoded data by the first decoder ends; and the seek operation And a second time from when the second decoding unit can output the second decoded data to the second decoding unit, and the calculated first time length and the calculated second time are calculated. A control unit for comparing the length of time,
When the first time is the same as the second time, or when the first time is longer than the second time, the control unit sets the first data and the second data as time. An editing apparatus that determines that continuous playback and output are possible . An information recording medium on which first data and second data to be played back by a playback device are recorded,
The playback device
A reading unit for reading the first data and the second data from the information recording medium;
A first buffer unit for temporarily storing the read first data;
A second buffer unit for temporarily storing the read second data;
A first decoding unit that outputs first decoded data generated by decoding the accumulated first data;
A second decoding unit for outputting second decoded data generated by decoding the accumulated second data;
With
A reading end point is set in the first data,
A read start point is set in the second data,
The length of the first time from the start point of the seek operation of the read unit from the read end point to the read start point until the output of the first decoded data by the first decoding unit ends, The first data and the second data are set to be equal to or longer than a second time from when the seek operation starts until the second decoding data can be output by the second decoding unit. An information recording medium in which are arranged. A reading step of reading the first data and the second data from the information recording medium;
A first accumulation step for temporarily accumulating the read first data;
A second accumulation step for temporarily accumulating the read second data;
A first decoding step of outputting first decoded data generated by decoding the accumulated first data;
A second decoding step of outputting second decoded data generated by decoding the accumulated second data;
A first setting step for setting a reading end point of the first data;
A second setting step for setting a reading start point of the second data;
From the start time of the seek operation from the read end point to the read start point until the end of the output of the first decoded data in the first decoding step, and from the start time of the seek operation Calculating a second time until the second decoded data can be output in the second decoding step, and calculating the calculated first time length and the calculated second time length. A comparison step for comparing
As a result of the comparison, when the first time is the same as the second time, or when the first time is longer than the second time, the first data and the second data are timed. Determining that it is possible to continuously reproduce and output,
Including a recording / reproducing method. A recording method for recording at least one of first data and second data to be reproduced by a reproduction device on an information recording medium,
The playback device
A reading unit for reading the first data and the second data from the information recording medium;
A first buffer unit for temporarily storing the read first data;
A second buffer unit for temporarily storing the read second data;
A first decoding unit that outputs first decoded data generated by decoding the accumulated first data;
A second decoding unit for outputting second decoded data generated by decoding the accumulated second data;
With
The recording method is:
A first setting step for setting a reading end point of the first data;
A second setting step for setting a reading start point of the second data;
A first time from the start of the seek operation of the read unit from the read end point to the read start point until the output of the first decoded data by the first decoder ends; and the seek operation And a second time from when the second decoding unit can output the second decoded data to the second decoding unit, and the calculated first time length and the calculated second time are calculated. A comparison step that compares the length of time and
As a result of the comparison, when the first time is the same as the second time, or when the first time is longer than the second time, the first data and the second data are timed. Determining that it is possible to continuously reproduce and output,
Including a recording method.   At least one of the first data and at least a part of the second data is stored in the information recording medium so that the length of the first time is equal to or longer than the length of the second time. 27. The recording method according to claim 26, further comprising a writing step of writing to the file. The first data includes first audio data and first video data;
The second data includes second audio data and second video data;
The writing step includes
Recording at least one of the first audio data and the second audio data on the information recording medium such that the first audio data and the second audio data are adjacent to each other;
Recording at least one of the first video data and the second video data on the information recording medium such that the first video data and the second video data are adjacent to each other;
The recording method according to claim 27, comprising: An editing method for editing at least one of first data and second data recorded on an information recording medium to be played back by a playback device,
The playback device
A reading unit for reading the first data and the second data from the information recording medium;
A first buffer unit for temporarily storing the read first data;
A second buffer unit for temporarily storing the read second data;
A first decoding unit that outputs first decoded data generated by decoding the accumulated first data;
A second decoding unit for outputting second decoded data generated by decoding the accumulated second data;
With
The editing method is as follows:
A first setting step for setting a reading end point of the first data;
A second setting step for setting a reading start point of the second data;
A first time from the start of the seek operation of the read unit from the read end point to the read start point until the output of the first decoded data by the first decoder ends; and the seek operation And a second time from when the second decoding unit can output the second decoded data to the second decoding unit, and the calculated first time length and the calculated second time are calculated. A comparison step that compares the length of time and
As a result of the comparison, when the first time is the same as the second time, or when the first time is longer than the second time, the first data and the second data are timed. Determining that it is possible to continuously reproduce and output,
Editing method.

Images