Video recorder having user extended and automatically extended time slots

Information

  • Patent Grant
  • 9848161
  • Patent Number
    9,848,161
  • Date Filed
    Tuesday, April 3, 2012
    13 years ago
  • Date Issued
    Tuesday, December 19, 2017
    7 years ago
Abstract
The present invention is directed to a video recorder having user extended and automatically extended time slots. An embodiment of the present invention includes a set-top box having an internal storage device, such as a hard drive where broadcasts are transferred from a broadcast input source to the storage device. The set-top box is connected to an output device such as a television, which displays a graphical user interface (GUI) and an interactive program guide (IPG). The user has the option to extend a chosen time slot, in which a show is scheduled to be transferred to the storage device. A dialog box is used when certain types of shows are selected that commonly require timeslot extensions at the end of the show.
Description
NOTICE OF MATERIAL SUBJECT TO COPYRIGHT PROTECTION

All of the material in this patent document is subject to copyright protection under the copyright laws of the United States and of other countries. The owner of the copyright has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure, as it appears in the United States Patent and Trademark Office file or records, but otherwise reserves all copyrights whatsoever.


BACKGROUND OF THE INVENTION

1. Field of the Invention


The present invention relates generally to systems that transfer broadcast content to


volatile and/or non-volatile storage devices.


2. Background of the Invention


The capture of broadcast content gained major popularity with the advent of the VCR. A user was able to tune their television to a station that had a show that they wanted to save and they simply inserted a storage device (e.g., a VHS tape), moved the tape to the appropriate location, and began capturing the broadcast. Recently, other types of equipment have developed to perform similar functionality. These types of equipment include, for instance, DVD recorders (DVD-R) and set-top boxes that include digital video recorders.


Both of these types of equipment are used in a manner that is similar to the operation of VCRs. Each has its own storage device (i.e., a DVD or hard drive) and each storage device is of finite space. If a user is saving a long program, multiple programs, or begins saving the program when the storage device is nearly full, there is a chance that the program the user is trying to save will be lost. This is a frustrating problem for the average user, specifically when they want to save content when they are away from the home.


Saving Broadcast Content


Saving broadcast content in its simplest form comprises turning on the television set and pressing a button on a VCR. More recently, VCRs, DVD-Rs, and digital video recorders (DVR), include interfaces which allow users to schedule the transfer of programs at a later date or time. Using this interface, the user is able to give the device a time and a channel and when it is the right time the device tunes to the channel, and begins saving the program. This is useful, for instance, when the user is away from home and wants to see the program later.


Another modern interface allows the user to focus on a favorite program. For instance, a user may love “Monday Night Football”, which occurs every Monday night from 6:00 P.M. to 9:00 P.M. So, the user may wish to transfer this broadcast to a storage device regardless of whether they are home or not and may not want to have to instruct the machine every time. Using the interface, the user is able to set the system to save content for the three hours on Monday night when the football game is broadcast every week.


Tuner Conflicts


However, these schemes are inadequate because conflicts may arise in the scheduling system. Typically, a system is limited by the number of tuners it has. A one tuner system, for instance can either be used to save a program on a specific channel or watch the channel, however, the system cannot save content on one station and be used to watch another station. A two tuner system can be used to transfer and watch two different stations. Situations arise, however, where the system has been given instructions to transfer multiple shows simultaneously and there are not enough available tuners to perform this function.


Show Prioritization


One technique prioritizes shows scheduled to be transferred and when a conflict arises only the highest priority show is transferred. This technique is limited, however, because sometimes a user extends a timeslot in the transfer schedule to a few minutes before and a few minutes after the actual show. The user might do this because, for instance, they might want to save part of a pre-game show for a sports event, or they might want to save content after a sports event, if it goes into overtime. Moreover, the system might automatically extend time slots by brief periods automatically to avoid missing content if the broadcaster's clock and the system's clock are out of sync or if the broadcast starts a few minutes early or late.


In such a case, a conflict may arise solely because of a user extended or automatically extended time slot. If these additional time slots are not treated as separate entities, unexpected results may occur. For instance a high priority first show may override a lower priority second show and cause the second show to not be saved merely because the first show overlapped the second show by an automatically extended minute or two. Such a result is clearly inadequate.


SUMMARY OF THE INVENTION

The present invention is directed to a video recorder having user extended and automatically extended time slots. An embodiment of the present invention includes a set-top box haying an internal storage device, such as a hard drive where broadcasts are transferred from a broadcast input source to the storage device and are played back from the storage device to an output device, such as a television or computer monitor. The set-top box displays a graphical user interface (GUI) and an interactive program guide (IPG) on the output device. The IPG displays a list of shows that are available by tuning to different channels at different times as well as descriptions and details about each show. The GUI allows the user to navigate through the IPG, for instance, by viewing different times and dates for broadcasts, and also allows the user to view the shows that are scheduled to be transferred to the storage device in the future, and the shows that have already been transferred to the storage device.


The GUI also allows the user to Utilize a video recorder, for instance by navigating the IPG and selecting broadcasts to later transfer to the storage device. The user may select one or more broadcasts, or may repeatedly transfer the same program in a series to the storage device. The user has the option to extend the time slot, in which a show is scheduled to be transferred to the storage device. The time slot may be extended before the show, after the show, or both. The system also implements an automatic extension of the time slot by default. Automatically extended time is used to ensure that the data is completely captured to the system, in case the broadcast time and the set-top box time are slightly out of sync or the broadcaster unexpectedly begins a show's broadcast slightly early or late.


Each show is given a priority either automatically or manually. Each user extended and automatically extended timeslot is also prioritized. When a conflict arises, the present invention generates solutions to the conflicts. When a conflict is merely multiple shows that overlap, various factors are used to determine which show is the highest priority. When a user extended or automatically extended time slot causes a conflict, then the extended time slots are prioritized separately from the actual show and the algorithms attempt to resolve conflicts by removing user extended or automatically extended time slots.


In one embodiment, where there are several solutions to a conflict, the system automatically finds the shows that, when removed from the transfer schedule, will result in the most shows of the highest priority to be transferred. Typically the system will present one or two of the most optimal shows to remove from the schedule to achieve a good solution. In another embodiment, an adjacent show list is implemented. The adjacent show list contains meta-data for the shows immediately before and after a scheduled show. The adjacent show list is used to disable user extended time for parental control reasons, so that an unauthorized user is not able to extend the transfer into the body of another show that they are not permitted to capture.





BRIEF DESCRIPTION OF THE DRAWINGS

The invention will be more fully understood by reference to the following drawings, which are for illustrative purposes only:



FIG. 1 is a functional block diagram of an embodiment of a set-top box.



FIG. 2 is a diagram of a configuration for one of the multiple tuners associated with the video recorder.



FIG. 3 shows a configuration for a single decoder.



FIG. 4 is a diagram of a typical tuner arrangement for use with a live TV signal.



FIG. 5 is a diagram of a typical tuner arrangement for use when a storage device.



FIG. 6 shows an arrangement for when a user is watching a show mat has already been transferred to a storage device.



FIG. 7 shows an arrangement for when a user is watching a show on the storage device while another show is being transferred to the storage device.



FIG. 8 is a block diagram showing the components of a scheduled show and its corresponding timeslots according to one embodiment of the invention.



FIG. 9 is a flowchart showing how one embodiment of the present invention manually resolves conflicts.



FIG. 10 is a flowchart showing how one embodiment of the present invention automatically resolves conflicts.



FIG. 11 is a block diagram showing a process whereby an embodiment of the present invention searches future guide data to transfer, in order to solve a conflict.



FIG. 12 is another flowchart showing how an embodiment of the present invention automatically resolves conflicts.



FIG. 13 is a block diagram showing how a conflict might arise that requires a manual resolution simplification process.



FIG. 14 is a flowchart showing a how an embodiment of the present invention produces the results of a manual resolution simplification process.



FIG. 15 is a flowchart showing the management of a conflict according to one embodiment of the invention.



FIG. 16 is a flowchart showing the management of a conflict according to one embodiment of the invention.



FIG. 17 is a block diagram showing the implementation of an adjacent show list according to one embodiment of the invention.



FIG. 18 is a flowchart showing how one embodiment of the invention handles an adjacent show list.



FIG. 19 is a functional block diagram of a video recorder according to an embodiment of the present invention.



FIG. 20 is an example of a program guide screen used by an embodiment of the present invention.



FIG. 21 is a flowchart showing the operation of a dialog box for a user extended trail timeslot according to an embodiment of the present invention.



FIG. 22 is a flowchart showing the operation of a dialog box for a user extended trail timeslot according to another embodiment of the present invention.





DETAILED DESCRIPTION OF THE INVENTION

The present invention is directed to a video recorder having user extended and automatically extended time slots. A video recorder as used herein refers to a device capable of transferring one or more broadcast signals to a storage device and retrieving the broadcast signals from the storage device. The terms video recorder, personal video recorder (PVR), and digital video recorder (DVR) are used herein interchangeably. Referring more specifically to the drawings, for illustrative purposes an embodiment of a video recorder is shown in the functional block diagram of FIG. 1.


Video Recorder


A video recorder 5 is an internal or external component of a set-top box 10. The video recorder 5 includes some or all of a combination of software, hardware, and firmware. In one embodiment, the video recorder 5 uses a storage device 6, such as a hard drive that is internal or external to the set-top box 10 where shows are saved. The set-top box 10 connects to an output device 20, which facilitates the use of broadcast signals, such as live television signals, video on demand broadcasts, downloads of Internet content, viewing of web pages, and viewing of content previously transferred to the storage device 6. In the example of FIG. 1, set-top box 10 is shown as being external to output device 20. It should be understood by someone having ordinary skill in the art, that set-top box 10 maybe internal to output device 20 as well.


A GUI 7 that includes an IPG 8 is provided, which is displayed on the output device 20. GUI 7 in conjunction with IPG 8 allows the user to control the video recorder 5, typically using a remote control 60. For instance, the user may search the IPG 8 and select shows which are then scheduled to be transferred to storage device 6. The software or firmware that controls set-top box 10 may be installed locally or it may be downloaded from the Internet as needed when configuring new set-top boxes or when updating existing ones.


Set-top box 10 is connected to output device 20 via a transmission line 30. Broadcast signals are received by the set-top box 10 via broadcast input source 40, which maybe connected to either an antenna, cable television outlet, or other suitable input source. One or more tuner systems 45 are configured to allow the system to utilize broadcast signals from multiple channels. The video recorder component 5 includes a hard disk drive 6 in conjunction with a volatile memory 46, such as a Random Access Memory (RAM). Typically, the broadcast input along line 40 is handled by the tuner 45. The signal is temporarily resident in memory 46 using a circular buffer or other cache before being transferred more or less permanently to storage device 6. The tuner system 45 works in conjunction with the storage device 6 so that for each tuner in the system, each can simultaneously transfer broadcast signals to the storage device 6, or display Channels up to the given number of tuners on output device 20.


Set-top box 10 receives power through a line 50. Set-top box 10 receives user input entered from a handheld remote control 60 over a wireless link 70. Wireless link 70 may be ah infrared (IR) link, a radio frequency (RF) link, or any other suitable type of link. A bi-directional data path 80 is provided to set-top box 10, through which set-top box 10 can access the Internet 90. Transmission line 40 may provide data from a variety of input sources including cable, satellite, or electro-magnetic waves.


Tuner Management


In one embodiment of the present invention, the PVR uses multiple tuners. Each of the tuners is normally associated with one encoder and one cache, which may be a fixed or variable size cache (for a live signal) or a fixed file in the case where the incoming signal is merely transferred to the storage device. FIG. 2 shows various configurations for one of the multiple tuners associated with the PVR. Video stream 200 is provided to tuner 210, which passes the signal to encoder 220, which transfers the data in a cache 230. This configuration is used for analog use of a live TV signal.


An alternate configuration includes a video stream 240, which is then provided to tuner 245, which is then passed to encoder 250 and then to fixed file block 260. This configuration is useful for the analog transfer of a signal. For digital channels, encoder blocks 220 and 250 are removed, since the signal has already been digitized.



FIG. 3 shows a configuration for a single decoder. Cache 300 provides data to decoder 310, which outputs video signal 320. This arrangement is useful for watching live TV. Alternatively, fixed file block 330 provides data to decoder 340, which outputs a video signal 350. This embodiment is useful for playing back a show that has already been transferred to the storage device.


Each decoder shown in FIG. 3 is associated with a tuner/encoder pair. For a live TV signal, FIG. 4 shows an example of a typical arrangement, where video signal 400 is transmitted to tuner 410 then to encoder 420 and to cache 430. After it leaves cache 430 it is decoded in block 440 and the outgoing video signal 450 is displayed on the television. It should be noted that a delay interval 460 of a given (x) number of seconds occurs between the time the signal reaches encoder 420 and is output by decoder 440. Therefore, a live TV signal is typically a signal that has been delayed by (x) seconds. If a user is watching a program arid is currently transferring the program to a storage device as well, a cache, as shown in block 430 of FIG. 4 is not used. Instead, a fixed buffer 500, shown in FIG. 5 is used.


If the user is watching a show that has already been transferred to the storage device, the decoder is decoupled from the encoder (i.e., it reads from a different cache than the encoder), which continues to encode and cache the live video signal. This embodiment is shown in FIG. 6, where video signal 600 is tuned at block 605 and encoded at block 610 and stored in buffer 620. Fixed buffer 630 is used to provide data to decoder 640, which provides the output signal 650.


Finally, if a user is watching a show that resides already on the storage device while another show is currently being transferred to the storage device, two different fixed buffers are implemented. This embodiment of the present invention is shown in FIG. 7. Video signal 700 is tuned at block 705 and encoded at block 710 and stored in a first fixed buffer 720. A second fixed buffer 730 is used to watch the previously saved show, by transmitting and decoding the data at block 740 and displaying the output video signal 750 on a television.


Show Scheduling


A user might schedule a show in a number of ways that could potentially give rise to a conflict. In one scenario the user is watching a television broadcast and presses a button on a remote control intended to initiate a transfer of the current show to the storage device. At the same time, another show is already being transferred to the storage device on another channel and the system cannot transfer both simultaneously. Alternatively, the user may have scheduled a number of shows to automatically be transferred to the storage device, for instance by accessing an IPG and selecting shows and/or by setting up the automatic transfer of certain series or specific programs (a series manager). If at some time that number of shows scheduled to be transferred exceeds the number of available tuners, a conflict arises.


Whenever a user schedules a show, the complete timeslot the system needs to have a tuner available to transfer the show is partitioned into its respective component timeslots. FIG. 8 gives an example of some of the components in a typical complete timeslot. Complete timeslot 800 has a start time 810 and an end time 820. Between start time 810 and end time 820 is the complete time slot. The timeslot 800 comprises automatically extended 830 and automatically extended trail time 840. Automatically extended times 830 and 840 are typically only for a few minutes and may be automatically added to every show scheduled by the user. User extended lead time 850 and user extended trail time 860 are timeslots the user has manually asked the system to append to the actual show that comprises the core time 870 also referred to as the body of the show. Each component of the partitioned timeslot 800 is given a different priority and each is handled as a separate entity when the system attempts to resolve a conflict.


Conflict Resolution


An embodiment of the present invention is configured to process conflicts. A conflict occurs when the number of shows (or component timeslots) scheduled to be transferred to the storage device exceed the number of available tuners. For the purposes of this example, it is assumed for simplicity that the system has two tuners, although the system may have any number of tuners. In one scenario the user is watching a television broadcast and presses a button on a remote control intended to initiate a transfer of the current show to the storage device. The pressing of the button generates an instruction to the video recorder which causes it to schedule the show. At the same time, another show is already being transferred to the storage device on another channel.


Alternatively, the user may have instructed the system to schedule a number of shows to automatically be transferred to the storage device, for instance by accessing an IPG and selecting shows and/or by setting up the automatic transfer of certain series or specific programs in the series manager. If at some time that number of shows scheduled to be transferred exceeds the number of available tuners, a conflict arises. Moreover, the user may have automatically extended timeslots enabled on their system. If so, the time slot either leading or trailing the show may extend into the body of another show. If this event causes the number of available tuners to be exceeded, then a conflict arises. Also, a user may have extended a show either at the lead or trail end and this manual extension may run into the body of another program and cause a similar conflict.


When conflicts arise, the user will typically be given notice and an opportunity to correct (solve) the conflict manually before it occurs. However, if the user does not or is not available to interact with the system, then the system automatically solve the conflict. FIG. 9 is a flowchart giving an example of how one embodiment of the present invention identifies and finds solutions to conflicts manually.


At block 900 a user schedules shows (including user extended and automatically extended timeslots) that they want to transfer to the storage device, collectively this is called timeslot x. At block 910 it is determined if the number of available tuners during timeslot x is less than what is needed to completely transfer timeslot x and any other shows that are scheduled during that timeslot. (i.e., there is a conflict). If there is no conflict, the system transfers timeslot x at block 915 to the storage device, and block 900 repeats.


If there is a conflict then at block 920, the system provides the user with a manual resolution screen. An example of a manual resolution screen includes various choices to manually resolve the conflict. These include, for instance, cancel show A, cancel show B, do not schedule timeslot x, or trim shows A and/or B. Trimming the show includes, for instance, removing user extended or automatically extended timeslots. At block 930, it is determined if the user has solved the conflict manually by trimming or canceling shows A and/or B. If so, then timeslot x is added to the schedule queue at block 940 and flow proceeds to block 915. Otherwise, the user does not wish to schedule timeslot x, so the process is complete.


In another embodiment of the present invention, the conflicts are resolved automatically. This embodiment is shown in FIG. 10, where at block 1000 shows are automatically scheduled to be transferred to a storage device (including user extended and automatically extended timeslots), collectively this is called timeslot z. Timeslot z may be scheduled for instance, by an automated process (series manager) configured to transfer every instance of a certain show, type of sporting event, genre, title, timeslot, etc. At block 1010 it is determined if the number of available tuners during timeslot z is less than what is needed to completely transfer timeslot z and any other shows that are scheduled during that timeslot. (i.e., there is a conflict). If there is no conflict, the system transfers timeslot z at block 1015 to the storage device, and block 1000 repeats.


If there is a conflict then at block 1020, the system examines the priorities of the conflicting timeslots (including timeslot z). At block 1030, it is determined if timeslot z is the lowest priority timeslot. If so, then timeslot z is not scheduled and the process is complete. Otherwise, timeslot z is added to the schedule queue at block 1040 and block 1015 repeats.


In another embodiment of the present invention, shows that are not transferred because of a conflict remain in a separate list or queue waiting to be transferred later if an opportunity occurs. For instance, the missed transfer may be broadcast again the next day. The system will attempt to initiate the transfer automatically the next day when the show occurs if it is possible. FIG. 11 shows how this process works according to one embodiment of the present invention.


Guide data 1110, which contains the information needed to determine what shows are broadcast at certain times, is transferred to the set-top in portions over time. For instance, one day of guide data may be downloaded at a time as first portion 1140. A loop 1120 walks through the guide data by comparing each component of the guide data to show A 1100, which has been entered in a queue 1160. It is assumed for the purposes of FIG. 11, that show B 1130 has previously scheduled arid that show B has a higher priority than show A 1100. In this example, show A 1100 is not transferred and show B 1130 is transferred when loop 1120 reaches first guide data component 1105 of guide data 1110.


As a second portion 1170 of guide data 1110 is downloaded, for instance the next day, the system continues walking through the guide data 1110 using loop 1120. Eventually, the system matches show A 1100 in queue 1160 with a repeated airing of show A 1150 when the loop 1120 reaches a second component of the guide data 1155. At this point the system is able to transfer repeated show A 1150 and the conflict is solved, since original show A 1100 is transferred and show B 1130 was also transferred. From a user perspective this is satisfactory, since they have stored both broadcasts and if the user did not immediately try to watch original show A, the whole process occurred transparently to the user.


In one embodiment, queue 1160 described in connection with FIG. 11 comprises multiple queues that are used together to resolve conflict. Table 1 shows some of the queues used to resolve conflicts:










TABLE 1





Name of Queue
Purpose







Saved
Saved shows are placed in the saved shows queue


Show Queue
along with shows that are actively being



transferred to the storage device


Schedule
Shows that are scheduled to be transferred to


Queue
the storage device in the future are placed in



this queue


Series
Each entry in this queue comprises a template


Manager Queue
having data about each series that is



automatically transferred to the storage device.



This includes, for instance, the series' title,



genre, time, etc. The data is used, for instance



to find matches in guide data entries when a



loop walks the guide data.


Manually
This queue contains shows the user has manually


Deleted Queue
deleted from a series manager or schedule queue.


Adjacent
Contains entries about shows adjacent (before


Shows Queue
and after) shows in the schedule queue. It is



used to prevent the system from transferring a



portion of a show (user or automatically



extended timeslot) that might have adult



content.










FIG. 12 is a flowchart showing how the queues described with respect to Table 1 are used when carrying put a process, such as the process described in FIG. 10. At block 1200 a component of the guide data representing a show is examined. At block 1210, it is determined if the component of the block of guide data matches a pattern of a show in the series manager queue (i.e., the user intends to record this show every time it occurs). If not, block 1200 repeats on the next available component of the guide data. If so, then at block 1220, it is determined if that component of the guide data already resides in the saved show queue If it does, then the show is not transferred, since it already has been saved, and block 1200 repeats. Otherwise, it is determined if the guide data component is already in the schedule queue at block 1230. If so, then it is not acted upon and block 1200 repeats. Otherwise, it is determined if the show is in the manually deleted queue at block 1240. If so, it is not acted upon since the user has decided manually not to transfer the show anymore, so block 1200 repeats. Otherwise, it is determined if there is a conflict at block 1250. If not, the show is transferred to the storage device at block 1260. Otherwise, the conflict is resolved at block 1270.


Manual Resolution Simplification Process


When a PVR, DVR, or other video recording system has many tuners, there may be an exponentially large number of potential solutions that will solve a conflict. To simplify the interface that is presented to the user to manually resolve the conflict, the present invention typically selects one or two choices to present to the user that are most satisfactory. FIG. 13 is a diagram showing how multiple solutions may occur.


Assume the user has scheduled a long show 1300 for transfer to the storage device. The long show may, for instance be a sporting event or a movie. Within complete timeslot reserved for long show 1300, short programs A 1320, B 1321, C 1322, D 1323, E 1324, and F 1325 are also scheduled. Assuming the system under consideration has two tuners, three conflicts have arisen. There are multiple solutions to this conflict. A first solution is to choose A 1320, C 1322, E 1324, and long show 1300. A second solution is to choose B 1321, C 1322, E 1324, and long show 1300. There are a total of eight solutions to the present conflict. Instead of presenting the user with all eight solutions, the system, according to one embodiment, presents the user with only one or two optimal choices that will resolve the conflict.



FIG. 14 is a flowchart describing the process of how an embodiment of the present invention finds and presents a user with a small amount of optimal choices to solve a conflict. The process begins at block 1400 where all conflicting programs/timeslots are obtained. At block 1410, all of the solutions are obtained and added to a list. At block 1420, each timeslot in the solution has its priority examined. At block 1430, a cumulative priority is given to the entry in the list based on the priorities of all of its timeslots involved in the solution. At block 1440, it is determined if there are any more entries for solutions in the list. If so, block 1420 repeats and the next solution entry in the list is prioritized. After the entire list is examined, the system presents the user at block 1450 with one or two of the lowest priority solutions, so that the user may delete one of those solutions to solve the conflict.


Show Priority


If there are instructions that cause a conflict for system resources, which prevent all the desired content from being transferred to the storage device, a prioritization system is used to determine which content is more desirable. This system is also used to determine undesirable content when deciding which shows to suggest to the user to delete in order to avoid conflicts as shown in FIG. 14. Each time slot to be saved, based user instructions, is handled as a type. A first type may be, for instance, automatically extended time, while a second type may be a show's body (or core time). Table 2 shows some examples of the various typing of timeslots and the resulting priority, according to an embodiment of the present invention:











TABLE 2





Type 1
Type 2
Priority







Currently being
Other content
Content 1 is given a


transferred to

higher priority.


the storage device


Scheduled manually by
An episode
Content 1 is given a


the user to be
automatically
higher priority


transferred to the
transferred to the


storage device
storage device by



a series manager


Content automatically
Content
The content with the


transferred to the
automatically
highest series priority


storage device by a
transferred to the
is chosen. The


series manager
storage device by a
series priority may be



series manager
set manually. One




embodiment determines




this by a position




in a series queue.




Shows closer to the top




are more desirable


Equal priority as
Equal priority as
The longer content is


content 2
content 1
given priority.


Automatically extended
Not
The content that is not


time
automatically
automatically extended



extended time
time is given a higher




priority


User extended lead time
Other content
The body of content 2


that extends into the

is preserved and the


body of content 2

user extended lead time




is not recorded


User extended trail
Other content
The body of content 2


time that is less than

is preserved and the


a fixed interval and

user extended trail


extends into the body

time is not recorded.


of content 2

The fixed interval




may be, for instance,




5 minutes.


User extended trail
Other content
The extended trail time


time that is greater

is recorded and the


than a fixed interval

body of content 2 is


and extends into the

truncated.


body of content 2


User extended trail
User extended
User extended trail


time
lead time
time is given a higher




priority.









When the system finds one or more conflicts and priority is needed to solve the conflict, the flowchart of FIG. 15 shows how one embodiment of the present invention resolves the conflict. The algorithm takes as input at block 1500 timeslots A and B, which are in conflict. Timeslots A and B are, for instance, the body of a show, user extended lead or trail time or automatically extended lead or trail time. At block 1510, it is determined if timeslot A is automatically extended time. If timeslot A is automatically, extended time, then it is determined at block 1520 if timeslot B is automatically extended time. If timeslot B is not automatically extended time, then timeslot B is given higher priority and the conflict is solved at block 1530.


If, however, at block 1510, timeslot A is not automatically extended time. Then it is determined at block 1540 if timeslot B is automatically extended time. If it is, then timeslot A is given a higher priority and the conflict is solved at block 1550. If, however, at block 1540, B is not automatically extended time or at block 1520, B is automatically extended time (meaning either both timeslots A and B are both automatically extended time or both are not automatically extended time) then at block 1560, it is determined if timeslot A is of a higher priority. If so then flow proceeds to block 1550. Otherwise, flow proceeds to block 1530.


If a conflict cannot be solved by using automatically extended time alone, then additional decision making algorithms are employed. These steps are invoked, for instance, when block 1560 of FIG. 15 is reached. FIG. 16 describes the steps that an embodiment of the present invention takes when it reaches a situation such as block 1560 of FIG. 15 when a conflict cannot be solved simply by not transferring the automatically extended time to the storage device. FIG. 16 assumes that timeslot A comprises user extended time.


At block 1600 the algorithm takes as input a user extended timeslot in timeslot A and other content, such as the body of a show or user extended time in timeslot B. At block 1610, it is determined if timeslot A is user extended lead time. If so, then at block 1615, it is determined if timeslot B is the body of a show. If so, then timeslot B is given priority at block 1620, and the user extended lead time is not transferred to the storage device.


If, however, at block 1610, timeslot A is user extended trail time, it is determined at block 1630, if the user extended trail time is less than a fixed interval, five minutes, for instance. If so, then it is determined at block 1615 if timeslot B is the body of a show. If so, then flow proceeds to block 1620 and timeslot B is transferred to the storage device if it is the body of a show. Otherwise, the trail time exceeds the fixed interval, so at block 1640, timeslot A is given priority and transferred to the storage device, while timeslot B is truncated. Returning to block 1615, if timeslot B is not the body of a show, then the timeslot with the highest priority is chosen at block 1650.


Adjacent Shows


In one embodiment of the present invention, a list is maintained of shows that are adjacent to a show that has been scheduled to be transferred to the storage device. This is useful, for instance, for parental control reasons. It is used to prevent an unauthorized user, such as a child, from misusing user extended lead time and user extended trail time to extend a transfer into the body of another show mat might have objectionable content. The adjacent show list contains meta-data for each show that is adjacent to a scheduled show.



FIG. 17 is a block diagram showing the lists that are used by an embodiment of the present invention. Program guide 1700 contains all of the shows the user can currently schedule. Show A 1710 has been selected by the user. Show A 1710 is placed in schedule list 1720. Shows X 1730 and Y 1740 are adjacent to show A 1710. Adjacent shows X 1730 and Y 1740 are placed in adjacent show list 1750. One or more meta-data columns 1760 are associated with each entry. Currently a meta-data entry 1770 is activated in association with show Y 1740. This is one way in which a system is able to identify show Y 1740 as being one that needs parental control. For instance meta-data column entry 1770 might indicate that show Y 1740 is rated “R”. Similarly, it might indicate that show Y 1740 is rated “X” or show Y 1740 has violent Content, graphic language, nudity, other objectionable rating information such as being on a specific channel, a content advisory, etc. Since show Y 1740 has a meta-data entry 1770 indicating that show Y 1740 violates a system content control, a user who has scheduled show A 1710 will hot be able to enable user extended trail time to extend into the body of show Y 1740, without the proper authentication, PIN, key, or the like.



FIG. 18 is a flowchart showing the process of using an adjacent show list according to one embodiment of the present invention. At block 1800, a user schedules a show to be transferred to the storage device. At block 1810, the system begins transferring the show to the storage device. At block 1820, the shows adjacent to the show currently being transferred are placed in an adjacent show list. At block 1830, the meta-data for the shows in the adjacent show list is checked. At block 1840, it is determined if the meta-data indicates that either show in the adjacent show list contains content that might be restricted through parental controls. If so, the system blocks the show in the adjacent show list at block 1860. Otherwise, the system un-blocks the show at block 1850.


After blocks 1850 or 1860, it is determined if the current time is within the current-metadata record at block 1870. This is accomplished, for instance, by using a playback head that moves sequentially in time as the current show is transferred. As the playback head reaches the end of the current show and moves to the next show in time, the system will discover that the meta-data in the adjacent show list is no longer current. At that point the system updates the adjacent show list and block 1870 becomes false. When block 1870 becomes false, block 1820 repeats. Otherwise the system loops until block 1870 becomes false.


Overall System



FIG. 19 is a functional block diagram that illustrates the components of an embodiment of the present invention. Note that FIG. 19 is intended to be a conceptual diagram and does, not necessarily reflect the exact physical construction and interconnections of these components. Set-top box 10 includes processing and control circuitry 1900, which controls the overall operation of the system. Coupled to the processing and control circuitry 1900 are one or more TV tuners 1910, a storage device 1920, a communication device 1930, and a remote interface 1940.


Tuners 1910 receive broadcast signals on transmission line 1960, which may originate from an antenna, a cable television outlet, a satellite connection, or another suitable broadcast input source. Processing and control circuitry 1900 provides audio and video output to device 170 via a line 1970. Remote interface 1940 receives signals from remote control 60 via wireless connection 70. Communication device 1930 is used to transfer data between set-top box 10 and one or more remote processing systems, such as a web server 1980, via a data path 1990.


Processing and control circuitry 1900 may include one or more of devices such as general-purpose microprocessors, digital signal processors, application specific integrated circuits, various types of signal conditioning circuitry, including analog-to-digital converters, digital-to-analog converters, input/output buffers, etc. Storage device 1920 may include one or more physical memory devices, which may include volatile storage devices, non-volatile storage devices, or both. For example, storage device 1920 may include both random access memory (RAM), read-only memory (ROM), hard disk drives, various forms of programmable and/or erasable ROM, flash memory, or any combination of these devices.


Communication device 1930 may be a conventional telephone modem, an Integrated Services Digital Network adapter, a Digital Subscriber Line adapter, a cable television modem, or any other suitable data communication device. Logic 1995 typically is resident in storage device 1920. Logic 1995 controls the overall functionality of the system, including the GUI, IPG, and may also be used when the video recorder has been given conflicting instructions to transfer more shows to storage device 1920 then there are tuners 1910 available. For instance, an instruction might be generated from remote control 70 handled by the user. The instruction would be sent across line 70, through remote interface 1940, and to processing and control circuitry 1900 via logic 1995. Logic 1995 interprets arid determines the action needed to be taken based on the instruction and might eventually store information in storage device 1920 that would allow the system to act on the instruction at the appropriate time.


One or more of the algorithms and processes described herein to manually and/or automatically resolve conflicts are stored in logic portion 1995. These algorithms and other codes in logic portion 1995 are used, for instance, to recognize the existence of conflicts and to prioritize the conflicting programs to find solutions to the conflicts by using automatically extended time, user extended time, and core time, as well as other factors in assessing the priorities of conflicting timeslots.


User Extended Timeslot


A user extended timeslot is a timeslot that occurs before or after the core timeslot that covers the time period in which a show is being broadcast. If the user extended time slot is before the show it is called lead time and if it is after the show it is called trail time. When a user selects a show, either to record the show now or to schedule the show to be recorded later, the system determines whether the show is of a specific type. If the show is of a specific type, an additional dialog box is shown, wherein the additional dialog box allows the user to invoke a user extended trail time slot.


Specific types of shows include sports shows, for instance, or any other show where it is more common for the body of the show to extend beyond the scheduled timeslot in the program guide data. In such cases, it allows the user to include a user extended trail time slot without having to navigate the system and invoke the user extended trail time slot manually. In other cases, it allows a user that has no familiarity with the system to carry out their intent in a simplified way.


The specific type of show may be identified by the system in any number of ways. A first way is to examine the title field or description field in a database that relates to each show and to match keywords that are indicative of a sports show (or other type of show) in the title or description fields. A second way is to add a show type field to a database representing the program guide data and to invoke the user extended trail timeslot dialog box when elements in the show type field match the specific type that is of interest.


The dialog box includes an input field which, when selected, allows the user to always invoice a user extended trail timeslot for this type of show, so that the dialog box does not subsequently appear on the screen and the user extended trail timeslot is invoked automatically in the future. The user may also set the length of the user extended trail timeslot, (i.e., 30 minutes) to save disk space. Alternatively, a default time period may be used.



FIG. 20 is an example of a program guide screen used by an embodiment of the present invention. Program guide 2000 includes a channel column 2010 and a plurality of time columns 2026. Each channel has a row that extends horizontally in time and includes information about the show that occurs on the channel during any given time period. This includes, for instance, the show's title, actors, description, type, time, rating, and any other pertinent information. In the present example, only show type is shown for simplicity. A first show 2030 is of type sports and a second show 2040 is of type news. When selected by the user, the first show 2030 may be of a type that invokes an automatic dialog box or automatically invokes a user extended trail timeslot, if such an action has been set as a default by the user. Second show 2040 may not invoke the dialog box. The user alternatively may set the dialog box to be invoked on certain types of shows or the system can do it automatically with pre-set defaults. For the purposes of this example, show 2030 has a trailing edge 2050 that might extend beyond 9:30, for instance if the sports show goes into overtime or is longer than expected. Such a show 2030 is identified by the system and the additional dialog box is presented to the user.



FIG. 21 is a flowchart showing an embodiment of the present invention that uses a dialog box. At block 2100, the user schedules a show. This includes, for instance, the scheduling of a show to be recorded in the future, or the scheduling of a show to be recorded now. At block 2110, the system determines if the show is of a specific type. For instance, the show may be a sports show, as described in connection with FIG. 20, or it may be another type of show that is of particular interest to the user. If the show is not of the specific type, then at block 2120, the system performs the requested action (i.e., scheduling the show).


If the show is of a specific type at block 2110, then at block 2130 a dialog box is invoked that allows the user to add a user extended trail timeslot after the show is scheduled to end. At block 2140, it is determined if the user wants to add the timeslot. If not, the system performs the requested action at block 2120. Otherwise, the body of the show is scheduled along with the user extended trailing timeslot.



FIG. 22 is a flowchart showing another embodiment of the present invention that uses a dialog box. At block 2200, it is determined whether the user has scheduled a show. This includes, for instance, the scheduling of a show to be recorded in the future, or the scheduling of a show to be recorded now. If the user has hot scheduled a show the system waits at block 2205 and repeats until the user does schedule a show. When the user does schedule a show, the system determines if the show is of a specific type at block 2210. For instance, the show may be a sports show, as described in connection with FIG. 20, or it may be another type of show that is of particular interest to the user. If the show is not of the specific type, then at block 2220, the system performs the requested action (i.e., scheduling the show).


If the show is of a specific type at block 2210, then at block 2230 it is determined whether the user has previously requested that all shows of this type have a user extended trailing timeslot automatically added. If so, then at block 2240 the show is scheduled along with a user extended trailing timeslot of the length that the user has designated. If not, a dialog box is invoked that allows the user to add a user extended trail timeslot after the show is scheduled to end at block 2250. At block 2260, it is determined if the user wants to add the timeslot. if not, the system performs the requested action at block 2220.


Otherwise, it is determined if the user wants all shows of this type to be extended automatically in the future at block 2270. If so, the action is set as the default at block 2280 so that in the future when the system reaches decision block 2230, it will be true, thereby eliminating the need to invoke the dialog box. In either case, after blocks 2270 or 2280, the system proceeds to block 2240 where the show is scheduled along with a user extended trailing timeslot of the length that the user has designated, and the process repeats at block 2200.


Although the description above contains many specificities, these should not be construed as limiting the scope of the invention but as merely providing illustrations of some of the presently preferred embodiments of this invention. Thus the scope of this invention should be determined by the appended claims and their legal equivalents.

Claims
  • 1. A method for storing media on a storage device, the method comprising: scheduling, with control circuitry, a media asset to be stored in the storage device during a scheduled transmission time associated with the media asset, wherein the media asset has a given duration; andprior to any portion of the media asset being received: determining whether the media asset, scheduled to be stored, is of a genre that commonly extends beyond its scheduled transmission time, causing the given duration of the media asset to increase, based on a comparison of a word associated with the media asset with one or more data fields stored in a database, wherein the one or more data fields stored in the database correspond to media content of the genre that commonly extends beyond its scheduled transmission time; andalerting a user of the control circuitry of an opportunity to extend storage of the media asset beyond the associated scheduled transmission time based on the determination that the media asset is of the genre that commonly extends beyond its scheduled transmission time.
  • 2. The method of claim 1, further comprising alerting a user of potential conflicts due to extending storage of the media asset beyond the associated scheduled transmission time.
  • 3. The method of claim 1, further comprising receiving a user indication to extend storage of the media asset beyond the associated scheduled transmission time.
  • 4. The method of claim 3, wherein said step of receiving a user indication further comprises, automatically extending storage of the media asset by a predetermined amount.
  • 5. The method of claim 4, wherein the predetermined amount is a timeslot interval.
  • 6. The method of claim 4, wherein the predetermined amount is based on the genre of the media asset.
  • 7. The method of claim 4, wherein automatically extending storage of the media asset by a predetermined amount includes prioritizing potential conflicts.
  • 8. The method of claim 4, wherein automatically extending storage of the media asset by a predetermined amount includes automatically extending storage of all media content of that genre.
  • 9. The method of claim 1, wherein the word associated with the media asset is a word in at least one of a title and a description associated with the media asset.
  • 10. The method of claim 1, wherein the word associated with the media asset is identified from a description of the media asset, and wherein the determining comprises: comparing the word with one or more keywords stored in the one or more data fields; anddetermining the media asset is of a genre that commonly extends beyond its scheduled transmission time in response to determining that the word matches a keyword associated with the genre.
  • 11. A system for storing media, the system comprising: a storage device configured to receive a media asset; andcontrol circuitry configured to: schedule a media asset to be stored in the storage device during a scheduled transmission time associated with the media asset, wherein the media asset has a given duration; andprior to any portion of the media asset being received: determine whether the media asset, scheduled to be stored, is of a genre that commonly extends beyond its scheduled transmission time, causing the given duration of the media asset to increase, based on a comparison of a word associated with the media asset with one or more data fields stored in a database, wherein the one or more data fields stored in the database correspond to media content of the genre that commonly extends beyond its scheduled transmission time; andalert a user of the control circuitry of an opportunity to extend storage of the media asset beyond the associated scheduled transmission time based on the determination that the media asset is of the genre that commonly extends beyond its scheduled transmission time.
  • 12. The system of claim 11, wherein the control circuitry is further configured to alert a user of potential conflicts due to extending storage of the media asset beyond the associated scheduled transmission time.
  • 13. The system of claim 11, wherein the control circuitry is further configured to receive a user indication to extend storage of the media asset beyond the associated scheduled transmission time.
  • 14. The system of claim 13, wherein the control circuitry automatically extends storage of the media asset by a predetermined amount after receiving the user indication to extend storage of the media asset beyond the associated scheduled transmission time.
  • 15. The system of claim 14, wherein the predetermined amount is a timeslot interval.
  • 16. The system of claim 14, wherein the predetermined amount is based on the genre of the media asset.
  • 17. The system of claim 14, wherein the control circuitry automatically extends storage of the media asset by a predetermined amount by prioritizing potential conflicts.
  • 18. The system of claim 14, wherein the control circuitry automatically extends storage of the media asset by a predetermined amount by automatically extending storage of all media content of that genre.
  • 19. The system of claim 11, wherein the word associated with the media asset is a word in at least one of a title and a description associated with the media asset.
  • 20. The system of claim 11, wherein the word associated with the media asset is identified from a description of the media asset, and wherein the control circuitry is configured to determine whether the media asset is of the genre by being configured to: compare the word with one or more keywords stored in the one or more data fields; anddetermine the media asset is of a genre that commonly extends beyond its scheduled transmission time in response to determining that the word matches a keyword associated with the genre.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of application Ser. No. 12/626,267, filed Nov. 25, 2009, (allowed) which is a continuation of Ser. No. 10/936,417, filed Sep. 8, 2004, (abandoned), which is a continuation-in-part of application Ser. No. 10/707,834, filed Jan. 15, 2004, now U.S. Pat. No. 7,853,120, which is a continuation of Ser. No. 10/249,575, filed Apr. 21, 2003, now U.S. Pat. No. 6,760,638, issued Jul. 6, 2004. These prior applications are hereby incorporated by reference herein in their entirety.

US Referenced Citations (425)
Number Name Date Kind
3594778 Herald et al. Jul 1971 A
3848193 Martin et al. Nov 1974 A
3893049 Bray Jul 1975 A
4162513 Beyers et al. Jul 1979 A
4224644 Lewis et al. Sep 1980 A
4264924 Freeman Apr 1981 A
4264925 Freeman et al. Apr 1981 A
4288809 Yabe Sep 1981 A
4325081 Abe et al. Apr 1982 A
4338644 Staar Jul 1982 A
4339798 Hedges et al. Jul 1982 A
4355415 George et al. Oct 1982 A
4422105 Rodesch et al. Dec 1983 A
4425579 Merrell Jan 1984 A
4429385 Cichelli et al. Jan 1984 A
4437498 Pankratz et al. Mar 1984 A
4488179 Krüger et al. Dec 1984 A
4495654 Deiss Jan 1985 A
4496171 Cherry Jan 1985 A
4573072 Freeman Feb 1986 A
4602279 Freeman Jul 1986 A
4620229 Amano et al. Oct 1986 A
4641205 Beyers, Jr. Feb 1987 A
4691351 Hayashi et al. Sep 1987 A
4694490 Harvey et al. Sep 1987 A
4701794 Froling et al. Oct 1987 A
4704725 Harvey et al. Nov 1987 A
4706121 Young Nov 1987 A
4718107 Hayes Jan 1988 A
4739406 Morton et al. Apr 1988 A
4745549 Hashimoto May 1988 A
4751578 Reiter et al. Jun 1988 A
4787063 Muguet Nov 1988 A
4789962 Berry et al. Dec 1988 A
4807052 Amano Feb 1989 A
4812940 Takenaga Mar 1989 A
4847696 Matsumoto et al. Jul 1989 A
4847698 Freeman Jul 1989 A
4847700 Freeman Jul 1989 A
4855833 Kageyama et al. Aug 1989 A
4857999 Welsh Aug 1989 A
4873584 Hashimoto Oct 1989 A
4879611 Fukiu et al. Nov 1989 A
4885775 Lucas Dec 1989 A
4894789 Yee Jan 1990 A
4908707 Kinghorn Mar 1990 A
4908713 Levine Mar 1990 A
4930158 Vogel May 1990 A
4945563 Horton et al. Jul 1990 A
4959720 Duffield et al. Sep 1990 A
4963994 Levine Oct 1990 A
4965825 Harvey et al. Oct 1990 A
4977455 Young Dec 1990 A
4989104 Schulein et al. Jan 1991 A
5027400 Baji et al. Jun 1991 A
5038211 Hallenbeck Aug 1991 A
5047867 Strubbe et al. Sep 1991 A
5068733 Bennett Nov 1991 A
5109279 Ando Apr 1992 A
5109414 Harvey et al. Apr 1992 A
5134719 Mankovitz Jul 1992 A
5151789 Young Sep 1992 A
5155591 Wachob Oct 1992 A
5172111 Olivo Dec 1992 A
5172413 Bradley et al. Dec 1992 A
5187589 Kono et al. Feb 1993 A
5195134 Inoue Mar 1993 A
5200822 Bronfin et al. Apr 1993 A
5210611 Yee et al. May 1993 A
5223924 Strubbe Jun 1993 A
5231493 Apitz Jul 1993 A
RE34340 Freeman Aug 1993 E
5233654 Harvey et al. Aug 1993 A
5241428 Goldwasser et al. Aug 1993 A
5249043 Grandmougin Sep 1993 A
5253066 Vogel Oct 1993 A
5285284 Takashima et al. Feb 1994 A
5293357 Hallenbeck Mar 1994 A
5296931 Na Mar 1994 A
5299006 Kim Mar 1994 A
5323234 Kawasaki Jun 1994 A
5335277 Harvey et al. Aug 1994 A
5339434 Rusis Aug 1994 A
5341350 Frank et al. Aug 1994 A
5353121 Young et al. Oct 1994 A
5357276 Banker et al. Oct 1994 A
5371551 Logan et al. Dec 1994 A
5404567 DePietro et al. Apr 1995 A
5410344 Graves et al. Apr 1995 A
5412720 Hoarty May 1995 A
5416508 Sakuma et al. May 1995 A
5426699 Wunderlich et al. Jun 1995 A
5442389 Blahut et al. Aug 1995 A
5459522 Pint Oct 1995 A
5461415 Wolf et al. Oct 1995 A
5465385 Ohga et al. Nov 1995 A
5479266 Young et al. Dec 1995 A
5479268 Young et al. Dec 1995 A
5483278 Strubbe et al. Jan 1996 A
5485197 Hoarty Jan 1996 A
5485219 Woo Jan 1996 A
5502504 Marshall et al. Mar 1996 A
5508815 Levine Apr 1996 A
5517257 Dunn et al. May 1996 A
5523794 Mankovitz et al. Jun 1996 A
5523796 Marshall et al. Jun 1996 A
5524195 Clanton, III et al. Jun 1996 A
5524271 Hollmann et al. Jun 1996 A
5528304 Cherrick et al. Jun 1996 A
5532754 Young et al. Jul 1996 A
5534911 Levitan Jul 1996 A
5537141 Harper et al. Jul 1996 A
5539449 Blahut et al. Jul 1996 A
5539822 Lett Jul 1996 A
5539880 Lakhani Jul 1996 A
5541638 Story Jul 1996 A
5541738 Mankovitz Jul 1996 A
5548338 Ellis et al. Aug 1996 A
5550576 Klosterman Aug 1996 A
5550825 McMullan, Jr. et al. Aug 1996 A
5557338 Maze et al. Sep 1996 A
5559548 Davis et al. Sep 1996 A
5559549 Hendricks et al. Sep 1996 A
5568272 Levine Oct 1996 A
5574778 Ely et al. Nov 1996 A
5576755 Davis et al. Nov 1996 A
5583560 Florin et al. Dec 1996 A
5583561 Baker et al. Dec 1996 A
5583563 Wanderscheid et al. Dec 1996 A
5583653 Timmermans Dec 1996 A
5585838 Lawler et al. Dec 1996 A
5585858 Harper et al. Dec 1996 A
5589892 Knee et al. Dec 1996 A
5592551 Lett et al. Jan 1997 A
5594509 Florin Jan 1997 A
5594779 Goodman Jan 1997 A
5600364 Hendricks et al. Feb 1997 A
5602582 Wanderscheid et al. Feb 1997 A
5606642 Stautner et al. Feb 1997 A
5616876 Cluts Apr 1997 A
5619247 Russo Apr 1997 A
5619249 Billock et al. Apr 1997 A
5619274 Roop et al. Apr 1997 A
5623613 Rowe et al. Apr 1997 A
5625678 Blomfield-Brown Apr 1997 A
5629733 Youman et al. May 1997 A
5629867 Goldman May 1997 A
5630119 Aristides et al. May 1997 A
5631995 Weissensteiner et al. May 1997 A
5632007 Freeman May 1997 A
5635978 Alten Jun 1997 A
5635987 Park et al. Jun 1997 A
5648824 Dunn et al. Jul 1997 A
5652613 Lazarus et al. Jul 1997 A
5654748 Matthews, III Aug 1997 A
5654886 Zereski, Jr. et al. Aug 1997 A
5657072 Aristides et al. Aug 1997 A
5657414 Lett et al. Aug 1997 A
5659367 Yuen Aug 1997 A
5661526 Hamamoto et al. Aug 1997 A
5666645 Thomas et al. Sep 1997 A
5668917 Lewine Sep 1997 A
5675743 Mavity Oct 1997 A
5684525 Klosterman Nov 1997 A
5694163 Harrison Dec 1997 A
5694381 Sako Dec 1997 A
5696765 Safadi Dec 1997 A
5699107 Lawler et al. Dec 1997 A
5708961 Hylton et al. Jan 1998 A
5710601 Marshall et al. Jan 1998 A
5717452 Janin et al. Feb 1998 A
5721829 Dunn et al. Feb 1998 A
5724091 Freeman et al. Mar 1998 A
5727060 Young Mar 1998 A
5732216 Logon et al. Mar 1998 A
5734119 France et al. Mar 1998 A
5734719 Tsevdos et al. Mar 1998 A
5742443 Tsao et al. Apr 1998 A
5745710 Clanton, III et al. Apr 1998 A
5751282 Girard et al. May 1998 A
5752159 Faust et al. May 1998 A
5752160 Dunn May 1998 A
5754771 Epperson et al. May 1998 A
5758257 Herz et al. May 1998 A
5758258 Shoff et al. May 1998 A
5758259 Lawler May 1998 A
5760821 Ellis et al. Jun 1998 A
5768528 Stumm Jun 1998 A
5771435 Brown Jun 1998 A
5774170 Hite et al. Jun 1998 A
5778182 Cathey et al. Jul 1998 A
5778187 Monteiro et al. Jul 1998 A
5781226 Sheehan Jul 1998 A
5781227 Goode et al. Jul 1998 A
5790198 Roop et al. Aug 1998 A
5790202 Kummer et al. Aug 1998 A
5790423 Lau et al. Aug 1998 A
5793412 Asamizuya Aug 1998 A
5793971 Fujita et al. Aug 1998 A
5794217 Allen Aug 1998 A
5796952 Davis et al. Aug 1998 A
5801787 Schein et al. Sep 1998 A
5802284 Karlton et al. Sep 1998 A
5805154 Brown Sep 1998 A
5805763 Lawler et al. Sep 1998 A
5805804 Laursen et al. Sep 1998 A
5805806 McArthur Sep 1998 A
5808608 Young et al. Sep 1998 A
5808694 Usui et al. Sep 1998 A
5809204 Young et al. Sep 1998 A
5809246 Goldman Sep 1998 A
5812123 Rowe et al. Sep 1998 A
5812205 Milnes et al. Sep 1998 A
5812937 Takahisa et al. Sep 1998 A
5815146 Youden et al. Sep 1998 A
5818438 Howe et al. Oct 1998 A
5819019 Nelson Oct 1998 A
5819156 Belmont Oct 1998 A
5819160 Foladare et al. Oct 1998 A
5822530 Brown Oct 1998 A
5825968 Nishigaki et al. Oct 1998 A
5828945 Klosterman Oct 1998 A
RE35954 Levine Nov 1998 E
5838314 Neel et al. Nov 1998 A
5841979 Schulhof et al. Nov 1998 A
5844620 Coleman et al. Dec 1998 A
5850218 LaJoie et al. Dec 1998 A
5859641 Cave Jan 1999 A
5861906 Dunn et al. Jan 1999 A
5867483 Ennis et al. Feb 1999 A
5880768 Lemmons et al. Mar 1999 A
5881245 Thompson Mar 1999 A
5884028 Kindell et al. Mar 1999 A
5886707 Berg Mar 1999 A
5886732 Humpleman Mar 1999 A
5887243 Harvey et al. Mar 1999 A
5892915 Duso et al. Apr 1999 A
5894589 Reber et al. Apr 1999 A
5896414 Meyer et al. Apr 1999 A
5898441 Flurry Apr 1999 A
5898456 Wahl Apr 1999 A
5899582 DuLac May 1999 A
5900904 Okada et al. May 1999 A
5903234 Kimura May 1999 A
5903263 Emura May 1999 A
5903264 Moeller et al. May 1999 A
5905522 Lawler May 1999 A
5905847 Kobayashi et al. May 1999 A
5909638 Allen Jun 1999 A
5911046 Amano Jun 1999 A
5913039 Nakamura et al. Jun 1999 A
5914941 Janky Jun 1999 A
5915090 Joseph et al. Jun 1999 A
5915094 Kouloheris et al. Jun 1999 A
5916303 Scott Jun 1999 A
5917538 Asamizuya Jun 1999 A
5917835 Barrett et al. Jun 1999 A
5920702 Bleidt et al. Jul 1999 A
5920800 Schäfer Jul 1999 A
5922045 Hanson Jul 1999 A
5922048 Emura Jul 1999 A
5923361 Sutton, Jr. Jul 1999 A
5926204 Mayer Jul 1999 A
5926205 Krause et al. Jul 1999 A
5926624 Katz et al. Jul 1999 A
5928327 Wang et al. Jul 1999 A
5929850 Broadwin et al. Jul 1999 A
5930473 Teng et al. Jul 1999 A
5930493 Ottesen et al. Jul 1999 A
5931901 Wolfe et al. Aug 1999 A
5933603 Vahalia et al. Aug 1999 A
5933835 Adams et al. Aug 1999 A
5935206 Dixon et al. Aug 1999 A
5936569 Ståhle et al. Aug 1999 A
5940071 Treffers et al. Aug 1999 A
5940073 Klosterman et al. Aug 1999 A
5940572 Balaban et al. Aug 1999 A
5943046 Cave et al. Aug 1999 A
5943047 Suzuki Aug 1999 A
5945987 Dunn Aug 1999 A
5947746 Tsai Sep 1999 A
5949411 Doerr et al. Sep 1999 A
5949954 Young et al. Sep 1999 A
5956482 Agraharam et al. Sep 1999 A
5959592 Petruzzelli Sep 1999 A
5959659 Dokic Sep 1999 A
5963202 Polish Oct 1999 A
5963264 Jackson Oct 1999 A
5964455 Catanzarite et al. Oct 1999 A
5969714 Butcher Oct 1999 A
5969748 Casement et al. Oct 1999 A
5973680 Ueda Oct 1999 A
5973722 Wakai et al. Oct 1999 A
5974217 Haraguchi Oct 1999 A
5974222 Yuen et al. Oct 1999 A
5977963 Gaughan et al. Nov 1999 A
5977964 Williams et al. Nov 1999 A
5978567 Rebane et al. Nov 1999 A
5978843 Wu et al. Nov 1999 A
5986650 Ellis et al. Nov 1999 A
5987213 Mankovitz et al. Nov 1999 A
5990881 Inoue et al. Nov 1999 A
5995155 Schindler et al. Nov 1999 A
5999970 Krisbergh et al. Dec 1999 A
6002394 Schein et al. Dec 1999 A
6002720 Yurt et al. Dec 1999 A
6005564 Ahmad et al. Dec 1999 A
6005600 Hill Dec 1999 A
6009465 Decker et al. Dec 1999 A
6012089 Hasegawa Jan 2000 A
6012091 Boyce Jan 2000 A
6014184 Knee et al. Jan 2000 A
6014381 Troxel et al. Jan 2000 A
6014693 Ito et al. Jan 2000 A
6014694 Aharoni et al. Jan 2000 A
6014706 Cannon et al. Jan 2000 A
6018359 Kermode et al. Jan 2000 A
6018765 Durana et al. Jan 2000 A
6020912 De Lang Feb 2000 A
6022223 Taniguchi et al. Feb 2000 A
6023725 Ozawa et al. Feb 2000 A
6025868 Russo Feb 2000 A
6028600 Rosin et al. Feb 2000 A
6029064 Farris et al. Feb 2000 A
6038367 Abecassis Mar 2000 A
6038591 Wolfe et al. Mar 2000 A
6052145 Macrae et al. Apr 2000 A
6057890 Virden et al. May 2000 A
6058242 Kim May 2000 A
6081291 Ludwig, Jr. Jun 2000 A
6091883 Artigalas et al. Jul 2000 A
6091884 Yuen et al. Jul 2000 A
RE36801 Logan et al. Aug 2000 E
6133910 Stinebruner Oct 2000 A
6141488 Knudson et al. Oct 2000 A
6154771 Rangan et al. Nov 2000 A
6157377 Shah Nazaroff et al. Dec 2000 A
6157413 Hanafee et al. Dec 2000 A
6160546 Thompson et al. Dec 2000 A
6163316 Killian Dec 2000 A
6177931 Alexander et al. Jan 2001 B1
6185360 Inoue et al. Feb 2001 B1
6185736 Ueno Feb 2001 B1
6208335 Gordon et al. Mar 2001 B1
6208799 Marsh et al. Mar 2001 B1
6233389 Barton et al. May 2001 B1
6240460 Mitsutake et al. May 2001 B1
6252629 Takatori Jun 2001 B1
6275648 Knudson et al. Aug 2001 B1
6314575 Billock et al. Nov 2001 B1
6323911 Schein Nov 2001 B1
6324338 Wood et al. Nov 2001 B1
6327418 Barton et al. Dec 2001 B1
6348932 Nishikawa Feb 2002 B1
6388714 Schein May 2002 B1
6430358 Yuen et al. Aug 2002 B1
6430359 Yuen et al. Aug 2002 B1
6438596 Ueno et al. Aug 2002 B1
6442332 Knudson et al. Aug 2002 B1
6473559 Knudson et al. Oct 2002 B1
6490722 Barton et al. Dec 2002 B1
6505348 Knowles et al. Jan 2003 B1
6553376 Lewis et al. Apr 2003 B1
6564005 Berstis May 2003 B1
6611958 Shintani et al. Aug 2003 B1
6681396 Bates et al. Jan 2004 B1
6735487 Marshall et al. May 2004 B1
6744967 Kaminski et al. Jun 2004 B2
6757907 Schumacher et al. Jun 2004 B1
6760538 Bumgardner et al. Jul 2004 B1
6771885 Agnihotri et al. Aug 2004 B1
6771886 Mendelsohn Aug 2004 B1
6857132 Rakib et al. Feb 2005 B1
6901209 Cooper et al. May 2005 B1
7088910 Potrebic et al. Aug 2006 B2
7096486 Ukai et al. Aug 2006 B1
7151886 Young et al. Dec 2006 B2
7185355 Ellis et al. Feb 2007 B1
7242988 Hoffberg et al. Jul 2007 B1
7293276 Phillips et al. Nov 2007 B2
7356246 Kobb Apr 2008 B1
7519268 Juen et al. Apr 2009 B2
7600246 Taylor et al. Oct 2009 B2
7853120 Bumgardner et al. Dec 2010 B2
7979881 Wong Jul 2011 B1
8176516 Krakirian et al. May 2012 B2
8532466 Bumgardner et al. Sep 2013 B2
8873938 Mountain Oct 2014 B2
9253462 Kummer Feb 2016 B2
20010024470 Radha et al. Sep 2001 A1
20010037508 Hindus et al. Nov 2001 A1
20020044764 Akamatsu Apr 2002 A1
20020054068 Ellis et al. May 2002 A1
20020057893 Wood et al. May 2002 A1
20020059599 Schein et al. May 2002 A1
20020081096 Watanabe et al. Jun 2002 A1
20020144279 Zhou Oct 2002 A1
20020174430 Ellis et al. Nov 2002 A1
20020174433 Baumgartner et al. Nov 2002 A1
20020191954 Beach et al. Dec 2002 A1
20030009766 Marolda Jan 2003 A1
20030061619 Giammaressi Mar 2003 A1
20030070183 Pierre Apr 2003 A1
20030126607 Phillips et al. Jul 2003 A1
20030149988 Ellis et al. Aug 2003 A1
20030194200 Yuen et al. Oct 2003 A1
20030198461 Taylor et al. Oct 2003 A1
20030206719 Bumgardner et al. Nov 2003 A1
20030210898 Juen et al. Nov 2003 A1
20040003413 Boston et al. Jan 2004 A1
20040013409 Beach et al. Jan 2004 A1
20040103434 Ellis et al. May 2004 A1
20040181814 Ellis et al. Sep 2004 A1
20050044577 Jerding et al. Feb 2005 A1
20050071882 Rodriquez et al. Mar 2005 A1
20050097619 Haddad May 2005 A1
20050198671 Hanai et al. Sep 2005 A1
20050198677 Lewis Sep 2005 A1
20050204388 Knudson et al. Sep 2005 A1
20050235323 Ellis et al. Oct 2005 A1
20050240968 Knudson et al. Oct 2005 A1
20050273819 Knudson et al. Dec 2005 A1
20060051059 Krakirian et al. Mar 2006 A1
20060140584 Ellis et al. Jun 2006 A1
20070280635 Huang Dec 2007 A1
Foreign Referenced Citations (232)
Number Date Country
2918846 Nov 1980 DE
3337204 Apr 1985 DE
3527939 Feb 1987 DE
3623924 Feb 1988 DE
3921847 Jan 1991 DE
4240187 Jun 1994 DE
0 051 228 May 1982 EP
0337336 Oct 1989 EP
393955 Oct 1990 EP
0 424 469 May 1991 EP
0 444 496 Sep 1991 EP
0 447 968 Sep 1991 EP
0 488 379 Jun 1992 EP
0 535 749 Apr 1993 EP
0 572 090 Dec 1993 EP
0 624 039 Nov 1994 EP
0 662 771 Jul 1995 EP
0 682 452 Nov 1995 EP
0682452 Nov 1995 EP
0 711 076 May 1996 EP
0 725 539 Aug 1996 EP
0 753 964 Jan 1997 EP
0753964 Jan 1997 EP
0 758 833 Feb 1997 EP
0 763 938 Mar 1997 EP
0 836 320 Apr 1998 EP
0836320 Apr 1998 EP
0 854 645 Jul 1998 EP
0854645 Jul 1998 EP
0 874 524 Oct 1998 EP
0 924 927 Jun 1999 EP
0 940 983 Sep 1999 EP
0 944 253 Sep 1999 EP
0940983 Sep 1999 EP
0 986 046 Mar 2000 EP
1 370 535 Oct 1974 GB
2155713 Sep 1985 GB
2210526 Jun 1989 GB
2217144 Oct 1989 GB
2 227 622 Aug 1990 GB
2227622 Aug 1990 GB
2 229 595 Sep 1990 GB
2229595 Sep 1990 GB
2 256 115 Nov 1992 GB
2 346 251 Aug 2000 GB
2346251 Aug 2000 GB
61-109379 May 1986 JP
61-227486 Oct 1986 JP
62-008389 Jan 1987 JP
62-49528 Mar 1987 JP
62-60384 Mar 1987 JP
62-066493 Mar 1987 JP
62-125077 Jun 1987 JP
62-198768 Sep 1987 JP
63-54884 Mar 1988 JP
63-141467 Jun 1988 JP
63-247812 Oct 1988 JP
63-276069 Nov 1988 JP
63-299582 Dec 1988 JP
1-078328 Mar 1989 JP
1-142918 Jun 1989 JP
1-150928 Jun 1989 JP
1-209399 Aug 1989 JP
1-212986 Aug 1989 JP
1-307944 Dec 1989 JP
2-838892 Dec 1989 JP
2-113318 Apr 1990 JP
2-189753 Jul 1990 JP
60-61935 Mar 1994 JP
08-130517 May 1996 JP
8-130517 May 1996 JP
10-021601 Jan 1998 JP
10 065978 Mar 1998 JP
10-247344 Sep 1998 JP
10-257400 Sep 1998 JP
11 032272 Feb 1999 JP
11 205711 Jul 1999 JP
2000-13708 Jan 2000 JP
2000-138886 May 2000 JP
2000-224533 Aug 2000 JP
2000-235546 Aug 2000 JP
2000-306314 Nov 2000 JP
2001-88372 Apr 2001 JP
2001-165669 Jun 2001 JP
2001-167522 Jun 2001 JP
2001-257950 Sep 2001 JP
247388 Oct 1994 TW
WO 8700884 Feb 1987 WO
WO 8804507 Jun 1988 WO
WO 8903085 Apr 1989 WO
WO 8912370 Dec 1989 WO
WO 9000847 Jan 1990 WO
WO 9100670 Jan 1991 WO
WO 9204801 Mar 1992 WO
WO 9222983 Dec 1992 WO
WO-1992022983 Dec 1992 WO
WO 9308542 Apr 1993 WO
WO 9322877 Nov 1993 WO
WO 9323957 Nov 1993 WO
WO-1993023957 Nov 1993 WO
WO 9501058 Jan 1995 WO
WO 9515658 Jun 1995 WO
WO 9531069 Nov 1995 WO
WO 9532583 Nov 1995 WO
WO 9532584 Nov 1995 WO
WO 9532585 Nov 1995 WO
WO 9532587 Nov 1995 WO
WO-1995032587 Nov 1995 WO
WO 9609721 Mar 1996 WO
WO 9617467 Jun 1996 WO
WO 9625821 Aug 1996 WO
WO 9626605 Aug 1996 WO
WO-1996026605 Aug 1996 WO
WO 9633572 Oct 1996 WO
WO 9634467 Oct 1996 WO
WO 9636172 Nov 1996 WO
WO 9637075 Nov 1996 WO
WO-1996036172 Nov 1996 WO
WO-1996037075 Nov 1996 WO
WO 9641472 Dec 1996 WO
WO 9641478 Dec 1996 WO
WO-1996041478 Dec 1996 WO
WO 9707050 Feb 1997 WO
WO 9713368 Apr 1997 WO
WO-1997013368 Apr 1997 WO
WO 9721291 Jun 1997 WO
WO 9732434 Sep 1997 WO
WO 9734413 Sep 1997 WO
WO 9734414 Sep 1997 WO
WO 9737500 Oct 1997 WO
WO 9742763 Nov 1997 WO
WO 9746016 Dec 1997 WO
WO 9746943 Dec 1997 WO
WO 9747124 Dec 1997 WO
WO 9748228 Dec 1997 WO
WO 9748230 Dec 1997 WO
WO 9749237 Dec 1997 WO
WO-1997048230 Dec 1997 WO
WO 9801995 Jan 1998 WO
WO 9806219 Feb 1998 WO
WO 9807277 Feb 1998 WO
WO-1998006219 Feb 1998 WO
WO 9810589 Mar 1998 WO
WO 9812872 Mar 1998 WO
WO 9817033 Apr 1998 WO
WO 9817064 Apr 1998 WO
WO 9818260 Apr 1998 WO
WO 9819459 May 1998 WO
WO 9826528 Jun 1998 WO
WO 9826584 Jun 1998 WO
WO 9826596 Jun 1998 WO
WO 9831115 Jul 1998 WO
WO 9831116 Jul 1998 WO
WO 9834405 Aug 1998 WO
WO 9838831 Sep 1998 WO
WO 9847279 Oct 1998 WO
WO 9848566 Oct 1998 WO
WO-1998048566 Oct 1998 WO
WO 9903267 Jan 1999 WO
WO 9904561 Jan 1999 WO
WO 9911060 Mar 1999 WO
WO 9912320 Mar 1999 WO
WO 9927681 Jun 1999 WO
WO 9928897 Jun 1999 WO
WO 9939466 Aug 1999 WO
WO 9945700 Sep 1999 WO
WO-1999045700 Sep 1999 WO
WO 9952279 Oct 1999 WO
WO-1999052279 Oct 1999 WO
WO 9956473 Nov 1999 WO
WO 9960790 Nov 1999 WO
WO 9965244 Dec 1999 WO
WO 9966725 Dec 1999 WO
WO-1999066725 Dec 1999 WO
WO 0004706 Jan 2000 WO
WO-2000004706 Jan 2000 WO
WO 0005885 Feb 2000 WO
WO 0007368 Feb 2000 WO
WO 0008850 Feb 2000 WO
WO 0008851 Feb 2000 WO
WO 0008852 Feb 2000 WO
WO-2000007368 Feb 2000 WO
WO-2000008850 Feb 2000 WO
WO-2000008851 Feb 2000 WO
WO-2000008852 Feb 2000 WO
WO 0011869 Mar 2000 WO
WO 0016548 Mar 2000 WO
WO-2000016548 Mar 2000 WO
WO 0028739 May 2000 WO
WO-2000028739 May 2000 WO
WO 0033560 Jun 2000 WO
WO 0058833 Oct 2000 WO
WO 0058967 Oct 2000 WO
WO 0059214 Oct 2000 WO
WO 0059223 Oct 2000 WO
WO 0062298 Oct 2000 WO
WO 0062299 Oct 2000 WO
WO 0062533 Oct 2000 WO
WO-2000058833 Oct 2000 WO
WO-2000058967 Oct 2000 WO
WO-2000059214 Oct 2000 WO
WO-2000059223 Oct 2000 WO
WO-2000062298 Oct 2000 WO
WO-2000062299 Oct 2000 WO
WO-2000062533 Oct 2000 WO
WO 0067475 Nov 2000 WO
WO-2000067475 Nov 2000 WO
WO 0101677 Jan 2001 WO
WO 0101689 Jan 2001 WO
WO-2001001677 Jan 2001 WO
WO 0122729 Mar 2001 WO
WO-2001022729 Mar 2001 WO
WO 0135662 May 2001 WO
WO 0146843 Jun 2001 WO
WO 0147238 Jun 2001 WO
WO 0147249 Jun 2001 WO
WO 0147257 Jun 2001 WO
WO 0147273 Jun 2001 WO
WO 0147279 Jun 2001 WO
WO-2001046843 Jun 2001 WO
WO-2001047238 Jun 2001 WO
WO-2001047249 Jun 2001 WO
WO-2001047257 Jun 2001 WO
WO-2001047273 Jun 2001 WO
WO-2001047279 Jun 2001 WO
WO 0150743 Jul 2001 WO
WO 0176239 Oct 2001 WO
WO 0176248 Oct 2001 WO
WO-2001076239 Oct 2001 WO
WO-2001076248 Oct 2001 WO
WO 02078317 Oct 2002 WO
WO-2002078317 Oct 2002 WO
Non-Patent Literature Citations (46)
Entry
“DIRECTV Digital Satellite Receiver—Operating Instructions,” Sony Electronics Inc. (2001).
“DIRECTV Receiver—Owner's Manual,” DIRECTV, Inc. (2002).
DIRECTV Receiver with TiVo Digital Satellite ReceiverlRecorder SAT-T60—Installation Guide.
“DIRECTV Receiver with TiVo Installation Guide,” Philips (2000).
“DIRECTV Receiver with TiVo Viewer's Guide” (1999, 2000).
“DishPro Satellite System—User's Guide,” Dish Network (undated).
“Electronic Programme Guide (EPG); Protocol for a TV Guide using electronic data transmission,” by European Telecommunication Standards Institute, May 1997, Valboone, France, publication No. ETS 300 707.
“Fall 2001 TiVo Service Update with Dual Tuner!,” TiVo Inc. (2001).
“PTV Recorder Setup Guide,” Philips (2000).
“RCA Satellite Receiver User's Guide,” Thomson multimedia Inc. (2001).
“Start Here,” Sony, TiVo and DIRECTV (undated).
“Advanced Analog Systems—Addressable Terminals,” General Instrument Corp. of Horsham, Pennsylvania, (http//www.gi.com/BUSAREA/ANALOG/TERMINAL/WATCH/watch.html), printed from the internet on Mar. 4, 1999.
User's Guide RCA Color TV with TV Plus + Guide, 1997.
DIRECTV Receiver with TiVo Digital Satellite Receiver Recorder Sat-T60—Installation Guide Corporation (2000).
James, A., “Oracle-Broadcasting the Written Word,” Wireless World, Jul. 1973.
Edwardson et al., “CEEFAX: A Proposed New Broadcasting Service,” SMPTE Journal, Jan. 1974, vol. 83, pp. 14-19.
Edmondson et al., “NBC Switching Central,” SMPTE Journal, Oct. 1976, vol. 85, No. 10, pp. 795-805.
Roizen, Joseph, “Teletext in USA,” Jul. 1981, pp. 602-610.
Hoffman et al., “Videotext Programmiert Videorecorder,” Sep. 1982, 9 pages.
Printed materials on “Time's Teletext Service,” 1982-1983, pp. V79175, V79142, V79143, V79148, and V79151.
Symposium Record Broadcast Sessions, 14th International TV Symposium, Montreux, Switzerland, Jun. 6-12, 1985, 9 pages.
Von Gerhard Eitz and Karl-Ulrich Oberlies, “Videotext Programmiert Videoheimgerate (VPV),” Sep. 1986, pp. 223-229; translation of abstract included.
Kruger, H. Eckart, “Digital Video Identification System VIS,” German, 9 pages, 1982.
Ziesel et al.; “An Interactive Menu-Driven Remote Control Unite for TV-Receivers and VC-Recorders,” IEEE Transactions on Consumer Electronics, Aug. 1988, vol. 34, No. 3, pp. 814-818.
Philips Consumer Electronics, Users Manual, Matchline 28DC2070, 33DC2080; obtained Mar. 31, 2009.
Page 12 of Philips TV 21SL5756/00B User Manual; obtained Mar. 31, 2009.
TV Guide, San Francisco Metropolitan Schedule, Feb. 6, 1989.
Systems as described in DIP II Advertisement “Program Listings Never Looked So Good”, English Translation of A. Bismuth, vol. 54, No. 3, pp. 46-50, Feb. 8, 2005.
System as described in Cable Data Advertisement “There's more to one-way addressability than meets the eye”; vol. 7, No. 30, Apr. 15, 1982.
CableData brochure, “A New Approach to Addressability” (undated).
“Addressable Converters: A New Development at CableData,” Via Cable, vol. 1, No. 12 (Dec. 1981).
Sorce, J., et al.; “Designing a Broadband Residential Entertainment Service: A Case Study,” 13th International Symposium Human Factors in Telecommunications, Torino, Italy, Sep. 10-14, 1990 pp. 141-148.
BrugLiera, V., “Digital On-Screen Display—A new Technology for the Consumer Interface,” Symposium Record Cable Sessions, 18th International Television Symposium and Technical Exhibition, Montreux, Switzerland Jun. 10-15, 1993, pp. 571-586 (Jun. 11, 1993).
Miller, M.D., “A Scenario for the Deployment of Interactive Multimedia Cable Television Systems in the United States in the 1990's”, Proceedings of the IEEE, vol. 82, No. 4, pp. 585-589 (Apr. 1994).
Chang, Y., et al.; “An Open-Systems Approach to Video on Demand,” IEEE Communications Magazine, vol. 32, No. 5, pp. 68-80 (May 1994).
Article: “Windows 98 Feature Combines TV, Terminal and the Internet,” New York Times, Aug. 19, 1998.
The New York Times Website Article, “2 Makers Plan Introductions of Digital VCR,” by John Markoff, Mar. 29, 1999.
David M. Rudnick, U.S. Appl. No. 09/283,681, filed Apr. 1, 1999, entitled “Interactive Television Program Guide System Having Graphic Arrangements of Program Event Regions”.
European Search Report for EP 10179880 dated Jan. 12, 2011.
U.S. Appl. No. 09/821,005, filed Mar. 29, 2001.
U.S. Appl. No. 12/634,154, filed Dec. 9, 2009.
U.S. Appl. No. 12/775,025, filed May 6, 2010.
U.S. Appl. No. 09/330,792, filed Jun. 11, 1999.
U.S. Appl. No. 10/105,128, filed Feb. 21, 2002.
U.S. Appl. No. 10/707,834, filed Jan. 15, 2004.
U.S. Appl. No. 10/936,417, filed Sep. 8, 2004.
Related Publications (1)
Number Date Country
20120189269 A1 Jul 2012 US
Continuations (3)
Number Date Country
Parent 12626267 Nov 2009 US
Child 13438237 US
Parent 10936417 Sep 2004 US
Child 12626267 US
Parent 10249575 Apr 2003 US
Child 10707834 US
Continuation in Parts (1)
Number Date Country
Parent 10707834 Jan 2004 US
Child 10936417 US