US5566174A
Expired / Lapsed
US
⏱️ 0.0 years remaining
MPEG information signal conversion system
Assignee: Philips North America LLC
•
Filing: 1994-09-07
•
Granted: 1996-10-15
•
Expires: 2014-09-07
Abstract
Abstract A method of transmitting timing critical data via an asynchronous channel. The timing critical data can be an MPEG transport stream of packets. The asynchronous channel can be a computer or telephone network, a digital storage media such as a digital VCR, or a digital interface. The packets are processed serially through a remuxer to obtain a constant rate and delivered to and consumed by one or more target decoders, for example, inside a TV set or in a set-top decoder. To prevent overflow of the transport buffers inside these decoders, a single monitor-scheduler is provided which monitors the transport buffers and delivers to each the packets wanted scheduled so as to avoid buffer overflow and loss of information. The method also includes restamping the transport packets with new PCRs. The remuxing scheme is simple enough to implement on DVCR or other consumer applications. Also described is a method for recording the output stream which selects out desired program material and tags the transport packets with SOA tags.
Inventors
- 👤 Takashi Sato
- 👤 Imran A. Shah
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 18:57
CPC Classifications
H; H04; H04N; H04N21/00; H04N21/20; H04N21/23; H04N21/234; H04N21/23406; G; G11; G11B; G11B15/00; G11B15/18; G11B15/1808; G11B15/1875; G11B20/00; G11B20/10; G11B20/12; G11B20/1201; G11B20/1207; G11B20/1208; G11B27/00; G11B27/005; G11B27/10; G11B27/19; G11B27/28; G11B27/30; G11B27/3027; G11B27/3036; G11B27/3054; G11B27/3063; G11B27/309; H04L; H04L12/00; H04L12/28; H04L12/40; H04L12/40052; H04L12/40117; H04N21/236; H04N21/238; H04N21/2381; H04N21/242; H04N21/40; H04N21/43; H04N21/4302; H04N21/4305; H04N21/433; H04N21/4334; H04N21/434; H04N21/4344; H04N21/436; H04N21/4363; H04N21/43632; H04N21/438; H04N21/4381; H04N21/44; H04N21/44004; H04N21/80; H04N21/83; H04N21/845; H04N21/8455; H04N9/00; H04N9/79; H04N9/80; H04N9/804; H04N9/8042; G11B2220/00; G11B2220/90; H04N5/00; H04N5/76; H04N5/78; H04N5/782; H04N5/7824; H04N5/7826; H04N5/78263; H04N5/78266; H04N5/783; H04N9/82; H04N9/8205; H04N9/8227
Claims Analysis
Total Claims: 18
Claim 1
Independent Claim
140 words
A method of processing a first transport stream of transport packets of valid timing-critical-information, and of unknown transport rate that may be of varying rate or bursty, to form a second transport stream of transport packets of known constant rate and of valid timing-critical-information, said second transport stream being supplied to and consumed by at least one target apparatus having a target buffer with a known read-out rate, comprising the steps: (i) providing a packet scheduler and providing to the scheduler the leak rate of the target buffer, (ii) processing the transport packets of the first transport stream in a serial manner through the scheduler to produce the second transport stream, said scheduler monitoring the target buffer and delivering the transport packets in the second transport stream to the target buffer timed so as not to overflow the target buffer.
Claim 2
Independent Claim
140 words
A method of processing a first transport stream of transport packets of valid timing-critical-information, and of unknown transport rate that may be of varying rate or bursty, to form a second transport stream of transport packets of known constant rate and of valid timing-critical-information, said second transport stream being supplied to and consumed by at least one target apparatus having a target buffer with a known read-out rate, comprising the steps: (i) providing a packet scheduler and providing to the scheduler the leak rate of the target buffer, (ii) processing the transport packets of the first transport stream in a serial manner through the scheduler to produce the second transport stream, said scheduler monitoring the target buffer and delivering the transport packets in the second transport stream to the target buffer timed so as not to overflow the target buffer.
Claim 3
Dependent Claim
35 words
A method as claimed in claim 1, further comprising the step: (iii) modifying the timing-critical-information in the transport packets of the second transport stream to take into account the processing delays encountered in step (ii).
Claim 4
Dependent Claim
37 words
A method as claimed in claim 1, further comprising an asynchronous channel located downstream of the scheduler and before the target buffer, said scheduler delivering the second transport stream to the target buffer via the asynchronous channel.
Claim 5
Dependent Claim
22 words
The method of claim 3, wherein the first transport stream is an MPEG data stream, and the channel is a digital VCR.
Claim 6
Dependent Claim
40 words
A method as claimed in claim 1, further comprising at least some of the packets in the first transport stream having a PCR, and restamping those packets with a new PCR at the time the second transport stream is formed.
Claim 7
Independent Claim
174 words
A method of processing a first transport stream of transport packets having a PCR comprising plural bits representing valid timing-critical-information, and of unknown transport rate that may be of varying rate or bursty, to form a second transport stream of transport packets of known constant rate and of valid timing-critical-information, comprising the steps: (i) providing a local clock, (ii) processing the transport packets of the first transport stream in a serial manner while sampling the local clock when one bit of the PCR of each packet is processed and storing the sampled clock time for each packet, (iii) delaying the transport packets to avoid overflowing a downstream buffer, (iv) when ready to deliver the transport packets without overflowing the downstream buffer, re-processing the transport packets while re-sampling the local clock and determining for each transport packet a new sample time corresponding to the time of reprocessing of said one PCR bit and updating the PCR with the new sample time, (v) delivering the transport packets with updated PCRs to form the second transport stream.
Claim 8
Independent Claim
174 words
A method of processing a first transport stream of transport packets having a PCR comprising plural bits representing valid timing-critical-information, and of unknown transport rate that may be of varying rate or bursty, to form a second transport stream of transport packets of known constant rate and of valid timing-critical-information, comprising the steps: (i) providing a local clock, (ii) processing the transport packets of the first transport stream in a serial manner while sampling the local clock when one bit of the PCR of each packet is processed and storing the sampled clock time for each packet, (iii) delaying the transport packets to avoid overflowing a downstream buffer, (iv) when ready to deliver the transport packets without overflowing the downstream buffer, re-processing the transport packets while re-sampling the local clock and determining for each transport packet a new sample time corresponding to the time of reprocessing of said one PCR bit and updating the PCR with the new sample time, (v) delivering the transport packets with updated PCRs to form the second transport stream.
Claim 9
Dependent Claim
37 words
The method of claim 6, wherein the transport rate of the first transport stream is of the order of 50 Mbps and the transport rate of the second transport stream is of the order of 25 Mbps.
Claim 10
Independent Claim
109 words
A method of transmitting timing-critical data including a program clock reference (PCR) via an asynchronous channel downstream to apparatus including a target buffer having a limited read-out rate, comprising the steps: (i) receiving the timing-critical data subdivided into a stream of successive transport packets, (ii) determining the arrival time of each of the transport packets, (iii) temporarily storing the transport packets, (iv) computing the times when individual transport packets can be transmitted downstream to avoid overflowing the target buffer, (v) computing the departure time of each of said transport packets and modifying the PCR accordingly, (vi) transmitting downstream the transport packets in accordance with the computations of step (iv).
Claim 11
Independent Claim
109 words
A method of transmitting timing-critical data including a program clock reference (PCR) via an asynchronous channel downstream to apparatus including a target buffer having a limited read-out rate, comprising the steps: (i) receiving the timing-critical data subdivided into a stream of successive transport packets, (ii) determining the arrival time of each of the transport packets, (iii) temporarily storing the transport packets, (iv) computing the times when individual transport packets can be transmitted downstream to avoid overflowing the target buffer, (v) computing the departure time of each of said transport packets and modifying the PCR accordingly, (vi) transmitting downstream the transport packets in accordance with the computations of step (iv).
Claim 12
Dependent Claim
20 words
A method as claimed in claim 8, further comprising re-stamping the transmitted transport packets, before transmission, with a new PCR.
Claim 13
Dependent Claim
251 words
A method as claimed in claim 8, further comprising: (1) selecting the desired packets from the incoming transport stream by a filter, (2) storing for the selected packets the sampled arrival time of a local clock, (3) storing the selected transport packets via a local buffer in a packet store, (4) whenever the packet store is empty and there is at least one packet in the local buffer, reading out the first packet in the local buffer and moving same to the packet store while simultaneously passing on to a scheduler information concerning the packet, (5) computing in the scheduler whether outputting of the packet in the packet store will overflow the downstream target buffer and signalling it to a MUX, (6) if the packet store has a packet and the scheduler signals that the target buffer will be OK, selecting in the MUX and reading out the transport packet in the packet store; otherwise, selecting in the MUX and outputting a Null packet from a Null packet generator, (7) modifying the PCR in the transport packet transmitted by the MUX in a PCR re-stamper using the following equation: PCR.sub.new =PCR.sub.old +(Clock.sub.current -Clock.sub.tagged)-Delay.sub.max ( 1) where, PCR new : New PCR value after restamping; PCR old : Old PCR value before restamping; Clock current : Current Clock value at restamping; Clock tagged : Clock value tagged at reception of the packet; Delay max : Maximum delay through restamping, which is a constant value to ensure that each PCR value never increases.
Claim 14
Dependent Claim
51 words
A method as claimed in claim 10, wherein said scheduler operates by knowing the read-out rate of the target buffer, by computing the downstream target buffer fullness at an output transport rate, and by delaying the transmission of any transport packets if the computation indicates that the target buffer will overflow.
Claim 15
Dependent Claim
43 words
A method as claimed in claim 10, further comprising means to record the selected packets, further comprising the steps: (viii) tagging the transport packets having the modified PCR with a sequence of arrival (SOA) tag, (ix) transmitting the tagged packets to a recorder.
Claim 16
Dependent Claim
313 words
Apparatus for generating from an incoming unknown first transport stream of transport packets having a PCR and of valid timing-critical-information a fixed-rate constant second transport stream comprising a sequence of transport packets comprising a PCR for delivery to a target buffer having a maximum read-out rate, comprising: (a) filter means for receiving the first transport stream for passing the transport packets desired to be included in the second transport stream, (b) a local clock measuring time, (c) a transport packet store for receiving the packets of the first transport stream, (d) a scheduler for storing the maximum read-out rate of the target buffer, (e) a first mux connected to the scheduler and to the transport packet store, (f) a source of Null packets connected to the first mux, (g) means in response to the transport packet store being empty and there being at least one transport packet available for moving said one transport packet to the transport packet store, (h) said scheduler being operative to determine whether outputting the transport packet in the transport packet store will satisfy a first condition that it will not overflow the target buffer or a second condition that it will overflow the target buffer and signalling the first mux that the transport packet in the transport packet store will satisfy the first or the second condition, (i) said first mux being operative in response to the signalling from the scheduler of the first condition to select and read out the said transport packet from the transport packet store and output it and in response to the signalling from the scheduler of the second condition to select a Null packet from the Null packet source and output it, (j) packet restamping means connected to the clock means and connected to receive the transport packets outputted by the mux for re-stamping said transport packets with a new PCR value.
Claim 17
Dependent Claim
313 words
Apparatus for generating from an incoming unknown first transport stream of transport packets having a PCR and of valid timing-critical-information a fixed-rate constant second transport stream comprising a sequence of transport packets comprising a PCR for delivery to a target buffer having a maximum read-out rate, comprising: (a) filter means for receiving the first transport stream for passing the transport packets desired to be included in the second transport stream, (b) a local clock measuring time, (c) a transport packet store for receiving the packets of the first transport stream, (d) a scheduler for storing the maximum read-out rate of the target buffer, (e) a first mux connected to the scheduler and to the transport packet store, (f) a source of Null packets connected to the first mux, (g) means in response to the transport packet store being empty and there being at least one transport packet available for moving said one transport packet to the transport packet store, (h) said scheduler being operative to determine whether outputting the transport packet in the transport packet store will satisfy a first condition that it will not overflow the target buffer or a second condition that it will overflow the target buffer and signalling the first mux that the transport packet in the transport packet store will satisfy the first or the second condition, (i) said first mux being operative in response to the signalling from the scheduler of the first condition to select and read out the said transport packet from the transport packet store and output it and in response to the signalling from the scheduler of the second condition to select a Null packet from the Null packet source and output it, (j) packet restamping means connected to the clock means and connected to receive the transport packets outputted by the mux for re-stamping said transport packets with a new PCR value.
Claim 18
Dependent Claim
28 words
Apparatus as claimed in claim 13, further comprising a recorder, means to tag the outputted transport packets with an SOA tag, means to record the tagged transport packets.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-10-15 | 2000-04-15 | 2000-10-15 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-10-15 | 2004-04-15 | 2004-10-15 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-10-15 | 2008-04-15 | 2008-10-15 | $7700.00 | Window Closed / Lapsed |