MXPA99010566A - Recording/reproduction and/or editing of real time information on/from a disc likerecord carrier - Google Patents

Abstract

Various measures are proposed for enabling simultaneous reading and writing of real time information, such as a digital video signal, from/onto a disc-like record carrier. The measures embody a requirement to the size of the blocks of information recorded in fixed sized fragment areas on the record carrier. Further, measures are disclosed to enable reproduction and seamless editing. The seamless editing method requires the generation of one or more bridging blocks to be recorded in fixed size fragment areas on the disk like record carrier.

Description

REGISTRATION / REPRODUCTION AND / OR EDITING OF REAL-TIME INFORMATION ON / OF A REGISTER CARRIER SUCH AS A DISC DESCRIPTION OF THE INVENTION The invention relates to an apparatus for recording a real-time information signal, such as a digital video signal, on a record carrier such as a disk, with an apparatus for editing an initially registered information signal. on the record carrier such as a disk, with the corresponding methods for recording / editing information, with a reading device for reading the information signal and with a record carrier. The record carrier can be of the magnetic or optical type. The apparatus for recording a real-time information signal, such as a video information signal encoded by MPEG on a record carrier is known from USP 5,579,183 (PHN 14818). The record carrier in such a document is longitudinally. Disk-like record carriers have the advantage of a short access time. This allows the possibility of carrying out the "simultaneous" recording and reproduction of information signals on / of the record carrier. During the registration and reproduction, the information must be recorded on / reproduced from the record carrier, so that a real-time information signal can be recorded on the record carrier and at the same time an information signal in time. The initial purpose of the invention is to provide the measures to allow the different requirements, such as those described above In accordance with the invention, the apparatus for recording an information signal in real time, such as a digital video signal, on a record carrier such as a disk, a data recording portion which is subdivided into fragmented areas of fixed size, comprises - input means for receiving the information signal , - signal processing means for processing the information signal in a channel signal p To record the channel signal on the record carrier such as a disk, - writing means for writing the channel signal on the record carrier, the signal processing means is adapted to convert the information signal into information blocks of information. the channel signal, the writing is adapted to eTscribe a block of information of the channel signal in a fragmented area on the record carrier, and where the signal processing is further adapted to convert the information signal into the blocks of information of the channel signal, so that the size of the information blocks can be made variable and satisfies the following relationship: SFA / 2 < size of a block of the channel signal < SFA, where SFA is equal to the fixed size of the fragmented area. In addition, the apparatus for preventing a real-time information signal, such as a digital video signal, recorded in a previous registration step on a record carrier such as a disk, a data record portion which is subdivided in fragmented areas of fixed size, the information signal is converted into a channel signal before being recorded and after being registered on the record carrier, so that the information blocks of the channel signal are recorded in the areas corresponding fragments on the record carrier, comprises: - input means for receiving an output position in a first recorded information signal on the record carrier to receive an entry position in a second information signal, which may be the first information signal, recorded on the record carrier, means for storing information related to the exit position and input, means generating union blocks to generate at least one information binding block, information binding block which comprises information of at least one of the first and second information signals, information signal which is located before the output position in the first information signal and / or after the entry position in the second information signal, and where the size of the information binding block can be variable and satisfies the relationship: SFA / 2 < size of a union of information block < SFA, where SFA is equal to the fixed size of the fragmented areas, writing means for writing at least one information binding block in a corresponding fragmented area, and means for reproducing the edited stream Ide information of the record carrier.

In addition, the apparatus for reading, a real-time information signal, such as a digital video signal, of a record carrier such as a disk, the information signal is recorded in the channel in coded form in a registration portion. of data of the record carrier, the data record portion is subdivided into fragmented areas of fixed size, information blocks of the information signal encoded by channel are recorded in the corresponding fragmented areas, the size of the information blocks can be be variable and satisfy the following relationship: SFA / 2 < size of a block information channel-signal = SFA, where SFA is equal to the fixed size of the fragmented areas, the apparatus comprises: means for reading the channel signal of the record carrier, signal processing means for processing the variable-size information blocks and reading of the fragmented areas in portions of the information signal, means for transmitting the information signal.

An additional advantageous embodiment is characterized in that the information blocks of a consecutive sequence alternatively satisfy the following relation: SFA / 2 < size of a block of the channel signal < SFA and size of a designated channel block = SFA. This leads to a more efficient occupation of the space or facilitates the requirements of an apparatus. Another advantageous embodiment with the same advantages as above is characterized in that the information blocks of a consecutive sequence satisfy the following relationship: 2SFA / 3 = size of μn block of the channel signal < SFA These and other aspects of the invention will be apparent from and will be deduced with reference to the modalities subsequent to the description of the figures, in which Figure 1 shows a modality of the apparatus, Figure 2 shows the registration of the blocks of information in fragmented areas on the record carrier, Figure 3 shows the principle of reproduction of a video information signal, Figure 4 shows the principle of editing the video information signal, Figure 5 shows the principle of reproduction and "simultaneous" registration, Figure 6 shows a situation during editing when the generation and registration of the information junction block is not required, Figure 7 shows an example of the edition of a video information signal and the generation of an information junction block, in the place of an exit point of the information signal, Figure 8 shows another example of the edition of an information video information signal and the generation of an information junction block, in the same place of the exit point as in Figure 7, Figure 9 shows an example of (the. editing of a video information signal and the generation of an information binding block, in the place of an entry point to the information signal, Figure 10 shows an example of the edition of two information and generation signals of an information junction block, Figure 11 shows an example of the "editing" of two information signals and the generation of an information junction block, where the edition includes recoding some of the information of the two information signals. Figure 12 shows the further elaboration of the apparatus, Figure 13 shows the sequences of the fragments illustrating three embodiments of the invention respectively, which satisfy the HF condition, the condition HFFF and the condition 2/3, Figure 14 shows the general case of the creation of the union or bridges in reassignment, Figure 15 shows the situation in the worst case for the creation of a union or bridge assuming an HFFF condition, with figures 16-21 illustrating the different allocation strategies in this case, Figure 22 shows the result of the creation of the junction or bridge without reallocation of a FF flow locally, with figures 23-24 illustrating the different allocation strategies in this case, Figure 24A shows a junction or bridge assuming a 2/3 condition containing only MPEG data, with figures 24B-36 illustrating the different allocation strategies in this case. Figure 1 shows an embodiment of the apparatus according to the invention. The following description of the figures, attention will focus on the recording, reproduction and editing of a video information signal,, SinHowever, it should be noted that other types of signals could be equally processed, such as audis signals or data signals. The apparatus comprises an input terminal 1 for receiving one. video information signal to be recorded on the record carrier such as a disk 3. Further, the apparatus comprises an output terminal 2 for supplying a reproduced video information signal of the record carrier 3. The record carrier 3 is a record carrier such as a disk of magnetic or optical form. The data area of the record carrier such as a disk 3 consists of a contiguous range of physical sectors, having corresponding sector addresses. That address space is divided into fragmented areas. A fragmented area is a contiguous sequence of sectors, with a fixed length. Preferably, this length corresponds to an integer number of ECC blocks included in the video information signal to be recorded. The apparatus shown in Figure 1 is shown decomposed into two main parts of the system, namely the disk subsystem 6 and what is known as the "video recorder subsystem" 8. The following characteristics characterize the two subsystems: - The disk subsystem can be managed transparently in terms of logical addresses. This handles the management of defects (which ™ implies the mapping of logical addresses on physical addresses1), in an autonomous way. For real-time data, the disk subsystem is directed on a basis related to the fragment. For data driven in this way, the disk subsystem can guarantee a maximum sustainable bit rate for reading and / or writing. In the case of simultaneous reading and writing, the disk subsystem handles the reading / writing and the associated intermediate memory of the flow data of the independent reading and writing channels. For data in non-real time, the disk subsystem can be managed on a sector basis. For data addressed in this way, the disk subsystem can not guarantee any sustainable bit rate for reading or writing. - The video recorder subsystem cares for the video application, as well as the administration of the file system. As a result, the disk subsystem does not interpret any of the data recorded in the data area of the disk. To perform real-time playback in all situations, the fragmented areas introduced at the beginning need to have a specific size. Also, in a situation where simultaneous recording and reproduction takes place, the reproduction must be uninterrupted. In the present example, the size of the fragment is chosen so that it satisfies the following requirement: fragment size = 4 MB = 2 22 bytes The recording of a video information signal will be discussed briefly hereinafter with reference to Figure 2. In the video recorder subsystem, the video information signal, which is a real-time signal, is converted into a video signal. a real time file, as shown in figure 2a. A real-time file consists of a sequence of information signal blocks registered in corresponding fragmented areas. There is no restriction on the location of the fragmented areas on the disk and, consequently, two consecutive fragmented areas comprising portions of information of the recorded information signal can be anywhere in the logical address space, as shown in FIG. Figure 2b. Within each fragmented area, the real-time data is assigned contiguously. Each real-time file represents a single AV stream. The AV flow data is obtained by concatenating the fragmented data in the sequence order of the file. Next, a reproduction of a recorded video information signal on a record carrier with reference to FIG. 3 will be discussed briefly hereinafter. The reproduction of a recorded video information signal on the record carrier is controlled by means of what is known as "reproduction control program" (PBC program). In general, each PBC program defines a (new) playback sequence. This is a sequence of fragmented areas with, for each fragmented area, a specification of a data segment that has been read from that fragment. Reference is made in this respect in Figure 3, where the reproduction of only a portion of the first three fragmented areas in the sequence of fragmented areas in Figure 3 is shown. A segment may be a complete fragmented area, but in general it will be only part of the fragmented area. "(The latter usually occurs around the transition from some part of an original record to the next part of it or another record as a result of editing.) Note, that the simple linear reproduction of an original record can be considered a case special of a PBC program: in this case, the playback sequence is defined as the sequence of fragmented areas in the real-time file, where each segment is a complete fragmented area except, probably for the segment in the last fragmented area of the file For the fragmented areas in a sequence of reproduction, there is no restriction on the location of the fragmented areas and, consequently, any two consecutive fragmented areas can be anywhere in the logical address space. brief here, later, the edition of one or more video information signals recorded about the po Record player with reference to Figure 4. Figure 4 shows two video information signals initially recorded on the record carrier 3, indicated by two sequences of fragments named "file A" and "file B". To make an edited version of one or more video information signals initially recorded, a new PBC program must be made to define the edited AV sequence. This new PBC program thus defines a new AV sequence obtained by concatenating parts of the initial AV registers in a new order. The parties can be from the same registry or from a different registry. To play a PBC program, the data of the different parts of (one or more) real-time files have to be provided to a decoder. This implies a new flow of data that is obtained by concatenating parts of the flows represented by each file in real time. In Figure 4, this is illustrated by a PBC program that uses three parts, one from file A and two from file B. Figure 4 shows that the edited version starts at a point P_ in the fragmented area f (i) in the sequence of fragmented areas of figure A and continues to point P2 in the new fragmented area f (i + 1) of file A. Then playback jumps to point P3 in the fragmented area f (j) in file B, and continues to point P4 in the fragmented area f (j + 2) in file B. Then playback jumps to point P5 in the same file B, which may be a higher point in the sequence of fragmented areas from file B to point P3, or a later point in the sequence to point P. Next, a condition for seamless reproduction during simultaneous registration will be discussed. In general, seamless reproduction of PBC programs can be done under certain conditions. The most severe conditions are required to guarantee the seamless reproduction that takes place simultaneously in the registry. A simple condition will be produced for this purpose. This is a restriction on the length of the data segments that occur in the reproduction sequences, as follows: to guarantee the seamless simultaneous reproduction of a PBC program, the reproduction sequence defined by the PBC program must be such that the length of the Segment in all fragments (except the first and last fragmented areas) must satisfy: 2 MB < segment length < 4 MB The use of fragmented areas allows consideration of the operating requirements at worst in terms of the fragmented areas and the segments (the signal blocks stored in the fragmented areas) only, as will be described hereinafter. This is based on the fact that it is guaranteed that the unique logical fragmented areas, and consequently the data segments within the fragmented areas, are physically contiguous on the disk, even after being traced again due to defects. Among the fragmented areas, however, there is no such guarantee: logically, consecutive fragmented areas can be arbitrarily far away on the disk. As a result of this, the analysis of the operation requirements concentrates on the following: a. For reproduction, it is considered that a data stream of a sequence of segments on the disk is read. Each segment is contiguous and has an arbitrary length of between 2 MB and 4 MB, but the segments have arbitrary locations on the disk. b. To register, it is considered that a data stream must be written in a sequence of fragmented areas of 4 MB on the disk. Fragmented areas have arbitrary locations on the disk. Note that for reproduction, the length of the segment is flexible. This corresponds to the condition of the segment for seamless reproduction during simultaneous registration. For the record, however, segmented areas with fixed length are described. Given a data flow to record and reproduce, we will concentrate on the disk subsystem during simultaneous recording and playback. It should be assumed that the video recorder subsystem delivers a sequence of segment measurements for the registration and playback flow in advance. For simultaneous recording and playback, the disk subsystem must be capable of interleaving the read and write sections, so that the recording and playback channels can guarantee sustained operation at peak speed without overflowing or maintaining a low flow in the buffer In general, different R / W programming algorithms can be used to achieve this. There are, however, strong reasons to do the programming in such a way that the cycle time from R / W to peak speed is as short as possible: - Shorter cycle times involve smaller buffer sizes for memory intermediate reading and writing, and consequently for the total memory in the disk subsystem. Shorter cycle times imply shorter response times to user sections. As an example of response times, consider a situation where the user is performing simultaneous recording and playback and suddenly wants to start playing from a new position. To keep the total response time of the device (visible to the user on its screen) as short as possible, it is important that the disk subsystem be able to start the flow data distribution from the new position as soon as possible. Of course, this must be done in such a way that, once the distribution is started, a reproduction at peak speed is guaranteed. Also, writing must continue uninterrupted with guaranteed performance. For the analysis here, a programming method is assumed, based on a cycle in which a complete fragmented area is written. For the analysis of the parameters of subsequent operation, it is sufficient to consider the minimum cycle time under the worst-case conditions. Such a cycle in the worst case consists of a writing interval in which a segment of 4 MB is written, and a reading interval in which they read at least 4 MB, divided into one or more segments. The cycle includes at least 2 jumps (to and from the place of writing), and possibly more, due to the lengths of the segments for flexible reading and can be less than 4 MB. This can result in additional jumps from one place in the joined segment to another. However, since the segments read are not less than 2 MB, more than two additional jumps are necessary to collect the total of 4 MB. In this way, an R / W cycle in the worst case has a total of four jumps, as illustrated in Ta figure 5. In this figure, x denotes the last part of a segment read, and denotes a segment of complete union, with a length of _____, _ = between 2 MBfc ~ and 4"MB, (yz denotes," the first part of a segment read and the total size of x, y and z is again 4 MB in this example. "In general, the drive parameters required to achieve a guaranteed performance for the simultaneous reproduction record depends on major design decisions such as rotational mode, etc. These decisions in turn depend on the characteristics of the media.

The conditions formulated above for seamless reproduction during simultaneous registration are derived so that they can satisfy the different designs with real parameters. To show this, we discuss the example of a CLV (constant linear speed) drive design here. In the case of a CLV design, the transfer rates for reading and writing are the same and independent of the physical location on the disk. Therefore, the "worst-case cycle" described above can be analyzed in terms of only two drive parameters: the transfer rate R and the total access time in the worst case t. in the worst case t is the maximum time between the end of the transfer of data on one place and the beginning of the transfer of data on another place, for any, couple of places in the data area of the disk. covers the rise / fall of disk speed, rotational latency, possible recoveries, etc., but not processing delays, etc. For the worst-case cycle described in the previous section, all jumps can be jumps in the worst case of duration T. This gives the following expression for the cycle time in the worst case: Tmax = 2F / Rt + 4.t where F is the size of the fragment: F = 4 MB = 33.6.106 bits. To ensure a sustainable operation at the peak speed of user R, the following must be satisfied: F > R.Tmax This produces: R < F / Tmax = Rt-F / 2. (F + 2Rt.t) "As an example, with Rt = 35 Mbps and t = 500 ms, we will have: R < 8.57 Mbps." The next edition will be described further: Creating a new PBC program or editing an existing PBC program usually results in A new sequence of reproduction The adjective is to ensure that the result is reproducible seamlessly under all circumstances, even during simultaneous registration A series of examples will be discussed, where it was assumed that the user's intention is to make a new AV flux outside of one or two existing AV flows, the examples will be discussed in terms of two flows A and B, where the user's intention is to make a transition from A to B. This is illustrated in Figure 6, where a is the intended exit point of flow A and where b is the intended entry point in flow B. Figure 6A shows the sequence of fragmented areas, f (il), f (i), f (i + l), f (i + 2) , .... of flow A and figure 6b shows the sequence of fragmented areas, f (j-l), f (j). f (j + l), f (j + 2), .... of flow B. The edited video information signal consists of the portion of the stream A that precedes the exit point A in the fragmented area f ( i + l), and the portion of the flow B starting from the entry point b in the fragmented area f (j). This is a general case that covers the entire edition such as - cut and paste, including the annexation of two flows, etc. It also covers the special case where A and B are equal. Depending on the relative position of A and B, this special case corresponds to PBC effects such as skipping a part of the flow or repeating a part of the flow. The discussion of the examples focuses on achieving seamless reproducibility during simultaneous registration. The condition for seamless reproducibility is the condition of the length of the segment over the length of the information signal blocks stored in the fragmented areas, which was discussed at the beginning. It will be shown later that, if flows A and B satisfy the length condition of the segment, then a new flow can be defined so that it also satisfies the segment length condition. In this way, reproducible streams can be avoided seamlessly in new, seamlessly reproducible streams. Since the original records are reproducible seamlessly by construction, this implies that any flow avoided will be reproducible seamlessly. As a result, it is possible to arbitrarily avoid the initially edited streams. Therefore the flows A and B in the discussion do not need to be original records: they can be arbitrary results of the first steps of virtual editing. In a first example, a simplified assumption will be made about the AV encoding format and the choice of the exit and entry points. It is assumed that points a and b are such that, from the point of view of the AV coding format, it would be possible to make a direct transition. In other words, it is assumed that the direct concatenation of the data from flow A (editing at the output point a) and the data from flow B (starting from entry point b) results in a valid flow as well as the format of related AV coding. The above assumption implies that in principle a new reproduction sequence can be defined based on the existing segments. However, for seamless reproducibility in the transition from A to B, we have to make sure that all segments satisfy the segment length condition. Let's concentrate on flow A and see how to ensure this. Consider the fragmented area of flow A that contains the exit point a. Let s be the segment in this fragmented area that ends at point a, see figure ßa. If l (s), the length of s, is at least 2 MB, then we can use this segment in the new reproduction sequence and point a is the output point that should be stored in a PBC program. However, if l (s) is less than 2 MB, then the resulting segment s does not satisfy the condition of length i, of the segment. This is shown in Figure 7. In this case a new fragmented area is created, the so-called fragmented junction area f '. In this fragmented area, a junction segment comprising a copy of s preceded by a copy of some preceding data in stream A is stored. For this, consider the original segment r preceding s in. the flow A, shown in figure 7a. Now, depending on the length of r, the segment stored in the fragmented area f (i), copies all or part of r into the new fragmented area f: If l (r) + l (s) < 4 MB, then the entire r is copied to f, and the original segment r is not used in the new reproduction sequence, as illustrated in Figure 7a. More specifically, the new exit point is the point denoted as a ', and this new exit point a' is stored in the PBC program, and subsequently, after having finished in the editing step, recorded on the carrier record similar to the disk. In this way, in response to this PBC program, during the reproduction of the edited video information stream, after having read the information stored in the fragmented area f (il), the program jumps to the area of the joining fragment f ', to reproduce the information stored in the area of the binding fragment f ', and then jump to the entry point in the video stream B to reproduce the portion of the flow B, as shown schematically in figure 7b. If l (r) + l (s) > 4 MB, then some part p of the end of r is copied to f ', where the length of p is such that we have 2 MB < l (r) -Kp) < 4 MB? 2 MB < 1 (p) + l (s) < 4 MB Reference is made to figure 8, where the figure; 8a f ~ shows the original flow A and figure 8b shows the flow A edited with the fragmented joining area f '. In the new reproduction sequence, only a smaller segment r 'is now used in the fragmented area f (i) that contains r. This new segment r 'is a subsegment of r, viz. the first part of r with length l (r ') = l (r) - 1 (p). In addition, a new exit point a 'is required, which indicates the position where the original flow A should be such as for a jump to the junction fragment f'. This new output position must therefore be stored in the PBC program, and finally stored on the disk. In the example given above, we discussed how to create a junction segment (or: the information junction block) for the fragmented area f ', in the event that the last segment in the A stream (ie s) becomes too short. Now we will concentrate on flow B. In flow B, there is a similar situation for the segment containing the entry point b, see figure 9. Figure 9a shows the original flow B and figure 9b shows the flow edited. Let t be the segment comprising the entry point b. If t becomes too short, a g junction segment can be created to be stored in a corresponding fragmented junction area. Analogous to the situation for the union area f ', g will consist of a copy of t plus a copy of some more data of flow B. This data is taken from the original segment u that happens at in the fragmented area f ( j + 1) in flow B. Depending on the length of u, all or part of u is copied into g. This is analogous to the situation for r described in the initial example. Now we will not describe the different cases in detail here, but Figure 9b gives the idea, by means of an illustration analogous to that of Figure 8, where u is divided into v and u '. This results in the new entry point b 'in the flow B, to be stored in the PBC program and, finally, on the record carrier. The following example, described with reference to Figure 10, shows how a new sequence can be defined seamlessly reproducible under all circumstances, creating at most two binding fragments (f 'and g). It can be shown that, in effect, a fragmented area of union is sufficient, even if both s and t are too short. This is achieved if s and t are copied into a single fragmented junction area (and, if necessary, some preceding data from flow A and / or some subsequent data from flow B). This will not be described broadly here, but Figure 10 shows the general result. In the examples described above, it was assumed that the concatenation of the flow data and the exit and entry points a and b are sufficient to create a valid AV flow. In general, however, some recoding has to be done to create a valid AV stream. This is usually the case if the exit and entry points are not in the GOP limits, when the encoded video information signal is a video information signal encoded by MPEG. The recoding will not be discussed here, but the general result will be that some binding sequence is necessary to go from flow A to flow B. Consequently, there will be a new departure point a 'and a new entry point b', and the binding sequence will contain recoded data corresponding to the original tables of a ' a a, followed by the original boxes from b to bv. Not all cases will be described in detail, but the total result is similar to the previous examples: there will be one or two binding fragments to cover the transition from A to B. In contrast to the previous examples, the data in the union fragments are now a combination of recoded data and some data copied from the original faith segments. Figure 11 gives a general flavor of this. As a final observation, note that no special restriction has been placed on the data recoded. The recoded flow data simply has to satisfy the same bit rate requirements as the data of the original stream. Figure 12 shows a schematic version of the The apparatus comprises a signal processing unit 100, which is incorporated in the subsystem 8 of FIG. 1. The signal processing unit 100 receives the video information signal via the input terminal 1, and processing the video information in a channel signal to record the channel signal on the record carrier such as a disk 3. In addition, a read / write unit 102 is available, which is incorporated in the disk subsystem 6. The read / write unit 102 comprises a read / write head 104, which is in the example hereof an optical read / write head for reading / writing the channel signal on / of the record carrier 3. In addition , positioning means 106 are present to place the head 104 in a radial direction through the registration carrier 3. A read / write amplifier 108 is present to amplify the signal to be recorded and amplified. The signal read from the record carrier 3 is available. A motor 110 is available to rotate the record carrier 3 in response to an engine control signal supplied by a motor control signal generating unit 112. A microprocessor is present. to control all circuits via control lines 116, 118 and 120. The signal processing unit is adapted to convert the video information received via the terminal of input 1 into information blocks of the channel signal "having a size specific. The size of the information blocks (which is the segment mentioned at the beginning) can be variable, but the size is such that satisfying the following relationship: SFA / 2 < size of a block of the channel signal < SFA, where SFA is equal to the fixed size of the fragmented areas. In the example given above, SFA = 4 MB. The writing unit 102 is adapted to write a block of information of the channel signal in a fragmented area on the record carrier. To allow editing of the recorded video information in an initial recoding step on the record carrier 3, the apparatus is further provided with an input unit 130 for receiving an output position in a first registered video information signal on the record carrier to receive an entry position in a second video information signal recorded on the same record carrier. The second information signal may be the same as the first information signal. In addition, the apparatus comprises a memory 132, for storing information related to the output and input positions. In addition, the apparatus comprises a junction block generating unit 134, incorporated in the signal processing unit 100, to generate at least one information junction blocks (or junction segment) of a specific size. As explained above, the information binding block comprises information of at least one of the first and second video information signals, information which is located before the output position in the first video information signal and / or after the entry position in the second video information signal. During the editing, as described above, one or more joining segments are generated in the unit 134 and in the editing step, one or more editing segments are recorded on the record carrier 3 in a corresponding fragment. The size of at least one information junction block also satisfies the relationship: SFA / 2 < size of an information binding block < SFA In addition, the PBC program obtained in the editing step may be stored in a memory incorporated in the microprocessor 114, or in another memory incorporated in the apparatus. The program can be created in the editing step for the edited video information signal will be registered on the record carrier, after the editing step has been completed. In this way, the edited video information signal can be reproduced by a different reproduction apparatus by retrieving the PBC program of the record carrier and reproducing the video information signal edited using the PBC program corresponding to the edited video signal. In this way, an edited version can be obtained, without recoded portions of the first and / or second video information signal, but simply by generating and registering one or more joint segments of corresponding fragmented shapes (union) on the record carrier. In the embodiment described above, fragments were created on the disk that are at least half-full. This will be called the HF condition while a fragment called FF if one is completely full. As shown above, after editing a flow that satisfies the HF condition, it is possible to ensure that the resulting flow also satisfies the HF condition. This requires assigning a single fragment to join or bridge. In the worst case, this may result in an A / V flow consisting of all half-full fragments. Figure 13A schematically illustrates such sequence of half full fragments HF. This flow places severe requirements on the operation of the disk drive.

Next, second and third modalities for recording and editing video / audio streams on a disc will be described. These modalities facilitate the situation in the worst case with respect to the occupation of the space that can occupy the first modality and that is illustrated in Figure 13A. The flow of fragments in the worst case resulting from a second mode is shown in Figure 13B. This flow satisfies a condition HFFF which implies that at least every second fragment is completely filled. The flow of fragments in the worst case resulting from a third mode is shown in Figure 13C. It is noted that the second and third modes also facilitate the requirements of an apparatus. This flow satisfies a condition 2 / 3F which implies that a minimum value of a fragment is greater than 2/3. Although this case will be considered in detail, other fullness values are also possible. It will be shown that to achieve any of these conditions, more than one fragment may be required for the bridges or junctions. First, the creation of a union or bridge is considered in the case of the first modality that satisfies the HF condition. Figure 14 shows the general case for creating a joint or bridge, the details are discussed in detail here later. Note that the fragments before and after the union or bridge may have originally been full fragments, but due to the choice of the editing points, the result is that they will be partially filled in the editing sequence. The only assumption is that the fragments before the bridge or junction, the binding fragment and the fragment after the bridge or union are at least half full. Next, we will show how to create a bridge or union in the case of the second modality that satisfies the HFFF condition. Figure 5 shows an edited sequence illustrating the situation in the worst case in this case. The original sequences, both the fragment before the bridge or union and the first fragment after the bridge or union must be full since it was assumed that the original flows satisfy the condition FFHF. First we will try to preserve the FFHF condition by reallocating the fragment before the bridge or junction, the binding fragment and the fragment after the bridge or union (reassignment of three fragments). In general, the following assumption can be made about the size of those fragments: 1. 5 < size (3 * HF) < 3 [i: where the units are the size of the fragment. This condition implies the following possibilities to reassign the three fragments: 1.5 < size (3 * HF) < '2 [2] 2 < size (3 * HF) < 2.5 [3] 2. 5 < size (3 * HF) < 3. 4] Possibly [1] can be reassigned as FF + HF, [2] as FF + HF + FF and [3] as FF + FF + HF. In the latter case, by reallocating the three fragments as FF HF and FF, it is possible to preserve the condition FFHF. However, the result is that the bridge or union requires three fragments instead of one, as illustrated in the figure. 16. In the other cases, it is not possible to preserve the FFHF condition by reallocating the three fragments. Therefore, it results from [1] and [2] the following condition: 1. 5 < size (3 * HF) < 2.5 [5] By adding a fourth HF fragment (reassignment of four fragments), this condition becomes: 2 < size (3 * HF) < 3.5 [6] This _condition implies the following possibilities for the reassignment of the four fragments: 2 = size (4 * HF) [7] 2 < size (4 * HF) < 2.5 [8] 2. 5 < size (4 * HF) < 3 [9] 3 < size (4 * HF) < 3.5 [10] Possibly [7] can be reassigned as FF + HF, [8] as FF + HF + HF, [9] as FF + FF + HF and [10] as FF + FF + HF + HF. In the second case [8], it is not possible to satisfy the condition FFHF. The third case [9] is shown in Figure 17. The fourth case [8] requires four fragments for the bridge or junction and is shown in Figure 18. However, possibly [8] implies that the first fragment "HF can make 0.5 and it can still be guaranteed that the FF segments can be filled in. But this means that only the first half of the original HF fragment can be taken in. This results in a union of three fragments, which is shown in Figure 18. A then possibly [8], which could not be reassigned, is added to the fifth fragment HF: 2.5 <size (5 * HF) < 3.5 [11] This possibly implies the following possibilities for the reallocation of five fragments: 2. 5 < size (5 * HF) < 3 [12] 2. 5 < size (4_THF) "= [13] In any case it is possible to reassign the five fragments to satisfy the HFFF condition. Figure 19 shows the first case [12] that requires the three fragments while Figure 20 shows the second case [13] that requires four fragments. However, as before, the possibility [13] implies that the first HF fragment [can be made 0.5 and this can still guarantee that the FF fragments "can be filled in. But this means that only the first half of the segment of the original HF fragment can This results in a bridge or union of three fragments as shown in Figure 21. Concluding, it is possible to satisfy the condition HFFF with a union or bridge in the worst case of three fragments. It is weaker than the FF condition, the previous analysis also covers the FF edition well.In most cases the flows that are being edited will be FF locally unless the user performs a number of very closed editions. If a FF flow is locally edited, it should be better than the worst case described above.The general case of editing a flow that satisfies the FF condition is shown in F Figure 22. Considering the three HF fragments, the following condition is valid: 1. 5 < size (3 * HF) < 3; 14] This ^ condition "implies the following possibilities for the reassignment of the three fragments: 1. 5 < size (3 * HF) < 2 [15] 2 < size (3 * HF) < 3 [16] Possibly [15] can be reassigned as FF + HF and [16] as FF + HF + HF. In the first case [15] it is possible to reassign the three fragments as two fragments as shown in Figure 23. It should be noted that in general it is not possible to use a single FF fragment for the junction or bridge and keep one of the original HF fragments . In the second case [16] it is possible to use a single fragment for the joint or bridge. Data from the other two fragments can be copied until the binding fragment is FF. This allows satisfying the HFFF condition with a single binding fragment. This is shown in Figure 24. Finally it is noted that the worst case will occur only where the user makes a number of closed editions. In the normal case, where the editions are separated by a few seconds, the union or bridge may require two fragments at most. The previous discussion of the second modality for a situation in the worst case, eventually together with the detailed discussion in the first modality, allows an expert in the technique to implement the creation of a union or bridge either in the programs and systems of programming or the physical components of computing or a mixture of programs and programming systems and the physical components of computing for all cases. It is noted that placing the HF condition according to the first modality with the HFFF condition will result in longer connections or bridges and thus the virtual edition requires more disk space than with the HF condition. However, in the case of the real edition, where the original stream can be discarded and only the edited stream is preserved on the disk, the second mode will actually save disk space. In a number of cases a group of partially filled fragments will be reassigned in a small number of fragments. Next, the third modality satisfying the condition 2/3 F will be discussed. It is remarked that in general, the greater the filling required by the fragments, the more fragments are required for the creation of the union or bridge. For example, the HF condition should be replaced with one where the minimum fragment fill is 0.75, that is, each fragment filled at least partially PF satisfies: 0. 75 < size (PF) < 1 [17] This gives the same filling of the average fragment in the worse case than the FFHF condition of 0.75. To preserve condition 0.75, four-fragment bonds or bridges are required in the worst case, even if the original flow is FF. Therefore, this option is not as good as the HFFF condition presented above. A condition 2/3 F gives a filling of the lowest average fragment in the worst case of the HFFF condition and consequently can be expected to require less reassignment than the HFFF condition. Figure 24 shows the starting point for the creation of a union or bridge assuming that the original flows satisfy the condition 2/3 F. Here D represents the part in the MPEG of the junction or bridge, that is, the part of the flows that must be copied, registered or remultiplexed to satisfy the MPEG requirements. No assumption can be made about filling the fragment directly after joining or bridging or the fragment directly after joining or bridging because the filling of those fragments will depend on the choice of editing points. A number of cases based on the filling of the fragments before and after the junction or bridge will be considered. "Figure 25 illustrates case 1. Here the fragment that precedes the junction or bridge as the fragment after the junction or bridge is filled more than 2/3 and the junction or bridge contains only the data required to satisfy the MPEG requirements. If Bl + D + B2> 2/3 [18] then there is no problem and the result is as shown in Figure 26. if Bl + D + B2 > 1 [19] then not all of Bl and B2 will be copied. Yes 2/3 + Bl + D < 1 [20] 2/3 + B2 + D < 1 [21] then there is no problem and the result as shown in Figure 27 and Figure 28 respectively. Assuming that 0 < Bl + D + B2 < 2/3 and adding _the content to the other two fragments gives: 4/3 < 2/3 + Bl + D + B2 +2/3 < 6/3 [22] In this case, it is possible to reassign the data in two fragments of at least 2/3 as shown in Figure 29. When the original flow was FF locally or not, it has no effect on the result in this case. Figure 30 shows the starting point for case 2. Here both fragments before joining or bridge and fragment after joining or bridge are at least 2/3 full. Yes 2/3 < Bl + D B2 < 1 [23] then there is no problem and the result is as shown in Figure 31. Now there are two situations to consider: Bl + D + b2 < 2/3 [24] and Bl + D + B2 > 1 [25] First, the first situation is discussed [24]. Adding all or part of Cl and C2 to make the fragment 2/3 is still a problem if Cl + C2 does not produce enough data. This happens when you have the following condition: Cl + Bl + D + B2 + C2 < 2/3 [26] Adding the rest of the previous and following fragments gives: 4/3 < 2/3 + Cl + Bl + D + B2 + C2 + 2/3 < 6/3 [27] These data can be reassigned as two fragments as_ is shown in Figure 32. Now the second situation is discussed [25]. This will only cause a problem in the case where: l < Bl + D + B2 + < 4/3 [28] Again all or part of Cl and C2 can be added to make the total at least 4/3 and thus there is a problem if: 1 < Cl + Bl + D + B2 + C2 < 4/3 [29] In this case, adding the previous or subsequent fragments gives: /3 < 2/3 + Cl + Bl + D + B2 + C2 < 6/3 [30] The data in this case can be assigned as two fragments as shown in Figure 10. If the original flow was FF locally then Cl = l / 3 and C2 = l / 3 and the first situation [24] a single fragment is sufficient for the union or bridge. In the second situation [25], two fragments are still required for the union or bridge. Figure 34 shows a starting point for case 3. Here the fragment before joining or bridge is filled less than 2/3 and the fragment after joining or bridge is more 2/3 full. Yes 2/3 < Bl + D + B2 [34] and Bl + D < 1 [35] then there is no problem and a single fragment can be used for the joint or bridge. There are two cases to consider: Bl + D + B2 < 2/3 [36] and 1 < Bl D < 4/3 [37; Now in the first case [36] add the rest of the fragment after the union or bridge gives: "2/3 < Bl + D + B2 + 2/3 < 4/3 [38] There is a problem if: 1 < Bl + D + B2 + 2/3 < 4/3. [39] Some or all of Cl and C2 can be added to ensure that the data can satisfy the two fragments, so there is a problem if: 1 < Cl + Bl + D + B2 + 2/3 + C2 < 4/3 [40] Adding the rest of the previous and following fragments, we obtain: /3 < 2/3 + CL + Bl + D + B2 + 2/3 + 2 < 6/3 [41] These data can be reassigned to two fragments as shown in Figure 35. Next, the second case will be considered [37]. Adding B2 is still possible if there is a problem if: 1 < Bl + D + B2 < 4/3 [42] Add the rest of the fragment after the union or bridge gives: /3 < Bl + D + B2 + 2/3 < 6/3 [43] This data can be reassigned to the fragments as shown in Figure 36. The bridge will still require two fragments even if the original flow was FF locally. Concluding, it is possible to replace the HF condition with a condition where when the fragment number is 2/3 of a full fragment. This requires a maximum of two fragments per one junction or bridge. The division of a FF flow locally will still require two fragments per link or bridge some case. Although the invention has been described with reference to the preferred embodiments thereof, it should be understood that "" there is not a limiting example. "In this way, the various modifications may be apparent to those skilled in the art, without departing from the scope of the invention. the invention, as defined by the claims, The size of the described fragment of 4 MB is characteristic of a specific modality The modalities may use other fragment sizes, such as 6 MB for example. note that the first generation of apparatuses according to the invention, capable of carrying out the recording and reproduction of a real-time information signal, may be able to register SFA fixed-size signal blocks in fragmented areas only, although they are capable of reproducing and processing blocks of variable-sized signals from fragmented areas to reproduce - an information signal in real time l of a record carrier that has variable size signal blocks stored in fragmented areas. The second generation of devices that are also capable of carrying out the editing step, will be able to register blocks of signals of variable size in fragmented areas.

In addition, the invention finds each and every one of the features or combination of novel features. The invention can be. implemented by the programs and programming systems and the physical components of computing, and those different "media" can be represented by the same type of physical computing components. In addition, the word "comprising" does not exclude the presence of other elements or steps different from those listed in the claims.

Claims (36)

1. CHAPTER CLAIMEDICATORÍO Having described the invention, it is considered as a novelty and, therefore, the content is claimed in the following CLAIMS: 1. An apparatus for recording a real-time information signal, such as a digital video signal, on a record carrier such as a disk, a data recording portion which is subdivided into fragmented areas of fixed size, characterized in that it comprises - input means for receiving the information signal, - signal processing means for processing the information signal in a channel signal for recording the channel signal on the record carrier such as a disk, - writing means for writing the channel signal on the record carrier, the signal processing means are adapted to convert the information signal into information blocks of the channel signal, the writing is adapted to write a block of information of the channel signal in an area fragmented on the record carrier, and where the signal processing is further adapted to convert the information signal n in blocks of information of the channel signal, so that the size of blocks of information can make variable and satisfies the following relationship: SFA / 2 < size of a block of the channel signal < SFA, where SFA is equal to the fixed size of the fragmented area. The apparatus according to claim 1, characterized in that the signal processing means is adapted to convert the information signal into the information blocks of the channel signal, so that the information blocks of a consecutive sequence satisfy alternatively the following relationship: SFA / 2 < size of a block of the channel signal < SFA, and size of a designated channel block = SFA. The apparatus according to claim 1, characterized in that the signal processing means is adapted to convert the information signal into the information blocks of the channel signal, so that the information blocks of a consecutive sequence satisfy alternatively the following relationship: 2. SFA / 3 < size of a block of the channel signal < SFA 4. The apparatus for editing a real-time information signal, such as a digital video signal, recorded in a previous registration step on a record carrier such as a disk, a data recording portion which is subdivided into fragmented areas of fixed size, the information signal is converted into a channel signal before being recorded and after being recorded on the record carrier, so that the information blocks of the channel signal are recorded in the corresponding fragmented areas on the record carrier, characterized in that it comprises: - input means for receiving an output position in a first recorded information signal on the record carrier to receive an entry position in a second information signal, which may be the first information signal, recorded on the registration carrier, means for storing information related to the position output and input, means generating junction blocks to generate at least one information junction block, information junction block which comprises information of at least one of the first and second information signals, information signal which is locates before the starting position in the first information signal and / or after the entry position in the second information signal, and where the size of the information binding block can be variable and satisfies the relationship: SFA / 2 = size of a union of information < SFA, where SFA is equal to the fixed size of the fragmented areas, writing means for writing at least one information binding block in a corresponding fragmented area, and - means for reproducing the flow of the information state of the record carrier. 5. The apparatus according to claim 4, characterized in that the means generating link blocks are adapted to generate a consecutive sequence of maximum three blocks of information link alternatively satisfies the following relationship: SFA / 2 = size of a block of the channel signal < SFA, and size of a designated channel block = SFA. 6. The apparatus according to claim 4, characterized in that the means generating link blocks are adapted to generate a consecutive sequence of maximum three information junction blocks alternatively satisfies the following relationship: 2. SFA / 3 < size of a block of the channel signal < SFA 7. The apparatus according to claim 1 or 4, characterized in that SFA is equal to 4 MB. The apparatus according to claim 4, characterized in that, when the amount of information in a first fragmented area of the first information signal comprising the exit position, from the beginning of the information block in that fragmented area to the position output is less than SFA / 2, then the means generating the junction block are adapted to generate the information information binding block in the first fragmented area preceding the exit position and at least a final portion of information stored in a second fragmented area, directly preceding the first fragmented area in the first information signal, so that the size binding information block requirement is satisfied. The apparatus according to claim 8, characterized in that the remaining information stored in the second fragmented area satisfies the relation: "- SFA / 2 <size of the remaining portion of information in the second fragmented area <SFA, and because the boundary between the remaining portion of information and the final portion of information in the second fragmented area is the new exit position of the first information signal, when the edited flow of information is reproduced by the apparatus, the apparatus further comprises means for storing information related to the new exit position. The apparatus according to claim 4, characterized in that, when the amount of information in a first fragmented area of the first information signal comprising the exit position, from the start of the information block in that fragmented area to the position output is smaller than SFA / 2, then the means generating the junction block are adapted to generate the information information binding block in the first fragment preceding the exit position and the information stored in a second area fragmented, directly preceding the first fragmented area in the first information signal. The apparatus according to claim 10, characterized in that the final position of the signal block in a third fragmented area directly preceding the second fragmented area in the first information signal is the new output position of the first signal of information, when the edited flow of information is produced by the apparatus, the apparatus further comprises means for storing information related to the new output position. The apparatus according to claim 4, characterized in that, when the amount of information in the first fragmented area of the second information signal comprising the entry position, from the entry position to the end of the information block in that fragmented area is smaller than SFA / 2, then the means generating the binding block are adapted to generate the information information binding block in the first fragmented area following the entry position and at least a portion of the information stored in a second fragmented area, directly after the first fragmented area in the second information signal, so that the requirement for the size of the information junction block is satisfied. The apparatus according to claim 12, characterized in that the remaining information stored in the second fragmented area satisfies the relation: SFA / 2 < size of the remaining portion of information in the second fragmented area < SFA, and because the boundary between the remaining portion of information and the initial portion of information in the second fragmented area is the new entry position in the second information signal, when the edited stream of information is reproduced by the apparatus, the apparatus further comprises means for storing information related to the new entry position. The apparatus according to claim 4, characterized in that, when the amount of information in a first fragmented area of the second information signal comprising the entry position, from the entry position to the end of the information block in that fragmented area is smaller than SFA / 2, the means generating the junction block are adapted to generate the information information binding block in the first fragmented area after the entry position and the information stored in the second fragmented area , directly after the first fragmented area in the second information signal. The apparatus according to claim 14, characterized in that the initial position of the signal block in a third fragmented area directly after the second fragment in the second information signal is the new entry position in the second information signal, when the edited flow of information is reproduced by the apparatus, the apparatus further comprises means for storing information related to the new entry position. The apparatus according to claim 4, characterized in that, when the amount of information in a first fragmented area of the first information signal comprising the exit position, from the beginning of the information block in that fragmented area to the position output is less than SFA / 2, then the means generating the junction block is adapted to generate the information junction block in the first fragmented area that precedes the exit position and at least a portion of the information stored in it. a second fragmented area of the second information signal comprising the entry position, the portion extending from the entry point in the direction of the end position of the second fragmented area, so that the size requirement of the information union is satisfied. The apparatus according to claim 16, characterized in that the information binding block comprises the information in the first fragmented area that precedes the exit position and only a portion of information in the second fragmented area, so that the requirement of the size of the portion of information in the second fragmented area after the portion stored in the joint block is also satisfied. 18. The apparatus according to claim 16 or 17, characterized in that the final position of the signal block included in a third fragmented area "directly preceding the first fragmented area in the first information signal is the new output position of the first information signal, when the edited stream of information is reproduced by means of the apparatus, the apparatus further comprises means for storing the new output position 19. The apparatus according to claim 16, characterized in that the initial position of the block of signal included in a fourth fragmented area directly after the second fragmented area in the second information signal is the new entry position in the second information signal, when the edited information flow is reproduced by means of the apparatus, the apparatus comprises also means to store the new entry position 20. The compliance device with claim 17, characterized in that the initial position of the information portion in the second fragmented area following the portion stored in the junction block is the new entry position of the second information signal., when the edited flow of information is reproduced by means of the apparatus, the apparatus further comprises means for storing the new entry position. The apparatus according to claim 4, characterized in that, when the amount of information in a first fragment of the second information signal comprising the entry position, from the entry position to the end of the information block in that area fragmented is less than SFA / 2, then the means generating the binding block are adapted to generate the information information binding block in the first fragmented area followed by the entry position and at least a portion of the stored information in the second fragment of the first information signal comprising the exit position, the portion extending from the exit point in the direction of the initial position of the second signal block in the second fragmented area, so that the requirement The size of the information binding block is satisfied. 22. The apparatus according to claim 21, characterized in that the information binding block comprises the information in the first fragmented area that follows the entry position and only a portion of information in the second fragmented area, so that the requirement of the size of the information portion in the second fragmented area that precedes the portion stored in the joint block is also satisfied. 23. The apparatus according to claim 21 or 22, characterized in that the initial position of the signal block included in a third fragmented area that directly follows the first fragmented area in "the second information signal is the new entry position". In the second information signal, when the edited flow of information is reproduced by means of the apparatus, the apparatus further comprises means for storing the new input position 24. The apparatus according to claim 21, characterized in that the final position of the signal block included in a fourth fragmented area directly preceding the second fragmented area in the first information signal is the new output position in the first information signal, when the edited information flow is reproduced by means of the apparatus, the apparatus it also comprises means for storing the new exit position 25. The conformity apparatus with claim 22, characterized in that the final position of the information portion in the second fragmented area that precedes the portion stored in the junction block is the new exit position of the first information signal, when the edited stream is reproduced. of information by means of the apparatus, the apparatus further comprises means for storing the new exit position. 26. The apparatus according to claim 4, characterized in that the apparatus further comprises - means for decoding a portion of the information in the first information signal before the exit point, for decoding a portion of the information in the second information signal. output after the entry point, - means for generating a composite signal derived from the decoded portions of the first and second information signals, means for encoding the composite signal, means for accommodating the composite signal encoded in one or more connection blocks of fragments of information, the size of the information binding block comprises the composite signal encoded can be variable and satisfies the requirement: SFA / 2 < size of an information block of the encoded composite signal < SFA and means for writing the information binding blocks comprising the composite signal encoded in the corresponding fragmented areas. 27. A method for recording a real-time information signal, such as a digital video signal, on a record carrier such as a disk, a data record portion which is subdivided into fragmented areas of fixed size, method is characterized in that it comprises - receiving the information signal, - processing the information signal in a channel signal for recording the channel signal on the record carrier such as a disk, where the processing comprises converting the information signal into blocks of information of the channel signal, writing the channel signal on the record carrier, where the writing comprises writing a block of information of the channel signal in a fragmented area on the record carrier, and where the processing further comprises - convert the information signal into information blocks of the channel signal, so that the size of the information blocks can be iable and satisfies the following relationship: SFA / 2 < size of a block of the channel signal = SFA, where SFA is equal to the fixed size of the fragmented area. 28. The method of compliance with the claim 27, characterized by the conversion of the information signal into information blocks of the channel signal, so that the information blocks of a consecutive sequence alternately satisfy the following relations: SFA / 2 < size of a block of the channel signal < SFA, and size of a block of the channel signal = SFA. 29. The method according to claim 27, characterized by the conversion of the information signal into information blocks of the channel signal, so that the information blocks of a consecutive sequence satisfy the following relationship: 2. SFA / 3 = size of a block of the channel signal < SFA 30. A method for editing a real-time information signal, such as a digital video signal, recorded in an initial registration step on a record carrier, such as a disk, a portion of the data record of which it is subdivided in fragmented areas of physical size, the information signal is converted to a channel signal before registration and after being recorded on the record carrier, so that the information blocks of the channel signal are recorded in corresponding fragmented areas on the record carrier, the method is characterized in that it comprises, - receiving an output position in a first recorded information signal on the record carrier and in order to receive an entry position in a second information signal, which may be the first information signal, recorded on the record carrier, - store information related to the entry and exit position , - generating at least one information binding block, information binding block which comprises information of at least one of the first and second information signals, information which is located before the output position in the first signal of information and / or after the entry position in the second information signal, and where the size of an information binding block can be variable and satisfies the requirement: SFA / 2 < size of an information binding block < SFA, where SFA is equal to the fixed size of the fragmented areas, - writing at least one information binding block in a corresponding fragmented area, and reproducing the edited flow of information of the record carrier. 31. The method according to claim 30, characterized in that it generates a consecutive sequence of maximum three information binding blocks that alternately satisfies the following relationship: SFA / 2 < size of a block of the channel signal < SFA, size of a designated channel block = SFA. 32. The method according to claim 30, characterized in that it generates a consecutive sequence of maximum two information binding blocks that alternately satisfies the following relationship: 2. SFA / 3 < size of a block of the channel signal < SFA 33. A record carrier, such as a disk, having a real-time information signal _ recorded on it, the record carrier has a data record portion which is subdivided into fragmented areas of fixed size, the information signal is registered on the record carrier in coded channel form, the information signal is divided into information blocks of the channel signal, the information blocks of the channel signal are written in the fragmented areas, the size of the blocks of information stored in a corresponding fragment is variable and satisfies the following requirement: SFA / 2 < size of a signal block of information channel < SFA, where SFA is equal to the fixed size of the fragmented areas. 34. The disk similar to the record carrier according to claim 33, characterized in that the consecutive size of the information blocks satisfies the following relationship: SFA / 2 < size of a block of the channel signal < SFA, and - size of a designated channel block = SFA. 35. The disk similar to the record carrier according to claim 33, characterized in that the consecutive size of the information blocks satisfies the following relationship: 2. SFA / 3 < size of a block of the channel signal < SFA 36. An apparatus for reading a real-time information signal, such as a digital video signal, and a record carrier, such as a disk, the information signal is registered in channel-coded form in a data recording portion of the register carrier, the data record portion is subdivided into fragmented areas of fixed size, information blocks of the information signal encoded by channel are recorded in the corresponding fragmented areas, the size of the information blocks can be variable and satisfies the following relationship: SFA / 2 < size of a block of information of the channel signal < SFA, where SFA is equal to the fixed size of the fragmented areas, the apparatus is characterized in that it comprises: means for reading the channel signal of the record carrier, signal processing means for processing information blocks of variable size and reading the areas fragmented into portions of the information signal, - means for producing the information signal.