US6351471B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Brandwidth optimization of video program bearing transport streams
Assignee: Ericsson Television Inc
•
Filing: 1998-01-14
•
Granted: 2002-02-26
•
Expires: 2018-01-14
Abstract
Abstract A method and system are provided for remultiplexing program bearing data. The remultiplexing method and system are applicable to MPEG-2 compliant transport streams carrying video programs. A descriptor based system is used for scheduling the timely output of transport packets wherein each descriptor records a dispatch time as well as a receipt time for each transport packet. The receipt time is used for estimating program clock reference adjustments, but final program clock reference adjustment is performed in hardware in relation to the precise output timing of each transport packets. A descriptor and transport packet caching technique is used for decoupling the synchronous receipt and transmission of transport packets from any asynchronous processing performed thereon. The descriptors can also be used for managing scrambling and descrambling control words (encryption and decryption keys). Remultiplexing functions may be distributed across a network. The remultiplexer can furthermore optimize the bandwidth of transport streams by replacing null transport packets with transport packet data to be inserted into the output transport stream. Program data transmitted via asynchronous communication links is re-timed and assistance is provided for outputting program data on such asynchronous communication links to reduce a variation in end-to-end delay incurred by the program data. Remultiplexing and program specific information can be seamlessly dynamically varied without stopping, or introducing a discontinuity in, the flow of outputted transport packets. A technique is also provided for locking multiple internal reference clock generators.
Inventors
- 👤 Robert Robinett
- 👤 Regis Gratacap
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 16:48
CPC Classifications
H; H04; H04N; H04N21/00; H04N21/20; H04N21/23; H04N21/234; H04N21/23424; H04N21/236; H04N21/23608; H04N21/60; H04N21/63; H04N21/633; H04N21/6332; H04N21/6334; H04N21/63345; H04N21/80; H04N21/85; H04N21/854; H04N21/8547
Claims Analysis
Total Claims: 28
Claim 1
Independent Claim
156 words
A method for optimizing the bandwidth of a transport stream comprising the steps of: (a) receiving a transport stream having a given bit rate, said transport stream including variably compressed program data bring transport packets and one or more null transport packets, each of said null transport packets occupying a time period of said received transport stream to maintain said given bit rate of said transport stream in lieu of compressed program data bearing transport packets, (b) selectively replacing one or more of said null transport packets with another to-be-remultiplexed non-null data bearing transport packet, and (c) independently of determining an amount of information carried by program data bearing transport packets from time to time in said received transport stream, scheduling at least one selected program data bearing transport packet for output in an output remultiplexed bitstream said scheduling being performed to transmit said program data at said given bit rate for proper receipt and decoding.
Claim 2
Independent Claim
156 words
A method for optimizing the bandwidth of a transport stream comprising the steps of: (a) receiving a transport stream having a given bit rate, said transport stream including variably compressed program data bring transport packets and one or more null transport packets, each of said null transport packets occupying a time period of said received transport stream to maintain said given bit rate of said transport stream in lieu of compressed program data bearing transport packets, (b) selectively replacing one or more of said null transport packets with another to-be-remultiplexed non-null data bearing transport packet, and (c) independently of determining an amount of information carried by program data bearing transport packets from time to time in said received transport stream, scheduling at least one selected program data bearing transport packet for output in an output remultiplexed bitstream said scheduling being performed to transmit said program data at said given bit rate for proper receipt and decoding.
Claim 3
Dependent Claim
17 words
The method of claim 1 wherein said another to-be-remultiplexed data bearing transport packet contains program specific information.
Claim 4
Dependent Claim
33 words
The method of claim 1 wherein said another to-be-remultiplexed data bearing transport 15 , packet contains transactional data having no bit rate or transmission latency requirement for presenting information in a continuous fashion.
Claim 5
Dependent Claim
43 words
The method of claim 3 wherein said step (b) further comprises selectively assigning data bearing transport packets to time periods of said outputted transport stream so as to regulate a transmission bit rate of said data bearing transport packets to a receiver buffer.
Claim 6
Dependent Claim
67 words
The method of claim 1 further comprising the steps of: (d) scheduling selected ones of said transport packets containing non-null data for output in an outputted transport stream, and (e) discarding at least one of said received null transport packets and scheduling said to-be-remultiplexed non-null data bearing transport packet for output in said outputted transport stream in lieu of said at least one discarded null transport packet.
Claim 7
Dependent Claim
96 words
The method of claim 5 further comprising the steps of: (f) at each time period of said outputted transport stream for which a corresponding one of said stored transport packets is scheduled outputting said corresponding stored transport packet scheduled for said time period, and (g) if no transport packet is scheduled for output at one of said time periods, outputting a null transport packet, wherein said null transport packets of said outputted transport stream occupy less bandwidth of said outputted transport stream than said null transport packets occupy in each transport stream received in step (a).
Claim 8
Dependent Claim
58 words
The method of claim 1 further comprising the step of: (d) independently of determining said given bit rate of said transport packets, scheduling at least one selected program data bearing transport packet for output in an output remultiplexed bitstream, said scheduling being performed to transmit said program data at said given bit rate for proper receipt and decoding.
Claim 9
Dependent Claim
23 words
The method of claim 7 wherein said given bit rate is constant only between pairs of program clock reference values of said program.
Claim 10
Dependent Claim
88 words
The method of claim 1 further comprising the step of: (d) independently of determining a precise time at which a program clock reference is received in at least a selected one of said program data bearing transport packets, scheduling said selected program data bearing transport packet for output in an output remultiplexed bitstream, said scheduling being performed to transmit said program clock reference value with said output remultiplexed transport stream for receipt for decoding at a correct time relative to other data bearing transport packets of said program.
Claim 11
Dependent Claim
165 words
A remultiplexer for optimizing the bandwidth of a transport stream comprising: a first interface for receiving a transport stream having a given bit rate, said transport stream including variably compressed program data bearing transport packets and one or more null transport packets, each of said null transport packets occupying a time period of said received transport stream to maintain said given bit rate of said transport stream in lieu of compressed program data bearing transport packets, and a processor for selectively replacing one or more of said null transport packets with another to be-remutiplexed non-null data bearing transport packets, wherein said processor is also for, independently of determining an amount of information carried by program data bearing transport packets from time to time in said received transport stream, scheduling at least one selected program data bearing transport packet for output in an output remultiplexed bit stream, said scheduling being performed to transmit said program data at said given bit rate for proper receipt and decoding.
Claim 12
Dependent Claim
165 words
A remultiplexer for optimizing the bandwidth of a transport stream comprising: a first interface for receiving a transport stream having a given bit rate, said transport stream including variably compressed program data bearing transport packets and one or more null transport packets, each of said null transport packets occupying a time period of said received transport stream to maintain said given bit rate of said transport stream in lieu of compressed program data bearing transport packets, and a processor for selectively replacing one or more of said null transport packets with another to be-remutiplexed non-null data bearing transport packets, wherein said processor is also for, independently of determining an amount of information carried by program data bearing transport packets from time to time in said received transport stream, scheduling at least one selected program data bearing transport packet for output in an output remultiplexed bit stream, said scheduling being performed to transmit said program data at said given bit rate for proper receipt and decoding.
Claim 13
Dependent Claim
17 words
The remultiplexer of claim 10 wherein said another to-be-remultiplexed data bearing transport packet contains program specific information.
Claim 14
Dependent Claim
31 words
The remultiplexer of claim 10 wherein said another to-be-remultiplexed data bearing transport packet contains transactional data having no bit rate or transmission latency requirement for presenting information in a continuous fashion.
Claim 15
Dependent Claim
40 words
The remultiplexer of claim 12 wherein said processor selectively assigns data bearing transport packets to time periods of said outputted transport stream so as to regulate a transmission bit rate of said data bearing transport packets to a receiver buffer.
Claim 16
Dependent Claim
71 words
The remultiplexer of claim 10 wherein said first interface and said processor are also for scheduling selected ones of said transport packets containing non-null data for output in an outputed transport stream, for discarding at least one of said received null transport packets and for scheduling said to-be-remultiplexed non-null data bearing transport packet for output in said outputted transport stream in lieu of said at least one discarded null transport packet.
Claim 17
Dependent Claim
103 words
The remultiplexer of claim 14 further comprising a second interface for outputting said outputted transport stream, wherein, at each time period of said outputted transport stream for which a corresponding one of said stored transport packets is scheduled, said second interface outputs said corresponding stored transport packet scheduled for said time period, and, if no transport packet is scheduled for output at one of said time periods, said second interface outputs a null transport packet, said null transport packets of said outputted transport stream occupying less bandwidth of said outputted transport stream than said null transport packets occupy in each received transport stream.
Claim 18
Dependent Claim
58 words
The remultiplexer of claim 10 wherein said processor is also for, independently of determining said given bit rate of said transport packets, scheduling at least one selected program data bearing transport packet for output in an output remultiplexed bitstream, said scheduling being performed to transmit said program data at said given bit rate for proper receipt and decoding.
Claim 19
Dependent Claim
23 words
The remultiplexer of claim 16 wherein said given bit rate is constant only between pairs of program clock reference values of said program.
Claim 20
Dependent Claim
88 words
The remultiplexer of claim 10 wherein said processor is also for, independently of determining a precise time at which a program clock reference is received in at least a selected one of said program data bearing transport packets, scheduling said selected program data bearing transport packet for output in an output remultiplexed bitstream, said scheduling being performed to transmit said program clock reference value with said output remultiplexed transport stream for receipt for decoding at a correct time relative to other data bearing transport packets of said program.
Claim 21
Dependent Claim
152 words
A bandwidth optimized transport stream produced by the steps of: (a) receiving a transport stream having a given bit rate, said transport steam including variably compressed program data bearing transport packets and one or more null transport packets, each of said null transport packets occupying a time period of said received transport stream to maintain said predetermined bit rate of said transport stream in lieu of compressed program data bearing transport packets, (b) selectively replacing one or more of said null transport packets with another to-be-remultiplexed non-null data bearing transport packet, and (c) independently of determining an amount of information carried by program data bearing transport packets from time to time in said received transport stream, scheduling at least one selected program data bearing transport packet for output in an output remultiplexed bitstream, said scheduling being performed to transmit said program data at said given bit rate for proper receipt and decoding.
Claim 22
Dependent Claim
152 words
A bandwidth optimized transport stream produced by the steps of: (a) receiving a transport stream having a given bit rate, said transport steam including variably compressed program data bearing transport packets and one or more null transport packets, each of said null transport packets occupying a time period of said received transport stream to maintain said predetermined bit rate of said transport stream in lieu of compressed program data bearing transport packets, (b) selectively replacing one or more of said null transport packets with another to-be-remultiplexed non-null data bearing transport packet, and (c) independently of determining an amount of information carried by program data bearing transport packets from time to time in said received transport stream, scheduling at least one selected program data bearing transport packet for output in an output remultiplexed bitstream, said scheduling being performed to transmit said program data at said given bit rate for proper receipt and decoding.
Claim 23
Dependent Claim
70 words
The bandwidth optimized bitstream of claim 19 produced by the further steps of: (d) scheduling selected ones of said transport packets containing non-null data for output in an outputted transport stream, and (e) discarding at least one of said received null transport packets and scheduling said to-be-remultiplexed non-null data bearing transport packet for output in said outputted transport stream in lieu of said at least one discarded null transport packet.
Claim 24
Dependent Claim
100 words
The bandwidth optimized transport stream of claim 20 produced by the further steps of: (f) at each time period of said outputted transport stream for which a corresponding one of said stored transport packets is scheduled, outputting said corresponding stored transport packet scheduled for said the period, and (g) if no transport packet is scheduled for output at one of said time periods, outputting a null transport packet, wherein said null transport packets of said outputted transport stream occupy less bandwidth of said outputted transport stream than said null transport packets occupy in each transport stream received in step (a).
Claim 25
Dependent Claim
49 words
The bandwidth optimized transport stream of claim 19 wherein said step (b) further comprises the step of selectively assigning data bearing transport packets to time periods of said outputted transport stream so as to regulate a transmission bit rate of said data bearing transport packets to a receiver buffer.
Claim 26
Dependent Claim
62 words
The bandwidth optimized transport stream of claim 19 produced by the further step of: (d) independently of determining said given bit rate of said transport packets, scheduling at least one selected program data bearing transport packet for output in an output remultiplexed bitstream, said scheduling being performed to transmit said program data at said given bit rate for proper receipt and decoding.
Claim 27
Dependent Claim
26 words
The bandwidth optimized transport stream of claim 23 wherein said given bit rate is constant only between pairs of program clock reference values of said program.
Claim 28
Dependent Claim
92 words
The bandwidth optimized transport stream of claim 19 produced by the further step of: (d) independently of determining a precise time at which a program clock reference is received in at least a selected one of said program data bearing transport packets, scheduling said selected program data bearing transport packet for output in an output remultiplexed bitstream said scheduling being performed to transmit said program clock reference value with said output remultiplexed transport stream for receipt for decoding at a correct time relative to other data bearing transport packets of said program.
References Cited (Backward Citations)
US3692942A
Cited
US4920534A
Cited
US4748618A
Cited
US5477236A
Cited
US5457780A
Cited
US5365272A
Cited
US5289276A
Cited
US5371547A
Cited
US5287182A
Cited
US5287178A
Cited
US5790176A
Cited
US5231486A
Cited
US5400401A
Cited
US5418782A
Cited
US5426464A
Cited
US5333135A
Cited
US5396497A
Cited
US5410355A
Cited
US5361097A
Cited
US5396492A
Cited
US5381181A
Cited
US5430485A
Cited
US5467139A
Cited
US5473601A
Cited
US5515106A
Cited
US5457701A
Cited
US5566208A
Cited
US5420866A
Cited
US5566174A
Cited
US5521979A
Cited
US5475754A
Cited
US5475688A
Cited
US5459789A
Cited
US5619501A
Cited
US5548532A
Cited
US5539920A
Cited
US5448568A
Cited
US5563648A
Cited
US5570335A
Cited
US5473609A
Cited
US5489947A
Cited
US5617146A
Cited
US5568403A
Cited
US5603058A
Cited
US5559999A
Cited
US5652627A
Cited
US5835668A
Cited
US5510845A
Cited
US5517250A
Cited
US5588025A
Cited
US5544161A
Cited
US5650825A
Cited
US5535209A
Cited
US5561791A
Cited
US5621463A
Cited
US5574505A
Cited
US5691986A
Cited
US5978542A
Cited
US5742623A
Cited
US5598415A
Cited
US5579317A
Cited
US6049551A
Cited
US5790543A
Cited
US5801781A
Cited
US5956088A
Cited
US5877812A
Cited
US5703877A
Cited
US6044396A
Cited
US5640388A
Cited
US5835493A
Cited
US5754783A
Cited
US5742599A
Cited
US5914962A
Cited
US5905732A
Cited
US5917830A
Cited
US5812529A
Cited
US6078958A
Cited
US6058109A
Cited
US6052384A
Cited
US5991912A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2005-02-25 | 2005-08-27 | 2006-02-26 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2009-02-25 | 2009-08-27 | 2010-02-26 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2013-02-25 | 2013-08-27 | 2014-02-26 | $7700.00 | Window Closed / Lapsed |