US5917830A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Splicing compressed packetized digital video streams
Assignee: Google Technology Holdings LLC
•
Filing: 1996-10-18
•
Granted: 1999-06-29
•
Expires: 2016-10-18
Abstract
Abstract A secondary packetized data stream, such as a commercial, is spliced with a primary packetized data stream, such as a network television program. The system does not require decompression of the data in the primary data stream, and is particularly suitable for use at a cable system headend to allow the insertion of commercials from local businesses into a nationally broadcast television program. When a start signal is received, a pre-splicing packet of the primary stream is determined. The pre-splicing packet is the packet closest to the start time which carries an anchor frame (e.g., I or P frame) start code. To prevent a potential discontinuity at the decoder, the pre-splicing packet is processed to discard the anchor frame data, and to insert a number of stuffing bytes which is equal to the number of bytes discarded into an adaptation field of the pre-splicing packet. To further maintain continuity at the decoder, identifying data of the primary stream such as PID and PSI data, is retrieved and provided to the secondary stream. A number of null packets are inserted into the output stream at the transition point between the main program and the commercial to prevent a buffer overflow at a decoder which receives the output stream.
Inventors
- 👤 David Chen
- 👤 Weidong Mao
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 20:16
CPC Classifications
H; H04; H04N; H04N21/00; H04N21/20; H04N21/23; H04N21/236; H04N21/23611; H04N21/21; H04N21/222; H04N21/2221; H04N21/234; H04N21/23406; H04N21/23424; H04N21/23608; H04N21/2365; H04N21/242; H04N21/40; H04N21/43; H04N21/434; H04N21/4344; H04N21/4347; H04N21/44; H04N21/44004; H04N21/44016; H04N21/80; H04N21/81; H04N21/812; H04N7/00; H04N7/16; H04N7/162; H04N7/165; H04N7/24; H04N7/52
Claims Analysis
Total Claims: 34
Claim 1
Independent Claim
106 words
A method for splicing a secondary packetized data stream with a primary packetized data stream, comprising the steps of: providing a start signal indicating a time to initiate said splicing; determining a pre-splicing packet of said primary stream according to said start signal; providing an output stream where a first packet of said secondary stream is positioned to follow said pre-splicing packet; determining a post-slicing packet of said primary stream which follows said pre-splicing packet; discarding data of said pre-splicing packet which is associated with said post-splicing packet; and adding an amount of stuffing data to said pre-splicing packet according to the amount of data discarded.
Claim 2
Independent Claim
106 words
A method for splicing a secondary packetized data stream with a primary packetized data stream, comprising the steps of: providing a start signal indicating a time to initiate said splicing; determining a pre-splicing packet of said primary stream according to said start signal; providing an output stream where a first packet of said secondary stream is positioned to follow said pre-splicing packet; determining a post-slicing packet of said primary stream which follows said pre-splicing packet; discarding data of said pre-splicing packet which is associated with said post-splicing packet; and adding an amount of stuffing data to said pre-splicing packet according to the amount of data discarded.
Claim 3
Dependent Claim
53 words
A method in accordance with claim 1, wherein the packets of said primary stream and said secondary stream have identifying data associated therewith, comprising the further steps of: retrieving said identifying data of said primary stream; and replacing said identifying data of said secondary stream with said identifying data of said primary stream.
Claim 4
Dependent Claim
76 words
A method in accordance with claim 1, comprising the further steps of: providing a number L of null packets in said output stream to prevent a buffer overflow at a decoder which receives said output stream; and inserting said null packets between said pre-splicing packet and said first packet; wherein said number L is determined according to respective data rates of said primary and secondary streams and according to a decoding delay time of said decoder.
Claim 5
Dependent Claim
30 words
A method in accordance with claim 2, wherein: the replaced identifying information of said secondary stream comprises at least one of program specific information (PSI) and packet identifier (PID) information.
Claim 6
Dependent Claim
31 words
A method in accordance with claim 1, wherein said pre-splicing packet is a packet of said primary stream with an anchor frame start code which is closest to said start time.
Claim 7
Dependent Claim
27 words
A method in accordance with claim 1, wherein said primary stream carries compressed digital data, and said splicing does not require decompression of said compressed digital data.
Claim 8
Dependent Claim
29 words
A method in accordance with claim 1, wherein: the discarded data of said pre-splicing packet includes at least an anchor frame start code and a data field associated therewith.
Claim 9
Independent Claim
114 words
An apparatus for splicing a secondary packetized data stream with a primary packetized data, comprising: means for providing a start signal indicating a time to initiate said splicing; means for determining a pre-splicing packet of said primary stream according to said start signal; means for providing an output stream where a first packet of said secondary stream is positioned to follow said pre-splicing packet; means for determining a post-splicing packet of said primary stream which follows said pre-splicing packet; means for discarding data of said pre-splicing packet which is associated with said post-splicing packet; and means for adding an amount of stuffing data to said pre-splicing packet according to the amount of data discarded.
Claim 10
Independent Claim
114 words
An apparatus for splicing a secondary packetized data stream with a primary packetized data, comprising: means for providing a start signal indicating a time to initiate said splicing; means for determining a pre-splicing packet of said primary stream according to said start signal; means for providing an output stream where a first packet of said secondary stream is positioned to follow said pre-splicing packet; means for determining a post-splicing packet of said primary stream which follows said pre-splicing packet; means for discarding data of said pre-splicing packet which is associated with said post-splicing packet; and means for adding an amount of stuffing data to said pre-splicing packet according to the amount of data discarded.
Claim 11
Dependent Claim
54 words
An apparatus in accordance with claim 8, wherein the packets of said primary stream and said secondary stream have identifying data associated therewith, further comprising: means for retrieving said identifying data of said primary stream; and means for replacing said identifying data of said secondary stream with said identifying data of said primary stream.
Claim 12
Dependent Claim
30 words
An apparatus in accordance with claim 9, wherein: the replaced identifying information of said secondary stream comprises at least one of program specific information (PSI) and packet identifier (PID) information.
Claim 13
Dependent Claim
77 words
An apparatus in accordance with claim 8, further comprising: means for providing a number L of null packets in said output stream to prevent a buffer overflow at a decoder which receives said output stream; and means for inserting said null packets between said pre-splicing packet and said first packet; wherein said number L is determined according to respective data rates of said primary and secondary streams and according to a decoding delay time of said decoder.
Claim 14
Dependent Claim
31 words
An apparatus in accordance with claim 8, wherein said pre-splicing packet is a packet of said primary stream with an anchor frame start code which is closest to said start time.
Claim 15
Dependent Claim
29 words
An apparatus in accordance with claim 8, wherein: the discarded data of said pre-splicing packet includes at least an anchor frame start code and a data field associated therewith.
Claim 16
Dependent Claim
42 words
An apparatus in accordance with claim 8, wherein said stuffing data is added to said pre-splicing packet in an adaptation field thereof, further comprising: means for creating said adaptation field if said adaptation field is not already present in said pre-splicing packet.
Claim 17
Dependent Claim
118 words
A decoder for decoding a transport data stream which comprises a secondary packetized data stream which is spliced with a primary packetized data stream, wherein a first packet of said secondary stream is positioned to follow a pre-splicing packet of said primary stream, said decoder comprising: a buffer for storing said transport data; and a processor coupled to receive data from said buffer for processing said transport data; wherein: a number L of null packets are provided between said pre-splicing packet and said first packet to prevent overflow of said buffer; and said number L is determined according to respective data rates of said primary and secondary streams and according to a decoding delay time of said decoder.
Claim 18
Dependent Claim
118 words
A decoder for decoding a transport data stream which comprises a secondary packetized data stream which is spliced with a primary packetized data stream, wherein a first packet of said secondary stream is positioned to follow a pre-splicing packet of said primary stream, said decoder comprising: a buffer for storing said transport data; and a processor coupled to receive data from said buffer for processing said transport data; wherein: a number L of null packets are provided between said pre-splicing packet and said first packet to prevent overflow of said buffer; and said number L is determined according to respective data rates of said primary and secondary streams and according to a decoding delay time of said decoder.
Claim 19
Independent Claim
131 words
A method for splicing a secondary packetized data stream with a primary packetized data stream, comprising the steps of: providing a start signal indicating a time to initiate said splicing; determining a pre-splicing packet of said primary stream according to said start signal; providing an output stream where a first packet of said secondary stream is positioned to follow said pre-splicing packet; determining a post-splicing packet of said primary stream which follows said pre-splicing packet; positioning said post-splicing packet to follow a last packet of said secondary stream in said output stream; discarding data of said post-splicing packet which is associated with a packet of said primary stream which precedes said post-splicing packet; and adding an amount of stuffing data to said post-splicing packet according to the amount of data discarded.
Claim 20
Independent Claim
131 words
A method for splicing a secondary packetized data stream with a primary packetized data stream, comprising the steps of: providing a start signal indicating a time to initiate said splicing; determining a pre-splicing packet of said primary stream according to said start signal; providing an output stream where a first packet of said secondary stream is positioned to follow said pre-splicing packet; determining a post-splicing packet of said primary stream which follows said pre-splicing packet; positioning said post-splicing packet to follow a last packet of said secondary stream in said output stream; discarding data of said post-splicing packet which is associated with a packet of said primary stream which precedes said post-splicing packet; and adding an amount of stuffing data to said post-splicing packet according to the amount of data discarded.
Claim 21
Dependent Claim
41 words
A method in accordance with claim 16, wherein said post-splicing packet is a packet of said primary stream with a sequence start code which directly follows a sequence end code which is associated with said last packet of said secondary stream.
Claim 22
Dependent Claim
53 words
A method in accordance with claim 16, wherein the packets of said primary stream and said secondary stream have identifying data associated therewith, comprising the further steps of: retrieving said identifying data of said primary stream; and replacing said identifying data of said secondary stream with said identifying data of said primary stream.
Claim 23
Dependent Claim
30 words
A method in accordance with claim 18, wherein: the replaced identifying information of said secondary stream comprises at least one of program specific information (PSI) and packet identifier (PID) information.
Claim 24
Dependent Claim
76 words
A method in accordance with claim 16, comprising the further steps of: providing a number L of null packets in said output stream to prevent a buffer overflow at a decoder which receives said output stream; and inserting said null packets between said pre-splicing packet and said first packet; wherein said number L is determined according to respective data rates of said primary and secondary streams, and according to a decoding delay time of said decoder.
Claim 25
Dependent Claim
31 words
A method in accordance with claim 16, wherein: said pre-splicing packet is a packet of said primary stream with an anchor frame start code which is closest to said start time.
Claim 26
Independent Claim
142 words
An apparatus for splicing a secondary packetized data stream with a primary packetized data stream, comprising: means for providing a start signal indicating a time to initiate said splicing; means for determining a pre-splicing packet of said primary stream according to said start signal; means for providing an output stream where a first packet of said secondary stream is positioned to follow said pre-splicing packet; means for determining a post-splicing packet of said primary stream which follows said pre-splicing packet; means for positioning said post-splicing packet to follow a last packet of said secondary stream in said output stream; means for discarding data of said post-splicing packet that is associated with a packet of said primary stream which precedes said post-splicing packet; and means for adding an amount of stuffing data to said post-splicing packet according to the amount of data discarded.
Claim 27
Independent Claim
142 words
An apparatus for splicing a secondary packetized data stream with a primary packetized data stream, comprising: means for providing a start signal indicating a time to initiate said splicing; means for determining a pre-splicing packet of said primary stream according to said start signal; means for providing an output stream where a first packet of said secondary stream is positioned to follow said pre-splicing packet; means for determining a post-splicing packet of said primary stream which follows said pre-splicing packet; means for positioning said post-splicing packet to follow a last packet of said secondary stream in said output stream; means for discarding data of said post-splicing packet that is associated with a packet of said primary stream which precedes said post-splicing packet; and means for adding an amount of stuffing data to said post-splicing packet according to the amount of data discarded.
Claim 28
Dependent Claim
41 words
An apparatus in accordance with claim 22, wherein said post-splicing packet is a packet of said primary stream with a sequence start code which directly follows a sequence end code which is associated with said last packet of said secondary stream.
Claim 29
Dependent Claim
54 words
An apparatus in accordance with claim 22, wherein the packets of said primary stream and said secondary stream have identifying data associated therewith, further comprising: means for retrieving said identifying data of said primary stream; and means for replacing said identifying data of said secondary stream with said identifying data of said primary stream.
Claim 30
Dependent Claim
30 words
An apparatus in accordance with claim 24, wherein: the replaced identifying information of said secondary stream comprises at least one of program specific information (PSI) and packet identifier (PID) information.
Claim 31
Dependent Claim
77 words
An apparatus in accordance with claim 22, further comprising: means for providing a number L of null packets in said output stream to prevent a buffer overflow at a decoder which receives said output stream; and means for inserting said null packets between said pre-splicing packet and said first packet; wherein said number L is determined according to respective data rates of said primary and secondary streams, and according to a decoding delay time of said decoder.
Claim 32
Dependent Claim
31 words
An apparatus in accordance with claim 22, wherein: said pre-splicing packet is a packet of said primary stream with an anchor frame start code which is closest to said start time.
Claim 33
Dependent Claim
27 words
An apparatus in accordance with claim 8, wherein said primary stream carries compressed digital data, and said splicing does not require decompression of said compressed digital data.
Claim 34
Dependent Claim
43 words
A method in accordance with claim 1, wherein said stuffing data is added to said pre-splicing packet in an adaptation field thereof, comprising the further step of: creating said adaptation field if said adaptation field is not already present in said pre-splicing packet.
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) | 2002-06-28 | 2002-12-28 | 2003-06-29 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-06-28 | 2006-12-28 | 2007-06-29 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-06-28 | 2010-12-28 | 2011-06-29 | $7700.00 | Window Closed / Lapsed |