US 7,225,458 B2Grant
Method and apparatus for ensuring reception of conditional access information in multi-tuner receivers
Issue Date:2007-05-29
•20 Claims
•7 Drawing Sheets
Abstract
A method and apparatus for receiving conditional access information (CAI) on one or more of a plurality of tuners while the user is selecting different channels is disclosed. The method comprises the steps of receiving the CAI on a first tuner tuned to a first channel; identifying the first tuner as the tuner receiving the CAI; and commanding the second tuner to receive the CAI after receiving a command to retune the first tuner from the first channel to a second channel.
Metadata
Assignee
- The DirecTV Group, Inc.
Inventors
- Peter M. Klauss
- Raynold M. Kahn
- Gregory J. Gagnon
- David D. Ha
Application Information
Application Number:US 10/302,414
Filing Date:2002-11-21
Priority Date:2002-11-21
Art Unit:2685
Classifications
IPC:
H04H1/00H04H7/00
Patent Drawings (7 sheets)
Description
CROSS-REFERENCE TO RELATED APPLICATIONS
[0001] This application is related to the following patent application, which is hereby incorporated by reference herein:
[0002] U.S. patent application Ser. No. 10/302,416, entitled “METHOD AND APPARATUS FOR MINIMIZING CONDITIONAL ACCESS INFORMATION OVERHEAD WHILE ENSURING CONDITIONAL ACCESS INFORMATION RECEPTION IN MULTI-TUNER RECEIVERS,” by Peter M. Klauss, Raynold M. Kahn, Gregory J. Gagnon, and David D. Ha, attorney's docket number PD-200184, filed on same date herewith.
BACKGROUND OF THE INVENTION
[0003] 1. Field of the Invention
[0004] The present invention relates to systems and methods for providing video program material to subscribers, and in particular to a method and system for ensuring reception of conditional access information in multi-tuner receivers.
[0005] 2. Description of the Related Art
[0006] Media programs such as video and audio information can be distributed to households via a variety of methods including terrestrial transmitters, cable, the Internet, and satellites. Each of these media distribution systems implement a large number of channels, and are therefore capable of providing a large number of concurrently broadcast media programs to each household.
[0007] While existing systems provide a large number of channels, there is a trend towards even greater numbers of channels and greater bandwidth requirements on existing channels to accommodate, for example, HDTV. With regard to satellite-based media program distribution systems, the increased channels and bandwidth demands can be satisfied by the introduction of additional satellites and/or the use of additional transponders on the satellites.
[0008] In order to receive signals from each of the plurality of satellites, ground stations can include multiple antennae (each directed to a satellite of interest) coupled to a single tuner, multiple receiving elements (referred to as low noise block converters, or LNBs) using a single reflector, or multiple antennae and multiple tuners.
[0009] At the same time, it is important that the media programs transmitted by the satellites be protected from unauthorized reception and/or reproduction. This is accomplished by encrypting the media programs, and broadcasting data that (along with hardware disposed at the receiver station) is used to decrypt the media programs.
[0010] Unfortunately, when consumers go from one channel to another, the channel selection may require the receiver to switch from one tuner to the other (since the second channel is being transmitted by a different satellite than the first channel). In some cases, this switching from one tuner to the other can temporarily interrupt the reception of the information required to decrypt the desired media information. This problem is especially notable when the user is rapidly changing channels, or “channel surfing.”
[0011] What is needed is a system and method for assuring that the information required to decrypt media programs is readily available, even in circumstances when a channel command requires switching tuners from one to another. The present invention satisfies that need.
SUMMARY OF THE INVENTION
[0012] In summary, the present invention describes a system and method for receiving conditional access information (CAI) on one or more of a plurality of tuners while the user is selecting different channels. The method comprises the steps of receiving the CAI on a first tuner tuned to a first channel; identifying the first tuner as the tuner receiving the CAI; and commanding the second tuner to receive the CAI after receiving a command to retune the first tuner from the first channel to a second channel. In one embodiment, the apparatus comprises a receiver for receiving a media program and conditional access information (CAI) for decrypting the media program. The receiver comprises a first tuner tunable to a first channel to receive the CAI; a second tuner tunable to the first channel and the second channel; and a verifier, communicatively coupled to the first tuner and the second tuner, the verifier for decrypting the media program using the conditional access information (CAI), for identifying the first tuner as the tuner receiving the CAI, and for commanding the second tuner to receive the CAI after the receiver is commanded to retune the first tuner from the first channel to a second channel.
BRIEF DESCRIPTION OF THE DRAWINGS
[0013] Referring now to the drawings in which like reference numbers represent corresponding parts throughout:
[0014] FIG. 1 is a diagram showing an overview of a video distribution system;
[0015] FIG. 2 is a block diagram showing a typical uplink configuration showing how video program material is uplinked to a satellite for transmission to subscribers using a single transponder;
[0016] FIG. 3A is a diagram of a representative data stream received from a satellite;
[0017] FIG. 3B is a diagram illustrating the structure of a data packet;
[0018] FIG. 4 is a block diagram illustrating a high-level block diagram of the IRD; and
[0019] FIGS. 5A–5C are flow charts presenting illustrative process steps that can be used to practice one embodiment of the present invention.
DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS
[0020] In the following description, reference is made to the accompanying drawings which form a part hereof, and which show, by way of illustration, several embodiments of the present invention. It is understood that other embodiments may be utilized and structural changes may be made without departing from the scope of the present invention.
Video Distribution System
[0021] FIG. 1 is a diagram illustrating an overview of a video distribution system 100. The video distribution system 100 comprises a control center 102 in communication with an uplink center 104 via a ground link 114 and an integrated receiver/decoder (IRD) 132 at receiver station 130 via a public switched telephone network (PSTN) or other link 120. The control center 102 provides program material to the uplink center 104, coordinates with the receiver station 130 to offer subscribers 110 pay-per-view (PPV) program services, including billing and associated decryption of video programs.
[0022] The uplink center 104 receives program material and program control information from the control center 102, and using an uplink antenna 106, transmits the program material and program control information to the satellite 108. The satellite 108 receives and processes this information, and transmits the video programs and control information to the subscriber 110 at the receiver station 130 via downlink 118. The subscriber 110 receives this information using the subscriber antenna 112 communicatively coupled to the IRD 132.
[0023] The video distribution system 100 can comprise a plurality of satellites 108 in order to provide wider terrestrial coverage, to provide additional channels, or to provide additional bandwidth per channel. In one embodiment of the invention, each satellite comprises 16 transponders to receive and transmit program material and other control data from the uplink center 104 and provide it to the subscribers 110. However, using data compression and multiplexing techniques the channel capabilities are far greater. For example, two satellites 108 working together can receive and broadcast over 150 conventional (non-HDTV) audio and video channels via 32 transponders.
[0024] While the invention disclosed herein will be described with reference to a satellite based video distribution system 100, the present invention may also be practiced with terrestrial-based transmission of program information, whether by traditional broadcasting means, cable, or other means. Further, the different functions collectively allocated among the control center 102 and the uplink center 104 as described above can be reallocated as desired without departing from the intended scope of the present invention.
[0025] Although the foregoing has been described with respect to an embodiment in which the program material delivered to the subscriber is video (and audio) program material such as a movie, the foregoing method can be used to deliver program material comprising purely audio information or data as well.
[0026] FIG. 2 is a block diagram showing a typical uplink configuration for a single satellite 108 transponder, showing how video program material is uplinked to the satellite 108 by the control center 102 and the uplink center 104. FIG. 2 shows three video channels (which could be augmented respectively with one or more audio channels for high fidelity music, soundtrack information, or a secondary audio program for transmitting foreign languages), and a data channel from a computer data source 206.
[0027] The video channels are provided by a program source of video material 200A–200C (collectively referred to hereinafter as video source(s) 200). The data from each video program source 200 is provided to an encoder 202A–202C (collectively referred to hereinafter as encoder(s) 202). Each of the encoders accepts a program time stamp (PTS) from the controller 216. The PTS is a wrap-around binary time stamp that is used to assure that the video information is properly synchronized with the audio information after encoding and decoding. A PTS time stamp is sent with each I-frame of the MPEG encoded data.
[0028] In one embodiment of the present invention, each encoder 202 is a second generation Motion Picture Experts Group (MPEG-2) encoder, but other decoders implementing other coding techniques can be used as well. The data channel can be subjected to a similar compression scheme by an encoder (not shown), but such compression is usually either unnecessary, or performed by computer programs in the computer data source (for example, photographic data is typically compressed into *.TIF files or *.JPG files before transmission). After encoding by the encoders 202, the signals are converted into data packets by a packetizer 204A–204F (collectively referred to hereinafter as packetizer(s) 204) associated with each source 200.
[0029] The data packets are assembled using a reference from the system clock 214 (SCR), a control word (CW) generated by the conditional access manager 208, and a system channel identifier (SCID) that associates each of the data packets that are broadcast to the subscriber with a program channel. This information is transmitted to the packetizers 204 for use in generating the data packets. These data packets are then multiplexed into serial data, encoded, modulated, and transmitted. A special packet known as a control word packet (CWP) which comprises control data including the control word (CW) and other control data used in support of providing conditional access to the program material is also encrypted and transmitted.
[0030] FIG. 3A is a diagram of a representative data stream. The first packet segment 302 comprises information from video channel 1 (data coming from, for example, the first video program source 200A). The next packet segment 304 comprises computer data information that was obtained, for example from the computer data source 206. The next packet segment 306 comprises information from video channel 5 (from one of the video program sources 200), and the next packet segment includes information from video channel 1 (again, coming from the first video program source 200A). The data stream therefore comprises a series of packets from any one of the data sources in an order determined by the controller 216. The data stream is encrypted by the encryption module 218, modulated by the modulator 220 (typically using a QPSK modulation scheme), and provided to the transmitter 222, which broadcasts the modulated data stream on a frequency bandwidth to the satellite via the antenna 106.
[0031] Subscribers 110 receive media programs via a subscriber receiver or IRD 132. Using the SCID, the IRD 132 reassembles the packets to regenerate the program material for each of the channels. As shown in FIG. 3A , null packets created by the null packet module 312 may be inserted into the data stream as desired.
[0032] FIG. 3B is a diagram of a data packet. Each data packet (e.g. 302–316) is 147 bytes long, and comprises a number of packet segments. The first packet segment 320 comprises two bytes of information containing the SCID and flags. The SCID is a unique 12-bit number that uniquely identifies the data packet's data channel. The flags include 4 bits that are used to control whether the packet is encrypted, and what key must be used to decrypt the packet. The second packet segment 322 is made up of a 4-bit packet type indicator and a 4-bit continuity counter. The packet type identifies the packet as one of the four data types (video, audio, data, or null). When combined with the SCID, the packet type determines how the data packet will be used. The continuity counter increments once for each packet type and SCID. The next packet segment 324 comprises 127 bytes of payload data, which is a portion of the video program provided by the video program source 200. The final packet segment 326 is data required to perform forward error correction.
Encryption of Media Programs
[0033] Media programs are encrypted by the encryption module 218 before transmission to assure that they are received and viewed only by authorized subscribers. Each media program is encrypted according to an conditional access information (CAI). In one embodiment, the conditional access information includes an alphanumeric encryption key referred to hereinafter as a control word (CW). This encryption can be accomplished by a variety of data encryption techniques, including the data encryption standard (DES) and the Rivest-Shamir-Adleman (RSA) algorithm.
[0034] To decrypt the media programs, the subscriber's 110 IRD 132 must also have access to the CW. To maintain security, CWs are not transmitted to the IRD 132 plaintext. Instead, CWs are encrypted before transmission to the subscriber's IRD 132. The encrypted CW is transmitted to the subscriber's IRD 132 in a control word (data) packet.
[0035] In one embodiment, the data in the control word packet (CWP) (which is also hereinafter alternatively referred to as a conditional access packet (CAP)), including the CW, is encrypted and decrypted via what is referred to hereinafter as an input/output (I/O) indecipherable algorithm.
[0036] An I/O indecipherable algorithm is an algorithm that is applied to an input data stream to produce an output data stream. Although the input data stream uniquely determines the output data stream, the algorithm selected is such that it's characteristics cannot be deciphered from a comparison of even a large number of input and output data streams. The security of this algorithm can be further increased by adding additional functional elements which are non-stationary (that is, they change as a function of time). When such an algorithm is provided with identical input streams, the output stream provided at a given point in time may be different than the output stream provided at another time.
[0037] So long as the encryption module 218 and the IRD 132 share the same I/O indecipherable algorithm, the IRD 132 can decode the information in the CWP to retrieve the CW. Then, using the CW, the IRD 132 can decrypt the media program so that it can be presented to the subscriber 110.
[0038] To further discourage piracy, the control data needed to decrypt and assemble data packets into viewable media programs may be time-varying (the validity of the control data in a CWP to decode a particular media program changes with time). This can be implemented in a variety of ways.
[0039] For example, since each CWP is associated with a SCID for each media program, the SCID related to each CWP could change over time.
[0040] Another way to implement time-varying control data is to associate time stamps with the received data stream and the CWP control data. In this case, successful decoding of the CWP to produce the CW would require the proper relationship between the time stamps for the data stream and the control data in the CWP. This relationship can be defined, for example, by changing the decryption scheme used to generate the CW from the CWP according to the received time stamp for the data stream. In this case, if the time stamp of the received data stream does not match the expected value, the wrong decryption scheme will be selected and the proper CW (to decrypt the program material) will not be produced. If, however, the time stamp of the received data stream matches the expected value, the proper decryption scheme will be selected, and the CWP decryption scheme will yield the proper CW.
Subscriber Reception and Decryption of Media Programs
[0041] FIG. 4 is a simplified block diagram of an IRD 132. The IRD 132 receives and decrypts the media programs broadcast by the video distribution system 100. These media programs are streamed to the IRD 132 in real time, and may include, for example, video, audio, or data services.
[0042] The media programs may be transmitted by a plurality of satellites such as satellite 108A and 108B (hereinafter alternatively collectively referred to as satellite(s) 108, each of which typically includes a plurality of transponders 450–456.
[0043] The IRD 132 is communicatively coupleable to a conditional access module (CAM) 406. The CAM 406 is typically implemented in a smart card or similar device, which is provided to the subscriber 110 to be inserted into the IRD 132. The CAM 406 interfaces with a conditional access verifier (CAV) 408 which performs at least some of the functions necessary to verify that the subscriber 110 is entitled to access the media programs. The CAV is communicatively coupled to the tuner(s) 410 via other elements in the IRD 132, including the microcontroller and memory 414.
[0044] In the illustrated embodiment, the CAV 414 is also communicatively coupled to the tuners 410. This permits the CAV to receive information from the tuners regarding which satellite/transponder/channel each tuner is tuned to and to supply commands to the tuners 410 to switch channels at appropriate times. In another embodiment, the CAV 414 is not directly coupled to the tuners, but receives information regarding the tuners 410 via the microprocessor and memory 414 (which controls the tuners and receives information from them) and provides commands to the tuners via the microprocessor and memory 414 as well.
[0045] The CAV 408 may be communicatively coupled to the CAM 406 via a metadata analysis module (MAM) 411. Using the information such as that which can be stored in a metadata table, the MAM 411 acts as a gate-keeper to determine whether stored media programs will be decrypted and presented to the subscriber 110. This is accomplished by comparing the metadata values with measured or accumulated values. The CAV 408 and the MAM 411 can be implemented as separate modules from the transport/demux/decryptor 412 and the microcontroller and memory 414 as shown, or may be implemented via software instructions stored in the memory and performed by the microcontroller 414.
[0046] In one embodiment, the IRD 132 comprises a plurality of tuners such as first tuner 410A and second tuner 410B and nth tuner 410N (alternatively referred to hereinafter as tuner(s) 410), a transport and demultiplexing module (TDM) 412, which operates under control of a microcontroller and associated memory 414, a source decoder 416 and communicatively coupled random access memory (RAM) 418, and a user I/O device for accepting subscriber 110 commands and for providing output information to the subscriber.
[0047] Each of the tuners 410 receive the data packets from the video distribution system and provides the packets to the TDM 412. The use of multiple tuners 410 allows the IRD 132 to quickly tune a signal from one of a plurality of satellites without moving the antenna or the antenna reflector. The use of two tuners also allows the IRD 132 to receive media program information at a higher bandwidth by receiving information with both tuners simultaneously. This can be implemented by dedicating each tuner to a different low noise block converter (LNB) or an entirely different antenna than the other tuner 410.
[0048] Using the SCIDs associated with each media program, the TDM 412 reassembles the data packets according to the channel selected by the subscriber 110, and unencrypts the media programs using the CW key. The TDM 412 can be implemented by a single secure chip, and is communicatively coupled to a microcontroller and memory 414.
[0049] Once the media programs are unencrypted, they are provided to the source decoder 416 which decodes the media program data according to MPEG or JPEG standards as appropriate. The decoded media program is then provided to a D/A converter (if necessary) and provided to external interfaces 404 which can include a media program presentation device such as a television, an audio system, or a computer. The source decoder 416 makes use of communicatively coupled RAM 418 to perform these functions.
[0050] The CW key is obtained from the CWP using the CAV 408 and the CAM 406. The TDM 412 provides the CWP to the CAM 406 via the CAV 408. The CAM 406 uses the I/O indecipherable algorithm to generate the CW, which is provided back to the TDM 412. The TDM 412 uses the CW to decrypt the media programs. In most IRDs 132, the CAV 408 and the CAM 406 are capable of decrypting one video/audio/data media program at a time.
[0051] As described above, to discourage potential pirates, the control data in the CWP used to decode a particular media program may change with time so that it only produces the proper CW when applied to a media program having the proper time stamp. In this case, the CAM 406 can select and/or control the decryption scheme (e.g. the I/O indecipherable algorithm) according to the time stamp associated with the data stream carrying the media program. If the media program is sufficiently disassociated in time, the improper decryption scheme will be used, and the proper CW to decode the media program will not be produced.
[0052] Further details regarding the encryption and decryption of media programs can be found in co-pending and commonly assigned U.S. patent application Ser. No. 09/491,959, which application is hereby incorporated by reference herein.
[0053] FIG. 5A is a flow chart presenting illustrative process steps that can be used to practice one embodiment of the present invention. Conditional access information (CAI) is received on a first tuner 410A tuned to a first channel, as shown in block 502. This CAI is used, for example, to decrypt the media program currently being viewed the user. A command is received to change the channel being viewed by the user, as shown in block 504. The receiver 132 identifies which of the tuners (e.g. 410A, 410B . . . 410N) is receiving the CAI, as shown in block 506. This can occur after the receipt of the channel change command (as illustrated in FIG. 5A ), after the channel change command, or may be determined periodically or on an ongoing basis. A determination is made as to whether the channel change command would require retuning the first tuner (the tuner currently receiving the CAI) away from the current channel (e.g. to another channel), as shown in block 508. If this is the case, there is the possibility that the receipt of the CAI information will be temporarily interrupted, compromising the user's ability to surf rapidly from one channel to another.
[0054] A command is provided to a different tuner (e.g. second tuner 410B or 410N) to tune to a channel (and a satellite/transponder combination) to receive the CAI information required to decrypt the media program provided on the selected channel. This is shown in block 510. The first tuner is the retuned from the first channel to the second channel, as was implicated in the channel command. Since the second tuner is now receiving the CAI, the change in channels can be performed without a temporary interruption in the decryption of the media program, as shown in block 514.
[0055] In one embodiment, the first tuner is not retuned from the first channel to the second channel until it is confirmed that the second tuner is receiving the CAI. This is shown in block 512. This effectively prevents any channel change to be performed until an appropriate CAI is received.
[0056] FIG. 5B is flow chart illustrating exemplary process steps that can be used to practice another embodiment of the invention. In this embodiment, the tuning step shown in block 510 includes a determination as to which of the plurality of tuners 410 should be selected to receive the CAI. Of the available tuners, this technique chooses the tuner that is retuned least often, as shown in block 518. Since this tuner is historically retuned less often than the others, using this tuner to receive the CAI should result in fewer service disruptions (e.g. the decision shown in block 508 will result in a “no” more often than if the other tuners were utilized).
[0057] FIG. 5C is a flow chart illustrating another embodiment of the present invention. In this embodiment, in performing the operation of block 510, each of the tuners 410A–410N are selected in order in a round-robin fashion (e.g. 410A, 410B, 410N, 410A, 410B, 410N . . . ). This is shown in block 520. Since this only occurs when block 508 determines that the commanded channel change requires that the tuner receiving the CAI information change from one channel to another, the round robin selection of the next succeeding tuner will assure that the tuners that are more typically tuned to the CAI channels remain so. In other words, if a particular channel is dedicated to receiving the CAI information, the round robin technique will eventually select that channel, and no further retuning will be required. Further in cases where a particular tuner is not dedicated to receive CAI information, but infrequently receives anything else, the round robin technique will eventually select that channel for receiving the CAI information, and the tuner will remain tuned to that channel until such time (which is infrequent) as the tuner is required to tune to another. Therefore, using the round robin technique, the channels which are statistically more likely to not require retuning are tuned to statistically more often.
[0058] The foregoing method steps can be implemented in a number of ways, including by use of software modules and hardware modules having a plurality interconnected circuit elements. In one embodiment of the present invention, the steps shown in FIGS. 5A–5C are performed at least in part in the CAV 408, by a hardware module and/or a software module. The processor for performing the operations defined in the software module may be stored in a CAV 408 dedicated memory coupled to a CAV 408 dedicated processor, or may be performed by the microcontroller and associated memory 414. Other elements, such as the CAM 406 and/or the microcontroller and memory 414 may perform some or all of the functions described in FIGS. 5A–5C .
CONCLUSION
[0059] The foregoing description of the preferred embodiment of the invention has been presented for the purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise form disclosed. Many modifications and variations are possible in light of the above teaching. For example, the encryption functions described herein could be performed by separate encryption/decryption modules, or a single multi-purpose encryption/decryption module can be utilized to perform the encryption/decryption functions of many separate modules.
[0060] It is intended that the scope of the invention be limited not by this detailed description, but rather by the claims appended hereto. The above specification, examples and data provide a complete description of the manufacture and use of the composition of the invention. Since many embodiments of the invention can be made without departing from the spirit and scope of the invention, the invention resides in the claims hereinafter appended.
Claims
What is claimed is:
1. A method of receiving conditional access information (CAI) on one or more of a plurality of tuners comprising a first tuner and a second tuner, the CAI usable to decrypt one or more media programs, the method comprising the steps of:
receiving the CAI on a first tuner tuned to a first channel;
identifying the first tuner as the tuner receiving the CAI; and
commanding the second tuner to receive the CAI.
2. The method of claim 1, wherein the step of commanding the second tuner to receive the CAI is performed before retuning the first tuner from the first channel to a second channel.
3. The method of claim 1, further comprising the steps of:
confirming that the second tuner is receiving the CAI; and
commanding the first tuner to retune the first tuner from the first channel to a second channel.
4. The method of claim 3, wherein the step of commanding the second tuner to receive the CAI further comprises the steps of:
determining which of the plurality of tuners is retuned least frequently among the plurality of tuner; and
designating the tuner that is retuned least frequently among the plurality of tuners as the second tuner.
5. The method of claim 1, wherein each of the plurality of tuners is identifiable in a round robin sequence and the step of commanding the second tuner to receive the CAI further comprises the steps of:
designating a tuner that follows the first tuner in the round robin sequence as the second tuner.
6. An apparatus for receiving conditional access information (CAI) on one or more of a plurality of tuners comprising a first tuner and a second tuner, the CAI usable to decrypt one or more media programs, the method comprising:
means for receiving the CAI on a first tuner tuned to a first channel;
means for identifying the first tuner as the tuner receiving the CAI; and
means for commanding the second tuner to receive the CAI.
7. The apparatus of claim 6, wherein the means for commanding the second tuner to receive the CAI is performed before retuning the first tuner from the first channel to a second channel.
8. The apparatus of claim 6, further comprising:
means for confirming that the second tuner is receiving the CAI; and
means for commanding the first tuner to retune the first tuner from the first channel to a second channel.
9. The apparatus of claim 8, wherein the step of commanding the second tuner to receive the CAI further comprises the steps of:
determining which of the plurality of tuners is retuned least frequently among the plurality of tuner; and
designating the tuner that is retuned least frequently among the plurality of tuners as the second tuner.
10. The apparatus of claim 6, wherein each of the plurality of tuners is identifiable in a round robin sequence and the step of commanding the second tuner to receive the CAI further comprises the steps of:
designating a tuner that follows the first tuner in the round robin sequence as the second tuner.
11. A receiver for receiving a media program and conditional access information (CAI) for decrypting the media program, comprising:
a first tuner tunable to a first channel to receive the CAI
a second tuner tunable to the first channel and a second channel; and
a verifier, communicatively coupled to the first tuner and the second tuner, the verifier for decrypting the media program using the conditional access information (CAI), for identifying the first tuner as the tuner receiving the CAI, and for commanding the second tuner to receive the CAI.
12. The receiver of claim 11, wherein the verifier commands the second tuner to receive the CAI before the first tuner is retuned from the first channel to the second channel.
13. The receiver of claim 11, wherein the verifier further comprises a module for confirming that the second tuner is receiving the CAI before the first tuner is retuned from the first channel to the second channel.
14. The receiver of claim 13, wherein the verifier further comprises:
a second module for determining which of the plurality of tuners is retuned least frequently among the plurality of tuner;
a third module for designating the tuner that is retuned least frequently among the plurality of tuners as the second tuner.
15. The receiver of claim 11, wherein each of the plurality of tuners is identifiable in a round robin sequence and the verifier further comprises:
a fourth module for designating a tuner that follows the first tuner in the round robin sequence as the second tuner.
16. A program storage device, readable by a computer, tangibly embodying at least one program of instructions executable by the computer to perform method steps of receiving conditional access information (CAI) on one or more of a plurality of tuners comprising a first tuner and a second tuner, the CAI usable to decrypt one or more media programs, the method steps comprising the steps of:
receiving the CAI on a first tuner tuned to a first channel;
identifying the first tuner as the tuner receiving the CAI; and
commanding the second tuner to receive the CAI.
17. The program storage device of claim 16, wherein the method step of commanding the second tuner to receive the CAI is performed before retuning the first tuner from the first channel to a second channel.
18. The program storage device of claim 16, wherein the method steps further comprise the steps of:
confirming that the second tuner is receiving the CAI; and
commanding the first tuner to retune the first tuner from the first channel to a second channel.
19. The program storage device of claim 18, wherein the method step of commanding the second tuner to receive the CAI further comprises the method steps of:
determining which of the plurality of tuners is retuned least frequently among the plurality of tuner; and
designating the tuner that is retuned least frequently among the plurality of tuners as the second tuner.
20. The program storage device of claim 16, wherein each of the plurality of tuners is identifiable in a round robin sequence and the method step of commanding the second tuner to receive the CAI further comprises the method steps of:
designating a tuner that follows the first tuner in the round robin sequence as the second tuner.
Patent Citations (171)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4613901(A) | 1986-09-01 | Gilhousen et al. | Applicant |
| US4633309(A) | 1986-12-01 | Li et al. | Applicant |
| US4675732(A) | 1987-06-01 | Oleson | Applicant |
| US4866769(A) | 1989-09-01 | Karp | Applicant |
| US4866787(A) | 1989-09-01 | Oleson | Applicant |
| US5033084(A) | 1991-07-01 | Beecher | Applicant |
| US5132992(A) | 1992-07-01 | Yurt et al. | Applicant |
| US5168353(A) | 1992-12-01 | Walker et al. | Applicant |
| US5172413(A) | 1992-12-01 | Bradley et al. | Applicant |
| US5199066(A) | 1993-03-01 | Logan | Applicant |
| US5301352(A) | 1994-04-01 | Nakagawa et al. | Applicant |
| US5357276(A) | 1994-10-01 | Banker et al. | Applicant |
| US5371551(A) | 1994-12-01 | Logan et al. | Applicant |
| US5386587(A) | 1995-01-01 | Yuzawa | Applicant |
| US5396293(A) | 1995-03-01 | Shellard | Applicant |
| US5420866(A) | 1995-05-01 | Wasilewski | Applicant |
| US5438423(A) | 1995-08-01 | Lynch et al. | Applicant |
| US5440336(A) | 1995-08-01 | Buhro et al. | Applicant |
| US5473609(A) | 1995-12-01 | Chaney | Applicant |
| US5495531(A) | 1996-02-01 | Smiedt | Applicant |
| US5557541(A) | 1996-09-01 | Schulhof et al. | Applicant |
| US5565805(A) | 1996-10-01 | Nakagawa et al. | Applicant |
| US5583937(A) | 1996-12-01 | Ullrich et al. | Applicant |
| US5586264(A) | 1996-12-01 | Belknap et al. | Applicant |
| US5592551(A) | 1997-01-01 | Lett et al. | Applicant |
| US5592651(A) | 1997-01-01 | Rackman | Applicant |
| US5594491(A) | 1997-01-01 | Hodge et al. | Applicant |
| US5619247(A) | 1997-04-01 | Russo | Applicant |
| US5640453(A) | 1997-06-01 | Schuchman et al. | Applicant |
| US5642418(A) | 1997-06-01 | Farris et al. | Applicant |
| US5663896(A) | 1997-09-01 | Aucsmith | Applicant |
| US5675390(A) | 1997-10-01 | Schindler et al. | Applicant |
| US5677895(A) | 1997-10-01 | Mankovitz | Applicant |
| US5701383(A) | 1997-12-01 | Russo et al. | Applicant |
| US5710970(A) | 1998-01-01 | Walters et al. | Applicant |
| US5715315(A) | 1998-02-01 | Handelman | Applicant |
| US5715403(A) | 1998-02-01 | Stefik | Applicant |
| US5721829(A) | 1998-02-01 | Dunn et al. | Applicant |
| US5724646(A) | 1998-03-01 | Ganek et al. | Applicant |
| US5729280(A) | 1998-03-01 | Inoue et al. | Applicant |
| US5748732(A) | 1998-05-01 | Le Berre et al. | Applicant |
| US5761302(A) | 1998-06-01 | Park | Applicant |
| US5764762(A) | 1998-06-01 | Kazmierczak et al. | Applicant |
| US5784095(A) | 1998-07-01 | Robbins et al. | Applicant |
| US5790663(A) | 1998-08-01 | Lee et al. | Applicant |
| US5793971(A) | 1998-08-01 | Fujita et al. | Applicant |
| US5805699(A) | 1998-09-01 | Akiyama et al. | Applicant |
| US5826165(A) | 1998-10-01 | Echeita et al. | Applicant |
| US5831664(A) | 1998-11-01 | Wharton et al. | Applicant |
| US5845240(A) | 1998-12-01 | Fielder | Applicant |
| US5850218(A) | 1998-12-01 | La Joie et al. | Applicant |
| US5864747(A) | 1999-01-01 | Clark et al. | Applicant |
| US5867207(A) | 1999-02-01 | Chaney et al. | Applicant |
| US5899582(A) | 1999-05-01 | DuLac | Applicant |
| US5912969(A) | 1999-06-01 | Sasamoto et al. | Applicant |
| US5914941(A) | 1999-06-01 | Janky | Applicant |
| US5926205(A) | 1999-07-01 | Krause et al. | Applicant |
| US5930215(A) | 1999-07-01 | Fite et al. | Applicant |
| US5933500(A) | 1999-08-01 | Blatter et al. | Applicant |
| US5936660(A) | 1999-08-01 | Gurantz | Examiner |
| US5937067(A) | 1999-08-01 | Thatcher et al. | Applicant |
| US5953418(A) | 1999-09-01 | Bock et al. | Applicant |
| US5966186(A) | 1999-10-01 | Shigihara et al. | Applicant |
| US5973756(A) | 1999-10-01 | Ertin | Applicant |
| US5978649(A) | 1999-11-01 | Kahn | Applicant |
| US5999628(A) | 1999-12-01 | Chan | Applicant |
| US5999629(A) | 1999-12-01 | Heer et al. | Applicant |
| US6005937(A) | 1999-12-01 | Lee | Applicant |
| US6011511(A) | 2000-01-01 | Chuong et al. | Applicant |
| US6025868(A) | 2000-02-01 | Russo | Applicant |
| US6035038(A) | 2000-03-01 | Campinos et al. | Applicant |
| US6055314(A) | 2000-04-01 | Spies et al. | Applicant |
| US6055566(A) | 2000-04-01 | Kikinis | Applicant |
| US6061451(A) | 2000-05-01 | Muratani et al. | Applicant |
| US6061452(A) | 2000-05-01 | Suzuki | Applicant |
| US6069647(A) | 2000-05-01 | Sullivan et al. | Applicant |
| US6072873(A) | 2000-06-01 | Bewick | Applicant |
| US6072982(A) | 2000-06-01 | Haddad | Applicant |
| US6075330(A) | 2000-06-01 | Terk | Applicant |
| US6091883(A) | 2000-07-01 | Artigalas et al. | Applicant |
| US6097441(A) | 2000-08-01 | Allport | Applicant |
| US6144400(A) | 2000-11-01 | Ebisawa | Applicant |
| US6154206(A) | 2000-11-01 | Ludtke | Examiner |
| US6157719(A) | 2000-12-01 | Wasilewski et al. | Applicant |
| US6157949(A) | 2000-12-01 | Cheng et al. | Applicant |
| US6160988(A) | 2000-12-01 | Shroyer et al. | Applicant |
| US6169879(B1) | 2001-01-01 | Perlman | Applicant |
| US6198875(B1) | 2001-03-01 | Edenson et al. | Applicant |
| US6202211(B1) | 2001-03-01 | Williams, Jr. | Applicant |
| US6229895(B1) | 2001-05-01 | Son et al. | Applicant |
| US6240401(B1) | 2001-05-01 | Oren et al. | Applicant |
| US6263504(B1) | 2001-07-01 | Ebisawa | Applicant |
| US6266481(B1) | 2001-07-01 | Lee et al. | Applicant |
| US6286142(B1) | 2001-09-01 | Ehreth | Applicant |
| US6288716(B1) | 2001-09-01 | Humpleman et al. | Applicant |
| US6289455(B1) | 2001-09-01 | Kocher et al. | Applicant |
| US6317883(B2) | 2001-11-01 | Marics | Applicant |
| US6317884(B1) | 2001-11-01 | Eames et al. | Applicant |
| US6370688(B1) | 2002-04-01 | Hejna, Jr. | Applicant |
| US6398245(B1) | 2002-06-01 | Gruse et al. | Applicant |
| US6405372(B1) | 2002-06-01 | Kim et al. | Examiner |
| US6415031(B1) | 2002-07-01 | Colligan et al. | Applicant |
| US6437836(B1) | 2002-08-01 | Huang et al. | Applicant |
| US6456985(B1) | 2002-09-01 | Ohtsuka | Applicant |
| US6466671(B1) | 2002-10-01 | Maillard et al. | Applicant |
| US6466921(B1) | 2002-10-01 | Cordery et al. | Applicant |
| US6473858(B1) | 2002-10-01 | Shimomura et al. | Applicant |
| US6480667(B1) | 2002-11-01 | O'Connor | Applicant |
| US6487663(B1) | 2002-11-01 | Jaisimha et al. | Applicant |
| US6487722(B1) | 2002-11-01 | Okura et al. | Applicant |
| US6496980(B1) | 2002-12-01 | Tillman et al. | Applicant |
| US6502139(B1) | 2002-12-01 | Birk et al. | Applicant |
| US6516465(B1) | 2003-02-01 | Paskins | Applicant |
| US6519772(B1) | 2003-02-01 | Bopardikar | Applicant |
| US6530085(B1) | 2003-03-01 | Perlman | Applicant |
| US6542870(B1) | 2003-04-01 | Matsumoto | Applicant |
| US6550011(B1) | 2003-04-01 | Simms, III | Applicant |
| US6574609(B1) | 2003-06-01 | Downs et al. | Applicant |
| US6611812(B2) | 2003-08-01 | Hurtado et al. | Applicant |
| US6637027(B1) | 2003-10-01 | Breslauer et al. | Examiner |
| US6654547(B1) | 2003-11-01 | Maeda et al. | Applicant |
| US6655580(B1) | 2003-12-01 | Ergo et al. | Applicant |
| US6671881(B1) | 2003-12-01 | Tamer et al. | Applicant |
| US6741834(B1) | 2004-05-01 | Godwin | Examiner |
| US6745245(B1) | 2004-06-01 | Carpenter | Examiner |
| US6772434(B1) | 2004-08-01 | Godwin | Examiner |
| US6853728(B1) | 2005-02-01 | Kahn et al. | Applicant |
| US2001/0001876(A1) | 2001-05-01 | Morgan et al. | Applicant |
| US2001/0046299(A1) | 2001-11-01 | Wasilewski et al. | Applicant |
| US2002/0001386(A1) | 2002-01-01 | Akiyama | Applicant |
| US2002/0010920(A1) | 2002-01-01 | Bertram | Applicant |
| US2002/0023219(A1) | 2002-02-01 | Treffers et al. | Applicant |
| US2002/0048367(A1) | 2002-04-01 | Maillard | Applicant |
| US2002/0056112(A1) | 2002-05-01 | Dureau et al. | Applicant |
| US2002/0101991(A1) | 2002-08-01 | Bacon et al. | Examiner |
| US2002/0112243(A1) | 2002-08-01 | Hunter et al. | Applicant |
| US2002/0116705(A1) | 2002-08-01 | Perlman et al. | Examiner |
| US2002/0170054(A1) | 2002-11-01 | Kudelski et al. | Applicant |
| US2002/0170072(A1) | 2002-11-01 | Lundbald et al. | Examiner |
| US2002/0196374(A1) | 2002-12-01 | Barry et al. | Examiner |
| US2002/0196939(A1) | 2002-12-01 | Unger et al. | Applicant |
| US2003/0002679(A1) | 2003-01-01 | Akiyama et al. | Applicant |
| US2003/0002680(A1) | 2003-01-01 | Akiyama et al. | Applicant |
| US2003/0040962(A1) | 2003-02-01 | Lewis | Applicant |
| US2003/0061477(A1) | 2003-03-01 | Kahn | Applicant |
| US2003/0105718(A1) | 2003-06-01 | Hurtado et al. | Applicant |
| US2003/0110132(A1) | 2003-06-01 | Sako | Applicant |
| US2003/0145183(A1) | 2003-07-01 | Muehrina | Applicant |
| US2003/0174844(A1) | 2003-09-01 | Candelore | Applicant |
| US2003/0196113(A1) | 2003-10-01 | Brown et al. | Examiner |
| US2003/0208771(A1) | 2003-11-01 | Hensgen et al. | Examiner |
| US2003/0228911(A1) | 2003-12-01 | Dernis et al. | Applicant |
| US2004/0003079(A1) | 2004-01-01 | Aiu et al. | Applicant |
| EP936812 | 1999-08-01 | Applicant | |
| EP975165 | 2000-01-01 | Applicant | |
| EP989557 | 2000-03-01 | Applicant | |
| EP1156676(A) | 2001-11-01 | Applicant | |
| EP1304871(A) | 2003-04-01 | Applicant | |
| EP1353511 | 2003-10-01 | Applicant | |
| EP1369152 | 2003-12-01 | Applicant | |
| GB2354392 | 2001-03-01 | Applicant | |
| JP6351023 | 1994-12-01 | Applicant | |
| JP11136708 | 1999-05-01 | Applicant | |
| WO92/11713 | 1992-07-01 | Applicant | |
| WO/13412 | 2000-03-01 | Applicant | |
| WO/14967 | 2000-03-01 | Applicant | |
| WO/19294 | 2000-04-01 | Applicant | |
| WO1/37546 | 2001-05-01 | Applicant | |
| WO1/43444(A) | 2001-06-01 | Applicant | |
| WO2/15184 | 2002-02-01 | Applicant | |
| WO2/065750 | 2002-08-01 | Applicant |
Non-Patent Literature (14)
- P. Venkat Rangan et al., “Designing an On-Demand Multimedia Service”, IEEE Communications Magazine, Jul. 1992, vol. 30, No. 7, title page and pp. 56-64.Applicant
- Wanjoun Liao wt al., “The Split and Merge Protocol for Interactive Video-On-Demand”, IEEE Multimedia, Oct.-Dec. 1997, vol. 4, No. 4, index and pp. 51-62.Applicant
- Robert Johnston et al., “A Digital Television Sequence Store”, IEEE Transactions on Communication, May 1978, vol. COM-26, No. 5, index and pp. 594-600.Applicant
- “Proposed SMPTE Standard for Television-Splice Points for MPEG-2 Transport Streams”, SMPTE Journal, Oct. 1998, SMPTE 312M, pp. 916-925.Applicant
- Michael Robin et al., “Digital Television Fundamentals-Design and Installation of Video and Audio Systems”, McGraw-Hill, Chapter 8, title page(s) and pp. 345-425.Applicant
- Yongchen Li et al., “Security Enhanced MPEG Player”, IEEE, 1996, pp. 169-175.Applicant
- Fink, Ready to take the dive? It's fast-forward as new DVD and divx formats hit market (includes graphic: home video: the next generation plus: Some selections that show off the system), . . .Applicant
- Sin-Joo Lee et al., A Survey of Watermarking Techniques Applied to Multimedia, IEEE, 2001, pp. 272-277.Applicant
- “PocketTV Brings Video to Palm-size PC”, Mar. 9, 2000, 2 pages.Applicant
- 1st Report of EBU/SMPTE Task Force for Harmonized Standards for the Exchange of Television Program Material as Bit Streams, May 6, 1997, Version 1.30, pp. 1-73.Applicant
- B. Schneier, “Applied Cryptography-Protocols, Algorithms, and Source Code in C”, 2nd Edition, pp. 216-222, 357-362.Applicant
- HP Jornada 430/430SE Palm-size PC: User's Guide, Hewlett Packard, 1999, pp. 7-9.Applicant
- PocketTV-MPEG movie player for Pocket PCT and WinCE, May 17, 2000, MPEG TV, LLC, retrieved from URL: http://web.archive.org/web/2000006210123803/www.mpegtv.com/wince/pockettv/index.html.Applicant
- Download PockeTV (beta) for WinCE, Nov. 3, 1999, MPEG TV, LLC, retrieved from HRL: http://web.archive.org/web/19991127093158/www.mpegtv.com/wince/pockettv/index.html.Applicant