WO2001072044A1 - A system and a process for reconstructing programs from an input transport stream and a corresponding digital receiver - Google Patents

A system and a process for reconstructing programs from an input transport stream and a corresponding digital receiver Download PDF

Info

Publication number
WO2001072044A1
WO2001072044A1 PCT/EP2001/003063 EP0103063W WO0172044A1 WO 2001072044 A1 WO2001072044 A1 WO 2001072044A1 EP 0103063 W EP0103063 W EP 0103063W WO 0172044 A1 WO0172044 A1 WO 0172044A1
Authority
WO
Grant status
Application
Patent type
Prior art keywords
insertion
packets
transport stream
section
reconstructing
Prior art date
Application number
PCT/EP2001/003063
Other languages
French (fr)
Inventor
Philippe Leyendecker
Jeam-Marie Steyer
Original Assignee
Thomson Licensing S.A.
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

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television, VOD [Video On Demand]
    • H04N21/40Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/43Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network, synchronizing decoder's clock; Client middleware
    • H04N21/434Disassembling of a multiplex stream, e.g. demultiplexing audio and video streams, extraction of additional data from a video stream; Remultiplexing of multiplex streams; Extraction or processing of SI; Disassembling of packetised elementary stream
    • H04N21/4344Remultiplexing of multiplex streams, e.g. by modifying time stamps or remapping the packet identifiers
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television, VOD [Video On Demand]
    • H04N21/40Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/43Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network, synchronizing decoder's clock; Client middleware
    • H04N21/4302Content synchronization processes, e.g. decoder synchronization
    • H04N21/4305Synchronizing client clock from received content stream, e.g. locking decoder clock with encoder clock, extraction of the PCR packets
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television, VOD [Video On Demand]
    • H04N21/40Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/43Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network, synchronizing decoder's clock; Client middleware
    • H04N21/434Disassembling of a multiplex stream, e.g. demultiplexing audio and video streams, extraction of additional data from a video stream; Remultiplexing of multiplex streams; Extraction or processing of SI; Disassembling of packetised elementary stream
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N7/00Television systems
    • H04N7/24Systems for the transmission of television signals using pulse code modulation
    • H04N7/52Systems for transmission of a pulse code modulated video signal with one or more other pulse code modulated signals, e.g. an audio signal or a synchronizing signal

Abstract

The invention is related to a reconstructing system and process of at least one program from an input transport stream (10) comprising transport stream packets, and to a corresponding digital receiver. The reconstructing system includes an extracting unit (2), extracting packets from the input transport stream, a memory (3) intended to store sections and a transport stream-remultiplexer (4) multiplexing the extracted packets and the section packets into an output transport stream (12). It includes also timing means (21), associating to each of the section packets at least one representative insertion time, sorting means (22), putting the section packets in an insertion order and at least one insertion buffer (23) storing an order of the sorted section packets. The transport stream-remultiplexer is able to insert the section packets into the output transport stream in relation to the insertion buffer and to the representative insertion times.

Description

A system and a process for reconstructing programs from an input transport stream and a corresponding digital receiver

The present invention is related to a system for reconstructing at least one program from an input Transport Stream (TS), to a digital receiver comprising such a system and to a corresponding process.

In new generations of consumer digital terminals, selecting one or more programs from a TS to send them to an application or another entity, like a storage device, is becoming a common feature. Typically, a new TS is created by the terminal before it is sent to its destination.

Now, reconstructing a program from a transport stream is not just selecting a number of packets from the original TS and sending them to a destination, for example extracting Packet Identifiers (PIDs) for MPEG standards (for Moving Picture Experts Group). The integrity of the resulting stream should be guaranteed: notably, the MPEG standard rules and often the DVB (for the Digital Video Broadcasting standard) guidelines have to be respected.

The following are cases of modifications that can occur during such an reconstruction operation.

In a first example, a program composed of a video stream and an audio stream is reconstructed from a TS composed of many audio and video streams. The original Program Allocation Table (PAT) is no more valid for the destination stream. A new PAT has to be created, listing only the program that is being reconstructed. However, if the program itself is not modified before recording, the original Program Map Table (PMT) for that program is still valid and can be sent along with the audio and video packets. In a second example, any component of the program of the first example is modified (discarded or descrambled for example) Thus, the PMT has also to be changed

Any kind of information could be merged with the extracted program before it is sent to its destination (i e extensive program description )

For example (Fig 1), a digital receiver 1 comprises an extracting unit 2 able to extract packets associated with the selected program from an input TS 10 and a Central Processing Unit (CPU) 6 The digital receiver 1 also comprises a memory 3, intended to store tables T1 , T2 TM, and a remultiplexer 4, intended to multiplex the extracted packets with the content of the stored tables so as to produce an output TS 11 A buffer 5 is optionally arranged between the extracting unit 2 and the remultiplexer 4

Typically, some packets are extracted and might be modified on the fly, while some other packets need to be added to the stream, respecting some rules which are defined by the application (and that usually need to comply with the MPEG standard) The resulting program has generally its own Program Clock Reference (PCR), which is the timing reference for packet insertion time

As a matter of fact, a number of tables or sections are prepared by the application in some memory to be inserted according to specific attributes, which are defined by the involved application or system Thus, document EP-A- 0,917,355 is related to a method for distributing MPEG2 transport streams on an IEEE 1394-based home network The received transport streams are filtered to include only service packets carrying predetermined services that should be distributed on the network, new PSI (Program Service Information) / SI (Service Information) tables for the filtered services are generated and the generated tables are inserted into the filtered transport streams, in predetermined intervals or at predetermined points of time However, some time constraints may be set, such as for example minimum delays between table or section insertions. In such cases, predetermined insertion intervals or points of time turn to be poorly adapted, and are very difficult to put in practice.

The entities to be inserted are either the tables themselves, or sections of which the tables are made, the tables being carried in the input TS in section form. Among the tables which have to be inserted, some of them are necessary, as mentioned above, while others are less important, or even optional.

Hereinafter, the term "sections" will be used indiscriminately to designate the sections or the tables.

The present invention concerns a system for reconstructing at least one program from an input TS, which enables an efficient and easy insertion of multiple sections into a resulting stream during a re-multiplexing operation, notably with time constraints on the section insertions.

The reconstructing system of the invention notably allows inserting multiple DVB-SI (i.e. System Information) tables into a stream during a re- multiplexing operation in a digital receiver.

The invention also relates to a digital receiver and to a reconstructing process having the advantages above.

To this end, the invention is related to a reconstructing system as defined in Claim 1. Thereby, a single insertion buffer may be used when reconstructing one or several programs, involving the insertion of several sections. By means of this buffer, which is advantageously circular, all the section packets to be inserted are put in an insertion order, preferably with their associated representative insertion times or derived information. Also, the section packets are inserted in the insertion order by the TS-remultiplexer, into the output TS. Such a system is well suited to taking into account time constraints on the section insertions, contrary to known systems involving predetermined insertion intervals or points of time.

According to advantageous embodiments, several insertion buffers are provided in the reconstructing system. In such an embodiment, several programs are simultaneously reconstructing from an input TS into several respective output TS, by means of several respective insertion buffers which are used in parallel. In another embodiment involving several insertion buffers, only one of them is actually used at any time, depending on the practically achievable insertion timing. According to a combination of both embodiments, several groups of buffers are provided, each of these groups being dedicated to a given output TS.

Preferred embodiments are defined in Claims 2 to 11.

Notably, the insertion buffer (or buffers) is advantageously intended to store a linked list of pointers to the section packets. In a variant, the insertion buffer is intended to store the sorted section packets.

Advantageously, the sorting means also assign to each section packet a time stamp, which is derived from the corresponding representative insertion time(s). According to two embodiments corresponding thereto, those time stamps are stored in the memory or in the insertion buffer(s).

The invention also relates to a digital receiver as defined in Claim 12, to a reconstructing process as defined in Claim 13 and to applications (Claim 14).

Particular implementations of the claimed system are developed below. The application is responsible for setting the insertion timing of each section. For example, N different sections have to be inserted and N+2 process steps have to be set-up and run in parallel. Those process steps (grouped as A, B and C) are as follows.

A- N first steps

Each section is turned into a series of section packets (also called transport packets) by a process, the total number of section packets being N.

Each transport packet is associated with a time stamp showing the earliest expected time of insertion with regard to a given reference time, and obeying to the insertion rules defined by the application.

In a variant, an insertion interval is defined for each transport packet, which is of the type: [earliest possible insertion time, latest possible insertion time].

Those steps are dynamic and lead to the creation of absolute representative insertion times, with respect to the reference time.

B- Step (N+1)

The (N+1)th process step then sorts all the section packets by order of insertion time and puts the result into the insertion buffer as a linked list of pointers to the packets to be inserted and their insertion times.

In the case each packet has an associated insertion window, the algorithm to order the packets may assign a single insertion time stamp to each packet when pushing the latter to the final insertion buffer. The time stamp has then to satisfy both the window [earliest - latest] and the ascending order.

One advantageous algorithm therefor consists in using the order of the latest insertion time to define the packet order in the insertion buffer. Another algorithm consists in using several weighted parameters, including for example the latest insertion time and a coefficient taking into account the relative importance of the section for the integrity of the final stream. Advantageously, the sections being parts of tables, the sections of a same table are allotted the same coefficient.

Each time a pointer to a packet is added to the insertion buffer, the process step taking care of the section it belongs to (namely in connection with steps of A) may compute a new insertion time (or time window) according to the rules given by the application.

Pointers to the sections, thus associated with process steps, can be dynamically added to or removed from the list during the life of the transport stream creation. This is why a linked list is useful since new pointers can be inserted into the middle of the existing list.

C- Step (N+2)

When the reference clock (PCR) of the resulting stream reaches the value of the earliest insertion time stamp of the first packet of the insertion buffer, a process step N+2 launches the insertion process. This insertion may not be instantaneous, but may take place at the next opportunity, which depends on how the packet insertion mechanism is implemented.

Preferably, the reconstructing system comprises adaptation means, which are able to implement appropriate actions if the packet insertion cannot be done within the required time (notably in case latest insertion times are used). Such actions advantageously rely on a modification of the insertion strategy or a modification of some other system behavior, under the control of the application. Thus, a falling-back solution is provided every time a section cannot be inserted. In a first embodiment of the adaptation means involving an infinite linked list, those means are able to modify the linked list whenever one of the sections cannot be inserted in time.

In another embodiment of the adaptation means involving the use of several insertion buffers, each time the given time constraints cannot be respected, those means are able to switch from the current insertion buffer to another following one. The latter provides new time constraints enabling the insertion operations. For example, one or several optional sections are canceled from the current to the following buffer.

In a combination of both embodiments involving several insertion buffers, when one of the sections cannot be inserted in time, the adaptation means first modify the sorted list of the current insertion buffer. If, in spite of this modification, insertion problems remain (according to a given rule, for example after a predetermined number of failures), the adaptation means switch from the current insertion buffer to the next one.

According to still another embodiment of the adaptation means, which can be combined with either of the two preceding ones, those means are intended to modify dynamically the priority level for the access to the memory storing the sections. So, when the insertion process cannot be operated in the provided way, the access to the memory for the insertion process (i.e. notably by the remultiplexer) is favored with respect to other system operations. On the other hand, the previous priority order is preferably restored if the subsequent insertion operations do not raise difficulties.

Preferably, a notification function indicates that the adaptation means are operated. Also, this function warns if the insertion is not possible.

The representative insertion times defined by the timing means may be absolute or relative, as explained below. By "relative", it is meant that at least some of the representative insertion times are defined with respect to at least one reference value, which is preferably determined dynamically when the insertion operations have started.

In a first use of the representative insertion times, the latter are considered as absolute times. Thus, the insertion operations take into account comparisons between the effective insertion times given by the PCR of the resulting stream and those nominal representative insertion times.

According to another embodiment of the reconstructing system, the timing means in the steps of A are intended to associate to the section packets relative representative insertion times, which are defined for each section or table with respect to a starting time, which consists in the time of insertion of the first section packet of this section or table. So, the steps of A are done only once per section or table, at the beginning of the insertion process. The sorting means are in charge of converting the relative representative insertion times into absolute representative times when setting the section packets in an insertion order (step of B).

In still another embodiment of the reconstructing system, the timing means in the steps of A are intended to associate to the section packets relative representative insertion times, like in the preceding embodiment. However, the remultiplexer (and not the sorting means) is in charge of converting the relative representative insertion times into absolute representative times when inserting the packets (i.e. in the step of C). Therefor, the insertion buffer is preferably intended to store a global static list of the sorted section packets, which is cyclic (and not infinite). Then, a new cyclic list is created each time a table is added or removed during the multiplexing operations. According to a variant of this particular embodiment, the insertion buffer is intended to store the sorted section packets themselves. In still another use of the representative insertion times produced by the timing means, referred to as reference representative insertion times, they are not only relative but are also adjusted at each insertion operation. They are thus considered only as reference relative values and the effectively used representative insertion times are adjusted dynamically during the insertion process. Therefor, the reconstructing system comprises updating means, intended to dynamically update the reference representative insertion times. This updating is done in function of the effective insertion times of the section packets into the output transport streams and in function of delays between consecutive reference representative insertion times (i.e. between reference representative insertion times of section packets which are consecutive in the stored insertion order). The updating means are able to add those delays to the effective insertion times as and when the section packets are successively inserted and to produce thereby updated representative insertion times.

This embodiment requires additional steps at each section packet insertion, but it enables a better mastering of the insertion timing, because it is dynamically adjusted. All the representative insertion times or only a part of them can be updated. In a preferred embodiment, the representative insertion times comprise the earliest and the latest expected time of insertion and only the earliest expected time is dynamically adapted.

The embodiments involving the conversion of the relative representative insertion times in function of the insertion time of the first section packet on one hand, and the dynamic adaptation of the reference representative insertion times, on the other hand, are advantageously combined. Then, for each section, the representative insertion times are first determined with respect to the first section packet, and then adapted dynamically with respect to the following effective insertion times.

A typical application of the invention is to create a stream to be recorded on a hard disk drive. Another typical application is to reconstruct a program and send it to another device attached to an IEEE1394/IEC61883 interface.

Other advantages and characteristics of the invention will become apparent through the description of particular non-limiting exemplary embodiments, illustrated by the attached figures in which:

- Figure 1 shows the most significant functional blocks of a typical reconstructing system, as already known from the prior art;

- Figure 2 shows the most significant functional blocks of a first embodiment of a reconstructing system according to the invention; Figure 3 represents specific features and operations of the reconstructing system of Figure 2;

- Figure 4 represents specific features of a variant embodiment of the reconstructing system of Figure 2; - Figure 5 illustrates the use of updated representative insertion times with the reconstructing system of Figure 2; and

- Figure 6 shows the most significant functional blocks of a second embodiment of a reconstructing system according to the invention.

In Figures 1 to 6, similar elements are referred to by the same references.

A digital receiver 20 (Figure 2) comprises an extracting unit 2, able to extract packets associated with programs received in an input TS 10, a memory 3, intended to store sections corresponding to the reconstructed programs, and a remultiplexer 4 connected to the extracting unit 2 and to the memory 3 and intended to multiplex the extracted packets and the section packets into an output TS 12.

The receiver 20 is also provided with timing means 21 , which are able to associate to each of the section packets one or several representative insertion times, sorting means 22 able to put the sections packets in an insertion order, notably in function of the representative insertion times, and an insertion buffer 23, intended to store an order of the sorted section packets. The remultiplexer 4 is intended to insert the section packets into the output TS 12, respecting the order stored in the insertion buffer 23 and taking into account the representative insertion times thereof. Moreover, the receiver 20 comprises updating means 24, intended to dynamically update the representative insertion times produced by the timing means 21.

For example, during an operation of the digital receiver 20 (Figure 3), two tables X and Y, associated with section packets 30 (respectively denoted PacketXi for table X and PacketYj for table Y) must be inserted in the output TS 12. First, the timing means 21 associate respectively to the section packets 30 time stamps 31. Those time stamps 31 indicate for instance the earliest expected times of insertion, according to predetermined constraint rules. The section packets and the time stamps 31 are stored together in the memory 3. Those operations correspond to N first process steps, N being the total numbers of the section packets 30 of tables X and Y.

The sorting means 22 then put the section packets 30 in an insertion order and form a infinite linked list 33 of pointers to the section packets 30, which is stored in the buffer 23 (process step N+1). This order is for instance obtained merely from an ascending order of the representative insertion times 31. In an improved embodiment, the respective importance of tables X and Y is taken into account through adapted weighted coefficients.

Finally, the remultiplexer 4 inserts the section packets 30 into the output TS 12 (process step N+2), using the linked list 33 and respecting the representative insertion times 31 , the appropriate effective insertion times being obtained through a comparison of the latter with a reference time.

In another embodiment (Figure 4), the time stamps associated with the timing means 21 consist in two sets or representative insertion times 31 and 32, respectively indicating the earliest TminXi / TminYi and the latest TmaxXj / TmaxYj expected times of insertion. Then, the sorting means 22 put for instance the section packets 30 in the insertion order by sorting the latest expected times 32 in an ascending order.

A particular case of the latter embodiment relies on the use of relative values for the representative insertion times 31 and 32. In the present example, all time stamps stored in the memory 3 for the table X are translated of a first value by the sorting means 22, this first value being given by the effective insertion time of PacketXi . Likewise, the time stamps stored in the memory for the table Y are translated of a second value, given by the effective insertion time of PacketYI .

Then (Figure 5), whenever one of the table packets 30 associated with an earliest Tminl and a latest Tmaxl expected times of insertion is inserted at a time T1 , the updating means 24 translate consequently the earliest expected times of insertion of the following table packets 30 in the sorted linked list of pointers, on the time axis 40. The used translation is worth

(T1 - Tminl ), namely the offset with respect to the provided insertion time for the presently inserted table packet. Thereby, the expected delays between the earliest times of insertion of the sorted table packets are maintained. For instance, the table packet just following the previous one being associated with an earliest Tmin2 and a latest Tmax2 expected times of insertion, the delay d between the consecutive earliest expected times of insertion Tminl and Tmin2 is worth d = (Tmin2 - Tminl). This delay d is maintained by converting the expected time Tmin2 into an adjusted expected time of insertion Tmin2', because:

(Tmin2' - T1) = (Tmin2' - Tmin2) + (Tmin2 - Tminl) + (Tminl - T1) = (T1 - Tminl ) + d - (T1 - Tminl) = d

Another digital receiver 28 (Figure 6) differs from the digital receiver of the embodiments above notably in that it comprises a set of insertion buffers 26_1 , 26_2...26_n, globally referred to as 26, and adaptation means 25. The adaptation means 25 are able to implement appropriate actions if the packet insertion cannot be done within the required time. Notably, they are intended to switch from a current insertion buffer 26_i to the following one 26_(i+1) in such a situation, the time constraints being increasingly alleviated with the order i of the insertion buffers 26.

Also, the representative insertion times provided by the timing means 21 are stored in the insertion buffers 26, instead of the memory 3.

In an improved embodiment of the digital receiver 28, the adaptation means 25 are also able to modify the linked lists of pointers in each of the insertion buffers 26: those means 25 switch from the current insertion buffer 26_i to the following one 26_(i+1) only when the modifications of the linked lists are not sufficient. In a further improved embodiment, the adaptation means 25 are also able to favor the access to the memory 3 for the insertion process with respect to other system operations, for limited periods during which the insertion operations cannot be operated in the provided way.

Claims

1. A system for reconstructing at least one program from an input transport stream (10) comprising transport stream packets, said system including:
- an extracting unit (2), intended to extract at least two of said packets associated with said program from the input transport stream (10),
- a memory (3) intended to store at least two sections (Table X, Table Y) comprising section packets (30), - and a transport stream-remultiplexer (4) connected to the extracting unit (2) and to the memory (4) and intended to multiplex said extracted packets and said section packets (30) into an output transport stream (12. 13),
characterized in that the reconstructing system includes also: - timing means (21), intended to associate to each of said section packets (30) at least one representative insertion time (31 , 32),
- sorting means (22), intended to put the section packets (30) in an insertion order,
- and at least one insertion buffer (23, 26), connected to the sorting means (22) and to the transport stream-remultiplexer (4) and intended to store an order of said sorted section packets (30), said transport stream-remultiplexer (4) being able to insert the section packets (30) into the output transport stream (12, 13) in relation to said insertion buffer (23, 26) and to said representative insertion times (31 , 32).
2. A reconstructing system according to Claim 1 , characterized in that said representative insertion times (31 , 32) include the earliest expected time of insertion (31 ).
3. A reconstructing system according to Claim 2, characterized in that said representative insertion times (31 , 32) also include the latest expected time of insertion (32).
4. A reconstructing system according to Claim 3, characterized in that said sorting means (22) are able to sort the section packets (30) according to said latest possible time of insertion (32).
5. A reconstructing system according to any of Claims 1 to 3, characterized in that said sorting means (22) are able to sort the section packets (30) according to a sorting indicator, which is a combination of weighted parameters including for the section packets (30) of each section (Table X, Table Y) at least one of said representative insertion times (31 , 32) and a coefficient taking into account the relative importance of said section for the integrity of the output transport stream (12, 13).
6. A reconstructing system according to any of Claims 1 to 5, characterized in that said insertion buffer (23, 26) is intended to store a linked list of pointers (33) to said section packets (30).
7. A reconstructing system according to any of Claims 1 to 6, characterized in that it comprises adaptation means (25), able to modify the behavior of said reconstructing system whenever the insertion timing defined by means of said insertion buffer (23, 26) cannot be respected.
8. A reconstructing system according to Claim 7, characterized in that said adaptation means (25) are intended to modify the order of the section packets (30) stored in the currently used insertion buffer (23) when the insertion timing defined by means of said insertion buffer (23) cannot be respected.
9. A reconstructing system according to any of Claims 7 or 8, characterized in that said adaptation means (25) are intended to switch from the currently used insertion buffer (26_i) to a following insertion buffer (26_(i+1)) when the insertion timing defined by means of said insertion buffer (23) cannot be respected.
10. A reconstructing system according to any of Claims 7 to 9, characterized in that said adaptation means (25) are intended to increase dynamically the priority level for the access to said memory (3) for the insertion process with respect to other system operations when the insertion timing defined by means of said insertion buffer (23, 26) cannot be respected.
11. A reconstructing system according to any of the preceding Claims, characterized in that said reconstructing system comprises updating means (24), intended to dynamically update said representative insertion times (Tminl , Tmaxl , Tmin2, Tmax2) produced by the timing means (21), referred to as reference representative insertion times, in function of effective insertion times (T1 ) of the section packets (30) into the output transport streams (12, 13) and in function of delays (d) between consecutive representative insertion times (Tminl , Tmin2), by adding said delays (d) to said effective insertion times (T1 ) as and when the section packets (30) are successively inserted and by producing thereby updated representative insertion times (Tmin2\ Tmax2).
12. A digital receiver (20, 28) comprising a reconstructing system according to any of Claims 1 to 11 , said sections being preferably DVB-SI tables.
13. A process for reconstructing at least one program from an input transport stream (10) comprising transport stream packets, in which: - at least two of said transport stream packets associated with said program are extracted from the input transport stream (10),
- and said extracted packets are multiplexed with section packets (30) of at least two sections (Table X, Table Y), into an output transport stream (12, 13),
characterized in that each of said section packets (30) is associated with at least one representative insertion time (31 , 32), said section packets (30) are put into a insertion order which is stored in at least one insertion buffer (23, 26) and said section packets (30) are inserted into the output transport stream (31 , 32) in relation to said insertion buffer (23, 26) and to said representative insertion times (31 , 32), said reconstructing process being preferably put in practice by means of a reconstructing system according to any of the Claims 1 to 11.
14. Application of the reconstructing system of any of Claims 1 to 11 , of the digital receiver of Claim 12 or of the reconstructing process of Claim 13 to the recording of a standard output stream on a hard disk drive or to the sending of said output stream to another device attached to IEEE1394 / IEC61883 interface.
PCT/EP2001/003063 2000-03-23 2001-03-16 A system and a process for reconstructing programs from an input transport stream and a corresponding digital receiver WO2001072044A1 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP00400814 2000-03-23
EP00400814.0 2000-03-23

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
AU7389701A AU7389701A (en) 2000-03-23 2001-03-16 A system and a process for reconstructing programs from an input transport stream and a corresponding digital receiver

Publications (1)

Publication Number Publication Date
WO2001072044A1 true true WO2001072044A1 (en) 2001-09-27

Family

ID=8173613

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2001/003063 WO2001072044A1 (en) 2000-03-23 2001-03-16 A system and a process for reconstructing programs from an input transport stream and a corresponding digital receiver

Country Status (1)

Country Link
WO (1) WO2001072044A1 (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2002087242A1 (en) * 2001-04-20 2002-10-31 Swelcom Oy A method and apparatus for localizing data
DE10323186A1 (en) * 2003-05-22 2004-12-23 Fujitsu Siemens Computers Gmbh Means for processing an MPEG-2 data stream and method for processing an MPEG-2 data stream
WO2006003162A1 (en) * 2004-07-07 2006-01-12 Thomson Licensing Device and method for secure demultiplexing and associated products
EP2053120B1 (en) 2007-10-26 2016-11-23 Dalli-Werke GmbH & Co. KG Washing or cleaning agent shaped body with dyeable relief structure

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5515106A (en) * 1994-01-05 1996-05-07 Thomson Consumer Electronics, Inc. Method and apparatus for transmitting/receiving a program guide for television services
EP0899955A2 (en) * 1997-08-27 1999-03-03 Matsushita Electric Industrial Co., Ltd. Control information generating apparatus for broadcast system
EP0917355A1 (en) * 1997-11-14 1999-05-19 Sony International (Europe) GmbH Distribution of MPEG-2 transport streams on the IEEE 1394-based home network
WO1999037048A1 (en) * 1998-01-14 1999-07-22 Skystream Corporation Video program bearing transport stream remultiplexer

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5515106A (en) * 1994-01-05 1996-05-07 Thomson Consumer Electronics, Inc. Method and apparatus for transmitting/receiving a program guide for television services
EP0899955A2 (en) * 1997-08-27 1999-03-03 Matsushita Electric Industrial Co., Ltd. Control information generating apparatus for broadcast system
EP0917355A1 (en) * 1997-11-14 1999-05-19 Sony International (Europe) GmbH Distribution of MPEG-2 transport streams on the IEEE 1394-based home network
WO1999037048A1 (en) * 1998-01-14 1999-07-22 Skystream Corporation Video program bearing transport stream remultiplexer

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
BUNGUM O W: "TRANSMULTIPLEXING, TRANSCONTROL AND TRANSSCRAMBLING OF MPEG-2/DVB SIGNAL", INTERNATIONAL BROADCASTING CONVENTION, LONDON, GB, 12 September 1996 (1996-09-12), pages 288 - 293, XP002040478 *
GERHARD MÖLL: "Service Informationen (SI) für DVB Systeme", FERNSEH UND KINOTECHNIK, VDE VERLAG GMBH. BERLIN, DE, 1 April 1996 (1996-04-01), pages 163 - 171, XP002075221, ISSN: 0015-0142 *
NAKAI T ET AL: "NEWLY DEVELOPED IRD BUILT-IN D-VHS VCR SYSTEM FOR DVB BROADCASTS", IEEE TRANSACTIONS ON CONSUMER ELECTRONICS, IEEE INC. NEW YORK, US, vol. 44, no. 3, August 1998 (1998-08-01), pages 465 - 471, XP000851544, ISSN: 0098-3063 *

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2002087242A1 (en) * 2001-04-20 2002-10-31 Swelcom Oy A method and apparatus for localizing data
DE10323186A1 (en) * 2003-05-22 2004-12-23 Fujitsu Siemens Computers Gmbh Means for processing an MPEG-2 data stream and method for processing an MPEG-2 data stream
DE10323186B4 (en) * 2003-05-22 2006-03-02 Fujitsu Siemens Computers Gmbh Means for processing an MPEG-2 data stream and method for processing an MPEG-2 data stream
WO2006003162A1 (en) * 2004-07-07 2006-01-12 Thomson Licensing Device and method for secure demultiplexing and associated products
FR2872987A1 (en) * 2004-07-07 2006-01-13 Thomson Licensing Sa Device and method of demultiplexing Secure and associated products
EP2053120B1 (en) 2007-10-26 2016-11-23 Dalli-Werke GmbH & Co. KG Washing or cleaning agent shaped body with dyeable relief structure

Similar Documents

Publication Publication Date Title
US5535216A (en) Multiplexed gapped constant bit rate data transmission
US6404711B1 (en) System including comparing a separated time stamp to a generated timing signal and controlling a timing signal on the basis of continuity of time stamps
US5801753A (en) Method and apparatus for providing an interactive guide to events available on an information network
US20030123556A1 (en) Information processing apparatus
DE4422015C1 (en) Transmission and reception of digital audio with image, speech or text
US6356567B2 (en) Embedded clock recovery and difference filtering for an MPEG-2 compliant transport stream
US6026506A (en) Concealing errors in transport stream data
US20020041628A1 (en) Method and apparatus for splicing
US6181706B1 (en) Common buffer for multiple streams and control registers in an MPEG-2 compliant transport register
US6278838B1 (en) Peak-ahead FIFO for DVD system stream parsing
US6763390B1 (en) Method and system for receiving and framing packetized data
US20040076194A1 (en) Multi-format transport stream decoder
US20050005289A1 (en) Method of linking metadata to a data stream
US6229801B1 (en) Delivery of MPEG2 compliant table data
US6275507B1 (en) Transport demultiplexor for an MPEG-2 compliant data stream
US6118786A (en) Apparatus and method for multiplexing with small buffer depth
US6088357A (en) Auxiliary transport assist processor especially for an MPEG-2 compliant decoder
EP0823798A1 (en) Receiver in a cyclic packet data transmission system
US6181712B1 (en) Method and device for transmitting data packets
US6310898B1 (en) Compressed video and audio transport stream multiplexer
US6823131B2 (en) Method and device for decoding a digital video stream in a digital video system using dummy header insertion
US6868125B2 (en) Transport stream to program stream conversion
US6115422A (en) Protocol and procedure for time base change in an MPEG-2 compliant datastream
US20030121050A1 (en) System and method for scheduling interactive audiovisual presentations
US6556546B1 (en) Multiplex data transmitting and receiving equipment

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG US UZ VN YU ZA ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

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

Ref country code: JP