Recording medium and reproducing apparatus thereof

Abstract: In a PVD table of a management region on the disc, a disc identifier 1 that represents the type of the data recording format of the disc, a number-of-disc-sides identifier 2 that represents whether the disc is a single-sided disc or a double-sided disc, and a disc side identifier 3 that represents whether the reproducing disc is side A or side B of a double-sided disc. A disc identifier 4 that represents the type of the data recording format of the file is recorded in a file (n) table including management information of the file. The reproducing apparatus reads the disc identifiers 1 and 4 from the PVD table and the file (n) table and determines whether or not the disc and the file are reproducible. In addition, the reproducing apparatus reads the number-of-disc-sides identifier 2 from the PVD table and determines whether or not the disc is a double-sided disc or a single-sided disc. When the disc is a double-sided disc, the reproducing apparatus determines whether the reproducing side is side A or side B.

Description: The present invention relates to a recording medium such as an optical disc and a reproducing apparatus thereof. Generally, management information is recorded on an optical disc. The management information manages data (files) recorded on the optical disc. As a representative example, management information defined as ISO-9660 standard is known. The management information includes at least ID information and the size of each disc, the number and reproducing order of discs that correlate, and the ID information, the record position, and the size of each file recorded on the disc as structural elements. However, in recent years, discs that have the management information corresponding to the ISO-9660 standard are categorized as various types such as specific discs, single-sided discs, and double-sided discs. However, the conventional management information does not include information that distinguishes such disc types. The management information is especially important for system operation. In other words, if the management information is damaged, the entire information on the disc will be lost. To prevent such a trouble, the same management information is recorded in another region as a spare. To further improve the safety of the management information, as shown in Fig. 40, the spare management information is multiplexedly recorded at multiple regions on the disc. However, in this case, the spare management information is multiplexedly recorded at a different record position. Thus, each information should have a different value that represents the position thereof. Thus, as the number of regions of the spare management information is increased, the work load of the disc provider increases. Moreover, in recent years, as the storage capacity of optical discs increases, discs that record a plurality of stories with slightly different contents and that reproduce any story selected by the user are known. However, in this case, since the same data for each story is multiplexedly recorded, the efficiency of the disc storage capacity is remarkably low. European patent specification number 0 459 157 discloses a method and apparatus for playing back a recording medium automatically to read and reproduce only a particular one of a number of media data or only a particular sequence of media data in a predetermined sequence. A plurality of playback sequences are recorded in the recording medium and a code is set in the apparatus for playing back the recording medium which identifies a particular one of the playback sequences. A playback control section is provided which reads the particular playback sequence out of the recording medium and sequentially reading a string of media data out of the recording medium, and then reproduces the string of media data in the particular playback sequence. EP-A-0 424 903 in which the two-part form of the claims is based discloses a recording medium (e.g. a CD-ROM) on which is recorded a data file and an index file. The data file contains data, such as compressed audio and video data, which is recorded in three hierarchical stages: titles, scenes and shots. The index file is an index containing, among other things, data representative of the position of each title, scene or shot relative to a particular bit (more specifically, th leading end). The data contained in the index file is arranged in the same three hierarchical stages as the data contained in the data file, thereby providing a convenient search facility for the data file. A first object of the present invention is to provide a recording medium and a reproducing apparatus thereof that can determine the types of a recording medium and individual files corresponding to a data record format. A second object of the present invention is to provide a recording medium and a reproducing apparatus thereof that determine the number of recording sides and a recording surface thereof. A third object of the present invention is to provide a recording medium that does not need to change values that represent positions of regions of spare management information multiplexedly recorded. A fourth object of the present invention is to provide a recording medium and a recording medium reproducing apparatus that does not need to multiplexedly record the same data. A first aspect of the present invention is a recording medium as claimed in claim 1. A second aspect of the present invention is a reproducing apparatus as claimed in claim 4. A third aspect of the present invention is a reproducing apparatus as claimed in claim 5. Thus, according to the present invention, the same program cell can be shared with a plurality of program chains. Consequently, the same data can be prevented from being redundantly recorded. As a result, the efficiency of the recording capacity of the recording medium can be maximally improved. These and other objects, features and advantages of the present invention will become more apparent in light of the following detailed description of a best mode embodiment thereof, as illustrated in the accompanying drawings. Fig. 1 is a schematic diagram showing a data structure of an optical disc according to an embodiment of the present invention; Fig. 2 is an example of PVD table; Fig. 3 is an example of VTD table; Fig. 4 is an example of L type PT table; Fig. 5 is an example of M type PT table; Fig. 6 is an example of DR(00) table; Fig. 7 is an example of DR(01) table; Fig. 8 is an example of file (n) table; Fig. 9 is a block diagram showing a construction of an optical disc reproducing apparatus that reproduces data from the disc shown in Fig. 1; Fig. 14 is a schematic diagram showing disc management information multiplexedly written to a read-in region; Fig. 15 is a schematic diagram showing a data structure of a file; Fig. 16 is an example of a file management table; Fig. 17 is an example of a chain information table; Fig. 18 is an example of a chain information table; Fig. 19 is an example of a cell information table; Fig. 20 is an example of a DAT; Fig. 21 is a flow chart showing a program chain selecting process; Fig. 22 is a schematic diagram showing an example of file relocation; Fig. 23 is an example of tables showing branch information of three program chains; Fig. 24 is an example of tables showing chain control information of three program chains; Fig. 25 is a schematic diagram showing a reproducing process of three chain programs; Fig. 26 is a table showing control information of a program chain; Fig. 27 is a flow chart showing a successive reproducing process of program cells; Fig. 28 is a schematic diagram showing a real example of a successive reproducing process of program cells; Fig. 29 is a table showing an example of control information of program chains including multiple angles; Fig. 30 is a flow chart showing a reproduction control process of multiple angles; Fig. 31 is a schematic diagram showing a real example of a reproducing process of multiple angles; Next, with reference to the accompanying drawings, an embodiment of the present invention will be described. Fig. 1 a schematic diagram showing a data structure of an optical disc according to an embodiment of the present invention. The data structure of the disc is based on ISO-9660 standard. The record space of the disc is divided into a read-in region, a management region, a data region, and a read-out region. The management region includes a system area, a PVD (Primary Volume Descriptor) table, a VTD (Volume Terminate Descriptor) table, a PT (Path Table), and a DR (Directory Record). The data region is composed of a plurality of files. As shown in Fig. 2, in the PVD table of the management region, information of the disc (volume) such as the size of the volume, the attribute of the volume, the position of the route DR, and the position of the PT is written. The content of the VTD table is defined as shown in Fig. 3. In the PT (L type PT or M type PT), as shown in Figs. 4 and 5, hierarchical structures between DRs are written. The DR is a table group that are composed of a route DR (00) table, a route DR (01) table, and a file (n) table. In the route DR (00) table and the route DR (01) table, as shown in Figs. 6 and 7, the positions thereof are written. The file (n) table is provided for each file in the data region. As shown in Fig. 8, in the file (n) table, the position of the file and so forth are written. As shown in Fig. 2, the PVD table is provided with an application system region. In the application system region, a disc identifier 1, a number-of-disc-sides identifier 2, a disc side identifier 3, and so forth are recorded. The disc identifier 1 represents the type of the data recording format of the disc. The number-of-disc-sides identifier 2 represents whether the disc is a double-sided disc or a single-sided disc. The disc side identifier 3 represents whether side A or side B of a double-sided disc is being reproduced. In the PVD table, the value of the BP represents the byte position from the top of the table. As shown in Fig. 8, the file (n) table corresponding to each file is provided with an application system region. In the application system region, information (disc identifier) 4 and so forth are recorded. The disc identifier 4 represents the type of the data recording format of the file. Fig. 9 is a schematic diagram showing a construction of an optical disc reproducing apparatus that reproduces data from a disc that has the above-described data structure. In Fig. 9, reference numeral 11 is an optical disc drive portion that drives the optical disc and reads data from the optical disc through an optical pickup. Reference numeral 12 is an MPU (Micro Processor Unit) that controls the entire system of the apparatus. Reference numeral 13 is a key input portion that supplies a user command to the MPU 12. Reference numeral 14 is an RAM portion that is used as a working region for a ROM and the MPU 12. In the ROM, a control program for the MPU 12 is stored. Reference numeral 15 is a system processor portion that demodulates and error-corrects the data that is output from the optical drive portion 11 and divides the error-corrected data into three types of data that are video (main image), audio, and sub video. Reference numeral 16 is a RAM portion that processes data. Reference numerals 17, 18, and 19 are a video decoder portion, an audio decoder portion, and a sub video decoder portion that decode the video data, the audio data, and the sub video data that are output from the system processor portion 15, respectively. Reference numeral 20 is a D/A & reproducing process portion that converts each decoded data into an analog signal, multiplexes the video data and the sub video data, and outputs the multiplexed data to an image and sound output portion 21. Next, the multiplex recording method of the management information will be described. On the disc, the same management information as the information recorded in the management region is multiplexedly recorded at a plurality of positions other than the positions of the management region and the data region. Fig. 14 shows the spare management information that is multiplexed written at a plurality of positions in the read-in region. As shown in Fig. 14, the values that represent the positions of individual spare management information are defined by the relative distance (number of sectors) from the top addresses of the spare management regions 51 and 52. The absolute addresses that represent the positions in a management region 53 and a data region 54 are defined by the relative distance (the number of sectors) from the top address of the management region 53. Thus, when any position of the spare management region 51 or 52 is accessed, by adding the value of a desired absolute address and an offset value of the top address of the spare management region 51 or 52, the value of the absolute address can be calculated. For example, when the top address of the first spare management region 51 is-20, the address represented by the absolute address 3 is calculated by the following expression. 3 + (-20) = -17 Likewise, when the top address of the second spare management region 52 is -10, the address represented by the absolute address 3 can be calculated by the following expression. 3 + (-10) = -7 Next, the data structure of the file recorded in the data region of the disc will be described. Fig. 15 is a schematic diagram showing the data structure of the file. As shown in Fig. 15, the file includes a file management table 5, a group of chain information tables 6, a group of cell information tables 7, a group of DUT allocation tables (referred to as DATs) 8, and a group of DUTs (data units) 9. As shown in Fig. 16, the file management table 5 includes the number of chain information tables, the number of cell information tables, the number of DUTs (data units), the number of sectors, and pointers that represent the top of each table As shown in Figs. 17 and 18, in the chain information table 6, information that composes a program chain is written. A program chain is a unit that composes one story. Each program chain is composed by linking a plurality of programs in the order of the reproduction. A program is composed of a group of at least one unit called a program cell. In other words, the chain information table 6 includes information that composes one program chain in which a plurality of cell information tables 7 are selectively linked. In the file, a plurality of chain information tables 6 are successively placed in the order of chain numbers. As shown in Fig. 19, in the cell information table 7, information that composes program cells is written. A program cell is a part that composes one program. Each program cell is composed by linking a plurality of DUTs in the order of reproduction. In other words, the cell information table 7 includes information that composes one program cell in which a plurality of DUTs 9 are selectively linked. In the file, a plurality of cell information tables 7 are successively linked in the order of cell numbers. As shown in Fig. 20, in the DAT 8, information that represents the position of the DUT is written as the relative distance (number of sectors) from the top of the file. In the file, a plurality of DATs 8 are successively placed in the order of the DUT numbers. The DUT 9 is composed of a plurality of types of data that are video data, audio data, sub video data that are synchronously reproduced. The reproducing time of each DUT 9 is not defined. In the file, the DUTs 9 are placed in the order of the DUT numbers. Next, with reference to Fig. 21, a process for selecting a program chain will be described. The reproducing apparatus can reproduce any program chain selected by the user from a plurality of program chains that are present in a file. The reproducing apparatus obtains a required file and then reads the file management table 5 from the file (at step 1). Thereafter, the reproducing apparatus obtains the number of program chains in the file, the number of program cells in the file, the number of DUTs in the file, the number of sectors in the file, and the pointers that represent the top of each table (at step 3). Next, the reproducing apparatus obtains the content of the first chain information table corresponding to the obtained pointers (at step 4) and resets the counter value that represents the chain number to "0" (at step 5). After that, the reproducing apparatus determines whether or not the chain number represented by the counter matches a chain number designated by the user (at step 6). When these number do not match, with a pointer that is obtained by adding the length of the table written to the chain information table to the top pointer, the reproducing apparatus obtains the content of the next chain information table (at step 7). Thereafter, the reproducing apparatus increments the chain number by "1" (at step 8) and determines whether or not the chain number of the counter matches the chain number designated by the user. The reproducing apparatus repeats steps 6 to 8 until the chain number represented by the counter matches the chain number designated by the user. When the chain number represented by the counter matches the chain number designated by the user, the reproducing apparatus obtains the number of program cells that compose the program chain, the number of DUTs, the number of sub video channels, the number of audio streams, and so forth from the chain information table (at step 9). Thereafter, the reproducing apparatus obtains the number of branch points (NBP) in the chain information table and the top pointer of the cain control information (SCINFO) from the obtained information (at step 10). After that, the reproducing apparatus obtains the top chain control information (SCINFO) from the obtained top pointer (at step 11) and starts the reproduction control of the program chain corresponding to the chain control information (SCINFO) (at step 12). The top positions of the file management table 5, the chain information table 6, the cell information table 6, the cell information table 7, the DAT 8, and the DUT 9 in the file shown in Fig. 15 are defined by the relative distance (the number of sectors) from the top of the file. In the following description, the number of sectors of the file management table 5 is represented by a. The number of sectors of all chain information tables 6 is represented by b. The number of sectors of all cell information tables is represented by c. The number of sectors of all DATs is represented by d. Thus, the top position of the file management table is represented by 0. The position of the top chain information table is represented by a. The position of the top cell information table is represented by a+b. The position of the top DAT is represented by a+b+c. The position of the top DUT is represented by a+b+c+d. Since the position in the file is represented by the relative distance (the number of sectors) from the top of the file, as shown in Fig. 22, when the file is relocated to another position of the data region, it is not necessary to change the value that represents the position. In the file structure of this optical disc, a plurality of program chains can share the same program cells. As shown in Fig. 18, in the chain information table, the number of branch points (NBP) that represents the number of program cells shared with another program chain and branch information (BINFO) that is the program cell number are written. Figs. 23 and 24 show examples of the branch information (BINFO) and chain control information (SCINFO) in the case that program chains A, B, and C share program cells. In the chain control information (SCINFO), program cell numbers are written in the order of reproduction thereof. The reproducing apparatus 'successively selects and reproduces program cells corresponding to the chain control information (SCINFO). Thus, the program chains A, B, and C are reproduced corresponding to the process shown in Fig. 25. In Fig. 25, (0) to (8) represent program cell numbers and reproducing regions thereof. Next, the operation in the case that a program chain is switched while one of program chains A, B, and C is being reproduced will be described. 1) When the program chain A is switched to the program chain B while the program cell 1 of the program chain A is being reproduced, the program chain B is reproduced from the first program cell 5. 2) When the program chain A is switched to the program chain C while the program cell 1 of the program chain A is being reproduced, the program chain C is reproduced from the first program cell 7. 3) When the program chain A is switched to the program chain B after the program cell 1 of the program chain A has been reproduced, the program chain B is reproduced from the next program cell 2. This is because the program chain B has the program cell 1 that is shared with the program chain A. To prevent the same program cell from being redundantly reproduced, the program chain B is reproduced from the next program cell 2. 4) When the program chain A is switched to the program chain C after the program cell 1 of the program chain A has been reproduced, the program chain C is reproduced from the first program cell 7. 5) When the program chain A is switched to the program chain B after the program cell 2 of the program chain A has been reproduced, the program chain B is reproduced from the program cell 6. The reason is the same as 3) above. 6) When the program chain A is switched to the program chain C after the program cell 2 of the program chain C has been reproduced, the program chain C is reproduced from the first program cell 7. 7) When the program chain A is switched to the program chain B after the program cell 3 of the program chain A has been reproduced, the program chain B is reproduced from the program cell 6. 8) When the program chain A is switched to the program chain C after the program cell 3 of the program chain A has been reproduced, the program chain C is reproduced from the program cell 8. This is because the program chain C has the program cell 3 that is shared with the program chain A. To prevent the same program cell from being redundantly reproduced, the program chain C is reproduced from the program cell 8. When a first program chain is switched to a second program chain that shares program cells with the first program chain, after the shared program cells have been reproduced, the next program chain is reproduced. Next, a process for controlling the reproduction of a program chain will be described. As shown in Fig. 18, in the chain information table, the chain control information (SCINFO) is successively recorded in the order of the reproduction of the program cells. Thus, by reading the chain control information, the program cells can be successively reproduced (namely, the program chain can be reproduced). As shown in Figs. 18 and 26, the chain control information (SCINFO) includes a two-bit reproduction control area 61. The reproducing apparatus can recognize the content of the control of program cells that are successively reproduced corresponding to the reproduction control information. The content of the reproduction control information is: 00 : Successively reproduces the next program cell without waiting time after a program cell is reproduced (presence of continuity of programs). 01 : Successively reproduces the next program cell without waiting time after a program cell is reproduced (absence of continuity of programs). 10: Reproduces a program cell with waiting time (PWAIT) designated by cell information table after another program cell is reproduced. 11 : Stops the reproducing operation, after a program cell is reproduced. Next, a real example of the successive reproduction control of program cells corresponding to the reproduction control information will be described. Fig. 26 shows an example of the chain control information (SCINFO). In this example, a program chain is composed of five program cells. The angle modes of the program cells are "00" A multi-angle reproduction is not designated. In the multi-angle reproduction, the user can select one of program cells that can be reproduced in the same time on the same time axis. For example, in the case of a baseball program on TV, the user can select one of the two images which have been photographed and received by cameras on the first base side and the second base side. Next, with reference to a flow chart of Fig. 27, a process for controlling successive reproduction of program cells will be described. The reproducing apparatus obtains the first control information (SCINFO) from the chain information table (at sep 1) and reads the first program cell number therefrom (at step 2). Thereafter, the reproducing apparatus reads the top pointer of the cell information table from the file management table and obtains a desired cell information table corresponding to the top pointer and the program cell number (at step 3). Next, the reproducing apparatus reproduces program cells corresponding to the content of the obtained cell information table (at step 4). At this point, the reproducing apparatus reads the information of the reproduction control area of the chain control information and controls the successive reproduction of the program cells corresponding to the reproduction control information. When the reproduction control information is "00" (at step 5), after the reproducing apparatus has reproduced the program cell, it obtains the next chain control information (SCINFO) (at step 11) and then starts reproducing the next program cell. When the reproduction control information is "01" (at step 6), the reproducing apparatus executes a broken link process such as mute just before it completes reproducing the program cell (at step 9). After the reproducing apparatus has reproduced the program cell, it obtains the next program chain control information (SCINFO) and then starts reproducing the next program cell. When the reproduction control information is "10" (at step 7), after the reproducing apparatus has reproduced the program cell, it performs a wait process for time (PWAIT) designated by the cell information table (at step 10). After the wait time elapsed, the reproducing apparatus obtains the next chain control information (SCINFO) and starts reproducing the next program cell. When the reproduction control information is "11", after the reproducing apparatus has reproduced the program cell, it stops reproducing the program chain (at step 8). The real process of the reproduction control for the chain control information shown in Fig. 26 will be described as follows. Fig. 28 shows the process of the reproduction control. Chain control information number 0 : S1 → S2 (obtained cell number 0) → S3 → S4 (reproduced cell number) → S5 → S11 Chain control information number 1 : → S2 (obtained cell number 1) → S3 → S4 (reproduced cell number 1) → S5 → S6 → S9 → S11 Chain control information number 2: → S2 (obtained cell number 4) → S3 → S4 (reproduced cell number 4) → S5 → S11 Chain control information number 3: → S2 (obtained cell number 2) → S3 → S4 (reproduced cell number 2) → S5 → S6 → S7 → S10 (wait process) → S11 Chain control information number 4: → S2 (obtained cell number 3) → S3 → S4 (reproduced cell number 3) → S5 → S6 → S7 → S8 → end Next, a process for multi-angle reproduction of program cells will be described. As shown in Figs. 29 and 18, in the chain control information of the chain information table, 2-bit angle mode information 71 and 4-bit angle number 42 are recorded. The content of the angle mode information 71 is as follows. The angle block is a group of some program cells that are selectively reproduced in the same time on the same time axis. 00: No angle block 10: Start/continuance of angle block 11: End of angle block. Angle numbers 72 are successively assigned to program cells that compose an angle block. When the user selects an angle number, the program cell corresponding to the angle number is reproduced. Next, the process for the multi-angle reproduction will be described. Fig. 30 is a flow chart showing the process for the multi-angle reproduction control. The reproducing apparatus obtains the first chain control information (SCINFO) from the chain information table and reads the first program cell number therefrom (at step 2). Thereafter, the reproducing apparatus reads the top pointer of the cell information table from the file management table and obtains a desired cell information table corresponding to the top pointer and the program cell number (at step 3). The reproducing apparatus reads the angle mode information 71 of the first chain control information and executes the multi-angle reproduction control corresponding to the information in the following manner. When the angle mode information is "10" (start/ continuance of angle block) (at step 6), the reproducing apparatus determines whether or not the user has designated an angle number (at step 7). When an angle number has not been designated, the reproducing apparatus selects a default angle number (0) (at step 8) and sets the angle mode flag (at step 9). When an angle number has been designated, the reproducing apparatus just sets the angle mode flag (at step 9). Thereafter, the reproducing apparatus determines whether or not the present program cell is a program cell with an angle number designated by the user (at step 10). When the determined result is YES, the reproducing apparatus obtains a corresponding cell information table and executes the reproduction of the program cell corresponding to the content of the cell information table (at step 11). Thereafter, the reproducing apparatus resets the angle mode flag (at step 12). When the determined result is "NO", the reproducing apparatus does not reproduce the present program cell. Thus, the reproducing apparatus keeps the angle mode flag in the set state. Next, the reproducing apparatus reads the information of the reproduction control area 61. When the information is not "11" (stops reproducing the program chain) (at step 13), the reproducing apparatus obtains the next chain control information from the chain information table (at step 15) and repeats the same process at step 2. When the angle mode information 71 at step 4 is "11" (end of the angle block), the reproducing apparatus determines whether or not the angle mode flag has been set (at step 16). When the angle mode flag has been reset, the reproducing apparatus obtains the next chain control information through step 13 (at step 15). Alternatively, the reproducing apparatus terminates the process for reproducing the program chain (at step 14). Thus, the multi-angle reproduction control is executed corresponding to the chain control information shown in Fig. 29 as follows. Fig. 31 shows the process for the multi-angle reproduction control. In the following description, it is assumed that the angle number designated by the user is "1". Chain control information number 0 : S1 → S2 (obtained cell number 0) → S3 → S4 → S5 → S11 (reproduced cell number 0) → S12 → S13 → S15 Chain control information number 1: → S2 (obtained cell number 1) → S3 → S4 → S5 → S6 → S7 → S9 → S10 → S13 → S15 Chain control information number 2 : → S2 (obtained cell number 5) S3 → S4 → S5 → S6 → S7 → S9 → S10 → S11 (reproduced cell number 5) → S12 → S13 → S15 Chain control information number 3: → S2 (obtained cell number 6) → S3 → S4 → S16 → S13 → S15 Chain control information number 4: → S2 (obtained cell number 2) → S3 → S4 → S5 → S11 (reproduced cell number 2) → S12 → S13 → S15 Chain control information number 5: → S2 (obtained cell number 3) → S3 → S4 → S5 → S6 → S7 → S8 → S9 → S10 → S11 (reproduced cell number 3) → S12 → S13 → S15 Chain control information number 6: → S2 (obtained cell number 7) → S3 → S4 → S16 → S13 → S15 Chain control information number 7: → S2 (obtained cell number 4) → S3 → S4 → S5 → S6 → S11 (reproduced cell number 4) → S12 → S13 → S14 → end Next, specific code added corresponding to an application type of a program chain of this disc will be described. As shown in Fig. 17, in the chain information table, 4-bit type information 74 and 8-bit specific code 73 are recorded. The 4-bit type information 74 represents an application type of a program chain. The 8-bit specific code 73 represents detail description of the application type. The specific code 73 represents detailed content, and the detailed content corresponding to the code is defined uniquely to each of the application type. For example, as an application of a program chain, an orchestral music program and an instrument are considered. In the case of an orchestral music program, the specific code represents the language type of the superimposed text. In the case of the instrument, the specific code represents the type of the instrument. Thus, without need to extend the specific code, with the specific code having a fixed length, detailed contents of many types can be defined.

Claims: A recording medium on which data is recorded as a data file, the data file comprising: a data unit region (9) containing a data unit representing a group of a plurality of types of data that may be synchronously reproduced; a cell information region (7) containing at least one cell information table containing cell information defining a program cell composed by selectively linking data defining at least one data unit recorded in said data unit region (9), the data file being characterised in that the data file comprises a chain information region (6) containing chain information defining at least one program chain composed by selectively linking one or more of the program cells defined in said at least one cell information table; and said cell information table includes a top address and an end address of said program cell. A recording medium according to claim 1, wherein the chain information includes: a cell number sequence that represents a plurality of program cell numbers defining the program chain and the order of reproduction of the program cells in the program chain. A recording medium according to claim 1, wherein the chain information includes: a cell number sequence that represents a plurality of program cell numbers defining the program chain and the order of reproduction of the program cells in the program chain; and mode information that represents whether or not each program cell represented by a portion of the cell number sequence is a program cell that can be selectively reproduced along with another program cell along the same time axis. A reproducing apparatus for reproducing a recording medium on which data is recorded as a data file, the data file comprising a data unit region (9) containing a data unit representing a group of a plurality of types of data that are synchronously reproduced, a cell information region (7) containing at least one cell information table containing cell information defining a program cell composed by selectively linking data defining at least one data unit recorded in said data unit region, characterised in that the data file comprises a chain information region (6) containing chain information defining at least one program chain composed by selectively linking one or more of the program cells defined in said at least one cell information table; and said cell information table includes a top address and an end address of said program cell, and in that the apparatus comprises: first searching means for searching the chain information; second searching means for searching at least one of the cell information table that composes the program chain from the cell information table region corresponding to the searched chain information; and third searching means for searching at least one data unit that composes the program cell from the data unit region corresponding to the cell information table searched by said second searching means. A reproducing apparatus for reproducing a recording medium on which data is recorded as a data file, the data file comprising a data unit region (9) containing a data unit representing a group of a plurality of types of data that are synchronously reproduced, a cell information region (7) containing at least one cell information table containing cell information defining a program cell composed by selectively linking data defining at least one data unit recorded in said data unit region, characterised in that the data file comprises a chain information region (6) containing chain information defining at least one program chain composed by selectively linking one or more of the program cells defined in said at least one cell information table: said cell information table includes a top address and an end address of said program cell; and the chain information includes a cell member sequence that represents a plurality of program cell numbers defining the program chain and the order of reproduction of the program cells in the program chain, and mode information that represents whether or not each program cell represented by a portion of the cell number sequences is a program cell that can be selectively reproduced along with another program cell along the same time axis, and in that the apparatus comprises: first searching means for searching the chain information and the mode information corresponding to the chain information; judging means for judging whether or not the program cell represented by the cell number sequence corresponding to the chain information is a program cell that is selectively reproduced; second searching means for searching at least one of the cell information table that composes the program chain from the cell information table region corresponding to the searched chain information; and third searching means for searching at least one data unit that composes the program cell from the data unit region corresponding to the cell information table searched by said second searching means when the program cell is judged to be a program cell that is selectively reproduced by the judging means and one program cell is selected from a plurality of program cells being selectively reproduced.

Inventors: KIKUCHI SHINICHI, KITAMURA TETSUYA, MIMURA HIDEKI, TAIRA KAZUHIKO, KIKUCHI, SHINICHI, KITAMURA, TETSUYA, MIMURA, HIDEKI, TAIRA, KAZUHIKO, KIKUCHI, SHINICHI, C/O K.K. TOSHIBA, KITAMURA, TETSUYA, C/O K.K. TOSHIBA, MIMURA, HIDEKI, C/O K.K. TOSHIBA, TAIRA, KAZUHIKO, C/O K.K. TOSHIBA
Applicants: TOSHIBA AVE KK, TOSHIBA KK, KABUSHIKI KAISHA TOSHIBA, TOSHIBA AVE CO., LTD
Application year: 1995
Main classification: G11B27
IPC codes: H04N5, G11B27, G11B20, H04N9, G11B7, G11B19