JP2857130B2 - Information recording method and recording device - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an information recording method and a recording apparatus effective for recording video, audio, sub-video and the like on a recording medium such as an optical disk.

[0002]

2. Description of the Related Art In recent years, there has been developed an optical disk in which video, audio, sub-video and the like are encoded and recorded at a high density, and a reproducing apparatus therefor. When information such as a movie is recorded on this optical disc, it is considered to record story data of a plurality of stories that progress simultaneously. The story data of a plurality of stories that progress simultaneously means, for example, that brothers A and B start different paths in the middle of their growth, one is a police officer (first story), and the other is a gangster world ( The second story), after the big incident,
It is a story of reuniting and spending time together.

When recording information such as a movie on an optical disc, it has been considered to record a multi-angle scene in which the same event that progresses simultaneously is photographed from a plurality of angles. The multi-angle scene that progresses simultaneously includes, for example, a first scene showing a state in which a ship navigating the ocean is viewed from land, and a second scene showing a state in which a ship navigating the ocean is viewed at the same time. Are a plurality of scenes having the relationship

[0004] As a creator, if the viewer wants to assemble both the first and second stories and show it to the viewer, if he wants to show the viewer mainly the first story,
There is room for some choices, such as when the viewer wants to mainly show the story to the viewer, but in the conventional movie production, one has to select one of them to produce.

The same can be said for the first and second scenes described above. Here, assuming that the viewer can freely select any of the first and second stories or the first and second scenes, the creator has a higher degree of freedom in the production.

Therefore, in recent years, in the case of recording information such as a movie, a plurality of stories and a plurality of scenes which proceed simultaneously are recorded in advance in an optical disc and a reproducing apparatus therefor.
Among them, those that can be freely selected by the viewer have been developed.

[0007]

When data of a plurality of stories and scenes is recorded on an optical disk, it is preferable to record the data so that the data can be easily handled during reproduction. For example, consider a case where story data of a first story and a story data of a second story are recorded in series. If only one story is played during playback, it is necessary to jump to the recording area of the other story. However, if the other story is a short one, the physical movement of the pickup is small and there is no problem. If the other story is a long one, the physical movement of the pickup becomes large, and therefore, The reproduced video may be interrupted or disturbed.

[0008]

SUMMARY OF THE INVENTION Therefore, according to the present invention, when data of a plurality of stories and angle scenes is recorded on a recording medium, the physical movement distance of a pickup at the time of reproduction is small, and the reproduced video is interrupted. It is an object of the present invention to provide an information recording method and a recording device capable of suppressing occurrence of disturbance.

In order to achieve the above object, according to the present invention, in order to record a multi-scene program, which is a video program having a plurality of arbitrarily selectable scenes on a recording track, to a recording medium, Is divided into m interleave units , and the interleave units of each branch scene are placed on the track.
In the case of a mixed arrangement, the plurality of branch scenes are arranged in the order of B0, B1,.
B2,..., Bi,... Further, the code amount of the Bi (arbitrary) is Vi (arbitrary), the reading rate of the reproducing apparatus is Rr, and the maximum reproducing rate per unit time at which the reproducing apparatus reproduces a branch scene in video. Is Pr, the code amount that can be jumped per unit time is Jp,
Time-division multiplexed interleave unit of the shortest branch scene B0
When the number of interleave units of other branch scenes between knits is M-1 , the interleave of the shortest branch scene B0 is performed.
The jump time TJP between units is The shortest playback time Tp of the unit interleave unit of the shortest branch scene B0 is (V0 / m) / Pr The read time Tr of the unit interleave unit of the shortest branch scene B0 is (V0 / m) / Rr. Tp-Tr that the time jump to jump in an interleaved unit or <br/> is small
> TJP condition And m is set as the number of divisions based on equation (1).

By setting the number of divisions and arranging the data as described above, the data of the interleave block is read, and when a certain scene is continuously reproduced, the image of one scene is interrupted or disturbed on the reproduction screen. Can be reproduced so as not to occur, and the division point is a point where scene switching can be obtained.

[0011]

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

FIG. 1 shows the flow of a video program on a time axis in order to explain an embodiment of the present invention. This video program consists of a preceding front story (or scene) A and a plurality of branch stories (or scenes).
B0 to B3 and a subsequent back story (or scene) C. The branch story branches at a branch point X, which is the final position of the front main story A, and connects at a connection point Y, which is the start point of the rear main story C. Here, the front main story, the branch story, and the subsequent main story of this video program are each divided into a plurality of scene cells. The cell of branch story B0 is B0-
, B0-4,..., B0-1, the cells of the branch story B1 are represented as B1-2, B1-1, and the cells of the branch story B2 are B2-5, B2-4,
, B2-1, and the cells of the branch story B3 are represented as B3-5, B3-4, ..., B3-1.

As a method of defining one scene cell, various methods described below are possible.

For example, one scene cell is defined by using the physical length of a track on a recording medium as a unit, and all scene cells are set to have the same length. Also one
One scene cell is defined in terms of the time length at the time of reproduction, and all the scene cells are set to have the same reproduction time length. When data is encoded, one scene cell is defined as a code amount, and all scene cells are set to have the same code amount. In any of the definitions, it is not necessary to set each scene cell to have exactly the same length or amount, but it is sufficient if they are almost the same.

As described above, when a plurality of branch stories are recorded on a recording medium, scene cells appear at the same ratio with respect to the total scene length of all branch stories. Are arranged. In the example of FIG. 1, there are four branch stories, the zeroth branch story is five scene cells, the first branch story is two scene cells, and the second and third branch stories are five scene cells. is there. Here, the total scene length is 17 cells.
So the 0th, 2nd, and 3rd branch stories are 5 /
The first branch story is allocated and arranged at a rate of 17 times, that is, approximately once in 3.5 cells, and the first branch story is allocated and arranged at a rate of 2/17, that is, once every 8.5 cells. Is done.

With such an arrangement, as can be seen from the recording arrangement of each cell in FIG. 1, the jump interval particularly when the first branch story is reproduced is obtained by assembling the second branch stories. It is smaller than the jump interval formed in the case.

FIG. 2A shows a pickup interval of the 0th branch story (solid arrow), a pickup interval of the third branch story (dotted arrow), and a pickup interval of the first branch story in the case of the above arrangement pattern. (Dashed-dotted arrow) is shown.

On the other hand, FIG. 2B shows an example in which the branch stories are sequentially arranged. The pickup interval of the 0th branch story (solid arrow), the pickup interval of the third branch story (dotted arrow), The pick-up interval (dashed-dotted arrow) of one branch story is shown. In this case, the pickup interval becomes very long, and the reproduced video is likely to be interrupted or disturbed. However, by arranging as in the present invention, a pattern as shown in FIG. 2A can be obtained, the interval between the pickups becomes narrow, and it is possible to suppress breaks or disturbances in the reproduced video.

Next, a method of arranging scene cells specifically after determining the scene cells of each branch story will be described.

Assume that there is a video program having a plurality of branch stories (including multi-angle scenes) as shown in FIG. 3A. A multi-angle scene is, for example, a plurality of simultaneously-moving videos taken from different angles, such as a video of a concert venue shot with the conductor up and a video of the entire orchestra shot from the audience side. It is.

In FIG. 3A, A0 is a front trunk scene, B0 is a pseudo-branch story, and B1 and B2 are branch stories having different contents. This video program is divided into scene cells as shown in FIG. 3B, for example. Each scene cell has a data capacity and a cell number. A black dot is attached to the division point, and this point is, for example, the head position of a video frame. In this example, the time length when the data of each scene cell is reproduced is set to be the same. Further, since this data is variable compression data, even if the reproduction time of each scene cell is the same, the data capacity of each scene cell is not necessarily the same. In FIG. 3B, B0 is indicated by one black circle, but in this case, it is assumed that there is no actual data because it is a pseudo story.

When the scene cells are set as described above, a table L1 indicating the cell numbers of the connection destination scene cells is completed as shown in FIG. 4A. That is, scene cell number A0
A0-0 is the only scene cell number connected to -1. The cell number connected to the cell number A0-0 is any of B1-3, B2-2, C0-0, and C1-0. When the connection-destination scene cells are grouped in such a manner as to correspond to each scene cell, a table L1 shown in FIG. 4A can be obtained.

FIG. 4B shows a cell number table L2 created based on the information in the table of FIG. 4A for actually arranging each scene cell in series on the track of the recording medium.

Next, when the scene cells are actually arranged in series on the track of the recording medium based on the information in which the connection destinations of the scene cells are arranged as described above, that is, when the arrangement of the table L2 is obtained, The sequence order is determined by the following procedure.

FIG. 5 shows an algorithm for determining the cell number arrangement order.

First, the cell number and capacity in the first row of the table L1 are written in the first row of the table L2 (steps S1 and S2). The cell number of the connection destination scene is also read. Next, in the table L2, among the cell numbers without the connection completion flag, all of the connection destination cell numbers of the cell number fall within the maximum jump allowable range (referred to as Jmax) in the front-rear direction with respect to the cell number position. Determine if there is.

Maximum jump allowable range (referred to as Jmax)
Is a value determined by the response speed of the pickup of the playback device and the capacity (playback time) of an output buffer for temporarily storing data for outputting decoded data for playback.

Cell number A0-1, connection destination cell number A0-
Since the relation with 0 satisfies the above-mentioned Jmax (20 Mb in this example), a connection completion flag is added to the row of A0-1 of the table L2 (step S5).
4). Next, the cell number A0-0 and its data capacity are read from the table L1, and the connection destination cell number B is read.
1-3, B2-2, C0-0, and C1-0 are read (step S3).

Then, cell numbers A0-0, B1-3, B2-2, C0-0, C without the connection completion flag
Among 1-0, it is determined whether or not all of the connection destination cell numbers of the cell number are within the maximum jump allowable range (Jmax) in the front-back direction with respect to the cell number position. In this case, since the distance from A0-0 to C0-0 and C1-0 is equal to or longer than Jmax, the process proceeds to step S6 via step S5.

In step S5, there is only one cell number without the connection completion flag, and it is determined whether or not the connection destination cell number does not exist. Step.

At the stage when the cell number A0-0 is read,
Since the arrangement has not been completed, the process proceeds to step S6. In step S6, the following determination is performed using the cell number A0-0 and the cell numbers B1-3, B2-2, C0-0, and C1-0 of the connection destination scene. That is, the scene cell number is
When mn is represented, the one with the smallest ＄ is selected first. In this example, since there are B and C, B is selected (in this example, A <B <C). Further, those having the maximum n and the minimum m are extracted. That is, when n is large, it means that the number of divisions is large, and when m is small, it means that the priority given to the branch story in advance is high.

In the above example, as can be seen from FIG. 3B, the scene cell number following A0-0 is B1-
That means three. Next, the extracted cell number B1
-3 is provisionally arranged in the last row of the table L2 (step S7). After B1-3, B1
-2. Therefore, A0-0, B1-3, B2
-2, C0-0, C1-0, and B1-2.

Next, except for the extracted cell number B1-3,
Unconnected cell numbers (B2-2, C0-0, C1-
If all the connection destination cells of 0) are arranged after the provisional arrangement, it is determined whether or not the code amount distance between each of the unconnected cell numbers and the connection destination cells is Jmax (20 Mb) or less (step). S8). In this example, B2-2, C
Following 0-0, C1-0 and B1-2, B2-
1, D0-0, D1-0, D0-0, and D1-0. In this case, the distance (code amount) from B2-2 to B2-1, the distance from C0-0 to D0-0, and the distance from C1-0 to D1-0 are all within Jmax. As a result, the temporary array is determined to be normal, and the process returns to step S3 via step S11.

In step S3, the previous temporary array is
1-3, B2-2, C0-0, C1-0, and B1-2, which have connection completion flags as regular ones. , B2-1, D0-0, D1-0, D0-
0, D1-0.

Next, B2-1, D0-0, D1-0, D
Following 0-0 and D1-0, the respective connection destination cell numbers are arranged. That is, B2-1, D0-0,
D1-0, D0-0, D1-0, B2-0, E0-0,
E1-0, E0-0, and E1-0 are arranged.
Then, in step S3, it is determined whether or not all of the connection destination cell numbers of the cell number (without the connection completion flag) are within the maximum jump allowable range (referred to as Jmax) in the front-rear direction with respect to the cell number position. to decide. In this case, since all of them become Jmax or more, step S
6, B2-1 is extracted here, and B2-0 is extracted in step S7, and B2-1, D0-
0, D1-0, D0-0, D1-0, B2-0 and the last part.

Next, in step S8, the cell numbers (D0-0, D1-0, D0-0, D1-0, B2-0) other than the extracted cell number (B2-1) are not connected except for the cell number (B2-1).
If all the connection destination cells of 0) are arranged after the provisional arrangement, it is determined whether or not the code amount distance between each of the unconnected cell numbers and the connection destination cells is Jmax (20 Mb) or less (step). S8). That is, (D0-0, D1-0,
D0-0, D1-0, B2-0), followed by E0-0,
When E1-0, E0-0, E1-0, C0-0, C1-0 are arranged, whether the distance of the connection destination cell from each of D0-0, D1-0, B2-0 is within 20 Mb Is determined. In the case of this example, the distance from B2-0 to the connection destination cells C0-0 and C1-0 is 20 or more.

Therefore, in this case, the process proceeds to step S9.
Here, it is determined whether or not there are two or more cell numbers that do not satisfy the condition, and if there are two or more, it is assumed that an error has occurred. In this case, the number is one, and the process proceeds to step S10.

In step S10, all connection destination cells of unconnected cells that do not satisfy the conditions are arranged, and their cell numbers and code amounts are read (in this case, C0-0, C1-0).
Read).

The process returns from step S10 to step S6. Here, the cell number is selected according to the principle described above. That is, the cell number {m-n} having the smallest 、, the largest n and the smallest m is extracted.
Then, the process proceeds to steps S7 and S8.

As described above, in this algorithm, when there are a plurality of branch streams, each of the branch streams is divided by, for example, a code amount for which the reproduction time is equal, and then the arrangement is performed according to the principles shown in steps S3 and S6. The order is decided.

FIG. 6 shows some reproduction examples of the disks arranged and recorded as described above. The order of the arrows is the order of picking up the scene cells.

The above example is one example, and various embodiments are possible in the present invention.

Various embodiments are possible as the dividing method shown in FIG. 3B. The method of determining the division point is as follows. When dividing a branch story into a plurality of parts, the branch story is divided by a code amount such that the reproduction times of the cells of all the branch stories are the same, and the distance that the pickup jumps is within the maximum jump amount Jmax. Is determined by the above-described algorithm with reference to the code amount.

However, when determining the division point, each branch story may be divided separately.

FIG. 7 shows three branch stories.
This is an example in which each of the branch story, the second branch story, and the third branch story are equally divided into three so that the code amounts are equal. That is, as shown in FIG. 7A, the first branch story is separated into cell numbers B0-0, B0-1, and B0-2 of the same code amount (5 Mb), and the second branch story has the same code amount. Cell number B in quantity (7 Mb)
1-0, B1-1, and B1-2, and the third branch story has a cell number B2 of the same code amount (6 Mb) unit.
−0, B2-1, and B2-2. The number of divisions of each branch story is the same, and in this example, it is three.

In this case, as shown in FIG. 7B, a set of cell numbers B0-0, B1-0 and B2-0 is set as scene cell block # 0, and cell numbers B0-1 and B1-
Assuming that a set of 1, B2-1 is a scene cell block # 1 and a set of cell numbers B0-2, B1-2, B2-2 is a scene cell block # 2, the code amount of each scene cell block is equal.

The fact that the code amount (data amount) is equal means that the jump distance is the same regardless of whether the B0 branch stream is reproduced, the B1 branch stream is reproduced, or the B2 branch stream is reproduced. That is.

In the above example, division is performed by the code amount.
Each branch may be divided at an equal playback time.

FIG. 8 shows four branch stories.
This is an example in which each of the branch story, the second branch story, the third branch story, and the fourth branch story are equally divided into three so that the reproduction times are equal. That is, FIG.
, The first branch story includes cell numbers B0-0, B0-1, B0-2, B0- in the same playback time unit.
3 and the second branch story is divided into cell numbers B1-0, B1-1, B1-2, B1-
3 and the third branch story is divided into cell numbers B2-0, B2-1, B2-2, B2-
3

Also in this case, scene cell blocks # 0 to # 3 can be obtained as shown in FIG. 8B.

In the above example, the cell arrangement method relating to a multi-story has been described. However, it is possible to arrange a multi-angle in a similar way. If you want to watch a video of a different angle from the middle, for example, at a concert hall, while watching a video of only the conductor up, and want to see a video of the entire orchestra taken from the audience, Is recorded, the user can watch the video with the angle freely changed.

FIG. 9A shows multi-angle video information. FIG. 9A shows a case where a first angle scene D0-0 to D0-3 and a second angle scene D1-0 to D1-3 exist as information sources. As shown in FIG. 9B, scene cell blocks # 0 to # 3 are formed and arranged.

FIG. 10A shows an example of a source in a case where one of the multi stories ends in an extremely short time. FIG. 10B shows a state where each branch story is divided by a predetermined division number (4) to obtain cells.

When one branch story is extremely short in this way, even if the cell of the story B0 is simply multiplexed together with the cell of another story, the transition from the reproduction of the story of B0 to the reproduction of the story of the next C0 is performed. In some cases, the jump interval becomes longer, and the condition cannot be satisfied.

In order to solve this problem, FIG.
1 is used. That is, first, FIG.
As shown in A, a part of the trunk story C0 at the rear is added to each of the branch stories B0, B1, and B2, and the connection point is shifted backward. Then, each branch story is defined as B0 (E), B1 (E), and B2 (E) as shown in FIG. 11B.
And these branch stories B0 (E), B1 (E),
B2 (E) is divided as shown in FIG. 11C, and a cell number is assigned. The subsequent arrangement method is the same as the procedure described above. In this example, each branch story is divided into five.

FIG. 12 shows a state where cells are selected one by one from each of the branch stories described above, and cell blocks # 0, # 1,... Are created and arranged. These scene cell blocks contain an error correction code. In this example, the scene cell blocks have the same code amount. Furthermore, in the case of compressed data of the MPEG2 system as a whole, uncompressed video data, ie, I
It is divided so as to include data that can be expanded without using compressed data in a picture or frame or other compressed data in a frame. This is because if there is no uncompressed video data in the first cell due to the compression method, subsequent compressed video data cannot be reproduced.

FIG. 13 is a diagram for explaining an example of division in the case of dividing and recording a multi-story using mathematical expressions.

As shown in FIG. 13A, a video program composed of video, audio, characters, etc., is connected to a branch point X for branching from the front main story A and a rear main story C. It is assumed that there are a plurality of branch stories B0, B1, and B2 that can be arbitrarily selected between the link stories Y and B. It is assumed that the recording state on the recording medium between the branch point X and the junction point Y is arranged as shown in FIG. 13B.
Now, assume that the system of the branch story B0 is reproduced as shown in FIG. 13C. Then, the playback device must perform playback while jumping between cells. actually,
The pickup performs processing while reading data and confirming the read data.

Here, it is assumed that each branch story is divided into the same number m. Then, the shortest story as a whole In this example, the reproduction interval (jump distance) of B0 is the longest. Therefore, we focus on the shortest story.

Assuming that the total capacity of B0 is V0, 1 of B0
The cell capacity is V0 / m.

Next, the maximum code reproduction rate per unit time of the reproducing apparatus is Pr, and the reading rate of the reproducing apparatus is R.
Assuming that r, the reproduction time Tp of B0-0 is Tp = (V0 / m) / Pr The read time Tr of B0-0 is Tr = (V0 / m) / Rr.

[0062] Further, the code amount VJ per one should jump during B0 reproduction is represented by _{^{VJ = Σ M-1 i =}} 1 (Vi / m), B0 at the time of reproduction (i story number, M is The number of stories) The jump time Tjp is represented by TJP = ΣM ^-1 _i-1 [(Vi / m) / Jp].

Jp is the code amount that the playback device can jump per unit time. Here, Tp that the jump time to jump to the next cell is shorter than the reproduction time
If the condition of -Tr> TJP is added, [(V0 / m) / P
r]-[(V0 / m) / Rr]> Σ ^M-1 _{i = 1} [(Vi /
m) / Jp] (1) can be obtained, and the number m of divisions is set based on this equation (1).

The division points for obtaining the above-mentioned cells should be determined according to the data format so that the reproduced data will not be disturbed. Therefore, there is no need to mechanically strictly divide the image by satisfying only the above conditions. For example, in a video program having compressed video data, compressed audio data, compressed sub-video data, and the like in a time-division manner, a time-divided good division point should be a cell division point.
In addition, compressed video data, compressed audio data,
It contains compressed sub-picture data. Furthermore, M
In the case of the coded video data compressed by the PEG2 system, it is preferable to divide the data into groups of pictures having a reproduction time of about 0.4 to 0.5 s as a division unit.

The present invention is not limited to the above description, and various embodiments are possible and modifications are possible. The above description is an explanation of the basic principle of the present invention.

Further, if each of the above-mentioned cells is provided with its own identification number and the identification number of the cell to be continued next, it is convenient to handle during reproduction. Also, in order to handle cells, management information that sets the cell playback order, etc.,
Used in the control unit of the playback device. In addition, the cell may include an error correction code whose correction processing is completed in the cell in order to improve data reliability. Also,
7 and 8, the cells of each branch scene are time-division multiplexed in that the first to n-th scene cell blocks are sequentially and repeatedly arranged, and each scene cell block has a different branch cell. It is a block where cells from the scene are brought in and combined. In this case, the scene cell block may include an error correction code completed in the scene cell block.

In the present invention, when a plurality of branch scenes are divided into a plurality of cells, and the cells of each branch scene are arranged in a time-division multiplex manner, the following is roughly described.

That is, the actual reproduction time for reproducing the video in the reproduction cell of the reproduction cell read from the pickup of the reproduction device by the reproduction circuit is Tp, and the next cell following the reproduction cell is searched and read by the pickup. Assuming that the read time up to Ts is Ts, the plurality of cells are divided and time-division multiplexed and arranged so as to satisfy a condition of a relation of Tp> Ts. In this case, the playback time for video playback by the playback circuit of the playback device is determined by the capacity of the buffer memory for storing the playback signal and the data amount ×
The compression ratio and the read clock frequency are determined, and the read time is determined mainly as a response speed of the pickup.

In the optical disk, the recording state between the branch point and the connection point is such that a plurality of branch scenes are respectively divided into a plurality of cells, and one cell corresponds to a predetermined video reproduction time. In addition, cells of each branch scene are time-division multiplexed, and cells to be continuously reproduced are recorded in a form arranged within a distance of a predetermined code amount. Here, on the reproducing apparatus side, the time required for seeking a distance of a predetermined code amount is Ts, the data read code amount per unit time is Rr, and the maximum code amount digested for video reproduction per unit time is Pr. And Then, the relationship between Ts and the time Tc at which the playback device decodes one cell by the decoder to obtain a video playback output is set to have a relationship of Tc − [(Tc × Pr) / Rr]> Ts. I have.

FIG. 14 shows a configuration example of a reproducing apparatus for reproducing the information recording medium (optical disk) described above.

The disk 100 is a turntable 101
It is placed on the top and driven to rotate by a motor 102.
If the playback mode is set, the information recorded on the disc 100 is picked up by the pickup unit 103. The movement and tracking of the pickup unit 103 are controlled by a pickup drive unit 104. The output of the pickup unit 103 is
And demodulated. The demodulated data that has been demodulated here is input to the error correction unit 202, and after error correction, is input to the demultiplexer 203. The demultiplexer 203 separates and derives video information, caption and character information, audio information, control information, and the like. That is, the caption, character information (sub-picture), audio information, and the like are recorded on the disc 100 in correspondence with the video information. In this case, as subtitles and text information or audio information,
Various languages can be selected, which are selected under the control of the system control unit 204.

An operation input by the user is given to the system control unit 204 through the operation unit 205.

The video information separated by the demultiplexer 203 is input to a video decoder 206 and subjected to a decoding process corresponding to the type of the display device. For example, NTS
It is converted to C, PAL, SECAM, wide screen, and the like. The sub-pictures separated by the demultiplexer 203 are input to the sub-picture processing unit 207, and are decoded as subtitles and character images. Video decoder 2
The video signal decoded in 06 is input to the adder 208, where the subtitle and the character image (= sub-picture)
, And the added output is output to the output terminal 209. The audio information selected and separated by the demultiplexer 203 is input to the audio decoder 211, demodulated, and led out to the output terminal 212. In addition, the audio processing unit includes an audio decoder 213 in addition to the audio decoder 211, and can reproduce audio of another language and output it to the output terminal 214.

Here, a buffer memory 220 is provided at the subsequent stage of the error correction section 202, and the reproduction data is temporarily stored in the buffer memory 220 and supplied to the demultiplexer 203 according to the decoding speed. ing. In the normal continuous reproduction, the buffer memory 22
If the data amount of 0 overflows, the system control unit 204
Performs kickback processing. The kickback process is to reread data of a predetermined sector that has been read so far, and has a function of compensating for data loss even if data overflows in the buffer memory 220.

When an optical disc including a multi-story is reproduced, a multi-story selection is displayed as a menu on a monitor screen or a sub-display unit of the system as disc management information. The user can select a branch story in advance via the remote control operation unit 205 while viewing the menu.

When the selection information is given here, the system control unit 204 grasps the identification information of the branch story, so that the system control unit 204 extracts from the buffer memory 220 the data with the identification information added to the header, and demultiplexes the data.
Give to 3.

As described above, according to the present invention, when data of a plurality of stories and scenes is recorded on a recording medium, the physical movement distance of the pickup at the time of reproduction is small, and the reproduced video is interrupted or distorted. Can be suppressed.

Next, a system of an optical disk reproducing apparatus to which the present invention is applied will be specifically described.

First, what information is recorded on the optical disc as information related to the present invention will be described.

FIG. 15 shows a volume space of the optical disk 100. As shown in FIG. 15, the volume space includes a volume and file configuration zone, a DVD video zone, and other zones. UDF (Universal Disk Format Specif.)
ication Revision 1.02) A bridge configuration is described, and the data can be read by a computer of a predetermined standard. The DVD video zone includes a video manager (VMG), a video title set (VT)
S). The video manager (VMG) and the video title set (VTS) are each composed of a plurality of files. Video Manager (VMG)
This is information for controlling a video title set (VTS).

FIG. 16 shows a video manager (VM
G) and the structure of a video title set (VTS).

The video manager (VMG) includes video manager information (VMGI) as control data and a video object set (VMGM) as data for menu display. VOBS). Also, backup video manager information (VMG) having the same contents as the VMGI
I).

The video title set (VTS) includes video title set information (VTSI) as control data and a video object set (VTSM) as data for menu display. VOBS)
And a video object set (VTSTT) for a title of a video title set which is a video object set for displaying video. VOBS).
It also has backup video title set information (VTSI) having the same contents as the VMGI.

Further, a video object set for displaying images (VTSTT) VOBS) is composed of a plurality of cells. Each cell (Cel)
1) is assigned a cell ID number.

FIG. 17 hierarchically shows the relationship between the video object set (VOBS) and the cell (Cell) and the contents of the cell (Cell). DVD
When the playback processing is performed, video breaks (scene changes, angle changes, story changes, etc.) and special playback are performed in units of cells (Cells) or video object units (VOBs) that are lower layers.
U) units, and interleaved units (ILV
U).

Video Object Set (VOBS)
First, a plurality of video objects (VOBs) IDN
1 to VOB IDNi). Further, one video object includes a plurality of cells (C IDN1 ~
C IDNj). Further, one cell is composed of a plurality of video object units (VOBUs) or interleaved units described later. One video object unit (VOBU) is composed of one navigation pack (NV PCK), multiple audio packs (A
PCK), multiple video packs (V PCK), multiple sub-picture packs (SP PCK).

The navigation pack (NV PCK)
Are mainly used as control data for controlling the reproduction and display of data in the video object unit to which it belongs, and control data for performing data search of the video object unit.

The video pack (V PCK) is main video information and is compressed according to a standard such as MPEG. Sub picture pack (SP PCK) is sub-picture information having auxiliary contents with respect to the main picture. Audio Pack (A PCK) is audio information.

FIG. 18 shows a program chain (PG
C) shows an example in which the reproduction order of the above cells (Cells) is controlled.

As a program chain (PGC),
Various program chains (PGC # 1, PG # 1) are set so that the reproduction order of the data cells can be variously set.
C # 2, PGC # 3...) Are prepared. Therefore, the order of cell reproduction is set by selecting a program chain.

Program chain information
(PGCI) program # 1 to program
An example in which the program #n is executed is shown. Professional shown
Grams are stored in the Video Object Set (VOBS).
(VOB IDN #s, C IDN # 1)
The contents after the cell are specified in order.

The program chain is recorded in the management information recording section of the optical disc, is read prior to reading the video title set of the optical disc, and is stored in the memory of the system control section. Management information
It is arranged at the head of the video manager and each video title set.

FIG. 19 shows the relationship between the video object unit (VOBU) and the video packs in this unit. Video data in a VOBU is composed of one or more GOPs. The encoded video data conforms to, for example, ISO / IEC13818-2. A VOBU GOP is composed of an I picture and a B picture, and this data sequence is divided into a video pack.

Next, a data unit when the multi-angle information is recorded and reproduced will be described. When a plurality of scenes having different viewpoints with respect to a subject are recorded on a disc, an interleaved block is constructed on a recording track to realize seamless reproduction. In the interleave block portion, a plurality of video objects (VOBs) having different angles are respectively divided into a plurality of interleave units. As described above, the data is arranged and recorded so that seamless reproduction is possible.

In the above description, multiplexing a plurality of stories by time division has been described. In the description, all the divided blocks are also called cells. However, hereafter, especially interleaved blocks will be referred to as interleave units.

FIG. 20 shows an example of the arrangement of interleaved blocks. This example shows an example in which 1 to m video objects (VOBs) are each divided into n interleaved units and arranged. Each video object (VOB) is divided into the same number of interleave units. Therefore, it corresponds to the example of FIG. 7 described above.

In FIG. 21, for example, video objects of two (VOB) scenes, that is, angle 1 and angle 2 scenes each have three interleave units (ILV
U1-1 to ILVU3-1) (ILVU1-2 to ILV)
U3-2) shows a recording state arranged on one track and, for example, a reproduction output example when the angle 1 is reproduced. In this case, the information of Angle 2 is not captured.

FIG. 22 shows a simplified version of the reproducing apparatus shown in FIG. When the above-described jump reproduction is performed, it is necessary to supply data to the decoder 206 so that the data is not interrupted. For this purpose, a track buffer 220 is provided. Vr is the transfer rate of the data supplied from the error correction processing unit 220 to the track buffer 220, and Vo is the track buffer 22
The transfer rate of data supplied from 0 to the decoder. Reading data from the disk is performed for each error correction block. One error correction block corresponds to 16 sectors.

FIG. 23 shows the worst case where the increase and decrease of the data input to the buffer 220 when the interleaved block is reproduced. At this time, the jump of the interleave unit on the recording track and the reading and reproduction processing of the interleave unit data of the jump destination are executed.

In the figure, Vr is the track buffer 22.
0 is the transfer rate of the data supplied from the error correction processing unit 220, and Vo is the track buffer 22
The transfer rate of data supplied from 0 to the decoder.

Tj is a jump time, and includes a time for seeking a track and a necessary time (latency time latency time) associated therewith. b is the data size of one ECC block (for example, 162144)
And Te is the time required to read one ECC block into the buffer. Bx is the amount of data remaining in the buffer 220 when the jump is started (time t4).

The data amount curve shown in FIG.
This indicates that data is accumulated in the buffer 220 at an accumulation rate of (Vr−Vo) from the inclination. The curve indicates that the data amount of the buffer has become zero at time t6. The data in this buffer decreases at a rate of decrease of the slope -Vo from time t3, and becomes zero at time t6.

What can be understood from this curve is as follows. That is, the condition under which data is continuously output from the buffer 220, that is, the condition under which data is supplied to the decoder without interruption, is Bx ≧ Vo (Tj + 3Te) (2).

The size (ILVU SZ) of the interleave unit is as follows: ILVU SZ ≧ {(Tj × Vr × 10 ⁶ + 2b) / (2048 × 8)} × Vo / (Vr−Vo) (sector) (3) Condition can be derived.

This equation is equivalent to the equation (1) except that the number m of the interve units is removed.

That is, [(V0 / m) / Pr]-[(V0 / m) / Rr]> Σ ^M-1 _{i = 1} (Vi / m) / Jp] (1) (V0 / m) corresponds to the size of the interleave unit, Pr corresponds to Vo, and Rr corresponds to Vr.

The right side of the equation (1) is a jump time, and in the equation (3), the number of sectors corresponding to the jump time is strictly defined as {(Tj × Vr × 10 ⁶ + 2b) / (2048 × 8)}. Is represented in

The equation (1) is modified so as to approach the equation (3).

(V0 / m) as unit size
If Z is set, Pr = Vo, Rr = Vr, and the right side of the equation (1) is set to Tjp, the following modification can be made.

[0110] Can be obtained.

The expression (4) is a form in which the dimension is represented by the data amount, and the elements of 10 ⁶ and 1 / (2048 × 8) in the expression (3) are omitted. Tjp corresponds to Tj + 2b.

Next, let us consider how much capacity is required as the buffer memory. It is desirable that the capacity of the buffer memory is such that even if the playback device performs a kickback operation and then jumps the interleave unit, the memory output data is not interrupted.
Kickback is a state in which the pickup is waiting for reading during one rotation of the disk, and seeks the reading position to an adjacent track after one rotation of the disk.

FIG. 24 shows the time when the kickback operation is performed in the playback device and subsequently the maximum jump operation is performed, and the data reduction status in the buffer memory.

Bm is the size of the track buffer Tk is the kickback time (corresponding to one rotation time of the disk) Te is the read time of one ECC block (24 msec) Tj is the jump time = track seek time (tj) + latency time (= Tk) MAX Vo is the maximum read rate of the ILVU. Using the above-mentioned requirements, the capacity of the buffer memory for compensating for the continuation of data when the kickback operation is performed in the playback device and then the maximum jump operation is performed. When calculated, Bm ≧ {(2Tk + tj + 4Te) × MAX Vo × 1
0 ⁶ } / (2048 × 8). Bm is a sector, Tk, t
The unit of each of j and Te is [sec], and MAX The unit of Vo is [Mbps].

As described above, the required track buffer size depends on Tk, tj, and Te of the reproducing apparatus.
Depends on the performance of the seek operation. Tk and Te depend on the rotation speed of the disk. FIG. 25 shows a design example of the minimum capacity (Bm) of the track buffer, the kickback and seek times, the jump distance, and the amount of output data from the track buffer per unit time of the playback device for playing back the digital video disk. Is shown.

Next, the above-mentioned interleave unit and management information for reproducing the interleave unit will be described.

FIG. 26 shows a video title set (VT
S) shows a video title set information (VTSI). Video title set program chain information table (VTS) in video title set information (VTSI) PGCIT) is described. Therefore, when a video object set (VOBS) in one video title set (VTS) is played,
This video title set program chain information table (VTS A program chain specified by the creator or selected by the user from a plurality of program chains presented in the PGCIT) is used.

The following data is described in the VTSI.

VTSI MAT: a management table of video title set information, which describes what information exists in the video title set, and describes a start address and an end address of each information.

VTS PTT SRPT: Video title set Part of title search pointer table, in which title entry points and the like are described.

VTSM PGCI UT: video title set menu program This is a chain information unit table, in which menus of video title sets described in various languages are described. Therefore, it is possible to confirm from the menu what kind of video title set is described, and what kind of style of playback order is described.

VTS TMAPT: a video title set time map table, in which information on the recording position of each VOBU, which is managed in each program chain and specified at a certain fixed interval, is described.

VTSM C ADT: Video title set menu cell address table, in which start and end addresses of cells constituting the video title set menu are described.

VTSM VOBU ADMAP... Video title set menu video object unit address map, in which the start address of the menu video object unit is described.

VTS C ADT: Video title set cell address table, and this map describes cell address information.

In the reproducing apparatus, when a program chain is selected, the reproduction order of the cells is set by the program chain. For playback, the NV included in the video object unit is used. PCK is referenced.

NV The PCK has information for controlling display contents and display timing, and information for data search. Therefore, this NV V based on the information in the PCK table The PCK is taken out and decoded. In addition, other packs are taken out and decoded. In this case, the language A specified by the creator or user is used. PCK, SP The removal of the PCK is performed.

FIG. 27 shows a video title set program chain information table (VTS). P
GCIT). This table contains video title set PGCI table information (VTS P
GCTITI), video title set program chain information search pointer (VTS PG
CI SRP # 1 to #n), specific program chain information (VTS PGCI) is described.

(VTS PGCITI) describes the number of search pointers and the end address of this table.

(VTS PGCI SRP # 1 to #n)
The categories of the video title set program chain include the number of titles of the target video title set, and whether the program chain is completed in one block or follows the chain of another block. It has been described. The start address of the video title set program chain is described as a relative address from the start position of this table.

FIG. 28 shows program chain information (P
GCI) is described.

PGCI is a program chain general information (PGCI) GI), program chain command table (PGC) CMDT), Program Chain Program Map (PGC) PGMAP), cell playback information (C PBI), cell position information table (C PO
SIT).

PGCI The GI describes the number of programs and the number of cells that are targets of this program chain (this information is stored in the PGC content (PGC content). CNT)). In addition, all reproduction times to be subjected to this program chain are indicated (this information is a PGC reproduction time (PGC reproduction time). PB TM)). Also, the program played by this program chain is
A code indicating whether user operation is permitted, for example, whether angle switching is possible is described (this information is based on PGC user operation control (PGC UPR
CTL)). Furthermore, whether the audio stream can be switched and what kind of audio stream (for example, linear PCM, AC-3, MP
EG, etc.) is also described (this information is stored in a PGC audio stream control table (PGC AST CTLT)). Also described is a code indicating whether the sub-pictures can be switched and what kind of sub-pictures (for example, different aspect ratios) can be switched to (this information is stored in the PGC sub-picture stream control table (PGC).
SPST CTLT)).

Further, this PGCI The GI also describes the number of the next program chain and the number of the preceding program chain. Also, whether the target program of this program chain is for continuous playback,
Whether it is for random playback or shuffle is also described (this information is based on PGC navigation control (PGC NV CTL)). Furthermore, a color is specified for what color the sub-picture should be displayed (this information is stored in a PGC sub-picture palette (PGC).
SP PLT)).

The program chain command table
Start address (PGC CMDT SA)
Start address of the program map of the program chain
(PGC PGMAP SA), cell playback information table
Start address (C PBIT SA), cell position
Start address of information (C POSI SA) described
Have been.

In the program chain command table, pre-commands, post-commands, and cell commands of the program chain are described. The pre-command is a command to be processed before the program chain is executed, and the post-command is a command to be processed after the program chain is executed. Pre-commands and post-commands are used to define the playback status and playback stream of video titles and audio based on commands and parameters prearranged by the player and the creator of the disc. The cell command is a command to be processed subsequently after the cell has been subjected to the reproduction processing.

The start address (PGC) of the program map of the program chain PGMAP) indicates the configuration of a program to be subjected to the program chain, and describes the entry cell number of the existing program.

The cell reproduction information table (C (PBIT) describes information indicating the reproduction order of cells to be subjected to the program chain.

FIG. 29 shows cell playback information (C PBI
T) and the contents of the cell playback information. C CAT
Is cell attribute information, and indicates a mode of a cell block. The mode of the cell block indicates whether it is the first cell or the last cell.
In addition, information on whether playback is seamless,
Whether it belongs to the interleaved block,
Information on seamless angle switching is also included. Information on seamless angle switching indicates whether angle switching can be performed seamlessly or non-seamlessly.

C PBTM indicates the cell playback time
C FVOBU SA is the first video of the cell
Start address of object unit (VOBU)
S, C ILVU EA is the first interleaver of the cell
End unit (ILVU) end address, C FV
OBU SA is the last video object in the cell
Unit (VOBU) start address, C FVO
BU EA is the last video object user in the cell.
The end address of the unit (VOBU) is shown. Up
This address is the first argument of the VOBS to which the cell belongs.
It is described by the logical block number relative to the logical block.

By referring to this cell reproduction information,
It can be determined whether the current playback state is the end of the cell. When reproducing the next cell, the next VOB of the next cell (or interleave unit) is referred to by referring to the next cell reproduction information in the cell reproduction information table.
The start address of U will be determined.

FIG. 30 shows a cell position information table (C P
SIT). As cell location information,
ID number of the video object containing the cell (C
VOB IDN) and the cell ID number (C
IDN).

As described above, the management information describes the cell reproduction information, which includes the attribute information of the cell, and indicates whether or not an interleave unit such as a multi-angle is recorded.

When a multi-angle video or a multi-story video is recorded in this way, the playback device switches the angle being played back or switches the story being played back in response to a user operation. There is a need. In that case, the playback device responds to the user's operation based on the information described below. First, the configuration of the pack will be described.

FIG. 31 shows a configuration example of one pack and one packet. One pack includes a pack header and a packet. A pack start code, a system clock reference (SCR), and the like are described in the pack header. The pack start code is a code indicating the start of a pack, and the system clock reference (SCR) is information indicating the location of the entire playback apparatus in the elapsed playback time. The length of one pack is 2048
A byte is defined and recorded as one logical block on the optical disk.

One packet is composed of a packet header and video data, audio data, sub-picture data, or navigation data. The packet header of the packet may be provided with stuffing. Padding may be provided in the data portion of the packet.

Referring to FIG. PCK (see Fig. 17)
Is shown.

NV The PCK basically has a picture control information (PCI) pack for controlling a display image and a data search information (DSI) pack existing in the same video object. Each pack is described with a pack header and a substream ID, followed by data. A stream ID is described in each pack header, and the NV PCK, indicating that the substream I
D identifies PCI and DSI. In each pack header, a packet start code, a stream ID, and a packet length are described, followed by each data.

The PCI packet is navigation data for changing the display content in synchronization with the reproduction of the video data in the video object unit (VOBU) to which the NV packet belongs.

[0150] The PCI packet includes PC which is general information.
I General Information (PCI GI),
Non-seamless angle information (NSML
ANGLI) and highlight information (HL)
I) and recording information that is recorded information
(RECI) is described.

[0151] PCI The GI has a general description of this PCI.
It is information and the following information is described. This na
Logical block number that is the address of the navigation pack
Bar (NV PCK LBN), managed by this PCI
Indicates the attributes of the video object unit (VOBU)
Video object unit category (VOBU C
AT), a video object unit managed by this PCI.
It is user operation prohibition information during the display period of the knit.
User operation control (VOBU UOP
CTL), start display of video object unit
Is time (VOBU S PTM), video objects
Is the end time of the display of the project unit (VOBU E
PTM). VOBU S Specified by PTM
The first video is an I-picture in the MPEG standard.
It is. Furthermore, the video object unit
Video object unit indicating the display time of the last video
Sequence end presentation time
(VOBU SE E PTM) or the first video in the cell
Cell Elap indicating elapsed elapsed time from off-frame
Time (C ElTM) and the like are also described.

Also, NSML ANGLI indicates the address of the destination at the time of an angle change. That is, the video object unit also has images captured from different angles. Then, when the user specifies to display an image at an angle different from the currently displayed angle, the address of the VOBU to be shifted to the next reproduction is described.

The HLI is information for designating a specific area in the screen in a rectangular shape and changing the brightness of this area, the color of the sub-picture displayed here, and the like. This information includes the Highlights General Information (HL G
I) A button color information table (BTN) for allowing the user to select a button for color selection COLIT), and a button information table (BTNIT) for the selection button.

The RECI is information on video, audio, and sub-picture recorded in the video object unit, and describes what data is to be decoded. For example, the information includes a country code, a copyright holder code, and a recording date.

A DSI packet is navigation data for executing a search for a video object unit.

The DSI packet contains the general information DS.
I General Information (DSI GI) and Seamless Playback Information (SML) PBI), Seamless Angle Information (SML) AGLI),
Video Object Unit Search Information (VOBU SRI), synchronization information (SYNCI), and the like.

As shown in FIG. The GI describes the following information.

NV Indicates the PCK decoding start reference time
NV which is the system clock reference PCK
SCR, NV Indicates the PCK logical address (NV P
CK LBN), this NV Video object to which PCK belongs
Indicates the end address of the project unit (VOBU E
A) is described. Furthermore, decode first
Of the first reference picture (I-picture) for
Address (VOBU 1STREF EA) First deco
Second reference picture (P picture) for loading
End address (VOBU) 2NDREF EA)
A third reference picture (B picture) for decoding first
Char) end address (VOBU) 3RDREF E
A) is described. Furthermore, this DSI belongs to
ID number of the VOB (VOBU VOB IDN)
ID number (VOBU) of the cell to which this DSI belongs C
IDN), relative to the first video frame in the cell
Cell Elapse Time (C ElTM)
Is also described.

As shown in FIG. The following information is described in the PBI.

The VOBU to which this DSI belongs is
Unit (ILVU) or video
Pre-unit (PR
EU) video object unit sea
Muress category (VOBU SML CAT).
Also indicates the end address of the interleaved unit
(ILVU EA) of the next interleaved unit
Indicates the start address (ILVU SA) Next Inter
Indicates the size of the left unit (ILVU SZ), bi
Video display start time in video object (VOB)
(VOB V S PTM), video objects
(VOB) indicates the video display end time (VOB).
OB V E PTM), Video Object (VO)
B) indicates the audio stop time in (VOB) A
STP PTM), within Video Object (VOB)
Indicates the audio gap length (VOB A GAP
LEN).

The pre-unit (PREU) is the last unit of the BOVU immediately before the interleave unit.

The above video object unit seam
Less category (VOBU SML CAT)
The interleave unit is
Flag indicating whether or not it is a knit,
A flag that indicates whether the unit is a unit
Have been.

FIG. 35 shows the seamless angle information (SM
L AGLI). C1 to C9 indicate the number of angles, and can indicate the address and size of the destination interleave unit even when information of up to nine angles exists. That is, the address and size (SML) of the next interleaving unit to be shifted in each angle AGL Cn DSTA) (n = 1 to
9) is described. If an angle change operation is performed by the user during viewing, this information is referred to,
The playback device can recognize the playback position of the next interleave unit.

FIG. 36 shows VOBU search information (VOBU).
SRI), and is referred to during special reproduction.

This information describes the start address of the VOBU that is (0.5 × n) seconds before and after the start time of the current video object unit (VOBU). That is, the start addresses of VOBUs from +1 to +20, +60, +120 and +240 as forward addresses (FWDINn) and the flag indicating that a video pack exists in the unit are described as forward addresses (FWDINn) based on the VOBU including the DSI. Have been.
The start address is described by the number of logical sectors relative to the first logical sector of the VOBU. By using this information, the VOBU to be reproduced can be freely selected.

FIG. 37 shows synchronization information. The synchronization information describes the address of the target audio pack to be synchronized and the VOBU start address of the target sub-picture pack to be synchronized.

The management information as described above is described on the optical disk. The system control unit of the playback device acquires cell playback information by referring to the program chain information of the video manager. Then, by referring to the attribute information of the cell, it is recognized whether or not an interleave unit block for multi-angle is recorded. If an interleave unit block for a multi-angle is recorded, NV PAC seamless playback information and seamless angle information are obtained and stored in the buffer memory. When angle switching information is input by a user operation, the seamless angle information is referred to. By this reference, the reproduction of the interleave unit at the angle desired by the user is started. After that, the acquired NV
With reference to the seamless cell reproduction information included in the PAC, an interleave unit to be reproduced next is recognized. By referring to the cell reproduction information, it is possible to determine whether the current reproduction state is the end of the cell. When reproducing the next cell, the start address of the first VOBU of the next cell (or interleave unit) is determined by referring to the next cell reproduction information in the cell reproduction information table.

[0168] The system control unit 204 of the playback apparatus shown in FIG. 14 processes the various types of management information, program chains, navigation packs, and other data as described above, and processes the operation input from the remote control operation unit 205. Means are provided for performing the operations. Therefore, cell attribute information,
It detects cell reproduction sequence information and branch scene switching information (angle information and the like). Then, in response to the operation input, the stream of the interleave unit to be reproduced is determined by referring to the information stored in the detecting means. In this case, the pickup unit 10
3 controls the tracking control unit and the error correction unit 20.
2 by controlling the data capture timing,
Kickback and jump processing are realized.

[0169]

The present invention is applicable to the manufacture and sale of optical discs in multimedia, and the manufacture and sale of recording / reproducing devices for optical discs. When recording data of multiple stories and scenes on a recording medium,
The physical movement distance of the pickup at the time of reproduction can be reduced, and it is possible to suppress occurrence of discontinuity or disturbance of the reproduced image.

[Brief description of the drawings]

FIG. 1 is an explanatory diagram illustrating an embodiment of an information recording medium and a recording method according to the present invention.

FIG. 2 is an explanatory diagram for explaining an example of cell arrangement and an example of a reproduction order in FIG. 1;

FIG. 3 is an explanatory diagram for explaining another embodiment of the information recording medium and the recording method of the present invention.

FIG. 4 is an explanatory diagram for explaining a connection destination of the cells in FIG. 3 and a specific arrangement example of the cells.

FIG. 5 is an explanatory diagram for explaining an example of a cell arrangement algorithm in FIG. 3;

FIG. 6 is an explanatory diagram for explaining an example of reproducing an array cell as shown in FIG. 3;

FIG. 7 is an explanatory diagram for explaining still another embodiment of the information recording medium and the recording method according to the present invention, and a diagram showing an arrangement example when cells are arranged on a track;

FIG. 8 is an explanatory diagram for explaining still another embodiment of the information recording medium and the recording method according to the present invention, and a diagram showing an arrangement example when cells are arranged on a track.

FIG. 9 is an explanatory diagram for explaining another embodiment of the information recording medium and the recording method according to the present invention, and a diagram showing an arrangement example when cells are arranged on a track.

FIG. 10 is an explanatory diagram for explaining still another embodiment of the information recording medium and the recording method of the present invention.

FIG. 11 is an explanatory diagram for explaining still another embodiment of the information recording medium and the recording method of the present invention.

FIG. 12 is an explanatory diagram for explaining an example of the arrangement of cells in FIG. 11;

FIG. 13 is an explanatory diagram for further explaining a dividing method when a multi-story is recorded on a recording medium of the present invention.

FIG. 14 is a diagram showing an example of a reproducing apparatus for reproducing a recording medium of the present invention.

FIG. 15 is an explanatory diagram showing a volume space of an optical disc to which the present invention is applied.

FIG. 16 is an explanatory diagram showing the structures of a video manager (VMG) and a video title set (VTS) in more detail.

FIG. 17 is an explanatory diagram hierarchically showing a relationship between a video object set (VOBS) and a cell and the contents of the cell.

FIG. 18 is an explanatory diagram showing an example in which the reproduction order of cells is controlled by a program chain (PGC).

FIG. 19 is a video object unit (VOBU).
FIG. 3 is an explanatory diagram showing the relationship between the video packs in the unit.

FIG. 20 is an explanatory diagram showing an example in which interleaved blocks are arranged.

FIG. 21 is a diagram showing three interleaved units (ILVU1-1 to ILVU3-1) (ILVU1-2) of video objects of scenes at angles 1 and 2 respectively.
FIG. 3 is an explanatory diagram showing an example of a recording state divided into one to an ILVU3-2) and arranged on one track, and an example of a reproduction output when the angle 1 is reproduced.

FIG. 22 is an explanatory diagram showing a simplified version of the optical disk reproducing apparatus shown in FIG. 14;

FIG. 23 is an explanatory diagram showing the worst case where the increase and decrease of data input to the track buffer when an interleaved block is reproduced is worst.

FIG. 24 is an explanatory diagram showing a time when a kickback operation is performed in the playback device and subsequently a maximum jump operation is performed, and a reduction state of data in the buffer memory.

FIG. 25 shows a minimum track buffer capacity (B
m), an illustration of a design example of kickback and seek times, jump distances, and the amount of data output from the track buffer per unit time.

FIG. 26 is an explanatory diagram showing a video title set information (VTSI) in a video title set (VTS).

FIG. 27 shows a video title set program chain information table (VTS). Explanatory drawing showing the contents of (PGCIT).

FIG. 28 is an explanatory diagram showing a configuration of program chain information (PGCI).

FIG. 29 shows cell playback information (C FIG. 3 is an explanatory diagram showing the contents of (PBIT) and cell reproduction information.

FIG. 30 is an explanatory diagram showing contents of a cell position information table (C PSIT).

FIG. 31 is an explanatory diagram showing a configuration example of one pack and a packet recorded on an optical disc.

FIG. 32. NV Explanatory drawing which takes out and shows PCK.

FIG. 33: Data search general information (DSI The figure which shows the information described in GI).

FIG. 34: Seamless playback information (SML) FIG. 2 is a diagram showing information described in (PBI).

FIG. 35: Seamless angle information (SML AGL
The figure which shows the content of I).

FIG. 36 shows VOBU search information (VOBU) SRI)
FIG.

FIG. 37 is a view showing synchronization information.

[Explanation of symbols]

 Reference Signs List 100 optical disc 101 turntable 102 motor 103 pickup unit 104 pickup drive unit 201 demodulation unit 202 error correction unit 203 demultiplexer 204 system control unit 205 remote control operation unit 206 video decoder 207 sub-picture Processing unit 2121313 Audio decoder 220 Buffer memory.

──────────────────────────────────────────────────続 き Continued on the front page (51) Int.Cl. ⁶ Identification code FIG11B 27/10 A (72) Inventor Tadashi Kojima 70, Yanagimachi, Saiwai-ku, Kawasaki-shi, Kanagawa Pref. Toshiba Yanagimachi Plant (56) Reference Document JP-A-9-161403 (JP, A) WO 95/12275 (WO, A1) WO 95/12197 (WO, A1) (58) Fields investigated (Int. Cl. ⁶ , DB name) G11B 27 / 00 G11B 27/10 G11B 20/12

Claims (10)

(57) [Claims] 1. A video program, comprising: a recording track
A multi scene with multiple selectable scenes
The plurality of programs to be recorded on a recording medium.
Branch scenesInterleave unitTo
Divide and branch each sceneInterleave unit
When physically mixing and arranging on a rack,
-The next unit of each branch scene is
The logical address data of the leave unit and the next interface
Navigation panel containing information on the size of the leave unit
Is included,  The plurality of branch scenes are described in the order of B0, B1,.
B2, ..., Bi, ..., and the code amount of Bi (arbitrary) is Vi (arbitrary),
The read rate of the playback device is Rr, and the playback device is
The maximum playback rate per unit time
Pr, the code amount that can be jumped per unit time is Jp,
Time-division multiplexed interleave unit of the shortest branch scene B0
Interleave unit of other branch scenes between knits
If the number is M-1, the shortest branch scene B0 is interleaved
The jump time TJP between units isThe shortest unit interleave unit of the shortest branch scene B0
The reproduction time Tp is (V0 / m) / Pr. Reading of the unit interleave unit of the shortest branch scene B0.
The take-up time Tr is (V0 / m) / Rr, and is shorter than the playback time by the next interleave unit.
Tp-Tr that jump time is short when jumping with
> TJP conditionCan be obtained, and based on this equation (1),
An information recording method, wherein m is set.
Law. 2. If there is no m that satisfies the expression (1), a part of a trunk scene for a branch is added to each branch scene to create a plurality of corrected branch scenes. The corrected plurality of branch scenes are referred to as B0, B1,
2. The information recording method according to claim 1, wherein a new m satisfying the expression (1) is obtained as B2,..., Bi,. 3. In order to record a multi-scene program in which a plurality of arbitrarily selectable scenes are present on a recording track on a recording medium, said plurality of branch scenes are each composed of m interleave units. At the beginning of the interleave unit
Address data of the next interleaved unit
And information on the size of the next interleaved unit
In a device that includes a navigation pack and physically interleaves the interleaved units of each branch scene on a track, the means for setting the number of divisions m includes the plurality of branch scenes in B0, B1,
B2,..., Bi,... Further, the code amount of the Bi (arbitrary) is Vi (arbitrary), the reading rate of the reproducing apparatus is Rr, and the maximum reproducing rate per unit time at which the reproducing apparatus reproduces a branch scene in video. Is Pr, the code amount that can be jumped per unit time is Jp,
Assuming that the number of interleave units of the other branch scenes between the time-division multiplexed interleave units of the shortest branch scene B0 is M-1, the jump time TJP between the interleave units of the shortest branch scene B0 is The shortest playback time Tp of the unit interleave unit of the shortest branch scene B0 is (V0 / m) / Pr The read time Tr of the unit interleave unit of the shortest branch scene B0 is (V0 / m) / Rr. Tp-Tr with short jump time to jump to interleave unit
> TJP condition Where m is set as the number of divisions based on the equation (1). 4. A means for setting the number of divisions m, wherein when there is no m that satisfies the expression (1), a part of a trunk scene for a branch is added to each branch scene,
A plurality of modified branch scenes are created, and the modified plurality of branch scenes are set to B0, B1, B2,..., Bi,... To obtain a new m that satisfies the above equation (1). 4. The information recording apparatus according to claim 3, wherein the information recording apparatus is a means for performing the following. 5. The information recording method according to claim 1, wherein said interleave unit includes an error correction code. 6. The information recording method according to claim 1, wherein the plurality of scenes are multi-angle scenes of the same object photographed from different angles. 7. The information recording method according to claim 1, wherein said plurality of scenes are images on the same time axis. The information recording method according to claim 1, wherein 8. An information recording apparatus according to claim 3, wherein said interleave unit includes an error correction code. 9. The information recording apparatus according to claim 3, wherein said plurality of scenes are multi-angle scenes of the same object photographed from different angles. 10. The information recording apparatus according to claim 3, wherein said plurality of scenes are images on the same time axis.