[go: up one dir, main page]

WO1996013773A1 - Compilateur de jeux video a portage et procede d'utilisation d'un jeu video - Google Patents

Compilateur de jeux video a portage et procede d'utilisation d'un jeu video Download PDF

Info

Publication number
WO1996013773A1
WO1996013773A1 PCT/US1995/013871 US9513871W WO9613773A1 WO 1996013773 A1 WO1996013773 A1 WO 1996013773A1 US 9513871 W US9513871 W US 9513871W WO 9613773 A1 WO9613773 A1 WO 9613773A1
Authority
WO
WIPO (PCT)
Prior art keywords
audiovideo
data signals
branches
scenes
storage device
Prior art date
Application number
PCT/US1995/013871
Other languages
English (en)
Inventor
Bruce Leak
Sean Callahan
George Cossey
Original Assignee
Rocket Science Games, Inc.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Rocket Science Games, Inc. filed Critical Rocket Science Games, Inc.
Publication of WO1996013773A1 publication Critical patent/WO1996013773A1/fr

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/40—Transformation of program code
    • G06F8/41—Compilation
    • G06F8/44—Encoding
    • G06F8/445—Exploiting fine grain parallelism, i.e. parallelism at instruction level

Definitions

  • VIDEO GAME PORTING COMPILER AND METHOD OF OPERATING A VIDEO GAME
  • the present invention relates to a compiler, and in particular, to a compiler for translating a computer program operating on a first computer to be operational on a second computer having a constraint of retrieval time of video data signals from a storage device associated with the second computer.
  • a primary goal of the developers of video games is for the video games, when played, to simulate reality as faithfully as possible. As such, it is preferable to display actual video scenes, rather than animated video scenes.
  • video data signals characterized by actual video scenes require large bandwidth, their use places high speed demands on video game storage device hardware. In order to appear realistic, it is desirable that video data signals characterized by the actual video scenes be retrievable from storage quickly to be available for display with minimal latency.
  • a video game developer initially develops game software to execute on a high performance, relatively unconstrained, computer (“development platform") which can retrieve video data signals from storage with minimal latency.
  • the video data signals may be stored in a fast randomly accessible memory medium, such as a large hard disk.
  • a user input node a point in the software where user input is sought and subsequent video scenes would differ depending upon the user input
  • the video game software can quickly respond to the user input, retrieving the video scenes associated with the branches with little or no latency. That is, the developer does not have to be concerned about delay in the availability of the video data from the chosen branch. This freedom from concern about the latency constraint allows the developer to direct her creative energies to the overall video game functions themselves, rather than to working around computing platform constraints.
  • target computers are typically inexpensive computer systems that suffer in performance.
  • One major performance problem is video signal data retrieval latency as a result of a storage medium being only sequentially accessible, or slow, or both sequentially accessible and slow.
  • a first prior art target computer system attempts to solve the data latency problem by storing video data on parallel tracks of a sequential access video tape.
  • Each parallel track contains video data associated with alternate branches of user input nodes in the video game software.
  • the target-dependent description of the game is such that when the video game player chooses one branch from a user input node, video data is provided for display from a video tape track which contains the video data for the chosen branch.
  • a problem with the first prior art system is the bandwidth loss associated with having parallel tracks of video data recorded for the various possible branches.
  • video data is recorded on a plurality of tracks, when only one track is ever needed at any one point in time.
  • retrieval of the stored video data is limited to sequential access.
  • a second prior art system programs a target computer to pre-fetch into a fast memory (i.e. one with minimal access latency, known as a cache) video data associated with to-be executed software instructions of a current path when video data associated with currently executing instructions is sparse. That is, for a particular time period when the density of the current video data is less than the capacity of the fast memory, the target computer is programmed to pre-fetch future video data of the current path to fill in the unused capacity.
  • a fast memory i.e. one with minimal access latency, known as a cache
  • a problem with the second prior art system is that unless it can be determined in advance whether the current path or a branch will be taken from a user input node of a current path, such a system cannot know for certain whether to pre-fetch data that is the continuation of the present path or is a branch. Hence, its use is limited to pre-fetching video data from the current path.
  • a third prior art system also programs a target computer to pre-fetch video data to fill in unused capacity.
  • the third prior art system overcomes the problem of the second prior art system by programming the target computer to force the video game player to decide, at a time before a user input node is reached in the game video display, which branch from the user input node will be taken. For example, a player of an automobile driving video game may be forced to engage a right or left turn signal some time before reaching an intersection, so that the appropriate (right or left turn) video data can be pre-fetched.
  • a problem with the third prior art system is that, while it allows pre-fetching of data before a user input node, forcing a player to "pre-decide" detracts from the realism and spontaneity of the video game.
  • a first embodiment in accordance with the present invention is a method of translating a computer program which operates on a first computer means for displaying video data signals on a video display means.
  • the video data signals are characterized by a plurality of video scenes associated with a current path and a plurality of first branches, with a user input node for selecting video scenes associated with one of said plurality of first branches.
  • the method translates the computer program to be operational on a second computer means with the second computer means having a constraint of retrieval time of said video data signals from a storage device associated with said second computer means.
  • the method comprises: a) calculating the capacity of said second computer means to retrieve video data signals from said storage device while said second computer means would be operating on said computer program during said current path; and b) arranging said computer program to retrieve from said storage device video data signals characterized by video scenes associated with said plurality of first branches while said second computer means would be operating on said computer program during said current path, while said second computer means has the capacity to retrieve video data signals from said storage device.
  • video data signals characterized by video scenes associated with a particular program branch are retrieved from the slow storage medium in advance of their need, to overcome the video retrieval time constraint of the target computer.
  • a second embodiment in accordance with the present invention is a method of arranging the video data signals.
  • the method comprises: a) calculating the capacity of said second computer means to retrieve video data signals from said storage device while said second computer means would be operating on said translated computer program during said current path; and b) arranging video data signals characterized by video scenes associated with said plurality of first branches such that said data signals characterized by video scenes associated with said plurality of first branches are retrievable while said second computer means would be operating on said current path, while said second computer means has the capacity to retrieve video data signals from said storage device.
  • a third embodiment in accordance with the present invention is a method of operating the computer program on the second computer means, comprising: a) retrieving video data signals, from said storage device, associated with said current path; b) displaying video scenes associated with said retrieved video data signals, while c) substantially simultaneously retrieving video data signals, from said storage device, associated with each of said plurality of first branches.
  • Fig. 1 is a block diagram of a typical video game target computer.
  • Fig. 2 shows a sample video game execution tree.
  • Fig. 3 is a flowchart of a method in accordance with a first embodiment of the invention.
  • Fig. 4 is a flowchart of a method in accordance with a second embodiment of the invention.
  • Fig. 5 is a schematic diagram of a plan view of a rotating storage media, such as CD-ROM, showing the storage of the video for different branches, in accordance with the method of the present invention.
  • Fig. 6 is a flowchart of a method in accordance with a third embodiment of the invention.
  • Fig. 1 shows a typical video game target computer 18.
  • Video data signals are stored in a relatively slow storage medium 20, such as a CD-
  • Video data signals are retrieved from the slow storage medium 20 to a video cache 22, which has faster access time than the slow storage medium 20.
  • a video game program is stored in an instruction memory 26.
  • the video data signals are characterized by video scenes associated with branches of the video game program.
  • the video data signals are retrieved from the video cache 22 to a video display memory 30, wherein the video data signals in the video memory 30 are displayed on a display device 32.
  • Fig. 2 is a sample execution tree for a video game instruction sequence.
  • blocks A, B, C, D, E, F, and G each represent branches of the video game program stored in the instruction memory 26.
  • the left-to- right direction of the execution tree represents the passage of time in which the video game program instructions are executed when the video game is played.
  • At the right end of each block is a user input node.
  • the user selects video scenes associated with one of the branches off the user input node by inputting game action signals via an input device 28.
  • the input device 28 can be located proximate to the target computer 18, or it can be located remotely as in the case of a video game delivered via cable or other wired or wireless medium to a household, with the target computer 18 being located remotely from the user. Since video scenes for a particular video game remain constant among target computers 18, the video data signal requirements also remain constant among target computers 18. However, each target computer 18 has its own video retrieval time constraint which depends on the particular hardware and system software.
  • the present invention ensures that, for a particular target computer 18, video data signals characterized by video scenes associated with a particular program branch are retrieved from the slow storage medium 20 to the video cache memory 22 in advance of their need, to overcome the video retrieval time constraint of the target computer 18.
  • step 110 calculate the capacity of the target computer to retrieve video data signals from the slow video storage device while the target computer is operating on the video game program during a current path.
  • step 120 arrange the video game program to retrieve video data signals associated with first branches of the video game program while the target computer 18 has capacity to retrieve video data signals from the video storage.
  • step 130 calculate preserved capacity to further retrieve video data signals from the video storage 20.
  • step 140 arrange the video game program to retrieve from the video storage video data signals characterized by video scenes associated with second branches of the video game program.
  • the translating program which can be executed by the developing computer, or another computer, calculates the capacity of the target computer 18 to retrieve video data signals from the slow video storage device 20 (i.e. the capacity of the video cache 22) while the target computer 18 is operating on the video game program during the current video path A.
  • the translating program may have to be changed or translated from the instructions set developed for operation on the developing computer into the instruction set for execution by the CPU 24 on the target computer 18.
  • the translating program is a program written in the C language, operating on the Apple Macintosh computer. A copy of the program is set forth in Exhibit A.
  • the translating program arranges the video game program to retrieve video data signals associated with a portion of the first branches B and C of the video game program, from the slow storage 20, while the video game program would be executing video instructions of the current video path A.
  • the translating program arranges the video game program to retrieve video data signals in an amount sufficient to display video scenes, of any first branch B or C chosen by a user, substantially equal to the constraint of video data signal retrieval time. That is, the translating program preferably arranges the video game program to retrieve less than all of the video signal data associated with scenes for the first branches B and C.
  • the translating computer preferably arranges the video game program to retrieve video data signals for video scenes up to a point 42 in branch B.
  • the video data signals from the start of the branch B, at the end of user input node 40 to point 42 represents a time period T B .
  • the time period T B represents a latency time period to retrieve the video signal data associated with the scenes from the beginning of the branch
  • video data signals corresponding to video scenes in branch C starting from user input node 40, until point 44, representing a retrieval time period of T c would be retrieved by the slow storage device 20.
  • the time for retrieval of video data signals from one branch, such as branch B may not be equal to the retrieval time of video data signals from another branch, such as branch C.
  • the target computer 18 would then retrieve video signal data for video scenes commencing from point 44.
  • video data signals representing video scenes from the start of user input node 40 until point 44, from the cache memory 22 would be supplied for display.
  • the video data signals of the branch not selected may be deleted from the cache memory 22, thereby freeing up cache memory 22.
  • the translating program may continue to a step 130, where it calculates the remaining capacity of the target computer 18 to retrieve video data signals from the slow video storage device 20 (i.e. the capacity of the video cache 22) while the target computer 18 is operating on the video game program during the current path A. If there is remaining capacity, the translating program continues at step 140, arranging the computer program to retrieve from the video storage 20, video data signals characterized by video scenes associated with third branches D, E, F, and G of the video game program, the third branches D and E being associated with the user input node at the end of the second branch B, and the third branches F and G being associated with the user input node at the end of the second branch C.
  • the translating computer program may arrange the video game program to retrieve from the video storage device 20 less than all of the video signal data associated with the scenes for the third branches D, E, F, and G, while substantially simultaneously the video game program is executing the video program of current video path A.
  • the translating program would preferably arrange the video game program to retrieve video data signals for video scenes only up to a point 46 in branch D, a point 48 in branch E, a point 50 in branch F, and a point 52 in branch G.
  • the time T E to retrieve the video signal data associated with the scenes from the beginning of branch E to the point 48, the time T F to retrieve the video signal data associated with the scenes from the beginning of the branch F to the point 50, and the time T G to retrieve the video signal data associated with the scenes from the beginning of branch G to the point 52 are equal to the constraint of video data signal retrieval time, for those respective branches.
  • pre-fetching of video data signals is not limited to one branch ahead. The video data signals of the branches not selected may then be discarded from cache memory 22.
  • video data signals for the video scenes associated with the latency time of T E would be supplied from the cache memory 22, while the slow storage device 20 retrieved video data signals for video scenes after point 46.
  • a further embodiment according to the present invention is particularly useful when the target computer's associated video storage medium 20, on which the video data signals are stored, is only sequentially accessible.
  • the video data signals are arranged on the storage medium 20 in the sequence that they are to be retrieved by the arranged computer program.
  • Fig. 4 calculate the capacity of the target computer to retrieve video data signals from the slow video storage device while the target computer is operating on the video game program during the current path.
  • step 220 arrange the video data signals on the video storage device such that video data signals associated with first branches of the video game program are retrievable after video data signals associated with the current path of the video game program, while the target computer is operating on the current path of the video game program and the target computer has capacity to retrieve video data signals from the video storage.
  • step 230 calculate capacity for the target computer to further retrieve video data signals from the video storage.
  • step 240 arrange the video data signals on the video storage device such that video data signals associated with second branches of the video game program are retrievable after video data signals associated with the first branches of the video game program, while the target computer has capacity to retrieve video data signals from the video storage. That is, at step 210, the translating program calculates the capacity of the target computer 18 to retrieve video data signals from the slow video storage device 20 (i.e. the capacity of the video cache 22) while the target computer 18 is operating on the video game program during the current path A.
  • the translating program arranges the video data signals on the video storage device 20 such that video data signals associated with the first branches B and C of the video game program are retrievable after the video data signals associated with the current path A of the video game program, while the target computer 18 is operating on the current path
  • a of the video game program and the target computer 18 has capacity to retrieve video data signals from the video storage 20.
  • the translating program arranges only an amount of the video signal data associated with the first branches B and C of the video game program sufficient for the video game program to display video scenes of any first branch B or C chosen by a user within the limitations of the target computer 18 (i.e. up to points 42 and 44, respectively).
  • the video data may be arranged to be retrieved from the video storage device 20 only those video data signals characterized by video scenes associated with the first branches B and C that are not associated with the current path A.
  • the translating program may continue to a step 230, where it calculates remaining capacity, for the target computer 18 to further retrieve video data signals from the video storage 20. If there is remaining capacity, the translating program continues at step 240, arranging the video data signals on the video storage device 20 such that video data signals associated with the second branches D, E, F, and G of the video game program are retrievable after video data signals associated with the first branches B and C of the video game program, while the target computer 18 has capacity to retrieve video data signals from the video storage 20.
  • the foregoing method describes the translating program being able to arrange the video game program such that during the execution of the video program in the current video path, the video program would also substantially simultaneously retrieve video data signals from branches not associated with the current path, all within the hardware constraint of the target computer 18, to eliminate latency.
  • the translating program can cause the video game program to be arranged on the slow storage device 20, in any one or all of the following manners, and also overcome the latency requirement.
  • the translating program can cause compressed video data signals to be stored on the slow storage device 20.
  • the calculation of latency must take into account the amount of time needed by the CPU 24 to decompress the video data signals.
  • only the video data signals associated with the pre-fetch segment of each branch need to be compressed.
  • Compressed video data signals require less storage space than uncompressed video data signals.
  • the retrieval of a lesser amount of data signals from a slow storage device 20 would require less capacity or bandwidth for retrieval.
  • the translation program can cause the further compression of the video data signals. Further compression of video data signals can, however, cause the loss of video fidelity, but does result in less storage space, and therefore requires less capacity for retrieval.
  • the translation program could also cause the video frame rate to be uniformly decreased. Thus, for example, real time video requires 30 frames per second. However the translation program could cause, for example, every third frame to be a repeat of every second frame. While the result would be video that may appear to be "jerky", it would require less video storage space, again resulting in a decrease in capacity required during retrieval.
  • the audio signals may be compressed.
  • FIG. 5 there is shown a plan view of a rotating storage media 70, such as CD-ROM.
  • the rotating platter 70 on which are stored the video signals rotate in the direction shown by the arrow R.
  • a rotating storage medium such as a DVD
  • the data signals are stored in tracks, which are concentric circles.
  • the video data signals for the current path A are stored in a segment of a track shown as 72.
  • One method to reduce the latency time is to arrange the video data signals for the video data signals for branch B to be an immediate contiguous continuation of the track segment 72 on which are arranged the video signals for the current path A. This would result in virtually zero or negligible latency time for the video data signals for branch B.
  • there is a limit as to the number of times in which this technique can be used since available storage space on the disc 70, may limit the placement of different segments of video data signals associated with different branches.
  • the video data signals for the other branch e.g. branch C must be arranged on the disc 70. Since the location which is the contiguous continuation of the track segment 70 is taken, the video data signals for branch C must be arranged in a track different from the track 72, such as track 74. As between track segment 74A and 74B, depending upon the time it would take the head containing the read/write transducers to traverse the distance from track 72 to track 74, by the time the head is positioned over track 74, either segment 74A or segment 74B would be closer to the head. The latency time would then be the time for the disc 70 to rotate into position such that track segment 74A or 74B is read by the transducer.
  • the developing computer can calculate the amount of time required for the transducer head to traverse the radial distance from track 72 to track 74, and record the video information of branch C at the track segment (74A or 74B) closest to the position of the transducer to minimize the latency of the head moving to the recorded segment.
  • FIG 6 there is shown a flowchart of a third embodiment of a method of the present invention.
  • This embodiment is very similar to the embodiment shown and described in Figure 3. However, it incorporates, the steps described heretofore, with regard to the case if the latency time cannot be reduced by the embodiments described in the first and second embodiments.
  • step 300 assume the placement of the video data signals on the slow video storage in some location.
  • step 310 calculate the capacity of the target computer to retrieve video data signals from the slow video storage device while the target computer is operating on the video game program during the current path.
  • step 315 determine if the location of the video data signals, and the capacity of the target computer are within the latency constraints of the target computer.
  • step 316 if not, change the following parameters, in the following order; and return to step 310; a. alter the location of the video data signals; b. compress or further compress the video signals, including change the video frame rate; c. compress or further compress the audio signals.
  • step 320 if yes, arrange the video game program to retrieve video data signals associated with first branches of the video game program while the target computer 18 has capacity to retrieve video data signals from the video storage.
  • step 330 calculate preserved capacity to further retrieve video data signals from the video storage 20.
  • step 340 arrange the video game program to retrieve from the video storage video data signals characterized by video scenes associated with second branches of the video game program.
  • the translation program assumes the video data signals are placed at certain locations on the CD-ROM.
  • the choice of the particular location for the video segments A,B,C etc. may be simply based upon "next available" immediately contiguous track segment, or any other type of assumption.
  • step 310 the calculation of the capacity of the target computer to retrieve video data signals is similar to the method for step 1 10, shown and described in Figure 3.
  • the translation program determines if the location of the video data signals, and the capacity of the target computer are within the latency constraints of the target computer. In other words, based upon the placed locations for the video data signals, would the retrieval time for those video signals, and the capacity be within the latency constraint requirements.
  • the translation program advances to step 316 if the locations on the CD-ROM would not fit within the constraint of the latency time. At that point in the order of preference to alter the parameters, the translation program performs the following functions: a. alter the location of the video data signals. This is the first choice since, it does not involve any alteration of video compression, frame rate etc. all of which might impact the user enjoyability and/or require further hardware resources (such as processing capability, in the case of compression). b. If after attempting to alter the location of the video data signals still does not result in the video signals being retrievable within the latency time, then the translation program can cause the compression or the further compression of the video signals. This would also include the possibility of reducing the video frame rate, as discussed heretofore, c.
  • the translation program can cause the compression or further compression of the associated audio signals.
  • the program returns to step 310. If the translation program determines that the location of the video data signals, and the capacity of the target computer are within the latency constraints of the target computer, then at step 320 the translation program arranges the video game program similar to step 120, all as described previously. From there, the translation program advances to step 330, which is similar to step 130. From step 330, the translation program advances to step 340, which is similar to step 140.
  • audiovisual signals shall mean either video or audio signals.

Landscapes

  • Engineering & Computer Science (AREA)
  • General Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Software Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Television Signal Processing For Recording (AREA)

Abstract

La présente invention concerne des procédés permettant de s'assurer que, pour un ordinateur d'exécution particulier (18), des signaux de données vidéo caractérisés par des scènes vidéo associées à toutes les branches (42-52) du programme provenant d'un n÷ud d'entrée (40) d'utilisateur sont rappelés d'un support d'information lent (20) avec une certaine anticipation par rapport au besoin correspondant, afin de surmonter la contrainte du temps de rappel vidéo de l'ordinateur d'exécution. Le procédé est mis en ÷uvre par calcul de la capacité de l'ordinateur d'exécution en ce qui concerne le rappel de signaux de données vidéo (110, 130) et confection d'un programme pour rappeler des signaux de données vidéo, associés à des premières et à des deuxièmes branches du programme, avec une certaine anticipation par rapport au besoin correspondant (120, 140). Le fait de surmonter la contrainte de temps de rappel vidéo accroît le réalisme du jeu.
PCT/US1995/013871 1994-10-28 1995-10-27 Compilateur de jeux video a portage et procede d'utilisation d'un jeu video WO1996013773A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US33121494A 1994-10-28 1994-10-28
US08/331,214 1994-10-28

Publications (1)

Publication Number Publication Date
WO1996013773A1 true WO1996013773A1 (fr) 1996-05-09

Family

ID=23293047

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US1995/013871 WO1996013773A1 (fr) 1994-10-28 1995-10-27 Compilateur de jeux video a portage et procede d'utilisation d'un jeu video

Country Status (1)

Country Link
WO (1) WO1996013773A1 (fr)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5261072A (en) * 1991-10-31 1993-11-09 Tandy Corporation Compact disk data transfer system using cache memory
US5339238A (en) * 1991-03-07 1994-08-16 Benson Thomas R Register usage tracking in translating code for different machine architectures by forward and reverse tracing through the program flow graph
US5355480A (en) * 1988-12-23 1994-10-11 Scientific-Atlanta, Inc. Storage control method and apparatus for an interactive television terminal

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5355480A (en) * 1988-12-23 1994-10-11 Scientific-Atlanta, Inc. Storage control method and apparatus for an interactive television terminal
US5339238A (en) * 1991-03-07 1994-08-16 Benson Thomas R Register usage tracking in translating code for different machine architectures by forward and reverse tracing through the program flow graph
US5261072A (en) * 1991-10-31 1993-11-09 Tandy Corporation Compact disk data transfer system using cache memory

Similar Documents

Publication Publication Date Title
US6867782B2 (en) Caching data in a processing pipeline
KR100618289B1 (ko) 신호기록방법및장치,신호기록/재생방법및장치,및신호기록매체
US5754730A (en) Method for predicting what video data should be in a cache which is in a disk-based digital video recorder
US6343298B1 (en) Seamless multimedia branching
US6449687B1 (en) Computer readable medium and information processing apparatus
US5607356A (en) Interactive game film
US5228859A (en) Interactive educational and training system with concurrent digitized sound and video output
US5924071A (en) Method and apparatus for optimizing a playlist of material
KR930009779B1 (ko) 디지틀정보 입출력장치와 디지틀정보 입출력방법
JP2000067522A (ja) 情報再生装置および方法、情報記録装置および方法、提供媒体、並びに記録媒体
US5619731A (en) Interactive music CD and data
US20020089519A1 (en) Systems and methods for creating an annotated media presentation
WO2004102465A2 (fr) Procede et appareil destines a reproduire des sequences video lors du chargement de donnees de jeu
CN1072280A (zh) 对多种方式播放中特定的段进行高效指定与检索的方法与系统
JPH10162560A (ja) 映像編集方法、及びノンリニア映像編集装置
JP2895064B2 (ja) 静止画ファイル方法、静止画再生装置および静止画ファイル記憶媒体システムならびに静止画ファイル装置
US5708846A (en) System for retrieving initial data sequence corresponding to next data sequence while locating next data sequence when branch point is reached during current data sequence
JP3752256B2 (ja) マルチメディアデータ記録再生装置及びマルチメディアデータ生成方法
JPH08195022A (ja) ディスク再生装置、カラオケシステム及びディスク再生方法
JP2736070B2 (ja) 静止画ファイル編集装置
WO1996013773A1 (fr) Compilateur de jeux video a portage et procede d'utilisation d'un jeu video
US5293606A (en) Apparatus and method for transferring interleaved data objects in mass storage devices into separate destinations in memory
US6816667B1 (en) Memory efficient method and apparatus for determining run times of DVD titles
CN1327584A (zh) 盘播放状态显示
RU2370833C2 (ru) Носитель записи, несущий видеосигнал и, по меньшей мере, один дополнительный информационный сигнал

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): CA JP KR

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): AT BE CH DE DK ES FR GB GR IE IT LU MC NL PT SE

DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
121 Ep: the epo has been informed by wipo that ep was designated in this application
122 Ep: pct application non-entry in european phase