EP0842587A2 - Communication method between stations - Google Patents
Communication method between stationsInfo
- Publication number
- EP0842587A2 EP0842587A2 EP97920916A EP97920916A EP0842587A2 EP 0842587 A2 EP0842587 A2 EP 0842587A2 EP 97920916 A EP97920916 A EP 97920916A EP 97920916 A EP97920916 A EP 97920916A EP 0842587 A2 EP0842587 A2 EP 0842587A2
- Authority
- EP
- European Patent Office
- Prior art keywords
- master station
- die
- station
- tables
- slave
- Prior art date
- Legal status (The legal status 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 status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
- H04N21/23—Processing of content or additional data; Elementary server operations; Server middleware
- H04N21/235—Processing of additional data, e.g. scrambling of additional data or processing content descriptors
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
- H04N21/23—Processing of content or additional data; Elementary server operations; Server middleware
- H04N21/236—Assembling of a multiplex stream, e.g. transport stream, by combining a video stream with other content or additional data, e.g. inserting a URL [Uniform Resource Locator] into a video stream, multiplexing software data into a video stream; Remultiplexing of multiplex streams; Insertion of stuffing bits into the multiplex stream, e.g. to obtain a constant bit-rate; Assembling of a packetised elementary stream
- H04N21/2365—Multiplexing of several video streams
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
- H04N21/43—Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
- H04N21/434—Disassembling 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/4347—Demultiplexing of several video streams
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
- H04N21/43—Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
- H04N21/435—Processing of additional data, e.g. decrypting of additional data, reconstructing software from modules extracted from the transport stream
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Time-Division Multiplex Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
According to the present communication method between N stations (S1, S2, ..., SN) and at least a customer (CM), one of them, selected as a master station, becomes responsible for building and broadcasting at least one service information table (such as the tables defined in MPEG or DVB), and communicates with the (N-1) other slave stations in a limited number of situations corresponding to modifications of the content of the tables and according to a specific table management, where the master station is always in one of three states that are either a waiting state, or a building state, or a transferring state, and specific communication rules for the slave stations and the master station.
Description
Communication method between stations
Description
The invention relates to a communication method between N stations among which one is selected as a master station and becomes responsible for building and broadcastmg at least one service information table such as die tables defined according to standards like MPEG or DVB, said master station communicating with die (N-l) other ones, called slave stations, accordmg to a specific table management, and in a limited number of situations.
The standards MPEG and DVB have defined various service information tables describing the transport stream content. In MPEG case, ύiese tables are referred to as PSI tables (Program Specific information), while m DVB case, tiiey are referred to as SI tables (Service Information). They provide die mimmum information to enable an automatic configuration of the receiver to demultiplex and decode the various streams of programs within a multiplexed transport stream.
In an independent broadcast system, each station transmits independently its own tables, widiout taking care of what the other stations broadcast and without any communication between stations. Such an independent broadcast system is the simplest one, but possible only if some constraining conditions are fulfilled (e.g. the version number and section numbers have to be independent from station to station, section interleaving shall not be possible,...), which is unfortunately not always the case.
In a central broadcast system as illustrated m Fig.1 (that shows an emitting station ES sending to a customer CM a multiplexed stream MXS emitted by a multiplexor MUX that receives several programs 1 to N), a station becomes responsible for building and broadcasting the tables for all the other stations, without communicating with them. The building and the transmission of these tables are relatively easy since the station generating the transport stream knowns their content. Such a situation is however reserved to tables which are global (i.e. not service oriented) and for which no information is needed from the other stations.
It is therefore an object of the invention to propose another kind of communication method, that is organised as indicated in the preamble of the description and
wherein said situations are me three following ones :
- a slave station wants to update the content of its tables ;
- a slave station wants to remove its tables ;
- die master station wants to refresh die tables of at least one of me slave stations ; and said table management is based on transmission orders, used when die master station has to refresh a table, and stop transmission orders, used when the master station has to modify the content of a table by updating or removing it.
Such a method allows to implement a solution where all the stations receive a remultiplexed stream and one of uiem is responsible for building the tables.
In a particular embodiment, the table management is carried out by means of the following principle, according to which the master station is always in one of three states that are eidier a waiting state, or a building state, or a transferring state, the following operations corresponding to said states : (i) in the waiting state, the master station refuses any modification of the content of any table except when one of the two following events occurs : either it is time to refresh at least one of the tables, or a slave station modifies its own contribution to one of the tables ;
(ii) one of said events having occurred, the master station transmits respectively a transmission order or a stop transmission order, and the building state begins, duπng which said master station stores all modifications ;
(iii) said modifications being stored, the transferring state begins, during which other modifications are no longer allowed and all modifications are copied, said master station finally returning to its waiting state. Preferably, me communication rules for said operations are subdivided into rules to be respected by any slave station and rules to be respected by the master station, the former ones being me following :
(a) a slave station can transmit a modification only if it has received from the master station a transmission order concerning a table or if it wants to update its own contribution to a table ;
(b) a slave station can update its own contribution to a table only if it has not received any order concerning said table since a predetermmed period ;
(c) when a slave station receives from the master station a transmission order concerning a table, said transmission has to be done within a predetermined period ;
(d) when a slave station receives from the master station a stop transmission order concerning a table, it has to finish a pending transmission within a predetermmed period and will be no longer able to begin a further transmission duπng a predetermmed period , whde the latter ones are the following :
(e) when the master station wants to refresh a table, it has to transmit a transmission order for said table ;
(0 die master station can send a transmission order only if it has not transmitted one during a predetermmed previous period ; (g) when the master station receives modifications sent by a slave station wantmg to update its contribution to a table, it has to transmit a stop transmission order for said table.
After the transmission of a transmission order or a stop transmission order, the master station men generally carries out the following operations . (1) all me modifications are first stored during a first predetermined period;
(11) after said period, all the modifications are copied during a second predetermmed period.
The particularities and advantages of the invention will become more apparent from the following description and the accompanying drawings, in which .
- Figs.1 and 2 are schematic representations of central and distributed broadcast systems respectively ;
- Figs.3 and 4 respectively illustrate the processing principles in the master station for a table T and a more general overview of the SI processing principles ; - Figs 5 and 6 illustrate m two cases die rules applied by a slave station when it receives an order packet.
Before describing the solution that allows to transmit said PS I/SI tables
(defined in MPEG and DVB) for a distributed broadcast system, it is useful to recall the following definitions, in order to remove any possible ambiguity : - transport stream : stream that respects the transport format defined by
MPEG ,
- multiplexing : operation consisting in concatenating several streams into one transport stream ,
- multiplexed stream : stream that contains several programs and that
respects the transport format defined by MPEG ;
- central broadcast system : system in which the multiplexed stream received by the customers is generated by only one emitting station (such as shown in Fig.1); - distributed broadcast system : system in which the multiplexed stream received by the customers is obtained by remultiplexmg various transport streams, each of which is generated by an independent station (such as shown in Fig.2, where stations 1 to N send to the customer CM a remultiplexed stream RMX obtained at me output of a multiplexer MUX receivmg the multiplexed stream MXS respectively available at the ouφuts of said stations).
In MPEG, four PSI tables are defined : CAT, NIT, PAT and PMT. These tables, that include data providing the minimum information to enable automatic configuration of the receiver to demultiplex and decode me various streams of the programs within a multiplexed stream (= transport stream), have me following meanings : - CAT (Conditional Access Table) • it provides information on die conditional access systems used m the multiplex (its syntax is neither defined in MPEG nor in DVB, and the information it carries is completely private, but includes the location of the EMM -Entitlement Management Message-streams, when applicable) ;
- NIT (Network Information Table) : it provides information about the physical network (its syntax is defined in DVB) ;
- PMT (Program Map Table) : to each program corresponds a PMT, and this PMT indicates the PID (Packet IDentifier) of the transport packets that carry the Program Clock Reference (PCR) and the PID of the streams that make up the program (its syntax is completely defined in MPEG) ; - PAT (Program Association lable) : for each program
(= service in DVB), me PAT indicates the PID of die transport packets carrying the corresponding PMT (its syntax is completely defined in MPEG).
In DVB, new tables have been introduced and some of them (EIT, SDT,
TDT) are mandatory. These DVB mandatory tables have the following meanings : - EIT (Event Information Table) : it contains data that describe the events constituting the services, e.g. event name, start time, duration
- SDT (Service Description Table) : it contains data that describe the services (programs) present in a system, e.g. names of the services, service providers,... ;
- TDT (Time and Date Table) : it gives information related to the present
time and date.
Different broadcast policies can t erefore be implemented depending on table properties. It was already seen that independent or central broadcast systems, although simple, are not an appropriate solution. A third policy, that is the proposed solution according to the invention, will now be described. Its basic principle consists in selecting one of the stations (called the master station) as the responsible one for building and broadcasting the tables. This master station then receives from me other ones (cailed slave stations) their respective contributions in die various tables. The communication between me master station and the slave ones is done thanks to the remultiplexed stream (connection in dotted line in Fig.2) and by using a private protocol.
The following notations will be used in the description :
- Tl is me maximum delay needed by a slave station to output its contribution to a table ; - D(st) is the maximum propagation delay of a packet from one station to anodier one ;
- D(tr) is die delay needed by die master station to replace the current version of a table by the modified one ;
- T2 is die sum of these delays : T2 = Tl + D(st) + D(tr)
- T3 is equal to the sum of T2 and D(st) : T3 = Tl + 2D(st) + D(tr).
Having defined diese preliminary notations, the table management, first in the slave stations and men in the master station, will be explained. Concerning first die table management in the slave stations, each slave station builds its own SI tables (PAT, CAT, SDT, EIT, ...) by considering that it is alone in the system. It then transmits these tables to the master station by using special packets called SI_modif_Packets, but only in die following cases, in order to reduce the communication data rate : (a) the concerned slave station wants to modify the contents of its tables
(for instance because new services are present, or because die current SI tables transmitted by the master station do not correspond to what the slave station wants) ;
(b) the slave station wants to remove its tables (the station wants to stop transmitting) ;
(c) ϋhe slave station has received a transmission order from the master one (e.g. the master station wants to refresh me tables, generally for security purposes).
As indicated for instance in the european patent application EP 0374548. the general technique of packetising separate data streams is already known in the field of data communication and video transmission. However, in the present case, a particular table management and specific communication rules are provided. An example of syntax of the SI_modif_Packets is given hereunder, widi die corresponding number of bits :
sync_byte 8 transport_error_indicator 1 payload_unit_start_indicator 1 transport_pπority 1
PID 13 transport_scrambling_control 2 adaptation_field_control 2 continuity_counter 4 adaptation_fιeld_length 8 discontinuιty_indicator 1 random_access_indicator 1 elementary _stream_priority_indicator 1
PCR_flag 1
OPCR_flag 1 splicing_point_flag 1 transport_private_data_flag 1 adaptatιon_fιeld_extens ion_flag I pπvate_data : transport_private_data_length 8
Table_Type 8
Table_Start 1
Table_End 1 reserved 6 version_number 8 last_section_number 8 stuffuιg_byte 8 pointer_field 8
SI_data_bytes 8
Concerning the table management in the master station, two kinds of orders can be transmitted by said master station in order to communicate with the slave stations : transmission orders, stop transmission orders. The transmission orders are used when the master station wants to refresh a table (as already seen, generally for security purposes), while the stop transmission orders are used when the master station wants to
modify the content of a table. These orders are transmitted by using special packets called Order_Packets, the syntax of which is given below, also with the corresponding number of
sync_byte 8 transport_error_ιndιcator 1 payload_unιt_start_ιndιcator 1 transport_pπoπty 1
PID 13 transport_scrambling_control 2 adaptatιon_fιeld_control 2 continuity _counter 4 adaptatιon_fιeld_length 8 dιscontmuιty_mdιcator random_access_mdicator elementary_stream_pπoπty_ιndιcator
PCR_flag
OPCR_flag spl icing _pomt_flag transpoπ_pπvate_data_flag adaptatιon_fιeld_extensιon_flag pπvate_data : transport_pπvate_data_lengdι 8
Table_Type 8
Transmission flag 1 reserved 7 stuffing_byte 8
widi, for some indications present in the two above-given tables, the following meanings
- Table_Type : identifies which table is concerned by the order ; - Table_Start : when set to 1 , then the contribution of the slave station to the table defined by Table_Type starts with the first SI_data_byte present in the packet ;
- Table_End : when set to 1 , then die contribution of the slave station to the table defined by Table_Type ends widi die last SI_data_byte present in the packet ;
- Transmιssιon_flag : when set ot 1 , then the order is a transmission order, otherwise it is a stop transmission order ;
- SI_data_bytes : they respect the format of the SI as specified both in MEPG and DVB ;
- versιon_number : is used in order to identify whether the contribution of the concerned slave station has been modified or not ; - last_sectιon_number : die sections of die contribution of a slave station are numbered from 0 to last section number
The tabie management is therefore carried out according to principles that wdl be now described, m relation with Figs.3 and 4 that respectively illustrate the processing principles in the master station for a table T and a more general overview of the SI processing principles. As shown in said figures, two kinds or registers (34, 134) are present in the master station . current_T, that contains at each time the version of the table T which is currently transmitted, and next_T, that contains at each time a part of or me total contribution of a station and is dierefore the version of the table T which shall replace current_T (next_T(l) is the contribution of die station 1 in next_T. next_T(2) for the station 2, and so on...). At the output of an input buffer 31, a table demultiplexer 32 and station demultiplexers 33(1), 33(2) 33(ι),..., allow to receive the SI_modιf_Packets and to transfer diem in the appropπate next_T register (referenced 134(0 for die station I) and then in die register current_T (referenced 34(ι) for die station l). An example of each sub- assembly (33(ι), 134(ι), 34(i)) is shown in Fig.3, as already indicated. At me output of said registers (34(1), 34(2),... 34(i),..., a multiplexer 35 transmits the different SI tables according to their repetition rates and transmits orders when a table has to be refreshed or updated, and an updating circuit 36 dien modifies correctly the appropriate fields of the concerned table.
For each table T, die master station is always in one of the three following states : waiting state (the station waits for a new contribution), building state (the next version of the table T is being completed), transferring state (the next version of the table T becomes the current one).
Most of die time, the station is in the waiting state, during which it has to refuse all the received SI_modιf_Packets(T) excepted when one of die two following events occurs : (0 it is time to refresh the table T, (n) die station receives a SI_modιf_Packet (T) starting with a new contribution (i.e Table_Start is set to 1). When such events occur, the master station transmits an Order_Packet (a transmission order in case (I) , or a stop transmission order in case (ii)). The building state then begins, duπng which the master station stores all die received SI_modιf_Packets(T) in the corresponding next_T(ι). The master station stays in this building state during me period Tl + 2D(st). Then the tranferring state begins, during which all the next_T(ι) are copied into current_T and no SI_modιf_Packet(T) is accepted anymore. The master station stays in the tranferring state duπng D(tr) and then returns to die waiting state.
This above-described table management is carried out according to some
communication rules that will be now indicated.
These communication rules for the transmission orders and the stop transmission orders may be subdivided m rules to be respected by a slave station and rules to be respected by the master station. The rules to be respected by a slave station are die following :
(a) a slave station can transmit an SI_modif_Packet(T) only if it has received from die master station a tranmission order concerning the table T (see also rule(c)) or if it wants to update its own contribution to said table T (see also rule (b)) ; (b) a slave station can however update its own contribution to said table T if and only if it has not received any order concerning this table T since a period equal to the delay T2 ;
(c) when a slave station receives from the master station a transmission order at a time tO concerning a table T (die master station wants to refresh said table), it has to transmit its whole contribution WHC concerning said table T widiin the interval (tO, tO + delay Tl) and, once mis transmission is finished, it has to wait till the time (tO + delay T2) before being able to transmit an SI_modif_Packet (mis is illustrated in Fig.5, where are indicated :
- the times tO, (tO + Tl), (tO + T2) ; - the delays D(st) and D(tr) ;
- die operation WHC consisting in the transmission of the whole contribution) ;
(d) when a slave station receives from the master station a stop transmission order at a time tO concerning a table T (the master station has received a new contribution for T from said slave station), it may be in eidier of die two following situations:
(i) if die slave station was transmitting its contribution concerning a table T, it has to finish (if necessary) said transmission widiin the interval (tO, tO + delay Tl) and, once this transmission is finished, it has to wait till the time (tO + delay T2) before being able to transmit an SI_modif_Packet (see Fig.6, where is indicated said operation CTC consisting in die completed T transmission) ;
(ii) otherwise die station shall not transmit any SI_modιf_Packet(T) till the
The rules to be respected by the master station are the following :
, Q
(a) when the master station wants to refresh a table, it has to transmit a transmission order for mis particular table ;
(b) when die master station receives SI_modif_Packets(T) sent by a slave station and signalling that said slave station wants to update its contribution to the table T, it has to transmit a stop transmission order for said table T ;
(c) said master station can transmit an order packet concerning a table T only if it has not transmitted one since T3 (= Tl + 2D(st) + D(tr), as previously seen) ;
(d) when it is time to refresh the table T, the master station transmits a transmission order, according to die following operations : (i) tl being die time at which such an order is transmitted, the master station shall store during die interval (tl, tl + Tl + 2 D(st)) all the received SI_modif_Packets(T) in me corresponding next_T(i) blocks ;
(ii) at die time (tl + Tl + 2D(st)), the master station refuses all the SI_modif_Packets(T) and copies all die next_T(i) blocks in current_T ; (e) when die master station receives from a slave station die start of a new contribution for T, if said master station has not transmitted any order packet since T3, then it shall transmit a stop transmission order, according to the following operations :
(i) tl being me time at which such a packet is transmitted, the master station shall store during die interval (tl, tl + Tl + 2D(st)) all the received SI_modif_Packets(T) in me corresponding next_T(i) blocks ;
(ii) at the time (tl + Tl + 2 D(st)), die master station refuses all the SI_modif_Packets(T) and copies all the next_T(i) blocks in current_T.
Claims
1. A communication memod between N stations among which one is selected as a master station and becomes responsible for building and broadcasting at least one service information table such as die tables defined according to standards like MPEG or DVB, said master station communicating with the (N-l) other ones, called slave stations, according to a specific table management, and in a limited number of situations, wherein said simations are the three following ones :
- a slave station wants to update me content of its tables ;
- a slave station wants to remove its tables ;
- die master station wants to refresh the tables of at least one of the slave stations ; and said table management is based on transmission orders, used when die master station has to refresh a table, and stop transmission orders, used when die master station has to modify the content of a table by updating or removing it.
2. A memod according to claim 1 , wherein said table management is carried out by means of the following principle, according to which me master station is always in one of three states diat are either a waiting state, or a building state, or a transferring state, the following operations corresponding to said states :
(i) in the waiting state, die master station refuses any modification of die content of any table except when one of the two following events occurs : eidier it is time to refresh at least one of the tables, or a slave station modifies its own contribution to one of die tables ;
(ii) one of said events having occurred, the master station transmits respectively a transmission order or a stop transmission order, and the building state begins, during which said master station stores all modifications ; (iii) said modifications being stored, the transferring state begins, during which odier modifications are no longer allowed and all modifications are copied, said master station finally returning to its waiting state.
3. A method according to claim 2, wherein die communication rules for said operations are subdivided into rules to be respected by any slave station and rules to be respected by the master station, the former ones being the following :
(a) a slave station can transmit a modification only if it has received from me master station a transmission order concerning a table or if it wants to update its own contribution to a table ; (b) a slave station can update its own contribution to a tabie only if it has not received any order concerning said table since a predetermined period ;
(c) when a slave station receives from die master station a transmission order concerning a table, said transmission has to be done widiin a predetermined period ;
(d) when a slave station receives from die master station a stop transmission order concerning a table, it has to finish a pending transmission widiin a predetermined period and will be no longer able to begin a further transmission duπng a predetermmed period ; while the latter ones are die following :
(e) when the master station wants to refresh a table, it has to transmit a transmission order for said table ;
(f) die master station can send a transmission order only if it has not transmitted one during a predetermined previous period ;
(g) when die master station receives modifications sent by a slave station wanting to update its contribution to a table, it has to transmit a stop transmission order for said table.
4. A method according to claim 3, wherein the master station, for transmitting a transmission order or a stop transmission order, carries out the following operations :
(i) all the modifications are first stored duπng a first predetermined period;
(ii) after said period, all me modifications are copied during a second predetermined period.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| EP97920916A EP0842587B1 (en) | 1996-05-30 | 1997-05-28 | Communication method between stations |
Applications Claiming Priority (6)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| EP96401161 | 1996-05-30 | ||
| EP96401161 | 1996-05-30 | ||
| EP97400672 | 1997-03-25 | ||
| EP97400672 | 1997-03-25 | ||
| PCT/IB1997/000605 WO1997046024A2 (en) | 1996-05-30 | 1997-05-28 | Communication method between stations |
| EP97920916A EP0842587B1 (en) | 1996-05-30 | 1997-05-28 | Communication method between stations |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| EP0842587A2 true EP0842587A2 (en) | 1998-05-20 |
| EP0842587B1 EP0842587B1 (en) | 2002-08-07 |
Family
ID=26144048
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| EP97920916A Expired - Lifetime EP0842587B1 (en) | 1996-05-30 | 1997-05-28 | Communication method between stations |
Country Status (5)
| Country | Link |
|---|---|
| US (1) | US6219100B1 (en) |
| EP (1) | EP0842587B1 (en) |
| JP (1) | JP3924324B2 (en) |
| DE (1) | DE69714549T2 (en) |
| WO (1) | WO1997046024A2 (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1046253A4 (en) * | 1998-01-14 | 2005-05-11 | Skystream Corp | Video program bearing transport stream remultiplexer |
| US6064676A (en) * | 1998-01-14 | 2000-05-16 | Skystream Corporation | Remultipelxer cache architecture and memory organization for storing video program bearing transport packets and descriptors |
| US6567986B2 (en) * | 1998-03-12 | 2003-05-20 | Sarnoff Corporation | Method and apparatus for distributing a globally accurate knowledge of time and frequency to a plurality of a high definition television studios |
| JP4114234B2 (en) * | 1998-06-09 | 2008-07-09 | ソニー株式会社 | Signal processing apparatus, receiving apparatus, and signal processing method |
| CN105232457B (en) * | 2015-11-17 | 2018-04-20 | 宁夏泰瑞制药股份有限公司 | A kind of preparation method of doractin sterile solution |
Family Cites Families (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US3706996A (en) * | 1970-04-14 | 1972-12-19 | Theodore Hafner | Frequency adjustment for two-way video transmission |
| US4574379A (en) * | 1983-06-16 | 1986-03-04 | At&T Bell Laboratories | Synchronization technique for non-colocated TV signals in a TDMA satellite communication system |
| IT1228109B (en) * | 1988-12-21 | 1991-05-28 | Telettra Spa M | PACKAGE PREMULTIPLATION SYSTEM AND DEVICE FOR TRANSMISSION OF MULTIPLE DATA FLOWS GENERATED BY A SINGLE ALGORITHM |
| JPH06284148A (en) * | 1993-03-30 | 1994-10-07 | Hitachi Ltd | Moving picture communication control method and communication controller |
| JPH07253991A (en) * | 1994-03-16 | 1995-10-03 | Mitsubishi Electric Corp | Join processing system |
| US6031577A (en) * | 1997-07-10 | 2000-02-29 | Thomson Consumer Electronics, Inc. | System for forming and processing program specific information containing text data for terrestrial, cable or satellite broadcast |
| US6064676A (en) * | 1998-01-14 | 2000-05-16 | Skystream Corporation | Remultipelxer cache architecture and memory organization for storing video program bearing transport packets and descriptors |
-
1997
- 1997-05-28 JP JP54193797A patent/JP3924324B2/en not_active Expired - Fee Related
- 1997-05-28 US US08/983,372 patent/US6219100B1/en not_active Expired - Lifetime
- 1997-05-28 EP EP97920916A patent/EP0842587B1/en not_active Expired - Lifetime
- 1997-05-28 DE DE69714549T patent/DE69714549T2/en not_active Expired - Lifetime
- 1997-05-28 WO PCT/IB1997/000605 patent/WO1997046024A2/en active IP Right Grant
Non-Patent Citations (1)
| Title |
|---|
| See references of WO9746024A3 * |
Also Published As
| Publication number | Publication date |
|---|---|
| DE69714549T2 (en) | 2003-04-03 |
| EP0842587B1 (en) | 2002-08-07 |
| DE69714549D1 (en) | 2002-09-12 |
| WO1997046024A3 (en) | 1998-02-05 |
| JP3924324B2 (en) | 2007-06-06 |
| US6219100B1 (en) | 2001-04-17 |
| JPH11510674A (en) | 1999-09-14 |
| WO1997046024A2 (en) | 1997-12-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6643298B1 (en) | Method and apparatus for MPEG-2 program ID re-mapping for multiplexing several programs into a single transport stream | |
| US6233255B1 (en) | Apparatus and method for remultiplexing and coding multimedia information | |
| US6351471B1 (en) | Brandwidth optimization of video program bearing transport streams | |
| KR100378718B1 (en) | Method and apparatus for transmitting data packets | |
| CN102714754A (en) | Remote re-multiplexing of transport streams | |
| CA2306013A1 (en) | Method for causal ordering in a distributed network | |
| EP2681858B1 (en) | Deterministic re-multiplexing for sfn networks | |
| WO1997046024A2 (en) | Communication method between stations | |
| DE60124837T2 (en) | Method and system for frame and pointer alignment of sonet data channels | |
| KR100333036B1 (en) | Program guide information producing apparatus and related program guide information collecting/transmitting system | |
| KR100973835B1 (en) | Method for processing digital streams | |
| JPS59210746A (en) | Digital signal transmitter | |
| GB2139049B (en) | Multiplexed digital data transmission | |
| US20030147391A1 (en) | Broadcast transmission apparatus | |
| US7190697B2 (en) | Multiplexing of selection from among streams and parsed-out time synchronization information | |
| EP4123971A1 (en) | Processing data in an ethernet protocol stack | |
| EP1175786B1 (en) | Method, transmitter and transmission system | |
| BR0102017A (en) | Method and apparatus for transmitting broadcasts | |
| Cutmore et al. | Experimental digital audio routeing in the BBC's radio operations | |
| JP2000115096A (en) | Hierarchized transmission method for ground digital broadcasting system | |
| KR20030030133A (en) | Method for producing Data transmission rate and Apparatus for transmitting | |
| JP2005277465A (en) | Video image distributor | |
| MXPA00006842A (en) | Video program bearing transport stream remultiplexer | |
| JPH02226837A (en) | Access control system for communication network | |
| JPH1093521A (en) | Digital signal transmission method and receiver |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
| AK | Designated contracting states |
Kind code of ref document: A2 Designated state(s): DE FR GB |
|
| 17P | Request for examination filed |
Effective date: 19980805 |
|
| 17Q | First examination report despatched |
Effective date: 20010111 |
|
| GRAG | Despatch of communication of intention to grant |
Free format text: ORIGINAL CODE: EPIDOS AGRA |
|
| GRAG | Despatch of communication of intention to grant |
Free format text: ORIGINAL CODE: EPIDOS AGRA |
|
| GRAH | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOS IGRA |
|
| GRAH | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOS IGRA |
|
| GRAA | (expected) grant |
Free format text: ORIGINAL CODE: 0009210 |
|
| AK | Designated contracting states |
Kind code of ref document: B1 Designated state(s): DE FR GB |
|
| REG | Reference to a national code |
Ref country code: GB Ref legal event code: FG4D |
|
| REF | Corresponds to: |
Ref document number: 69714549 Country of ref document: DE Date of ref document: 20020912 |
|
| ET | Fr: translation filed | ||
| PLBE | No opposition filed within time limit |
Free format text: ORIGINAL CODE: 0009261 |
|
| STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT |
|
| 26N | No opposition filed |
Effective date: 20030508 |
|
| REG | Reference to a national code |
Ref country code: GB Ref legal event code: 746 Effective date: 20050609 |
|
| REG | Reference to a national code |
Ref country code: GB Ref legal event code: 732E Free format text: REGISTERED BETWEEN 20090305 AND 20090311 |
|
| PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: FR Payment date: 20090513 Year of fee payment: 13 |
|
| REG | Reference to a national code |
Ref country code: FR Ref legal event code: ST Effective date: 20110131 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: FR Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20100531 |
|
| REG | Reference to a national code |
Ref country code: GB Ref legal event code: 732E Free format text: REGISTERED BETWEEN 20120628 AND 20120704 |
|
| REG | Reference to a national code |
Ref country code: DE Ref legal event code: R082 Ref document number: 69714549 Country of ref document: DE Representative=s name: PATENTANWAELTE BRESSEL UND PARTNER MBB, DE Effective date: 20121213 Ref country code: DE Ref legal event code: R082 Ref document number: 69714549 Country of ref document: DE Representative=s name: PATENTANWAELTE BRESSEL UND PARTNER, DE Effective date: 20121213 Ref country code: DE Ref legal event code: R081 Ref document number: 69714549 Country of ref document: DE Owner name: PENDRAGON WIRELESS LLC (A NEVADA MANAGED LIMIT, US Free format text: FORMER OWNER: IPG ELECTRONICS 503 LTD., ST. PETER PORT, GUERNSEY, GB Effective date: 20121213 Ref country code: DE Ref legal event code: R081 Ref document number: 69714549 Country of ref document: DE Owner name: PENDRAGON WIRELESS LLC (A NEVADA MANAGED LIMIT, US Free format text: FORMER OWNER: IPG ELECTRONICS 503 LTD., ST. PETER PORT, GB Effective date: 20121213 |
|
| PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: DE Payment date: 20130522 Year of fee payment: 17 Ref country code: GB Payment date: 20130521 Year of fee payment: 17 |
|
| REG | Reference to a national code |
Ref country code: DE Ref legal event code: R119 Ref document number: 69714549 Country of ref document: DE |
|
| GBPC | Gb: european patent ceased through non-payment of renewal fee |
Effective date: 20140528 |
|
| REG | Reference to a national code |
Ref country code: DE Ref legal event code: R119 Ref document number: 69714549 Country of ref document: DE Effective date: 20141202 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: DE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20141202 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: GB Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20140528 |