Patent Grant
7823174
A portion of the disclosure of this patent document contains material which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction of the patent document or the patent disclosure, as it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyright rights whatsoever.
Conventional digital video content, such as MPEG video, can take the form of a single program, movie or other content with no opportunity for a service provider or a user to modify the viewing experience by selecting alternative content. Various mechanisms have been proposed for providing interactive content, but usually such proposals have been expensive to implement, can take up large amounts of bandwidth, and may require expensive specialized equipment including servers and/or other support equipment. Therefore, although there is a demand for “interactive” applications which allow an end viewer of video content to tailor what they watch and manipulate the content, no commercially viable system has yet appeared in the marketplace.
The features of the invention believed to be novel are set forth with particularity in the appended claims. The invention itself however, both as to organization and method of operation, together with objects and advantages thereof, may be best understood by reference to the following detailed description of the invention, which describes certain exemplary embodiments of the invention, taken in conjunction with the accompanying drawings in which:
While this invention is susceptible of embodiment in many different forms, there is shown in the drawings and will herein be described in detail specific embodiments, with the understanding that the present disclosure is to be considered as an example of the principles of the invention and not intended to limit the invention to the specific embodiments shown and described. In the description below, like reference numerals are used to describe the same, similar or corresponding parts in the several views of the drawings.
The terms “scramble” and “encrypt” and variations thereof are used synonymously herein. The tern “video” may be used herein to embrace not only true visual information, but also in the conversational sense (e.g., “video tape recorder”) to embrace not only video signals but also associated audio and data. The present document generally uses the example of a “dual selective encryption” embodiment, but those skilled in the art will recognize that the present invention can be utilized to realize multiple partial encryption without departing from the invention. The terms “partial encryption” and “selective encryption” are used synonymously herein. Also, the terms “program” and “television program” and similar terms can be interpreted in the normal conversational sense, as well as a meaning wherein the term means any segment of A/V content that can be displayed on a television set or similar monitor device. The term “legacy” as used herein refers to existing technology used for existing cable and satellite systems. The exemplary embodiments disclosed herein are decoded by a television Set-Top Box (STB), but it is contemplated that such technology will soon be incorporated within television receivers of all types whether housed in a separate enclosure alone or in conjunction with recording and/or playback equipment or Conditional Access (CA) decryption module or within a television set itself. The present document generally uses the example of a “dual partial encryption” embodiment, but those skilled in the art will recognize that the present invention can be utilized to realize multiple partial encryption without departing from the invention. The term “package medium” and similar terms as used herein are intended to embrace a recording medium such as a Digital Versatile Disc (DVD), Compact Disc (CD) or other magnetic, optical or other recorded medium that is generally merchandised as a package that contains the electronic storage medium and is sold as a retail commodity, as contrasted to an electronically downloadable data stream. The term “macroblock” is used to mean an object formed from a collection of one or more blocks which is used to produce a video picture. This terminology is consistent with use of the term in the various MPEG (Moving Pictures Expert Group) video standards as well as AVC (Advanced Video Coding), but is not limited thereto.
The above-referenced commonly owned patent applications describe inventions relating to various aspects of methods generally referred to herein as partial encryption or selective encryption. More particularly, systems are described wherein selected portions of a particular selection of digital content are encrypted using two (or more) encryption techniques while other portions of the content are left unencrypted. The encrypted portions are identified and distinguished from one another by use of multiple packet identifiers. By properly selecting the portions to be encrypted, the content can effectively be encrypted for use under multiple decryption systems without the necessity of encryption of the entire selection of content. In some embodiments, only a few percent of data overhead is needed to effectively encrypt the content using multiple encryption systems. This results in a cable or satellite system being able to utilize Set-top boxes or other implementations of conditional access (CA) receivers from multiple manufacturers in a single system—thus freeing the cable or satellite company to competitively shop for providers of Set-top boxes.
The partial encryption processes described in the above patent applications utilize any suitable encryption method. However, these encryption techniques are selectively applied to the data stream, rather than encrypting the entire data stream, using techniques described in the above-referenced patent applications. In general, but without the intent to be limiting, the selective encryption process utilizes intelligent selection of information to encrypt so that the entire program does not have to undergo dual encryption. By appropriate selection of data to encrypt, the program material can be effectively scrambled and hidden from those who desire to hack into the system and illegally recover commercial content without paying. MPEG (or similar format) data that are used to represent the audio and video data does so using a high degree of reliance on the redundancy of information from frame to frame. Certain data can be transmitted as “anchor” data representing chrominance and luminance data. That data is then often simply moved about the screen to generate subsequent frames by sending motion vectors that describe the movement of the block. Changes in the chrominance and luminance data are also encoded as changes rather than a recoding of absolute anchor data. Thus, encryption of this anchor data, for example, or other key data can effectively render the video un-viewable.
In accordance with certain embodiments consistent with the above inventions, the selected video data to be encrypted may be any individual one or combination of the following (described in greater detail in the above applications): video slice headers appearing in an active region of a video frame, data representing an active region of a video frame, data in a star pattern within the video frame, data representing scene changes, I Frame packets, packets containing motion vectors in a first P frame following an I Frame, packets having an intra_slice_flag indicator set, packets having an intra_slice indicator set, packets containing an intra_coded macroblock, data for a slice containing an intra_coded macroblock, data from a first macroblock following the video slice header, packets containing video slice headers, anchor data, and P Frame data for progressively refreshed video data, data arranged in vertical and or horizontal moat patterns on the video frame, and any other selected data that renders the video and/or audio difficult to utilize. Several such techniques as well as others are disclosed in the above-referenced patent applications, any of which (or other techniques) can be utilized with the present invention to encrypt only a portion of the content.
In order to distinguish between the two or more digital television signals encrypted using the multiple encryption algorithms in accordance with the above inventions, multiple packet identifiers (PIDs) are utilized. Normally a single set of packet identifiers is used to identify a particular television program. When a television signal is encrypted under the multiple selective encryption arrangement described in the above-referenced applications, the clear content is assigned a first set of PIDs, and each set of encrypted content is assigned another set of PIDs (one set of encrypted content may share the same PID with the unencrypted content in certain embodiments). The receiving STB then remaps all of the appropriate content to a single PID for playback. This process is described in detail in the above patent applications.
Certain embodiments consistent with the present invention utilizes multiple PIDs associated with substitutable macroblocks of content as a mechanism to provide content substitution. Content substitution can be used to provide an enhanced level of customization of television programming in any number of ways. For example, content substitution can be used to provide targeted advertising to an audience by substitution of one advertisement for another. Content substitution can also be used to provide multiple endings, plots or other segments for a program, or to provide multiple views in a sportscast or other program. Other applications for the content substitution of the present invention will be discussed during the course of this discussion. Each of these applications, as well as others, can be facilitated using the present invention without need for dramatic increases in bandwidth and at reasonable cost for the hardware.
Referring now to
If the criterion is not met at 116, the processing of the main content (PID A) continues at 120. If the criterion is met at 116, a content substitution is carried out at 124 (e.g., by substitution of content with PID B for content with PID A, or by carrying out any of the other content substitution operations described herein including, but not limited to one-for-one substitution, one-for-one insertion or multiple-for-one insertion/deletion). Such substitution may entail a remapping of the PID values so that a decoder or other processor merely continues processing content with the same PID. Alternately, a decoder can be programmed to select the substituted content, when present, in preference to the main content. From 120 or 124, control passes to 128 where the content is examined to determine if the end has been reached. If not, control returns to processing content at 116. If the end is reached, the process stops at 132. In the preferred embodiment, content replacement takes place by replacement of macroblocks of video.
Thus, a method of content substitution consistent with certain embodiments involve receiving data representing content, the data having at least first and second packet identifiers (PIDs) associated with first and second macroblocks of content; playing content having the first PID; determining that a substitution criterion has been met; and substituting content having the second PID for content having the first PID.
In accordance with this process, for example, a local cable operator can receive a program that contains multiple sets of advertisements (commercials). Depending on the geographic location of the local operator, the main content can be retransmitted along with an appropriate one of several regional advertisements that are more appropriate to the geographic location or marketplace of the local cable operator. In another example, a movie with multiple selectable endings can be broadcast from a cable operator to its subscribers. The subscriber can then decide, before or during the viewing of the movie, which ending is preferred and make a selection. The subscriber sends a command to the STB which selects the alternative ending desired by the subscriber by selecting the ending associated with a particular PID and remapping that PID to the main program's PID. Numerous other examples will occur to those skilled in the art upon consideration of the present teachings.
Referring now to
The content then passes to a PSI/PMT inserter 220 that inserts Program Specific Information (PSI) and Program Map Tables (PMT) into the stream of content for use by the decoding side in decoding the programming. If the content is to be encrypted, it may be passed through an encrypter 224 prior to modulation at a modulator (such as a QAM modulator) 230. The modulated stream of content is then transmitted via the cable plant 236 to the end users with decoder boxes such as Set-top boxes 240 and 244. The operation of the cable head end, including but not limited to the PID mapping for content substitution, is carried out under control of a control computer 300.
Such a system can be used to form a content substitution encoder consistent with certain embodiments of the invention in which input data is received representing main content and representing substitution content. A packet identifier (PID) mapper assigns a primary PID to the main content and assigns a secondary PID to the substitution content. A private data generator generates user private data that identifies the main content by the primary PID and substitution content by the secondary PID. The private data, the main content mapped to the primary PID and the substitution content mapped to the secondary PID are then assembled into a data stream.
The process 100 of
The description above largely assumes that the substitutable content is to be inserted at the cable system head end, but those skilled in the art will appreciate that the present content substitution concept can be implemented in many ways to permit content substitution at multiple levels to serve multiple purposes. For example, if the cable customer is viewing an interactive television show, the customer's selections (e.g., from a remote controller) can be used to establish the criterion for selection of a particular substitution (e.g., ending selection). However, the cable head end can also implement a content substitution in accord with certain embodiments consistent with the present invention, for example, by substitution of a local advertisement for a national advertisement or substitution of (or addition of) a local channel logo for a national logo.
This substitution can be accomplished by replacement of macroblocks of video in the original content with macroblocks that contain substitution video data. Some or all of the substitution video data may be the same as the original data, since macroblocks may significantly overlap the desired region of a video picture to be replaced.
Consider now an exemplary embodiment consistent with the present invention in which a content provider wishes to provide alternative advertisements to several groups of customers, for example in a cable television system. In this example, assume that the cable television customers can be divided into three categories based upon, for example, a customer profile stored at the cable system's head end. Now, with reference to
The first alternative advertisement 356 is identified by an alternative PID (e.g., PID 101), and the second alternative advertisement is identified by another alternative PID (e.g., PID 102). Thus, in order to present the main advertisement, no special instructions need to be conveyed to the decoder (e.g., the television STB) since it is shared with the program content and will be shown by default. For decoders that are to decode the alternative advertisement 356, an instruction is sent from the cable system head end to the decoders instructing them to substitute content with PID 101 whenever this PID is encountered for PID 100. Similarly, for decoders that are to decode the alternative advertisement 358, an instruction is sent from the cable system head end to the decoders instructing them to substitute content with PID 102 whenever this PID is encountered in place of PID 100. In one embodiment, each packed of video data having PID 100 has a corresponding packet with PID 101 and PID 102. In other embodiments, a one for one correlation is not required. In any event, packet counts should be maintained in a manner that permits the proper ordered processing of packets at the decoder.
In this example, the content is displayed side by side to illustrate the direct substitution that is the nature of the process. However, as depicted in
In addition to providing targeted advertisement for sets of customers by the cable system MSO, a similar technique can be implemented to provide networks with the ability to provide regional advertisement by embedding, for example, multiple regional advertisements into a single data stream and using a remapping of the PIDs at the local networks or cable operators to select the appropriate advertisement for a given region. Thus, the three advertisements depicted in
With reference to
The content substitution using alternative PIDs as described above can be utilized for any number of purposes.
Consider, for example, the simplified illustration of
These are but a few examples of the types of content manipulation that can be facilitated using the PID mapping techniques of the present invention. Several other examples are listed in the table below, but many more will occur to those skilled in the art upon consideration of the present discussion:
Turning now to
The replacement of the primary PID packet by the secondary PID packet is called “Substitution Mode”. Secondary PID packets may be inserted into the stream without replacement of a primary PID packet. This mode is called “Insertion Mode.” In fact, the decoder may be used in a mode wherein both operations are active at the same time. This is called “Insertion and Deletion Mode”. All three discrete decoder modes are mutually exclusive and follow a series of state transitions that are specific to each mode. The active mode is signaled through the decoder specific variable mode. If the value of mode is set to zero, decoding is not enabled and the transport decoder state machine is bypassed. If the value of mode is invalid (not a specifically define state, then the same actions are taken as if mode was set to zero, i.e. the transport decoder state machine is bypassed. The definition of the state transitions for each mode is detailed as followed.
The algorithm for decoding an encoded transport stream is embodied in the state machine of
The state machine can be implemented in either hardware or software, depending upon the IC manufacturer's device architecture. A software implementation on a programmed processor can generally be expected to provide more flexibility in the design.
One error case identified (illegal state transition). This error is a unique error that is in addition to MPEG transport layer errors like continuity count, transport error, etc. Error_IRQn is the detection of two adjacent shadow packets without an intervening legacy packet, with n representing the number of the specific decoder. Depending upon the setting of the decoder specific variable queue_on_error, two different operations can occur. If the variable is set to true, the decoder will process the second shadow packet (PID=B) as in the non-error case. If the variable is set to false, the second shadow packet is discarded.
Whenever packets are inserted or deleted, the continuity count (CC) of the primary stream (PID=A), will be preserved by adjusting the CC as appropriate. The decode_RSTn variable is a non-latching bit that can be set through a configuration register or accessed by other functions to force the decoder state machine n to a known state.
One mode of operation of the decoder transport processing algorithm is referred to as the Substitution Mode. This mode is illustrated in
The return to state 1 occurs when the next A PID is received. In this case, it is not queued and is converted to the NULL (0x1fff) PID value, effectively erasing it from the stream without altering the overall stream timing as would have occurred if it were physically removed. The return to state 1 can also be signaled by receipt of another substitution flag 524 indicating termination of the substitute mode.
Another mode of operation of the decoder transport processing algorithm is referred to as the Insertion Mode, which is depicted in
The decoder transport processing algorithm for the Insertion/Deletion Mode for a MPEG compliant transport stream with the desired content packets containing a PID field matching A, where A is a 13 bit value previously defined in a configuration register of the decoder is depicted in
The return to state 2B occurs when the next packet with a B PID value is received and it is queued and converted to the A PID value. Likewise, return to the return to state 1 from state 2B occurs when the next packet with a B PID value is received accordingly, it is also queued and converted to the A PID value. The method according to claim 1, wherein the substituting comprises using private signaling to select a unit of content with the second PID and discarding a unit of content with the first PID.
In methods consistent with the present invention, private signaling can be used to select a unit of content on the secondary PID while receiving content with the primary PID. Alternatively, private signaling can be used to select multiple units of content with the secondary PID while discarding units of content with the primary PID. Similarly, private signaling can be used to select multiple units of content with a secondary PID while receiving units of content with the primary PID. Also, private signaling can be used to switch from a mode of selecting multiple units of content with the secondary PID while discarding units of content with the primary PID to a mode of selecting multiple units of content with the secondary PID while receiving content with the primary PID. Private signaling can also be used to switch from a mode of selecting multiple units of content with the secondary PID and receiving multiple units of content with the primary PID to a mode of selecting multiple units of content with the secondary PID while discarding units of content with the primary PID.
A unit of content with the secondary PID is sent before or after a corresponding unit of content with the primary PID. Substitution operations can be initiated and terminated by private signaling forming part of an adaptation layer of packets in a data stream. The adaptation layer can be in a packet with the secondary PID, the primary PID or another PID.
For reference, the following two tables are provided which call out the syntax used for an MPEG transport packet and an MPEG transport stream adaptation field respectively:
Much of the information used to configure and control the decoder module comes from the MPEG PSI data contained in the transport stream and decoded by the STB middleware. Configuration and control can be achieved using extensions to the MPEG PSI specification specific to the current decoder when needed. In certain embodiments consistent with the present invention, the following table defines the extensions used and the private data syntax.
It may be possible to use “adaptation and no payload” as well as “adaptation with payload” to signal transition between states. Adaptation field only packets whether A, B or C can be made “null”, e.g. NOP, or can simply be left in the stream.
In this document, references to “registers”, which may imply a hardware implementation, can be freely interchanged with “variable” in a software or microcoded implementation. In either case, a common decoder module command/control structure and interface is desirable to achieve middleware compatibility across STB platforms of varying architecture and capability.
In certain preferred implementations, each decoder module contains 19 registers (or variables). Unless otherwise stated, all registers are read/write, meaning that the current value can be read back through the same interface used to write. All registers will be sequentially offset from a common base value (origin). The addresses in this specification are all relative to the base (offset values). The registers can be mapped as shown in the table below:
Status registers are provided in accordance with the following table (Interrupt Source Register (Read Only)—Address: 0x00)
If an interrupt is invoked, the associated bit will be set to “1”. More than one bit may asserted simultaneously. If any bit is set, the decoder interrupts the host controller based upon the value of the mask register. The contents of the source register is bitwise ANDed with the mask register and the result logically ORed to form a single IRQ output. Interrupt Conditions are tabulated as follows
Decode_n_ERROR
Set on: Detection of two adjacent shadow packets without an intervening legacy packet.
Reset on: Read of interrupt status register.
A write only Interrupt Mask Register is at Address: 0x00. When an Interrupt Mask Register bit is “1”, the associated interrupt is unmasked and when “0”, it is masked. Masked interrupts will not generate an interrupt output to the host processor. The interrupt flag bit(s) of masked interrupts will still be valid in the interrupt register. The default power-up condition is for all interrupts to be masked (all “0's”).
Configuration Registers are as above.
A primary PID register for Decoder 1 (Read/Write) appears at Address: 0x01 and is configured as follows.
The Primary PID is a 13 bit value stored right justified as a big-endian (MSB in bit 12) value.
A secondary PID register Secondary PID Register for decoder 1 (Read/Write) appears at Address: 0x02 and is configured as follows:
The Secondary PID is a 13 bit value stored right justified as a big-endian (MSB in bit 12) value as shown above.
A primary PID register, for Decoder 2 (Read/Write) appears at Address: 0x03 and is configured as follows:
The Primary PID is a 13 bit value stored right justified as a big-endian (MSB in bit 12) value.
A secondary PID register for decoder 2 (Read/Write) appears at Address: 0x04 and is configured as follows:
The Secondary PID is a 13 bit value stored right justified as a big-endian (MSB in bit 12) value.
A primary PID register, for decoder 3 (Read/Write) appears at Address: 0x05 and is configured as follows:
The Primary PID is a 13 bit value stored right justified as a big-endian (MSB in bit 12) value.
A secondary PID register for decoder 3 (Read/Write) appears at Address: 0x06 and is configured as follows:
The Secondary PID is a 13 bit value stored right justified as a big-endian (MSB in bit 12) value.
A primary PID register for decoder 4 (Read/Write) appears at Address: 0x07 and is configured as follows:
The Primary PID is a 13 bit value stored right justified as a big-endian (MSB in bit 12) value.
A secondary PID register for decoder 4 (Read/Write) appears at Address: 0x08 and is configured as follows:
The Secondary PID is a 13 bit value stored right justified as a big-endian (MSB in bit 12) value.
A primary PID register for decoder 5 (Read/Write) appears at Address: 0x09 and is configured as follows:
The Primary PID is a 13 bit value stored right justified as a big-endian (MSB in bit 12) value.
A secondary PID register for decoder 5 (Read/Write) appears at Address: 0x0A and is configured as follows:
The Secondary PID is a 13 bit value stored right justified as a big-endian (MSB in bit 12) value.
A primary PID register for decoder 6 (Read/Write) appears at Address: 0x0B and is configured as follows:
The Primary PID is a 13 bit value stored right justified as a big-endian (MSB in bit 12) value.
A secondary PID register for decoder 6 (Read/Write) appears at Address: 0x0C and is configured as follows:
The Secondary PID is a 13 bit value stored right justified as a big-endian (MSB in bit 12) value.
The Decoder 1 mode register (Read/Write) appears at Address: 0x0D and is configured as follows:
Mode definitions are as follows:
0: Bypass all decode processing, disable state machine
1: Substitution mode
2: Insertion Mode
4: Insertion & Deletion Mode
All other values: Bypass all decode processing, disable state machine
The decoder 2 mode registers (Read/Write) appear at Address: 0x0E and are configured as follows:
Mode definitions are as follows:
All other values: Bypass all decode processing, disable state machine
The Decoder 5 mode register (Read/Write) appears at Address: 0x11 and is configured as follows:
Mode definitions are as follows:
0: Bypass all decode processing, disable state machine
1: Substitution mode
2: Insertion Mode
4: Insertion & Deletion Mode
All other values: Bypass all decode processing, disable state machine
The Decoder 6 mode register (Read/Write) is at Address: 0x12 and is configured as follows:
Mode definitions are as follows:
0: Bypass all decode processing, disable state machine
1: Substitution mode
2: Insertion Mode
4: Insertion & Deletion Mode
All other values: Bypass all decode processing, disable state machine
The Decoder reset register (Write) is located at Address: 0x13 and is configured as follows:
0: Bypass all decode processing, disable state machine
1: Substitution mode
2: Insertion Mode
4: Insertion & Deletion Mode
All other values: Bypass all decode processing, disable state machine
The Decoder 3 mode register (Read/Write) is at Address: 0x0F and is configured as follows:
Mode definitions are as follows:
0: Bypass all decode processing, disable state machine
1: Substitution mode
2: Insertion Mode
4: Insertion & Deletion Mode
All other values: Bypass all decode processing, disable state machine
The Decoder 4 Mode Register (Read/Write) appears at Address: 0x10 and is configured as follows:
Mode definitions are as follows:
0: Bypass all decode processing, disable state machine
1: Substitution mode
2: Insertion Mode
4: Insertion & Deletion Mode
There is one error case identified (illegal state transition). This error is a unique error and is in addition to MPEG transport layer errors like continuity count, transport error, etc. Error_IRQn is the detection of two adjacent shadow packets without an intervening legacy packet, with n representing the number of the specific decoder. Depending upon the setting of the decoder specific variable queue_on_error, two different operations can occur. If the variable is set to true, the decoder will process the second shadow packet (PID=B) as in the non-error case. If the variable is set to false, the second shadow packet is discarded.
In some instances, content that is to be replaced is placed on packet boundaries. Since some information may not fit neatly within the boundaries of a packet, some additional content, which is not specifically the content of interest may need to be duplicated to fill up the packet. In other cases, the packet can simply be filled with null bytes (e.g., all zeros). A typical video slice contains approximately 3 to 8 packets depending upon how much intra-coded data is present. It is noted that some decoders may have difficulty with multiple slices on a single video line even though the MPEG2 specification allows for this.
It is also noted that there may be ending problems encountered if the substituted content is referenced from future frames. However, this can be resolved by establishing a rule that says that the substituted content cannot be referenced by past frames. This is due to the possibility that the content may be different depending upon the choice made by a customer or the set top box. Reference to future frames might be allowed if the reference is all contained within the substitute content. Also, since the encoder uses a specified set of quantization tables, substitute content should be processed using the same quantization table so that correct decoding can take place.
The present content substitution can be carried out either on line or off line depending upon the application, without limitation.
A decoder such as the above can be incorporated within a television STB or other television receiver and can be used to provide the end user with content substitution capabilities controlled either by the user or by the MSO. Referring now to
Audio packets from the demultiplexer 614 (those identified with an audio PID) are decrypted and forwarded to an audio decoder 618 where they may be converted to analog audio to drive a speaker system (e.g., stereo or home theater multiple channel audio systems) or other audio system 622 (e.g., stereo or home theater multiple channel amplifier and speaker systems) or may simply provide decoded audio out at 626. Video packets from the demultiplexer 614 (those identified with a video PID) are decrypted and forwarded to a video decoder 630. In a similar manner, data packets from the demultiplexer 614 (those identified with a data PID) are decrypted and forwarded to a data decoder 634.
Decoded data packets from data decoder 634 are sent to the set-top box's computer system via the system bus 634. A control computer 644 can thus access the decoded data from data decoder 634 via the system bus 638 as well as programs and data in memory 646. Video data decoded by video decoder 630 is passed to a graphics processor 648, which is a computer optimized to processes graphics information rapidly. Graphics processor 648 is particularly useful in processing graphics intensive data associated with Internet browsing, gaming and multimedia applications such as those associated with MHEG (Multimedia and Hypermedia information coding Experts Group) set-top box applications. It should be noted, however, that the function of graphics processor 648 may be unnecessary in some set-top box designs having lower capabilities, and the function of the graphics processor 648 may be handled by the control computer 644 in some applications where the decoded video is passed directly from the demultiplexer 614 to a video encoder. Graphics processor 648 is also coupled to the system bus 638 and operates under the control of control computer 644.
Many set-top boxes such as STB 600 may incorporate a smart card reader 140 for communicating with a so called “smart card,” often serving as a Conditional Access Module (CAM). The CAM typically includes a central processor unit of its own along with associated RAM and ROM memory. Such smart card based CAMs are conventionally utilized for authentication of the user and authentication of transactions carried out by the user as well as authorization of services and storage of authorized cryptography keys. For example, the CAM can be used to provide the key for decoding incoming cryptographic data for content that the CAM determines the user is authorized to receive.
STB 600 can operate in a bidirectional communication mode so that data and other information can be transmitted not only from the system's head end to the end user, or from a service provider to the end user of the STB 600, but also, from the end user upstream using an out-of-band channel. In one embodiment, such data passes through the system bus 638 to a modulator 652 through a diplexer forming part of tuner 604 and out through the transmission medium 604. This capability is used to provide a mechanism for the STB 600 and/or its user to send information to the head end (e.g., service requests or changes, registration information, etc.) as well as to provide fast outbound communication with the Internet or other services provided at the head end to the end user.
Set-top box 600 may include any of a plurality of I/O (Input/Output) interfaces represented by I/O interfaces 656 that permit interconnection of I/O devices to the set-top box 600. By way of example, and not limitation, a serial RS-232 port can be provided to enable interconnection to any suitable serial device supported by the STB 600's internal software. Similarly, communication with appropriately compatible devices can be provided via an Ethernet port, a USB (Universal Serial Bus) port, an IEEE 1394 (so-called Firewire™ or i-Link™) or IEEE 1394 wide port, or S-video port. An infrared interface 660 provides communication with a remote controller 666. Such interfaces can be utilized to interconnect the STB 600 with any of a variety of accessory devices such as storage devices, audio/visual devices, gaming devices (not shown), Internet Appliances 28, etc.
I/O interfaces 656 can also include a modem (be it dial-up, cable, DSL or other technology modem) having a modem port to facilitate high speed or alternative access to the Internet or other data communication functions. In one preferred embodiment, modem port 162 is that of a DOCSIS (Data Over Cable System Interface Specification) cable modem to facilitate high speed network access over a cable system, and port is appropriately coupled to the transmission medium 604 embodied as a coaxial cable. Thus, the STB 600 can carry out bidirectional communication via the DOCSIS cable modem with the STB 600 being identified by a unique IP address. The DOCSIS specification is publicly available.
A PS/2 or other keyboard/mouse/joystick interface can be provided to permit ease of data entry to the STB 600. Such inputs provide the user with the ability to easily enter data and/or navigate using pointing devices. Pointing devices such as a mouse or joystick may be used in gaming applications.
Of course, STB 600 also may incorporate basic video outputs that can be used for direct connection to a television set instead of (or in addition to) an IEEE 1394 connection. In one embodiment, the video output can provide composite video formatted as NTSC (National Television System Committee) video. In some embodiments, the video output can be provided by a direct connection to the graphics processor 648 or the demultiplexer/descrambler 614 rather than passing through the system bus 638 as illustrated in the exemplary block diagram. S-Video signals can be similarly provided without passing through the system bus 130 if desired in other embodiments.
The infrared interface 660 receives commands from an infrared remote control 666, infrared keyboard or other infrared control device. Although not explicitly shown, front panel controls may be used in some embodiments to directly control the operation of the STB 600 through a front panel control interface as one of the provided interfaces. Selected interfaces such as those described above and others can be provided in STB 600 in various combinations as required or desired.
In one illustrative embodiment consistent with the present invention, the STB 600 can be utilized to control multiple content as in, for example, selection from multiple endings. In one such scenario, the main program content having a designated set of PIDS is played out in a normal manner until near the end of the program. At this point, the viewer is presented with a menu selection on screen from which one of a plurality of endings is presented. As a simple example, there may be three possible endings associated with three sets of PIDs as follows: 1) PID A—Boy gets girl, good guys win, 2) PID B—Girl dies, good guys win, and 3) PID C—Girl dies, bad guys win.
Using the remote controller 666 or any other suitable input mechanism, the viewer selects from the possible endings. A limited time may be provided to make this selection prior to a default ending being shown (e.g., a two minute pause in content to allow the selection of the ending). In response to the user's selection, control computer 644 programs PID decoder 614 to select the ending chosen by the user. After this pause, is completed, the programming continues with the PID decoder 614 making the appropriate PID remapping to cause the audio, data and video for the selected ending to be played. Thus, if the program is normally associated with PID A and the user selects ending three, packets bearing PID C will be remapped to PID A for playback. Thus, in this embodiment, the user can make selections for playback of a particular segment of content that is substituted for the normal content.
Accordingly, a decoder consistent with certain embodiments of the present invention has a receiver receiving data that represents content, the data having at least first and second packet identifiers (PIDs) associated with first and second portions of content. A content decoder is configured to play content having the first PID. A controller determines that a substitution criterion has been met, and a PID mapper maps content having the second PID to the first PID so that the content originally having the second PID is played.
Thus, a method and apparatus for content substitution, consistent with certain embodiments involves receiving data representing content, the data having at least first and second packet identifiers (PIDs) associated with first and second macroblocks of content. The content having the first PID is placed into a data stream. An initiation flag is received indicating initiation of a PID mapping operation. The content having the second PID is then mapped to the first PID and the mapped content is placed into the data stream. A termination flag is received indicating termination of the PID mapping operation at which point the process returns to placing content having the first PID into the data stream. The content substitution process can be used to replace advertisements, censor content, provide multiple plots, multiple endings, multiple views as well as other applications.
Those skilled in the art will recognize that the present invention has been described in terms of exemplary embodiments based upon use of a programmed processor (e.g., computer 300). However, the invention should not be so limited, since the present invention could be implemented using hardware component equivalents such as special purpose hardware and/or dedicated processors that are equivalents to the invention as described and claimed. Similarly, general purpose computers, microprocessor based computers, micro-controllers, optical computers, analog computers, dedicated processors and/or dedicated hard wired logic may be used to construct alternative equivalent embodiments of the present invention. Moreover, although the present invention has been described in terms of a general purpose personal computer providing a playback mechanism, the playback can be carried on a dedicated machine without departing from the present invention. Conversely, the present decoder has been described in terms of a state machine and such state machine can be implemented as either a hardware or software based state machine. Moreover, those skilled in the art will understand that the exact register configurations, PID protocols and other details described in connection with the above exemplary embodiment should not be considered limiting, but are presented by way of illustration.
Those skilled in the art will appreciate that the program steps and associated data used to implement the embodiments described above can be implemented using disc storage as well as other forms of storage such as for example Read Only Memory (ROM) devices, Random Access Memory (RAM) devices; optical storage elements, magnetic storage elements, magneto-optical storage elements, flash memory, core memory and/or other equivalent storage technologies without departing from the present invention. Such alternative storage devices should be considered equivalents.
The present invention, as described in embodiments herein, is implemented using a programmed processor executing programming instructions that are broadly described above form that can be stored on any suitable electronic storage medium or transmitted over any suitable electronic communication medium or otherwise be present in any computer readable or propagation medium. However, those skilled in the art will appreciate that the processes described above can be implemented in any number of variations and in many suitable programming languages without departing from the present invention. For example, the order of certain operations carried out can often be varied, additional operations can be added or operations can be deleted without departing from the invention. Error trapping can be added and/or enhanced and variations can be made in user interface and information presentation without departing from the present invention. Such variations are contemplated and considered equivalent.
Software code and/or data embodying certain aspects of the present invention may be present in any computer readable medium, transmission medium, storage medium or propagation medium including, but not limited to, electronic storage devices such as those described above, as well as carrier waves, electronic signals, data structures (e.g., trees, linked lists, tables, packets, frames, etc.) optical signals, propagated signals, broadcast signals, transmission media (e.g., circuit connection, cable, twisted pair, fiber optic cables, waveguides, antennas, etc.) and other media that stores, carries or passes the code and/or data. Such media may either store the software code and/or data or serve to transport the code and/or data from one location to another. In the present exemplary embodiments, MPEG compliant packets, slices, tables and other data structures are used, but this should not be considered limiting since other data structures can similarly be used without departing from the present invention.
While the invention has been described in conjunction with specific embodiments, it is evident that many alternatives, modifications, permutations and variations will become apparent to those skilled in the art in light of the foregoing description. Accordingly, it is intended that the present invention embrace all such alternatives, modifications and variations as fall within the scope of the appended claims.
This application claims priority benefit of U.S. Provisional patent application Ser. No. 60/519,472 filed Nov. 12, 2003 and is a continuation-in-part of: Ser. No. 10/319,066 filed Dec. 13, 2002, now U.S. Pat. No. 7,765,567 which claims priority benefit of U.S. Provisional patent application Ser. No. 60/409,675, filed Sep. 9, 2002 and U.S. Provisional patent application Ser. No. 60/372,870 filed Apr. 16, 2002; which is a continuation-in-part of patent applications: Ser. No. 10/038,217, now U.S. Pat. No. 7,336,787 Ser. No. 10/038,032, now U.S. Pat. No. 7,139,398 Ser. No. 10/037,914, now U.S. Pat. No. 7,124,303 Ser. No. 10/037,499, now U.S. Pat. No. 7,151,831 and Ser. No. 10/037,498 now U.S. Pat. No. 7,127,619 all of which were filed on Jan. 2, 2002. Each of the above applications is hereby incorporated by reference herein. This application is also related to U.S. patent application Ser. No. 10/667,614 filed Sep. 22, 2003; Ser. No. 10/273,905, filed Oct. 18, 2002; Ser. No. 10/273,903, filed Oct. 18, 2002; and Ser. No. 10/274,084, filed Oct. 18, 2002; Ser. No. 10/274,019, filed Oct. 18, 2002, each of which are hereby incorporated by reference herein.
| Number | Name | Date | Kind |
|---|---|---|---|
| 3852519 | Court | Dec 1974 | A |
| 4374399 | Ensinger | Feb 1983 | A |
| 4381519 | Wilkinson et al. | Apr 1983 | A |
| 4419693 | Wilkinson | Dec 1983 | A |
| 4521853 | Guttag | Jun 1985 | A |
| 4634808 | Moerder | Jan 1987 | A |
| 4700387 | Hirata | Oct 1987 | A |
| 4703351 | Kondo | Oct 1987 | A |
| 4703352 | Kondo | Oct 1987 | A |
| 4710811 | Kondo | Dec 1987 | A |
| 4712238 | Gilhousen et al. | Dec 1987 | A |
| 4722003 | Kondo | Jan 1988 | A |
| 4739510 | Jeffers et al. | Apr 1988 | A |
| 4772947 | Kondo | Sep 1988 | A |
| 4785361 | Brotby | Nov 1988 | A |
| 4788589 | Kondo | Nov 1988 | A |
| 4815078 | Shimura | Mar 1989 | A |
| 4845560 | Kondo et al. | Jul 1989 | A |
| 4881263 | Herbison et al. | Nov 1989 | A |
| 4887296 | Horne | Dec 1989 | A |
| 4890161 | Kondo | Dec 1989 | A |
| 4914515 | Van Luyt | Apr 1990 | A |
| 4924310 | von Brandt | May 1990 | A |
| 4944006 | Citta et al. | Jul 1990 | A |
| 4953023 | Kondo | Aug 1990 | A |
| 4964126 | Musicus et al. | Oct 1990 | A |
| 4989245 | Bennett | Jan 1991 | A |
| 4995080 | Bestler et al. | Feb 1991 | A |
| 5018197 | Jones et al. | May 1991 | A |
| 5023710 | Kondo et al. | Jun 1991 | A |
| 5091936 | Katznelson | Feb 1992 | A |
| 5122873 | Golin | Jun 1992 | A |
| 5138659 | Kelkar et al. | Aug 1992 | A |
| 5142537 | Kutner et al. | Aug 1992 | A |
| 5144662 | Welmer | Sep 1992 | A |
| 5144664 | Esserman et al. | Sep 1992 | A |
| 5151782 | Ferraro | Sep 1992 | A |
| 5159452 | Kinoshita et al. | Oct 1992 | A |
| 5159633 | Nakamura | Oct 1992 | A |
| 5195135 | Palmer | Mar 1993 | A |
| 5196931 | Kondo | Mar 1993 | A |
| 5208816 | Seshardi et al. | May 1993 | A |
| 5237424 | Nishino et al. | Aug 1993 | A |
| 5237610 | Gammie et al. | Aug 1993 | A |
| 5241381 | Kondo | Aug 1993 | A |
| 5247575 | Sprague et al. | Sep 1993 | A |
| 5258835 | Kato | Nov 1993 | A |
| 5319707 | Wasilewski et al. | Jun 1994 | A |
| 5319712 | Finkelstein et al. | Jun 1994 | A |
| 5325432 | Gardeck et al. | Jun 1994 | A |
| 5327502 | Katata | Jul 1994 | A |
| 5341425 | Wasilewski et al. | Aug 1994 | A |
| 5359694 | Concordel | Oct 1994 | A |
| 5379072 | Kondo | Jan 1995 | A |
| 5381481 | Gammie et al. | Jan 1995 | A |
| 5398078 | Masuda et al. | Mar 1995 | A |
| 5400401 | Wasilewski et al. | Mar 1995 | A |
| 5414852 | Kramer et al. | May 1995 | A |
| 5416651 | Uetake et al. | May 1995 | A |
| 5416847 | Boze | May 1995 | A |
| 5420866 | Wasilewski | May 1995 | A |
| 5428403 | Andrew et al. | Jun 1995 | A |
| 5434716 | Sugiyama et al. | Jul 1995 | A |
| 5438369 | Citta et al. | Aug 1995 | A |
| 5444491 | Lim | Aug 1995 | A |
| 5444782 | Adams, Jr. et al. | Aug 1995 | A |
| 5455862 | Hoskinson | Oct 1995 | A |
| 5469216 | Takahashi et al. | Nov 1995 | A |
| 5471501 | Parr et al. | Nov 1995 | A |
| 5473692 | Davis | Dec 1995 | A |
| 5477263 | O'Callaghan et al. | Dec 1995 | A |
| 5481554 | Kondo | Jan 1996 | A |
| 5481627 | Kim | Jan 1996 | A |
| 5485577 | Eyer et al. | Jan 1996 | A |
| 5491748 | Auld, Jr. et al. | Feb 1996 | A |
| 5515107 | Chiang et al. | May 1996 | A |
| 5526427 | Thomas et al. | Jun 1996 | A |
| 5528608 | Shimizume | Jun 1996 | A |
| 5535276 | Ganesan | Jul 1996 | A |
| 5539823 | Martin | Jul 1996 | A |
| 5539828 | Davis | Jul 1996 | A |
| 5553141 | Lowry et al. | Sep 1996 | A |
| 5555305 | Robinson et al. | Sep 1996 | A |
| 5561713 | Suh | Oct 1996 | A |
| 5568552 | Davis | Oct 1996 | A |
| 5574787 | Ryan | Nov 1996 | A |
| 5582470 | Yu | Dec 1996 | A |
| 5583576 | Perlman et al. | Dec 1996 | A |
| 5583863 | Darr, Jr. et al. | Dec 1996 | A |
| 5590202 | Bestler et al. | Dec 1996 | A |
| 5594507 | Hoarty | Jan 1997 | A |
| 5598214 | Kondo et al. | Jan 1997 | A |
| 5600378 | Wasilewski | Feb 1997 | A |
| 5600721 | Kitazato | Feb 1997 | A |
| 5606359 | Youden et al. | Feb 1997 | A |
| 5608448 | Smoral et al. | Mar 1997 | A |
| 5615265 | Coutrot | Mar 1997 | A |
| 5617333 | Oyamada et al. | Apr 1997 | A |
| 5625715 | Trew et al. | Apr 1997 | A |
| 5629866 | Carrubba et al. | May 1997 | A |
| 5629981 | Nerlikar | May 1997 | A |
| 5652615 | Bryant et al. | Jul 1997 | A |
| 5652795 | Eillon et al. | Jul 1997 | A |
| 5663764 | Kondo et al. | Sep 1997 | A |
| 5666293 | Metz et al. | Sep 1997 | A |
| 5696906 | Peters et al. | Dec 1997 | A |
| 5699429 | Tamer et al. | Dec 1997 | A |
| 5703889 | Shimoda et al. | Dec 1997 | A |
| 5717814 | Abecassis | Feb 1998 | A |
| 5726702 | Hamaguchi et al. | Mar 1998 | A |
| 5726711 | Boyce | Mar 1998 | A |
| 5732346 | Lazaridis et al. | Mar 1998 | A |
| 5742680 | Wilson | Apr 1998 | A |
| 5742681 | Giachettie et al. | Apr 1998 | A |
| 5751280 | Abbott et al. | May 1998 | A |
| 5751743 | Takizawa | May 1998 | A |
| 5751813 | Dorenbos | May 1998 | A |
| 5754650 | Katznelson | May 1998 | A |
| 5754658 | Aucsmith | May 1998 | A |
| 5757417 | Aras et al. | May 1998 | A |
| 5757909 | Park | May 1998 | A |
| 5761180 | Murabayashi et al. | Jun 1998 | A |
| 5768539 | Metz et al. | Jun 1998 | A |
| 5796786 | Lee | Aug 1998 | A |
| 5796829 | Newby et al. | Aug 1998 | A |
| 5796840 | Davis | Aug 1998 | A |
| 5802176 | Audebert | Sep 1998 | A |
| 5805700 | Nardone et al. | Sep 1998 | A |
| 5805712 | Davis | Sep 1998 | A |
| 5805762 | Boyce et al. | Sep 1998 | A |
| 5809147 | De Lange et al. | Sep 1998 | A |
| 5815146 | Youden et al. | Sep 1998 | A |
| 5818934 | Cuccia | Oct 1998 | A |
| 5825879 | Davis | Oct 1998 | A |
| 5835668 | Yanagihara | Nov 1998 | A |
| 5838873 | Blatter et al. | Nov 1998 | A |
| 5850218 | LaJoie et al. | Dec 1998 | A |
| 5852290 | Chaney | Dec 1998 | A |
| 5852470 | Kondo et al. | Dec 1998 | A |
| 5870474 | Wasiliewski et al. | Feb 1999 | A |
| 5892900 | Ginter et al. | Apr 1999 | A |
| 5894320 | Vancelette | Apr 1999 | A |
| 5894516 | Brandenburg | Apr 1999 | A |
| 5905732 | Fimoff et al. | May 1999 | A |
| 5915018 | Aucsmith | Jun 1999 | A |
| 5917830 | Chen et al. | Jun 1999 | A |
| 5920625 | Davies | Jul 1999 | A |
| 5920626 | Durden et al. | Jul 1999 | A |
| 5922048 | Emura | Jul 1999 | A |
| 5923755 | Birch et al. | Jul 1999 | A |
| 5930361 | Hayashi et al. | Jul 1999 | A |
| 5933500 | Blatter et al. | Aug 1999 | A |
| 5940738 | Rao | Aug 1999 | A |
| 5943605 | Koepele, Jr. | Aug 1999 | A |
| 5949877 | Traw et al. | Sep 1999 | A |
| 5949881 | Davis | Sep 1999 | A |
| 5963909 | Warren et al. | Oct 1999 | A |
| 5973679 | Abbott et al. | Oct 1999 | A |
| 5973722 | Wakai et al. | Oct 1999 | A |
| 5973726 | Iijima et al. | Oct 1999 | A |
| 5999622 | Yasukawa et al. | Dec 1999 | A |
| 5999698 | Nakai et al. | Dec 1999 | A |
| 6005561 | Hawkins et al. | Dec 1999 | A |
| 6005940 | Kulinets | Dec 1999 | A |
| 6011849 | Orrin | Jan 2000 | A |
| 6012144 | Pickett | Jan 2000 | A |
| 6016348 | Blatter et al. | Jan 2000 | A |
| 6021199 | Ishibashi | Feb 2000 | A |
| 6021201 | Bakhle et al. | Feb 2000 | A |
| 6026164 | Sakamoto et al. | Feb 2000 | A |
| 6028932 | Park | Feb 2000 | A |
| 6049613 | Jakobsson | Apr 2000 | A |
| 6055314 | Spies et al. | Apr 2000 | A |
| 6055315 | Doyle et al. | Apr 2000 | A |
| 6057832 | Lev et al. | May 2000 | A |
| 6057872 | Candelore | May 2000 | A |
| 6058186 | Enari | May 2000 | A |
| 6058192 | Guralnick et al. | May 2000 | A |
| 6061451 | Muratani et al. | May 2000 | A |
| 6061471 | Coleman | May 2000 | A |
| 6064676 | Slattery et al. | May 2000 | A |
| 6064748 | Hogan | May 2000 | A |
| 6065050 | DeMoney | May 2000 | A |
| 6069647 | Sullivan et al. | May 2000 | A |
| 6070245 | Murphy, Jr. et al. | May 2000 | A |
| 6072872 | Chang et al. | Jun 2000 | A |
| 6072873 | Bewick | Jun 2000 | A |
| 6073122 | Wool | Jun 2000 | A |
| 6088450 | Davis et al. | Jul 2000 | A |
| 6105134 | Pinder et al. | Aug 2000 | A |
| 6108422 | Newby et al. | Aug 2000 | A |
| 6115821 | Newby et al. | Sep 2000 | A |
| 6118873 | Lotspiech et al. | Sep 2000 | A |
| 6134237 | Brailean et al. | Oct 2000 | A |
| 6134551 | Aucsmith | Oct 2000 | A |
| 6138237 | Ruben et al. | Oct 2000 | A |
| 6148082 | Slattery et al. | Nov 2000 | A |
| 6154206 | Ludtke | Nov 2000 | A |
| 6157719 | Wasilewski et al. | Dec 2000 | A |
| 6170075 | Schuster et al. | Jan 2001 | B1 |
| 6181334 | Freeman et al. | Jan 2001 | B1 |
| 6181364 | Ford | Jan 2001 | B1 |
| 6185369 | Ko et al. | Feb 2001 | B1 |
| 6185546 | Davis | Feb 2001 | B1 |
| 6189096 | Haverty | Feb 2001 | B1 |
| 6192131 | Geer et al. | Feb 2001 | B1 |
| 6199053 | Herbert et al. | Mar 2001 | B1 |
| 6201927 | Comer | Mar 2001 | B1 |
| 6204843 | Freeman et al. | Mar 2001 | B1 |
| 6209098 | Davis | Mar 2001 | B1 |
| 6215484 | Freeman et al. | Apr 2001 | B1 |
| 6219358 | Pinder et al. | Apr 2001 | B1 |
| 6222924 | Salomaki | Apr 2001 | B1 |
| 6223290 | Larsen et al. | Apr 2001 | B1 |
| 6226385 | Taguchi et al. | May 2001 | B1 |
| 6226618 | Downs | May 2001 | B1 |
| 6229895 | Son et al. | May 2001 | B1 |
| 6230194 | Frailong et al. | May 2001 | B1 |
| 6230266 | Perlman et al. | May 2001 | B1 |
| 6236727 | Ciacelli et al. | May 2001 | B1 |
| 6240553 | Son et al. | May 2001 | B1 |
| 6246720 | Kutner et al. | Jun 2001 | B1 |
| 6256747 | Inohara et al. | Jul 2001 | B1 |
| 6263506 | Ezaki et al. | Jul 2001 | B1 |
| 6266416 | Sigbjornsen et al. | Jul 2001 | B1 |
| 6266480 | Ezaki et al. | Jul 2001 | B1 |
| 6272538 | Holden et al. | Aug 2001 | B1 |
| 6278783 | Kocher et al. | Aug 2001 | B1 |
| 6289455 | Kocher et al. | Sep 2001 | B1 |
| 6292568 | Atkins, III et al. | Sep 2001 | B1 |
| 6292892 | Davis | Sep 2001 | B1 |
| 6307939 | Vigarie | Oct 2001 | B1 |
| 6311012 | Cho et al. | Oct 2001 | B1 |
| 6314111 | Nandikonda et al. | Nov 2001 | B1 |
| 6314409 | Schneck et al. | Nov 2001 | B2 |
| 6323914 | Linzer | Nov 2001 | B1 |
| 6324288 | Hoffman | Nov 2001 | B1 |
| 6327421 | Tiwari et al. | Dec 2001 | B1 |
| 6337947 | Porter et al. | Jan 2002 | B1 |
| 6351538 | Uz | Feb 2002 | B1 |
| 6351813 | Mooney et al. | Feb 2002 | B1 |
| 6377589 | Knight et al. | Apr 2002 | B1 |
| 6378130 | Adams | Apr 2002 | B1 |
| 6389533 | Davis et al. | May 2002 | B1 |
| 6389537 | Davis et al. | May 2002 | B1 |
| 6415031 | Colligan et al. | Jul 2002 | B1 |
| 6415101 | deCarmo et al. | Jul 2002 | B1 |
| 6418169 | Datari | Jul 2002 | B1 |
| 6424717 | Pinder et al. | Jul 2002 | B1 |
| 6430361 | Lee | Aug 2002 | B2 |
| 6445738 | Zdepski et al. | Sep 2002 | B1 |
| 6449718 | Rucklidge et al. | Sep 2002 | B1 |
| 6452923 | Gerszberg et al. | Sep 2002 | B1 |
| 6453115 | Boyle | Sep 2002 | B1 |
| 6453116 | Ando et al. | Sep 2002 | B1 |
| 6456985 | Ohtsuka | Sep 2002 | B1 |
| 6459427 | Mao et al. | Oct 2002 | B1 |
| 6463152 | Takahashi | Oct 2002 | B1 |
| 6466671 | Maillard et al. | Oct 2002 | B1 |
| 6473459 | Sugano et al. | Oct 2002 | B1 |
| 6480551 | Ohishi et al. | Nov 2002 | B1 |
| 6490728 | Kitazato et al. | Dec 2002 | B1 |
| 6505032 | McCorkle et al. | Jan 2003 | B1 |
| 6505299 | Zeng et al. | Jan 2003 | B1 |
| 6510554 | Gorden et al. | Jan 2003 | B1 |
| 6519693 | Debey | Feb 2003 | B1 |
| 6526144 | Markandey et al. | Feb 2003 | B2 |
| 6529526 | Schneidewend | Mar 2003 | B1 |
| 6543053 | Li et al. | Apr 2003 | B1 |
| 6549229 | Kirby et al. | Apr 2003 | B1 |
| 6550008 | Zhang et al. | Apr 2003 | B1 |
| 6557031 | Mimura et al. | Apr 2003 | B1 |
| 6587561 | Sered et al. | Jul 2003 | B1 |
| 6590979 | Ryan | Jul 2003 | B1 |
| 6621866 | Florencio et al. | Sep 2003 | B1 |
| 6621979 | Eerenberg et al. | Sep 2003 | B1 |
| 6640145 | Hoffberg et al. | Oct 2003 | B2 |
| 6640305 | Kocher et al. | Oct 2003 | B2 |
| 6643298 | Brunheroto et al. | Nov 2003 | B1 |
| 6650754 | Akiyama et al. | Nov 2003 | B2 |
| 6654389 | Brunheroto et al. | Nov 2003 | B1 |
| 6678740 | Rakib et al. | Jan 2004 | B1 |
| 6681326 | Son et al. | Jan 2004 | B2 |
| 6684250 | Anderson et al. | Jan 2004 | B2 |
| 6697489 | Candelore | Feb 2004 | B1 |
| 6697944 | Jones et al. | Feb 2004 | B1 |
| 6698020 | Zigmond et al. | Feb 2004 | B1 |
| 6701258 | Kramb et al. | Mar 2004 | B2 |
| 6704733 | Clark et al. | Mar 2004 | B2 |
| 6707696 | Turner et al. | Mar 2004 | B1 |
| 6714650 | Maillard et al. | Mar 2004 | B1 |
| 6741795 | Takehiko et al. | May 2004 | B1 |
| 6754276 | Harumoto et al. | Jun 2004 | B1 |
| 6772340 | Peinado et al. | Aug 2004 | B1 |
| 6788690 | Harri | Sep 2004 | B2 |
| 6788882 | Geer et al. | Sep 2004 | B1 |
| 6826185 | Montanaro et al. | Nov 2004 | B1 |
| 6853728 | Kahn et al. | Feb 2005 | B1 |
| 6883050 | Safadi | Apr 2005 | B1 |
| 6891565 | Dietrich | May 2005 | B1 |
| 6895128 | Bohnenkamp | May 2005 | B2 |
| 6904520 | Rosset et al. | Jun 2005 | B1 |
| 6917684 | Tatebayashi et al. | Jul 2005 | B1 |
| 6925180 | Iwamura | Aug 2005 | B2 |
| 6938162 | Nagai et al. | Aug 2005 | B1 |
| 6976166 | Herley et al. | Dec 2005 | B2 |
| 6988238 | Kovacevic et al. | Jan 2006 | B1 |
| 7023924 | Keller et al. | Apr 2006 | B1 |
| 7039802 | Eskicioglu et al. | May 2006 | B1 |
| 7039938 | Candelore | May 2006 | B2 |
| 7055166 | Logan et al. | May 2006 | B1 |
| 7065213 | Pinder | Jun 2006 | B2 |
| 7079752 | Leyendecker | Jul 2006 | B1 |
| 7089579 | Mao et al. | Aug 2006 | B1 |
| 7096481 | Forecast et al. | Aug 2006 | B1 |
| 7096487 | Gordon et al. | Aug 2006 | B1 |
| 7110659 | Fujie et al. | Sep 2006 | B2 |
| 7120250 | Candelore | Oct 2006 | B2 |
| 7124303 | Candelore | Oct 2006 | B2 |
| 7127619 | Unger et al. | Oct 2006 | B2 |
| 7139398 | Candelore et al. | Nov 2006 | B2 |
| 7146007 | Maruo et al. | Dec 2006 | B1 |
| 7151831 | Candelore et al. | Dec 2006 | B2 |
| 7151833 | Candelore et al. | Dec 2006 | B2 |
| 7155012 | Candelore et al. | Dec 2006 | B2 |
| 7158185 | Gastaldi | Jan 2007 | B2 |
| 7194758 | Waki et al. | Mar 2007 | B1 |
| 7221706 | Zhao et al. | May 2007 | B2 |
| 7292692 | Bonan et al. | Nov 2007 | B2 |
| 7298959 | Hallberg et al. | Nov 2007 | B1 |
| 7336785 | Lu et al. | Feb 2008 | B1 |
| 7391866 | Fukami et al. | Jun 2008 | B2 |
| 7490236 | Wasilewski | Feb 2009 | B2 |
| 7496198 | Pinder et al. | Feb 2009 | B2 |
| 7508454 | Vantalon et al. | Mar 2009 | B1 |
| 7555123 | Pinder et al. | Jun 2009 | B2 |
| 20010013123 | Freeman et al. | Aug 2001 | A1 |
| 20010024471 | Bordes et al. | Sep 2001 | A1 |
| 20010030959 | Ozawa et al. | Oct 2001 | A1 |
| 20010036271 | Javed | Nov 2001 | A1 |
| 20010051007 | Teshima | Dec 2001 | A1 |
| 20020003881 | Reitmeier et al. | Jan 2002 | A1 |
| 20020021805 | Schumann et al. | Feb 2002 | A1 |
| 20020023013 | Hughes et al. | Feb 2002 | A1 |
| 20020026478 | Rodgers et al. | Feb 2002 | A1 |
| 20020026587 | Talstra et al. | Feb 2002 | A1 |
| 20020036717 | Abiko et al. | Mar 2002 | A1 |
| 20020044558 | Gobbi et al. | Apr 2002 | A1 |
| 20020046406 | Chelehmal et al. | Apr 2002 | A1 |
| 20020047915 | Misu | Apr 2002 | A1 |
| 20020056093 | Kunkel et al. | May 2002 | A1 |
| 20020059425 | Belfiore et al. | May 2002 | A1 |
| 20020065678 | Peliotis et al. | May 2002 | A1 |
| 20020066101 | Gordon et al. | May 2002 | A1 |
| 20020067436 | Shirahama et al. | Jun 2002 | A1 |
| 20020083317 | Ohta et al. | Jun 2002 | A1 |
| 20020083438 | So et al. | Jun 2002 | A1 |
| 20020083439 | Eldering | Jun 2002 | A1 |
| 20020097322 | Monroe et al. | Jul 2002 | A1 |
| 20020100054 | Feinberg et al. | Jul 2002 | A1 |
| 20020108035 | Herley et al. | Aug 2002 | A1 |
| 20020109707 | Lao et al. | Aug 2002 | A1 |
| 20020116705 | Perlman et al. | Aug 2002 | A1 |
| 20020126890 | Katayama et al. | Sep 2002 | A1 |
| 20020129243 | Nanjundiah | Sep 2002 | A1 |
| 20020144116 | Giobbi | Oct 2002 | A1 |
| 20020144260 | Devara | Oct 2002 | A1 |
| 20020150239 | Carny et al. | Oct 2002 | A1 |
| 20020157115 | Lu | Oct 2002 | A1 |
| 20020164022 | Strasser et al. | Nov 2002 | A1 |
| 20020170053 | Peterka et al. | Nov 2002 | A1 |
| 20020184506 | Perlman | Dec 2002 | A1 |
| 20020194589 | Cristofalo et al. | Dec 2002 | A1 |
| 20020194613 | Unger | Dec 2002 | A1 |
| 20020196939 | Unger et al. | Dec 2002 | A1 |
| 20030002854 | Belknap et al. | Jan 2003 | A1 |
| 20030009669 | White et al. | Jan 2003 | A1 |
| 20030012286 | Ishtiaq et al. | Jan 2003 | A1 |
| 20030021412 | Candelore et al. | Jan 2003 | A1 |
| 20030026423 | Unger et al. | Feb 2003 | A1 |
| 20030028879 | Gordon et al. | Feb 2003 | A1 |
| 20030034997 | McKain et al. | Feb 2003 | A1 |
| 20030035482 | Klompenhouwer et al. | Feb 2003 | A1 |
| 20030035540 | Freeman et al. | Feb 2003 | A1 |
| 20030035543 | Gillon | Feb 2003 | A1 |
| 20030046686 | Candelore et al. | Mar 2003 | A1 |
| 20030046687 | Hodges et al. | Mar 2003 | A1 |
| 20030059047 | Iwamura | Mar 2003 | A1 |
| 20030063615 | Luoma et al. | Apr 2003 | A1 |
| 20030072555 | Yap et al. | Apr 2003 | A1 |
| 20030077071 | Lin et al. | Apr 2003 | A1 |
| 20030081630 | Mowery et al. | May 2003 | A1 |
| 20030081776 | Candelore | May 2003 | A1 |
| 20030084284 | Ando et al. | May 2003 | A1 |
| 20030097662 | Russ et al. | May 2003 | A1 |
| 20030108199 | Pinder et al. | Jun 2003 | A1 |
| 20030112333 | Chen et al. | Jun 2003 | A1 |
| 20030118243 | Sezer et al. | Jun 2003 | A1 |
| 20030123664 | Pedlow et al. | Jul 2003 | A1 |
| 20030123849 | Nallur et al. | Jul 2003 | A1 |
| 20030126086 | Safadi | Jul 2003 | A1 |
| 20030133570 | Candelore et al. | Jul 2003 | A1 |
| 20030140257 | Peterka et al. | Jul 2003 | A1 |
| 20030145329 | Candelore | Jul 2003 | A1 |
| 20030152224 | Candelore et al. | Aug 2003 | A1 |
| 20030152226 | Candelore et al. | Aug 2003 | A1 |
| 20030152232 | Pirila et al. | Aug 2003 | A1 |
| 20030156718 | Candelore et al. | Aug 2003 | A1 |
| 20030159139 | Candelore et al. | Aug 2003 | A1 |
| 20030159140 | Candelore | Aug 2003 | A1 |
| 20030159152 | Lin et al. | Aug 2003 | A1 |
| 20030174837 | Candelore et al. | Sep 2003 | A1 |
| 20030174844 | Candelore | Sep 2003 | A1 |
| 20030188154 | Dallard | Oct 2003 | A1 |
| 20030188164 | Okimoto et al. | Oct 2003 | A1 |
| 20030190054 | Troyansky et al. | Oct 2003 | A1 |
| 20030193973 | Takashimizu et al. | Oct 2003 | A1 |
| 20030198223 | Mack et al. | Oct 2003 | A1 |
| 20030204717 | Kuehnel | Oct 2003 | A1 |
| 20030222994 | Dawson | Dec 2003 | A1 |
| 20030226149 | Chun et al. | Dec 2003 | A1 |
| 20030228018 | Vince | Dec 2003 | A1 |
| 20040003008 | Wasilewski et al. | Jan 2004 | A1 |
| 20040010717 | Simec et al. | Jan 2004 | A1 |
| 20040021764 | Driscoll, Jr. et al. | Feb 2004 | A1 |
| 20040028227 | Yu | Feb 2004 | A1 |
| 20040037421 | Truman | Feb 2004 | A1 |
| 20040047470 | Candelore | Mar 2004 | A1 |
| 20040049688 | Candelore et al. | Mar 2004 | A1 |
| 20040049690 | Candelore et al. | Mar 2004 | A1 |
| 20040049691 | Candelore et al. | Mar 2004 | A1 |
| 20040049694 | Candelore | Mar 2004 | A1 |
| 20040064688 | Jacobs | Apr 2004 | A1 |
| 20040068659 | Diehl | Apr 2004 | A1 |
| 20040073917 | Pedlow, Jr. et al. | Apr 2004 | A1 |
| 20040078575 | Morten et al. | Apr 2004 | A1 |
| 20040081333 | Grab et al. | Apr 2004 | A1 |
| 20040083177 | Chen et al. | Apr 2004 | A1 |
| 20040086127 | Candelore | May 2004 | A1 |
| 20040088552 | Candelore | May 2004 | A1 |
| 20040088558 | Candelore | May 2004 | A1 |
| 20040091109 | Son et al. | May 2004 | A1 |
| 20040100510 | Milic-Frayling et al. | May 2004 | A1 |
| 20040123094 | Sprunk | Jun 2004 | A1 |
| 20040136532 | Pinder et al. | Jul 2004 | A1 |
| 20040139337 | Pinder et al. | Jul 2004 | A1 |
| 20040151314 | Candelore | Aug 2004 | A1 |
| 20040158721 | Candelore | Aug 2004 | A1 |
| 20040165586 | Read et al. | Aug 2004 | A1 |
| 20040168121 | Matz | Aug 2004 | A1 |
| 20040172650 | Hawkins et al. | Sep 2004 | A1 |
| 20040181666 | Candelore | Sep 2004 | A1 |
| 20040187161 | Cao | Sep 2004 | A1 |
| 20040193550 | Siegal | Sep 2004 | A1 |
| 20040240668 | Bonan et al. | Dec 2004 | A1 |
| 20040247122 | Hobrock et al. | Dec 2004 | A1 |
| 20040261099 | Durden et al. | Dec 2004 | A1 |
| 20040264924 | Campisano et al. | Dec 2004 | A1 |
| 20040267602 | Gaydos et al. | Dec 2004 | A1 |
| 20050004875 | Kontio et al. | Jan 2005 | A1 |
| 20050015816 | Christofalo et al. | Jan 2005 | A1 |
| 20050028193 | Candelore et al. | Feb 2005 | A1 |
| 20050036067 | Ryal et al. | Feb 2005 | A1 |
| 20050063541 | Candelore | Mar 2005 | A1 |
| 20050066357 | Ryal | Mar 2005 | A1 |
| 20050071669 | Medvinsky et al. | Mar 2005 | A1 |
| 20050094808 | Pedlow, Jr. et al. | May 2005 | A1 |
| 20050094809 | Pedlow, Jr. et al. | May 2005 | A1 |
| 20050097596 | Pedlow, Jr. | May 2005 | A1 |
| 20050097597 | Pedlow, Jr. et al. | May 2005 | A1 |
| 20050097598 | Pedlow, Jr. et al. | May 2005 | A1 |
| 20050097614 | Pedlow, Jr. et al. | May 2005 | A1 |
| 20050102702 | Candelore et al. | May 2005 | A1 |
| 20050129233 | Pedlow, Jr. | Jun 2005 | A1 |
| 20050141713 | Genevois | Jun 2005 | A1 |
| 20050169473 | Candelore | Aug 2005 | A1 |
| 20050192904 | Candelore | Sep 2005 | A1 |
| 20050198586 | Sekiguchi et al. | Sep 2005 | A1 |
| 20050210502 | Flickinger et al. | Sep 2005 | A1 |
| 20050259813 | Wasilewski et al. | Nov 2005 | A1 |
| 20050265547 | Strasser et al. | Dec 2005 | A1 |
| 20050283797 | Eldering et al. | Dec 2005 | A1 |
| 20060115083 | Candelore et al. | Jun 2006 | A1 |
| 20060130119 | Candelore et al. | Jun 2006 | A1 |
| 20060130121 | Candelore et al. | Jun 2006 | A1 |
| 20060136976 | Coupe et al. | Jun 2006 | A1 |
| 20060153379 | Candelore et al. | Jul 2006 | A1 |
| 20060168616 | Candelore | Jul 2006 | A1 |
| 20060174264 | Candelore | Aug 2006 | A1 |
| 20060262926 | Candelore et al. | Nov 2006 | A1 |
| 20060269060 | Candelore et al. | Nov 2006 | A1 |
| 20070006253 | Pinder et al. | Jan 2007 | A1 |
| 20070091886 | Davis et al. | Apr 2007 | A1 |
| Number | Date | Country |
|---|---|---|
| 2389247 | May 2001 | CA |
| 0471373 | Feb 1992 | EP |
| 0527611 | Jul 1992 | EP |
| 0558016 | Feb 1993 | EP |
| 0596826 | Apr 1993 | EP |
| 0610587 | Dec 1993 | EP |
| 0680209 | Apr 1995 | EP |
| 0 696 141 | Jul 1995 | EP |
| 0674440 | Sep 1995 | EP |
| 0674441 | Sep 1995 | EP |
| 0720374 | Jul 1996 | EP |
| 0382764 | Apr 1997 | EP |
| 0833517 | Apr 1998 | EP |
| 0866615 | Sep 1998 | EP |
| 0 926 894 | Jun 1999 | EP |
| 1187483 | Mar 2002 | EP |
| 61-264371 | Nov 1986 | JP |
| 07-046575 | Feb 1995 | JP |
| 7067028 | Mar 1995 | JP |
| 10-336624 | Dec 1998 | JP |
| 2001-69480 | Mar 2001 | JP |
| 11243534 | Oct 2002 | JP |
| 299634 | Aug 2008 | KR |
| WO 8607224 | Dec 1986 | WO |
| WO 9309525 | May 1993 | WO |
| WO 9410775 | May 1994 | WO |
| WO 9413081 | Jun 1994 | WO |
| WO 9413107 | Jun 1994 | WO |
| WO 9528058 | Apr 1995 | WO |
| WO 9738530 | Oct 1997 | WO |
| WO 9746009 | Dec 1997 | WO |
| WO 9808341 | Feb 1998 | WO |
| WO 0031964 | Jun 2000 | WO |
| WO 0059203 | Oct 2000 | WO |
| WO 0060846 | Oct 2000 | WO |
| WO 0064164 | Oct 2000 | WO |
| WO 0070817 | Nov 2000 | WO |
| WO 0126372 | Apr 2001 | WO |
| WO 0135669 | May 2001 | WO |
| WO 0165762 | Sep 2001 | WO |
| WO 0167667 | Sep 2001 | WO |
| WO 0178386 | Oct 2001 | WO |
| WO 0251096 | Jun 2002 | WO |
| Number | Date | Country | |
|---|---|---|---|
| 20050028193 A1 | Feb 2005 | US |
| Number | Date | Country | |
|---|---|---|---|
| 60519472 | Nov 2003 | US | |
| 60372870 | Apr 2002 | US | |
| 60409675 | Sep 2002 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 10319066 | Dec 2002 | US |
| Child | 10822891 | US | |
| Parent | 10038217 | Jan 2002 | US |
| Child | 10319066 | US | |
| Parent | 10038032 | Jan 2002 | US |
| Child | 10038217 | US | |
| Parent | 10037914 | Jan 2002 | US |
| Child | 10038032 | US | |
| Parent | 10037499 | Jan 2002 | US |
| Child | 10037914 | US | |
| Parent | 10037498 | Jan 2002 | US |
| Child | 10037499 | US |
