WikiPatents - Community Patent Review
Create Free Account  |  License or Sell Your Patent  |  WikiPatents Marketplace  |  WikiPatents Blog
Username:  Password:  
    
Advanced Search
Recording medium and reproducing apparatus thereof    
United States Patent5642346   
Link to this pagehttp://www.wikipatents.com/5642346.html
Inventor(s)Taira; Kazuhiko (Yokohama, JP); Mimura; Hideki (Yokohama, JP); Kikuchi; Shinichi (Yokohama, JP); Kitamura; Tetsuya (Komae, JP)
AbstractA table of a management region on the disc, contains a disc identifier that represents the type of the data recording format of the disc, a number-of-disc-sides identifier that represents whether the disc is a single-sided disc or a double-sided disc, and a disc side identifier that represents whether the reproducing disc is side A or side B of a double-sided disc. A disc identifier 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. A reproducing apparatus reads the disc identifiers from the 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 from the 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.
   














 Title Information Submit all comments and votes
 
Patent Text Patent PDF Print Page Summary File History
Plain text PDF images Print Summary File History
Drawing from US Patent 5642346
Recording medium and reproducing apparatus thereof - US Patent 5642346 Drawing
Recording medium and reproducing apparatus thereof
Inventor     Taira; Kazuhiko (Yokohama, JP); Mimura; Hideki (Yokohama, JP); Kikuchi; Shinichi (Yokohama, JP); Kitamura; Tetsuya (Komae, JP)
Owner/Assignee     Kabushiki Kaisha Toshiba (Kawasaki, JP)
Patent assignment
All assignments
Publication Date     June 24, 1997
Application Number     08/708,751
PAIR File History     Application Data   Transaction History
Image File Wrapper   Patent Term   Fees
Litigation
Filing Date     September 5, 1996
US Classification     369/275.3
Int'l Classification     G11B 007/00
Examiner     Hindi; Nabil
Assistant Examiner    
Attorney/Law Firm     Cushman Darby & Cushman IP Group of Pillsbury Madison & Sutro LLP
Address
Parent Case     This is a division of application Ser. No. 08/421,743, filed Apr. 13, 1995 now pending.
Priority Data     Apr 14, 1994[JP]6-076194 Mar 15, 1995[JP]7-055970
USPTO Field of Search     369/275.1 369/275.2 369/275.3 369/275.4
Patent Tags     recording medium reproducing
   
Enter a comma (,) or semicolon (;) between multiple tag words/phrases.
Describe this patent:
 Amusing   
 Clever   
 Complex   
 Efficient   
 Historic   
 Important   
 Innovative   
 Interesting   
 Practical   
 Simple   
[no votes]
Patent WIKI

Share information and news about this patent, including information and news about the technology, inventors, company, ligation and licensing.

 References Submit all comments and votes
 
*references marked with an asterisk below are user-added references
 U.S. References
 
Add a new US reference:  
ReferenceRelevancyCommentsReferenceRelevancyComments
5546365
Roth
369/30.09
Aug,1996

[0 after 0 votes]
5546368
Lee
369/47.23
Aug,1996

[0 after 0 votes]
5521900
Ando
369/53.22
May,1996

[0 after 0 votes]
5473584
Oshima
369/47.11
Dec,1995

[0 after 0 votes]
5469370
Ostrover
711/111
Nov,1995

[0 after 0 votes]
5434678
Abecassis

Jul,1995

[0 after 0 votes]
5367510
Ando
369/30.09
Nov,1994

[0 after 0 votes]
5280572
Case
369/47.16
Jan,1994

[0 after 0 votes]
5138925
Koguchi
84/609
Aug,1992

[0 after 0 votes]
4862439
Ando
369/30.04
Aug,1989

[0 after 0 votes]
 Foreign References
 Other References
 Market Review Submit all comments and votes
   
Market Size
Estimate the gross annual revenues of the relevant market sector:
> $10B
$5B - $10B
$2B - $5B
$500M - $2B
$100M - $500M
$10M - $100M
$1M - $10M
$500K - $1M
$100K - $500K
< $100K
[No votes]
$0
 
$0   $2.5B   $5B   $7.5B   $10B
Market Share
Estimate the percentage of the relevant market sector this invention will capture:
75% - 100%
50% - 74.99%
25% - 49.99%
10 - 24.99%
5 - 9.99%
2 - 4.99%
1 - 1.99%
< 1%
[No votes]
0.0%
 
0%   25%   50%   75%   100%
Reasonable Royalty
What percentage of gross sales should the inventor or assignee be paid?
75% - 100%
50% - 74.99%
25% - 49.99%
10 - 24.99%
5 - 9.99%
2 - 4.99%
1 - 1.99%
< 1%
[No votes]
0.0%
 
0%   25%   50%   75%   100%
Public's "Guesstimation" of Royalty Value
Market SizeN/A[No votes]
xMarket ShareN/A[No votes]
xReasonable RoyaltyN/A[No votes]

N/A

License Availablity
If you are NOT the owner or assignee, answer here:
Yes, license is available for purchase

No, license is not currently available



[No votes]
License Availablity
If you ARE the owner or assignee, answer here:
Yes, license is available for purchase

No, license is not currently available



[No votes]
Competitive Advantage
Does this invention have a significant competitive advantage over similar technologies?
Yes

No



[No votes]
Most helpful competitive advantage comment
[No comments]

Commercial Alternatives
Are there viable commercial alternatives for this invention?
Yes

No



[No votes]
Most helpful commercial alternative comment
[No comments]

 Technical Review Submit all comments and votes
 Claims Submit all comments and votes
 


What is claimed is:

1. The recording medium on which data is recorded as a file, the file comprising:

a data unit region containing a data unit representing a group of a plurality of types of data that are synchronously reproduced;

a cell information region containing at least one cell information table containing cell information defining a program cell by linking data defining at least one data unit recorded in said data unit region;

a chain information region containing chain information defining at least one program chain composed by linking at least one of said program cells based on said cell information table recorded in said cell information region; and

at least one cell information menu table that contains information used to compose a menu screen on which any data item to be displayed is selected, wherein said cell information table includes identifying information indicating that said cell information menu table used to compose said menu screen.

2. The recording medium as set forth in claim 1, wherein said chain information that composes said program chain and said cell information menu table that composes said menu screen define a cell information group as one block of information in said file.

3. The recording medium as set forth in claim 1, wherein said cell information menu table that composes said menu screen further includes language type information that represents a language of characters displayed on said menu screen.
 Description Submit all comments and votes
 


BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to a recording medium, such as an optical disc, and a reproducing apparatus thereof.

2. Description of the Related Art

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 problem, 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 recorded in a multiplexed fashion at multiple regions on the disc. However, in this case, the spare management information is recorded at a different record position as shown by arrow A. Thus, each portion of duplicated management information management will 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 recorded in a multiplexed fashion, the efficiency of the disc storage capacity is remarkably low.

Furthermore, in recent years, as a technique for selectively reproducing a variety of data recorded on the disc, menus are used. When menus are composed, for example, as shown in FIG. 41, a menu list and memory image information are recorded at predetermined regions of the disc. In the menu list, the record position of menu image information corresponding to each menu number and the file record position corresponding to each menu selection number are recorded. When any menu number is selected (at step 1), a corresponding menu image information is read (at step 3) based on an address on the menu list (at step 2). Thus, the menu screen is displayed. When any file number is selected from the menu screen (at step 4), the record position of the desired file is determined corresponding to the menu list (at step 5) and the desired file is reproduced (at step 6).

However, in the above-described method using the menu list, as the number of selection items increases, the size of the menu list increases and the ratio of the data amount of the menu to the entire record data amount increases, thereby lowering the efficiency of the disc storage capacity.

SUMMARY OF THE INVENTION

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 recorded in a multiplexed fashion.

A fourth object of the present invention is to provide a recording medium and a recording medium reproducing apparatus that does not need to in a multiplexed fashion record the same data.

A fifth object of the present invention is to provide a recording medium and a reproducing apparatus thereof that do not increase the ratio of menu data amount to the entire data amount even if the number of menu selection items increases.

To accomplish such objects, a first aspect of the present invention is a recording medium comprising a data region in which data is recorded as a file corresponding to a predetermined data recording format, and a management region including medium identifying information that represents the type of the data recording format and file identifying information that represents the type of the data recording format of the file.

A second aspect of the present invention is a reproducing apparatus, comprising a first determining means for reading medium identifying information recorded in the management region and determining a type of a data recording format of the recording medium corresponding to the medium identifying information, and a second determining means for reading the file identifying information of each file recorded in the management region and determining a type of each file recorded on the recording medium corresponding to the file identifying information.

Thus, according to the present invention, the type of the recording format for a recording medium and the type of files can be determined. Consequently, a recording medium and files dedicated for a specific system can be provided.

A third aspect of the present invention is a recording medium having two opposite sides, either or both of which are selective as recording sides, comprising a data region in which data is recorded, and a management region including number-of-recording-sides identifying information that represents the number of recording sides of the recording medium and recording side identifying information that represents the recording side.

A fourth aspect of the present invention is a reproducing apparatus, comprising a number-of-recording-sides determining means for reading the number-of-recording-sides identifying information recorded in the management region and determining the number of recording sides of the recording medium, and a recording-side determining means for reading the recording-side identifying information recorded in the management region and determining the recording side of the recording medium to be reproduced.

Thus, according to the present invention, different types of recording mediums that are for example single-sided type and double-sided type can be handled.

A fifth aspect of the present invention is a recording medium, comprising a data region in which data is recorded, a management region in which management information is recorded, the management information being adapted for managing data recorded in the data region, and a plurality of spare management regions in which management information with the same content as the management region is recorded, values representing the positions in the spare management regions being represented with relative distance from the top addresses thereof.

Thus, it is not necessary to change the value that represents the position of each management information.

A sixth aspect of the present invention is a recording medium on which data is recorded as a file, the file comprising a first region in which a data unit group that is a group of a plurality of types of data that are synchronously reproduced, a second region in which at least one cell information table that is a program cell composed by selectively linking at least one data unit recorded in the first region, and a third region in which at least one chain information that is a program chain composed by selectively linking at least one cell information table recorded in the second region.

A seventh aspect of the present invention is a reproducing apparatus comprising a first searching means for searching any chain information table recorded in the third region, a second searching means for searching at least one cell information table that composes the program chain from the second region corresponding to the searched chain information table, and a third searching means for searching at least one data unit that composes the program cell from the first region corresponding to the cell information table searched by the second searching means.

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 maximized.

An eighth aspect of the present invention is a recording medium, wherein the file includes at least one cell information table that composes a menu screen on which any data item to be displayed is selected, and wherein the cell information table that composes the menu screen includes identifying information that represents that the cell information table composes the menu screen.

A ninth aspect of the present invention is a reproducing apparatus, comprising means for determining a cell information table that composes a menu screen corresponding to the identifying information and means for reproducing the menu screen corresponding to the cell information table.

Thus, according to the present invention, it is not necessary to record a menu list and so forth in other than a file. Consequently, even if the number of selection items increases, the ratio of the menu data amount to the entire record data amount does not increase.

A tenth aspect of the present invention is a recording medium, wherein the chain information table that composes the program chain with the cell information table that composes the menu screen includes block mode information that defines a cell information group that composes the menu screens that correlate as-one block.

An eleventh aspect of the present invention is a recording apparatus, comprising a means for recognizing the correlation among a plurality of menu screens included in the chain information table corresponding to the block mode information in the chain information table searched by the first searching means, and a means for reproducing a second menu screen after a first menu screen is selected, when the recognizing means has determined that there is correlation between the first menu screen that is being reproduced and the second menu screen.

A twelfth aspect of the present invention is a recording medium, wherein the cell information table that composes the menu screen further includes language type information that represents a language type of characters displayed on the menu screen.

A thirteenth aspect of the present invention is a reproducing apparatus, comprising a means for determining whether or not a language type of the menu screen composed of the cell information table on the menu screen matches a language type selected by the language type selecting means corresponding to the language type information in the cell information table when the determining means has determined the cell information table that composes the menu screen, and a means for reproducing at least one data unit searched by the third searching means as the menu screen.

Thus, according to the present invention, only a menu screen with a language type selected by the user reproduced from a plurality of cell information tables so as to compose a menu screen with same content but different languages.

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.

BRIEF DESCRIPTION OF THE 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. 10 is a block diagram showing a construction of a device that determines the types of a disc and a file corresponding to a data recording format;

FIG. 11 is a block diagram showing a construction of a function that determines the number of recording sides and a reproducing side of a disc;

FIG. 12 is a schematic diagram showing a file access process of a data structure;

FIG. 13 is a flow chart showing a file access process;

FIG. 14 is a schematic diagram showing disc management information in a multiplexed fashion 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 another 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;

FIGS. 23A-23C illustrate tables showing branch information of three program chains;

FIGS. 24A-24C illustrate tables showing chain control information of three program chains;

FIGS. 24A-24C are schematic diagrams 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;

FIG. 32 is a schematic diagram showing a construction of chain control information in a chain information table that composes a menu screen;

FIG. 33 is a table and a schematic diagram showing a structure of a cell information table that composes a menu screen;

FIG. 34 is a schematic diagram showing a structure of a file selecting menu;

FIG. 35 is a schematic diagram showing a structure of a sequence (program chain) selecting menu;

FIG. 36 is a schematic diagram showing a structure of another menu;

FIG. 37 is a block diagram showing a structure of a function for displaying a menu;

FIG. 38 is a schematic diagram showing a file selecting process;

FIG. 39 is a table showing a cell information table group that composes a plurality of menu screens with different languages;

FIG. 40 is a schematic diagram showing multiplexedly recorded spare management information of a related art reference; and

FIG. 41 is a schematic diagram showing a menu composing process of a related art reference.

DESCRIPTION OF THE PREFERRED EMBODIMENT

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. The physical sector size is 1024 bytes. The logical sector size is 2048 bytes. The logical block size is 1024 bytes.

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, with reference to FIGS. 10 to 13, the operation of the optical disc reproducing apparatus will be described. FIG. 10 is a block diagram showing a construction of a device that determines the types of a disc and a file corresponding to the data recording format of the disc. FIG. 11 is a schematic diagram showing a construction of a device that determines the number of recording sides of the disc and the reproducing side. FIG. 12 is a schematic diagram showing a file access process of the data structure shown in FIG. 1. FIG. 13 is a flow chart showing a file access process.

After the disc reproducing apparatus is activated or the disc is replaced, the reproducing apparatus reads the PVD table (at step 1). Thereafter, the reproducing apparatus determines whether or not the disc is based on the ISO-9660 standard corresponding to the standard identifier in the PVD table (at step 2). When the disc is based on the ISO-9660 standard, a disc recording format determining portion 31 of the reproducing apparatus checks the disc identifier 1 recorded in the application system region of the PVD table and determines whether or not the reproducing apparatus can reproduce data from the disc (applicable disc) (at step 3).

When the mounted disc is an applicable disc, a number-of-disc-recording-sides determining portion 41 of the reproducing apparatus determines the number-of-disc-sides identifier 2 recorded in the application system region (at step 4). When the mounted disc is a double-sided disc, a disc side A/B determining portion 42 of the reproducing apparatus checks the disc side identifier 3 recorded in the application system region and determines whether the reproducing side is side A or side B (at step 5).

Thereafter, the reproducing apparatus reads the PT and determines the hierarchical structure between the DRs. Next, the reproducing apparatus reads the route RD and determines the position of each file (n) table (at step 6). After that, the reproducing apparatus obtains a file name from the first file (n) table (at step 7) and determines whether or not the file name matches a predetermined file name (at step 8). When these file names do not match, the reproducing apparatus obtains the next file name (at step 9) and repeats the same operation. When these files match, a file record format determining portion 32 shown in FIG. 10 of the reproducing apparatus checks the information (disc identifier) 4 in the application system region of the file (n) table in the matched file and determines whether or not the file is applicable for the reproducing apparatus (at step 11). When the file is not applicable, the process is terminated. When the file is applicable, the reproducing apparatus checks the record position of the file corresponding to the file (n) table and accesses the file (at step 12).

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 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 written at a plurality of positions in the read-in region in a multiplexed fashion. 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 101). 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 103). Next, the reproducing apparatus obtains the content of the first chain information table corresponding to the obtained pointers (at step 104) and resets the counter value that represents the chain number to "0" (at step 105).

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 106). 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 107). Thereafter, the reproducing apparatus increments the chain number by "1" (at step 108) 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 109). 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 110). After that, the reproducing apparatus obtains the top chain control information (SCINFO) from the obtained top pointer (at step 111) and starts the reproduction control of the program chain corresponding to the chain control information (SCINFO) (at step 112).

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.

Because 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. 23A-23C and 24A-24C 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 FIGS. 25A-25C. In FIGS. 25A-24C, (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 after a program cell is reproduced (presence of continuity of programs).

01: Successively reproduces the next program cell without waiting 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 with no multi-angle (angle mode=00B).

The reproducing apparatus obtains the first control information (SCINFO) from the chain information table (at step 201) and reads the first program cell number therefrom (at step 202). 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 203). Next, the reproducing apparatus reproduces program cells corresponding to the content of the obtained cell information table (at step 204).

At this point, the reproducing apparatus reads the information of the reproduction control area of the chain control