Search Images Maps Play YouTube News Gmail Drive More »
Sign in
Screen reader users: click this link for accessible mode. Accessible mode has the same essential features but works better with your reader.

Patents

  1. Advanced Patent Search
Publication numberUS20030037123 A1
Publication typeApplication
Application numberUS 10/179,800
Publication dateFeb 20, 2003
Filing dateJun 24, 2002
Priority dateMay 31, 2000
Also published asCA2404611A1, CN1355904A, EP1285345A1, EP1285345A4, EP1285533A1, US6557030, US6725267, US20030105834, US20030140122, WO2001093060A1, WO2001093585A1
Publication number10179800, 179800, US 2003/0037123 A1, US 2003/037123 A1, US 20030037123 A1, US 20030037123A1, US 2003037123 A1, US 2003037123A1, US-A1-20030037123, US-A1-2003037123, US2003/0037123A1, US2003/037123A1, US20030037123 A1, US20030037123A1, US2003037123 A1, US2003037123A1
InventorsKhoi Hoang
Original AssigneeKhoi Hoang
Export CitationBiBTeX, EndNote, RefMan
External Links: USPTO, USPTO Assignment, Espacenet
Systems and method for providing video-on-demand services for broadcasting systems
US 20030037123 A1
Abstract
A method for sending data to a client to provide data-on-demand services comprises the steps of: receiving a data file, specifying a time interval, parsing the data file into a plurality of data blocks based on the time interval such that each data block is displayable during a time interval, determining a required number of time slots to send the data file, allocating to each time slot at least a first of the plurality of data blocks and optionally one or more additional data blocks, such that starting from any of the time slots, (i) the data file can be displayed by accessing the first of the plurality of data blocks; (ii) at a consecutive time slot, a next data block sequential to a prior displayed data block is available for displaying; and (iii) repeating step (ii) until all of the plurality of data blocks for the data file has been displayed, and sending the plurality of data blocks based on the allocating step.
Images(6)
Previous page
Next page
Claims(11)
1. A method for generating a scheduling matrix for data file, and scheduling matrix provides a send order for sending data blocks for a data file, such that said data blocks are available in sequential order to a client receiving said data blocks, said method comprising the steps of:
(a) receiving a number of data blocks [x] for a data file;
(b) setting a first variable [i] to zero;
(c) setting a second variable [i] to zero;
(d) clearing all entries in a reference array;
(e) writing at least one data block stored in matrix positions of a column [(i+j) modulo x] in a matrix to a reference array, if said reference array does not already contain said data block;
(f) writing a data block [i] into said reference array and a matrix position [(i+j) modulu x,j] of said matrix, if said reference array does not contains aid data block [i];
(g) incrementing said second variable [i] is equal to said number of data blocks [x]; and
((h) incrementing said first variable [j] by one and repeating said step (c) until said first variable [j] is equal to said number of data blocks [x].
2. The method of claim 1, further comprising the steps of:
(i) repeating said steps (a) to (h) to generate a set of scheduling matrices for a set of data files; and
(j) applying a convolution method to generate a delivery matrix based on said set of scheduling matrices for sending said set of data files.
3. A method for calculating a delivery matrix, said delivery matrix provides a send order for sending data blocks of a set of data files, said method comprising the step of:
(a) calculating a scheduling matrix for each data file in a set of data files to form a set of scheduling matrices;
(b) generating an identification array containing an identification for each of said set of data files; and
(c) combining said set of scheduling matrices and said identification array to generate a delivery matrix for said set of data files.
4. The method of claim 3, wherein said calculating step includes the step of:
(i) generating an array containing a set of time slots for each data file; and
(ii) generating an array contain at least one data block of a data file to be sent during each time slot.
5. The method of claim 3, wherein said combining includes the step of using a convolution method.
6. A computer implemented on-demand data broadcast method comprising the act of preparing a delivery matrix defining a data transmission sequence suitable for broadcast, to a plurality of clients, on-demand data in a non client specific manner, whereby transmission of said on-demand data files requires an amount of transmission bandwidth that is independent of the number of said plurality of clients.
7. A computer implemented method as recited in claim 6, wherein the act of generating a delivery matrix comprises the act of:
preparing a first scheduling matrix suitable for transmission of a first data file, said first data file being represented by a first plurality of data blocks, said first scheduling matrix providing a first sequence for transmitting said first plurality of data blocks sequentially within time slots in a manner such that any client receiving transmission of said first data file according to said first scheduling matrix may begin accessing said first data file within one time slot.
8. A computer implemented method as recited in claim 7, wherein the act of preparing a delivery matrix further includes the acts of:
preparing a second scheduling matrix suitable for transmission of a second data file, said second data file being represented by a second plurality of data blocks, said second scheduling matrix providing a second sequence for transmitting said second plurality f data blocks sequentially within time slots in a manner such that any client receiving transmission of said second data file according to said second scheduling matrix may being accessing said second data file within one timeslot; and
generating said delivery matrix through a combination of said first and second scheduling matrices.
9. A computer implemented universal data broadcast method as recited in claim 6 further comprising the act of preparing an electronic program guide (EPG) suitable for broadcast to said plurality of clients.
10. A computer implemented method as recited in claim 6, wherein said on-demand data includes video data.
11. A computer implemented method as recited in claim 6, wherein said on-demand data includes game data.
Description
CROSS REFERENCES RELATED TO APPLICATION

[0001] This application is a divisional application of U.S. Ser. No. 09/584,832 filed on May 31, 2000 by Khoi Hoang.

BACKGROUND OF THE INVENTION

[0002] Video-on-demand (VOD) systems are one type of data-on-demand (DOD) systems. In VOD systems, video data files are provided by a server or a network of servers to one or more clients on a demand basis.

[0003] In a conventional VOD architecture, a server or a network of servers communicates with clients in a standard hierarchical client-server model. For example, a client sends a request to a server for a data file (e.g., a video data file). In response to the client request, the server sends the requested data file to the client. In the standard client-server model, a client's request for a data file can be fulfilled by one or more servers. The client may have the capability to store any received data file locally in non-volatile memory for later use. The standard client-server model requires a two-way communications infrastructure. Currently, two-way communications require building new infrastructure because existing cables can only provide one-way communications. Example of two-way communications infrastructure are hybrid fiber optics coaxial cable (HFC) or all fiber infrastructure. Replacing existing cables is very costly and the resulting services may not be affordable by most users.

[0004] In addition, the standard client-server model has many limitations when a service provider (e.g., a cable company) attempts to provide VOD services to a large number of clients. One limitation of the standard client-server model is that the service provider has to implement a mechanism to continuously listen and fulfill every request from each client within the network; thus, the number of clients who can receive service is dependent on the capacity of such a mechanism. One mechanism uses massively-parallel computers having large and fast disk arrays as local servers. However, even the fastest existing local server can only deliver video data streams to about 1000 to 2000 clients at one time. Thus, in order to service more clients, the number of local servers must increase. Increasing local servers requires more upper level servers to maintain control of the local servers.

[0005] Another limitation of the standard client-server model is that each client requires its own bandwidth. Thus, the total required bandwidth is directly proportional to the number of subscribing clients. Cache memory within local servers has been used to improve bandwidth limitation but using cache memory does not solve the problem because cache memory is also limited.

[0006] Presently, in order to make video-on-demand services more affordable for clients, existing service providers are increasing the ratio of clients per local server above the local server's capabilities. Typically, a local server, which is capable of providing service to 1000 clients, is actually committed to service 10,000 clients. This technique may work if most of the subscribing clients do not order videos at the same time. However, this technique is set up for failure because most clients are likely to want to view videos at the same time (i.e., evenings and weekends), thus, causing the local server to become overloaded.

[0007] Thus, it is desirable to provide a system that is capable of providing on-demand services to a large number of clients over virtually any transmission medium without replacing existing infrastructure.

SUMMARY OF THE INVENTION

[0008] In an exemplary embodiment, at a server side, a method for sending data to a client to provide data-on-demand services comprises the steps of: receiving a data file, specifying a time interval, parsing the data file into a plurality of data blocks based on the time interval such that each data block is displayable during the time interval, determining a required number of time slots to send the data file, allocating to each time slot at least a first of the plurality of data blocks and optionally one or more additional data blocks, such that the plurality of data blocks is available in sequential order to a client accessing the data file during any time slot, and sending the plurality of data blocks based on the allocating step. In one embodiment, the parsing step includes the steps of: determining an estimated data block size, determining a cluster size of a memory in a channel server, and parsing the data file based on the estimated data block size and the cluster size. In another embodiment, the determining step includes the step of assessing resource allocation and bandwidth availability.

[0009] In an exemplary embodiment, at a client side, a method for processing data received from a server to provide data-on-demand services comprises the steps of: (a) receiving a selection of a data file during a first time slot; (b) receiving at least one data block of the data file during a second time slot; (c) during a next time slot: receiving any data block not already received, sequentially displaying a data block of the data file, and repeating step (c) until all data blocks of the data file has been received and displayed. In one embodiment, the method for processing data received from a server is performed by a set-top box at the client side.

[0010] In an exemplary embodiment, a data file is divided into a number of data blocks and a scheduling matrix is generated based on the number of data blocks. At the server side, the scheduling matrix provides a send order for sending the data blocks, such that a client can access the data blocks in sequential order at a random time. In an exemplary embodiment, a method for generating a scheduling matrix for a data file comprises the steps of: (a) receiving a number of data blocks [x] for a data file; (b) setting a first variable [j] to zero; (c) setting a second variable [i] to zero; (d) clearing all entries in a reference array; (e) writing at least one data block stored in matrix positions of a column [(i+j) modulo x] in a matrix to a reference array, if the reference array does not already contain the data block; (f) writing a data block [i] into the reference array and a matrix position [(i+j) modulo x, j] of the matrix, if the reference array does not contain the data block [i]; (g) incrementing the second variable [i] by one and repeating step (e) until the second variable [i] is equal to the number of data blocks [x]; and (h) incrementing the first variable [j] by one and repeating the step (c) until the first variable [j] is equal to the number of data blocks [x]. In one embodiment, a scheduling matrix is generated for each data file in a set of data files and a convolution method is applied to generate a delivery matrix based on the scheduling matrices for sending the set of data files.

[0011] A data-on-demand system comprises a first set of channel servers, a central controlling server for controlling the first set of channel servers, a first set of up-converters coupled to the first set of channel servers, a combiner/amplifier coupled to the first set of up-converters, and a combiner/amplifier adapted to transmit data via a transmission medium. In an exemplary embodiment, the data-on-demand system further comprises a channel monitoring module for monitoring the system, a switch matrix, a second set of channel servers, and a second set of up-converters. The channel monitoring module is configured to report to the central controlling server when system failure occurs. The central controlling server, in response to report from the channel monitoring module, instructs the switch matrix to replace a defective channel server in the first set of channel servers with a channel server in the second set of channel servers and a defective up-converter in the first set of up-converters with an up-converter in the second set of up-converters.

[0012] A method for providing data-on-demand services comprises the steps of calculating a delivery matrix of a data file, sending the data file in accordance with the delivery matrix, such that a large number of clients is capable of viewing the data file on demand. In one embodiment, the data file includes a video file.

BRIEF DESCRIPTION OF THE DRAWINGS

[0013]FIG. 1A illustrates an exemplary DOD system in accordance with an embodiment of the invention.

[0014]FIG. 1B illustrates an exemplary DOD system in accordance with another embodiment of the invention.

[0015]FIG. 2 illustrates an exemplary channel server in accordance with an embodiment of the invention.

[0016]FIG. 3 illustrates an exemplary set-top box in accordance with an embodiment of the invention.

[0017]FIG. 4 illustrates an exemplary process for generating a scheduling matrix in accordance with an embodiment of the invention.

DETAILED DESCRIPTION OF THE INVENTION

[0018]FIG. 1A illustrates an exemplary DOD system 100 in accordance with an embodiment of the invention. In this embodiment, the DOD system 100 provides data files, such as video files, on demand. However, the DOD system 100 is not limited to providing video files on demand but is also capable of providing other data files, for example, game files on demand. The DOD system 100 includes a central controlling server 102, a central storage 103, a plurality of channel servers 104 a- 104 n, a plurality of up-converters 106 a-106 n, and a combiner/amplifier 108. The central controlling server 102 controls the channel servers 104. The central storage 103 stores data files in digital format. In an exemplary embodiment, data files stored in the central storage 103 is accessible via a standard network interface (e.g., ethernet connection) by any authorized computer, such as the central controlling server 102, connected to the network. Each channel server 104 is assigned to a channel and is coupled to an up-converter 106. The channel servers 104 provide data files that are retrieved from the central storage 103 in accordance with instructions from the central controlling server 102. The output of each channel server 104 is a quadrature amplitude modulation (QAM) modulated intermediate frequency (IF) signal having a suitable frequency for the corresponding up-converter 106. The QAM-modulated IF signals are dependent upon adopted standards. The current adopted standard in the United States is the data-over-cable-systems-interface-specification (DOCSIS) standard, which requires an approximately 43.75 MHz IF frequency. The up-converters 106 convert IF signals received from the channel servers 104 to radio frequency signals (RF signals). The RF signals, which include frequency and bandwidth, are dependent on a desired channel and adopted standards. For example, under the current standard in the United States for a cable television channel 80, the RF signal has a frequency of approximately 559.25 MHz and a bandwidth of approximately 6 MHz. The outputs of the up-converters 106 are applied to the combiner/amplifier 108. The combiner/amplifier 108 amplifies, conditions, and combines the received RF signals then outputs the signals out to a transmission medium 110.

[0019] In an exemplary embodiment, the central controlling server 102 includes a graphics user interface (not shown) to enable a service provider to schedule data delivery by a drag-and-drop operation. Further, the central controlling server 102 authenticates and controls the channel servers 104 to start or stop according to delivery matrices. In an exemplary embodiment, the central controlling server 102 automatically selects a channel and calculates delivery matrices for transmitting data files in the selected channel. The central controlling server 102 provides offline addition, deletion, and update of data file information (e.g., duration, category, rating, and/or brief description). Further, the central controlling server 102 controls the central storage 103 by updating data files and databases stored therein.

[0020] In an exemplary embodiment, an existing cable television system 120 may continue to feed signals into the combiner/amplifier 108 to provide non-DOD services to clients. Thus, the DOD system 100 in accordance with the invention does not disrupt present cable television services.

[0021]FIG. 1B illustrates another exemplary embodiment of the DOD system 100 in accordance with the invention. In addition to the elements illustrated in FIG. 1A, the DOD system 100 includes a switch matrix 112, a channel monitoring module 114, a set of back-up channel servers 116 a-116 b, and a set of back-up up-converters 118 a-118 b. In one embodiment, the switch matrix 112 is physically located between the up-converters 106 and the combiner/amplifier 108. The switch matrix 112 is controlled by the central controlling server 102. The channel monitoring module 114 comprises a plurality of configured set-top boxes, which simulate potential clients, for monitoring the health of the DOD system 100. Monitoring results are communicated by the channel monitoring module 114 to the central controlling server 102. In case of a channel failure (i.e., a channel server failure, an up-converter failure, or a communication link failure), the central controlling server 102 through the switch matrix 112 disengages the malfunctioning component and engages a healthy backup component 116 and/or 118 to resume service.

[0022] In an exemplary embodiment, data files being broadcasted from the DOD system 100 are contained in motion pictures expert group (MPEG) files. Each MPEG file is dynamically divided into data blocks and sub-blocks mapping to a particular portion of a data file along a time axis. These data blocks and sub-blocks are sent during a pre-determined time in accordance with three-dimensional delivery matrices provided by the central controlling server 102. A feedback channel is not necessary for the DOD system 100 to provide DOD services. However, if a feedback channel is available, the feedback channel can be used for other purpose, such as billing or providing Internet services.

[0023]FIG. 2 illustrates an exemplary channel server 104 in accordance with an embodiment of the invention. The channel server 104 comprises a server controller 202, a CPU 204, a QAM modulator 206, a local memory 208, and a network interface 210. The server controller 202 controls the overall operation of the channel server 104 by instructing the CPU 204 to divide data files into blocks (further into sub-blocks and data packets), select data blocks for transmission in accordance with a delivery matrix provided by the central controlling server 102, encode selected data, compress encoded data, then deliver compressed data to the QAM modulator 206. The QAM modulator 206 receives data to be transmitted via a bus (i.e., PCI, CPU local bus) or Ethernet connections. In an exemplary embodiment, the QAM modulator 206 may include a downstream QAM modulator, an upstream quadrature amplitude modulation/quadrature phase shift keying (QAM/QPSK) burst demodulator with forward error correction decoder, and/or an upstream tuner. The output of the QAM modulator 206 is an IF signal that can be applied directly to an up-converter 106.

[0024] The network interface 210 connects the channel server 104 to other channel servers 104 and to the central controlling server 102 to execute the scheduling and controlling instructions from the central controlling server 102, reporting status back to the central controlling server 102, and receiving data files from the cental storage 103. Any data file retrieved from the central storage 103 can be stored in the local memory 208 of the channel server 104 before the data file is processed in accordance with instructions from the server controller 202. In an exemplary embodiment, the channel server 104 may send one or more DOD data streams depending on the bandwidth of a cable channel (e.g., 6, 6.5, or 8 MHz), QAM modulation (e.g., QAM 64 or QAM 256), and a compression standard/bit rate of the DOD data stream (i.e., MPEG-1 or MPEG-2).

[0025]FIG. 3 illustrates an exemplary set-top box (STB) 300 in accordance with an embodiment of the invention. The STB 300 comprises a QAM demodulator 302, a CPU 304, a conditional access module 306 (e.g., a smart card system), a local memory 308, a buffer memory 309, a STB controller 310, a decoder 312, and a graphics overlay module 314. The STB controller 310 controls the overall operation of the STB 300 by controlling the CPU 302 and the QAM demodulator 302 to select data in response to a client's request, decode selected data, decompress decoded data, reassemble decoded data, store decoded data in the local memory 308 or the buffer memory 309, and deliver stored data to the decoder 312. In an exemplary embodiment, the STB controller 310 controls the overall operation of the STB 300 based on data packet headers in the data packets received from the transmission medium 110. In an exemplary embodiment, the local memory 308 comprises non-volatile memory (e.g., a hard drive) and the buffer memory 309 comprises volatile memory.

[0026] In one embodiment, the QAM demodulator 302 comprises transmitter and receiver modules and one or more of the following: privacy encryption/decryption module, forward error correction decoder/encoder, tuner control, downstream and upstream processor, CPU and memory interface circuits. The QAM demodulator 302 receives modulated IF signals, samples and demodulates the signals to restore data.

[0027] The conditional access module 306 permits a decoding process when access is granted after authentication and/or when appropriate fees have been charged. Access condition is determined by the service provider.

[0028] In an exemplary embodiment, when access is granted, the decoder 312 decodes at least one data block to transform the data block into images displayable on an output screen. The decoder 312 supports commands from a subscribing client, such as play, stop, pause, step, rewind, forward, etc.

[0029] The graphics overlay module 314 enhances displayed graphics quality by, for example, providing alpha blending or picture-in-picture capabilities. In an exemplary embodiment, the graphics overlay module 314 can be used for graphics acceleration during game playing mode, for example, when the service provider provides games-on-demand services using the system in accordance with the invention.

[0030] In an exemplary embodiment, although data files are broadcasted to all cable television subscribers, only the DOD subscriber who has a compatible STB 300 will be able to decode and enjoy data-on-demand services. In one exemplary embodiment, permission to obtain data files on demand can be obtained via a smart card system in the conditional access control module 306. A smart card may be rechargeable at a local store or vending machine set up by a service provider. In another exemplary embodiment, a flat fee system provides a subscriber an unlimited access to all available data files.

[0031] In an exemplary embodiment, data-on-demand interactive features permit a client to select at any time an available data file. The amount of time between when a client presses a select button and the time the selected data file begins playing is referred to as a response time. As more resources are allocated (e.g., bandwidth, server capability) to provide DOD services, the response time gets shorter. In an exemplary embodiment, a response time can be determined based on an evaluation of resource allocation and desired quality of service.

[0032] In an exemplary embodiment, a selected response time determines the duration of a time slot. The duration of a time slot (TS) is the time interval for playing a data block at normal speed by a client. In an exemplary embodiment, a data file, such as a video file, is divided into a number of data blocks such that each data block can support the playing of the data file for the duration of a time slot.

[0033] In one embodiment, the number of data blocks (NUM_OF_BLKS) for each data file can be calculated as follows:

Estimated_BLK_Size=(DataFile_Size*TS)/DataFile_Length   (1)

BLK SIZE=(Estimated BLK Size+CLUSTER_SIZE−1 Byte)/CLUSTER_SIZE   (2)

BLK_SIZE_BYTES=BLK_SIZE*CLUSTER_SIZE   (3)

NUM_OF_BLKS=(DataFile_Size+BLK_SIZE_BYTES−1 Byte)/BLK_SIZE_BYTES   (4)

[0034] In equations (1) to (4), the Estimated_BLK_Size is an estimated block size (in Bytes); the DataFile_Size is the data file size (in Bytes); TS represents the duration of a time slot (in seconds); DataFile_Length is the duration of the data file (in seconds); BLK SIZE is the number of clusters needed for each data block; CLUSTER_SIZE is the size of a cluster in the local memory 208 for each channel server 104 (e.g., 64 KBytes); BLK_SIZE_BYTES is a block size in Bytes. In this embodiment, the number of blocks (NUM_OF_BLKS) is equal to the data file size (in Bytes) plus a data block size in Bytes minus 1 Byte and divided by a data block size in Bytes. Equations (1) to (4) illustrate one specific embodiment. A person of skill in the art would recognize that other methods are available to calculate a number of data blocks for a data file. For example, dividing a data file into a number of data blocks is primarily a function of an estimated block size and the cluster size of the local memory 208 of a channel server 104. Thus, the invention should not be limited to the specific embodiment presented above.

[0035]FIG. 4 illustrates an exemplary process for generating a scheduling matrix for sending a data file in accordance with an embodiment of the invention. In an exemplary embodiment, this invention uses time division multiplexing (TDM) and frequency division multiplexing (FDM) technology to compress and schedule data delivery at the server side. In an exemplary embodiment, a scheduling matrix is generated for each data file. In one embodiment, each data file is divided into a number of data blocks and the scheduling matrix is generated based on the number of data blocks. Typically, a scheduling matrix provides a send order for sending data blocks of a data file from a server to clients, such that the data blocks are accessible in sequential order by any client who wishes to access the data file at a random time.

[0036] At step 402, a number of data blocks (x) for a data file is received. A first variable, j, is set to zero (step 404). A reference array is cleared (step 406). The reference array keeps track of data blocks for internal management purposes. Next, j is compared to x (step 408). If j is less than x, a second variable, i, is set to zero (step 412). Next, i is compared to x (step 414). If i is less than x, data blocks stored in the column [(i+j) modulo (x)] of a scheduling matrix are written into the reference array (step 418). If the reference array already has such data block(s), do not write a duplicate copy. Initially, since the scheduling matrix does not yet have entries, this step can be skipped. Next, the reference array is checked if it contains data block i (step 420). Initially, since all entries in the reference array has been cleared at step 406, there would be nothing in the reference array. If the reference array does not contain data block i, data block i is added into the scheduling matrix at matrix position [(i+j) modulo (x), j] and the reference array (step 422). After the data block i is added to the scheduling matrix and the reference array, i is incremented by 1, such that i=i+1 (step 424), then the process repeats at step 414 until i=x. If the reference array contains data block i, i is incremented by 1, such that i=i+1 (step 424), then the process repeats at step 414 until i=x. When i=x, j is incremented by 1, such that j=j+1 (step 416) and the process repeats at step 406 until j=x. The entire process ends when j=x (step 410).

[0037] In an exemplary embodiment, if a data file is divided into six data blocks (x=6), the scheduling matrix and the reference arrays are as follows:

Scheduling Matrix (SM)
TS0 TS1 TS2 TS3 TS4 TS5
[0, 0] blk0 [1, 0] blk1 [2, 0] blk2 [3, 0] blk3 [4, 0] blk4 [5, 0] blk5
[0, 1] [1, 1] blk0 [2, 1] [3, 1] [4, 1] [5, 0]
[0, 2] [1, 2] [2, 2] blk0 [3, 2] blk1 [4, 2] [5, 1]
[0, 3] [1, 3] [2, 3] [3, 3] blk0 [4, 3] [5, 2] blk2
[0, 4] [1, 4] blk3 [2, 4] [3, 4] [4, 4] blk0 [5, 3] blk1
[0, 5] [1, 5] [2, 5] [3, 5] blk4 [4, 5] [5, 4] blk0

[0038]

Reference Array (RA)
space0 space1 space2 space3 space4 space5
TS0 blk0 blk1 blk2 blk3 blk4 blk5
TS1 blk1 blk0 blk2 blk3 blk4 blk5
TS2 blk2 blk0 blk3 blk1 blk4 blk5
TS3 blk3 blk1 blk0 blk4 blk5 blk2
TS4 blk4 blk0 blk5 blk2 blk1 blk3
TS5 blk5 blk2 blk1 blk0 blk3 blk4

[0039] Appendix A attached to this application describes a step-by-step process of the exemplary process illustrated in FIG. 4 to generate the above scheduling matrix and reference arrays. In this exemplary embodiment, based on the scheduling matrix above, the six data blocks of the data file are sent in the following sequence:

[0040] TS0

blk0

[0041] TS1

blk0, blk1, blk3

[0042] TS2

blk0, blk2

[0043] TS3

blk0, blk1, blk3, blk4

[0044] TS4

blk0, blk4

[0045] TS5

blk0, blk1, blk2, blk5

[0046] In another exemplary embodiment, a look-ahead process can be used to calculate a look-ahead scheduling matrix to send a predetermined number of data blocks of a data file prior to a predicted access time. For example, if a predetermined look-ahead time is the duration of one time slot, for any time slot greater than or equal to time slot number four, data block 4 (blk4) of a data file should be received by a STB 300 at a subscribing client at or before TS3, but blk4 would not be played until TS4. The process steps for generating a look-ahead scheduling matrix is substantially similar to the process steps described above for FIG. 4 except that the look-ahead scheduling matrix in this embodiment schedules an earlier sending sequence based on a look-ahead time. Assuming a data file is divided into six data blocks, an exemplary sending sequence based on a look-ahead scheduling matrix, having a look-ahead time of the duration of two time slots, can be represented as follows:

[0047] TS0

blk0

[0048] TS1

blk0, blk1, blk3, blk4

[0049] TS2

blk0, blk2

[0050] TS3

blk0, blk1, blk3, blk4, blk5

[0051] TS4

blk0, blk5

[0052] TS5

blk0, blk1, blk2

[0053] A three-dimensional delivery matrix for sending a set of data files is generated based on the scheduling matrices for each data file of the set of data files. In the three-dimensional delivery matrix, a third dimension containing IDs for each data file in the set of data files is generated. The three-dimensional delivery matrix is calculated to efficiently utilize available bandwidth in each channel to deliver multiple data streams. In an exemplary embodiment, a convolution method, which is well known in the art, is used to generate a three-dimensional delivery matrix to schedule an efficient delivery of a set of data files. For example, a convolution method may include the following policies: (1) the total number of data blocks sent in the duration of any time slot (TS) should be kept at a smallest possible number; and (2) if multiple partial solutions are available with respect to policy (1), the preferred solution is the one which has a smallest sum of data blocks by adding the data blocks to be sent during the duration of any reference time slot, data blocks to be sent during the duration of a previous time slot (with respect to the reference time slot), and data blocks to be sent during the duration of a next time slot (with respect to the reference time slot). For example, assuming an exemplary system sending two short data files, M and N, where each data file is divided into six data blocks, the sending sequence based on a scheduling matrix is as follows:

[0054] TS0

blk0

[0055] TS1

blk0, blk1, blk3

[0056] TS2

blk0, blk2

[0057] TS3

blk0, blk1, blk3, blk4

[0058] TS4

blk0, blk4

[0059] TS5

blk0, blk1, blk2, blk5

[0060] Applying the exemplary convolution method as described above, possible combinations of delivery matrices are as follows:

Total Data Blocks
Option 1: Send video file N at shift 0 TS
TS0 => M0, N0 2
TS1 => M0, M1, M3, N0, N1, N3 6
TS2 => M0, M2, N0, N2 4
TS3 => M0, M1, M3, M4, N0, N1, N3, N4 8
TS4 => M0, M4, N0, N4 4
TS5 => M0, M1, M2, M5, N0, N1, N2, N5 8
Option 2: Send video file N at shift 1 TS
TS0 => M0, N0, N1, N3 4
TS1 => M0, M1, M3, N0, N2 5
TS2 => M0, M2, N0, N1, N3, N4 6
TS3 => M0, M1, M3, M4, N0, N4 6
TS4 => M0, M4, N0, N1, N2, N5 6
TS5 => M0, M1, M2, M5, N0 5
Option 3: Send video file N at shift 2 TS
TS0 => M0, N0, N2 3
TS1 => M0, M1, M3, N0, N1, N3, N4 7
TS2 => M0, M2, N0, N4 4
TS3 => M0, M1, M3, M4, N0, N1, N2, N5 8
TS4 => M0, M4, N0 3
TS5 => M0, M1, M2, M5, N0, N1, N3 7
Option 4: Send video file N at shift 3 TS
TS0 => M0, N0, N1, N3, N4 5
TS1 => M0, M1, M3, N0, N4 5
TS2 => M0, M2, N0, N1, N2, N5 6
TS3 => M0, M1, M3, M4, N0 5
TS4 => M0, M4, N0, N1, N3 5
TS5 => M0, M1, M2, M5, N0, N2 6
Option 5: Send video file N at shift 4 TS
TS0 => M0, N0, N4 3
TS1 => M0, M1, M3, N0, N1, N2, N5 7
TS2 => M0, M2, N0 3
TS3 => M0, M1, M3, M4, N0, N1, N3 7
TS4 => M0, M4, N0, N2 4
TS5 => M0, M1, M2, M5, N0, N1, N3, N4 8
Option 6: Send video file N at shift 5 TS
TS0 => M0, N0, N1, N2, N5 5
TS1 => M0, M1, M3, N0 4
TS2 => M0, M2, N0, N1, N3 5
TS3 => M0, M1, M3, M4, N0, N2 6
TS4 => M0, M4, N0, N1, N3, N4 6
TS5 => M0, M1, M2, M5, N0, N4 6

[0061] Applying policy (1), options 2, 4, and 6 have the smallest maximum number of data blocks (i.e., 6 data blocks) sent during any time slot. Applying policy (2), the optimal delivery matrix in this exemplary embodiment is option 4 because option 4 has the smallest sum of data blocks of any reference time slot plus data blocks of neighboring time slots (i.e., 16 data blocks). Thus, optimally for this embodiment, the sending sequence of the data file N should be shifted by three time slots. In an exemplary embodiment, a three-dimensional delivery matrix is generated for each channel server 104.

[0062] When data blocks for each data file are sent in accordance with a delivery matrix, a large number of subscribing clients can access the data file at a random time and the appropriate data blocks of the data file will be timely available to each subscribing client. In the example provided above, assume the duration of a time slot is equal to 5 seconds, the DOD system 100 sends data blocks for data files M and N in accordance with the optimal delivery matrix (i.e., shift delivery sequence of data file N by three time slots) in the following manner:

[0063] Time 00:00:00

M0 N0 N1 N3 N4

[0064] Time 00:00:05

M0 M1 M3 N0 N4

[0065] Time 00:00:10

M0 M2 N0 N1 N2 N5

[0066] Time 00:00:15

M0 M1 M3 M4 N0

[0067] Time 00:00:20

M0 M4 N0 N1 N3

[0068] Time 00:00:25

M0 M1 M2 M5 N0 N2

[0069] Time 00:00:30

M0 N0N1 N3 N4

[0070] Time 00:00:35

M0 M1 M3 N0 N4

[0071] Time 00:00:40

M0 M2 N0 N1 N2 N5

[0072] Time 00:00:45

M0 M1 M3 M4 N0

[0073] Time 00:00:50

M0 M4 N0 N1 N3

[0074] Time 00:00:55

M0 M1 M2 M5 N0 N2

[0075] If at time 00:00:00 a client A selects movie M, the STB 300 at client A receives, stores, plays, and rejects data blocks as follows:

[0076] Time 00:00:00

Receive M0 play M0, store M0.

[0077] Time 00:00:05

Receive M1, M3 play M1, store M0, M1, M3.

[0078] Time 00:00:10

Receive M2 play M2, store M0, M1, M2 M3.

[0079] Time 00:00:15

Receive M4 play M3, store M0, M1, M2, M3, M4.

[0080] Time 00:00:20

Receive none play M4, store M0, M1, M2, M3, M4.

[0081] Time 00:00:25

Receive M5 play M5, store M0, M1, M2, M3, M4, M5.

[0082] If at time 00:00:10, a client B selects movie M, the STB 300 at client B receives, stores, plays, and rejects data blocks as follows:

[0083] Time 00:00:10

Rcv M0, M2 play M0, store M0, M2.

[0084] Time 00:00:15

Rcv M1, M3, M4play M1, store M0, M1, M2, M3, M4.

[0085] Time 00:00:20

Rcv none play M2, store M0, M1, M2, M3, M4.

[0086] Time 00:00:25

Rcv M5 play M3, store M0, M1, M2, M3, M4, M5.

[0087] Time 00:00:30

Rcv none play M4, store M0, M1, M2, M3, M4, M5.

[0088] Time 00:00:35

Rcv none play M5, store M0, M1, M2, M3, M4, M5.

[0089] If at time 00:00:15, a client C selects movie N, the STB 300 of the client C receives, stores, plays, and rejects data blocks as follows:

[0090] Time 00:00:15

Rcv N0 play N0, store N0.

[0091] Time 00:00:20

Rcv N1 N3 play N1, store N0, N1, N3.

[0092] Time 00:00:25

Rcv N2 play N2, store N0, N1, N2, N3.

[0093] Time 00:00:30

Rcv N4 play N3, store N0, N1, N2, N3, N4.

[0094] Time 00:00:35

Rcv none play N4, store N0, N1, N2, N3, N4.

[0095] Time 00:00:40

Rcv N5 play N5, store N0, N1, N2, N3, N4, N5.

[0096] If at time 00:00:30, a client D also selects movie N, the STB 300 at the client D receives, stores, plays, and rejects data blocks as follows:

[0097] Time 00:00:30

Rcv N0, N1, , N3, N4play N0, store N0, N1, N3, N4.

[0098] Time 00:00:35

Rcv none play N1, store N0, N1, N3, N4.

[0099] Time 00:00:40

Rcv N2, N5 play N2, store N0, N1, N2, N3, N4, N5.

[0100] Time 00:00:45

Rcv none play N3, store N0, N1, N2, N3, N4, N5.

[0101] Time 00:00:50

Rcv none play N4, store N0, N1, N2, N3, N4, N5.

[0102] Time 00:00:55

Rcv none play N5, store N0, N1, N2, N3, N4, N5.

[0103] As shown in the above examples, any combination of clients can at a random time independently select and begin playing any data file provided by the service provider.

GENERAL OPERATION

[0104] A service provider can schedule to send a number of data files (e.g., video files) to channel servers 104 prior to broadcasting. The central controlling server 102 calculates and sends to the channel servers 104 three-dimensional delivery matrices (ID, time slot, and data block send order). During broadcasting, channel servers 104 consult the three-dimensional delivery matrices to send appropriate data blocks in an appropriate order. Each data file is divided into data blocks so that a large number of subscribing clients can separately begin viewing a data file continuously and sequentially at a random time. The size of a data block of a data file is dependent on the duration of a selected time slot and the bit rate of the data stream of the data file. For example, in a constant bit rate MPEG data stream, each data block has a fixed size of:

Block Size (MBytes)=BitRate (Mb/s)×TS (sec)/8   (1).

[0105] In an exemplary embodiment, a data block size is adjusted to a next higher multiple of a memory cluster size in the local memory 208 of a channel server 104. For example, if a calculated data block length is 720 Kbytes according to equation (1) above, then the resulting data block length should be 768 Kbytes if the cluster size of the local memory 208 is 64 Kbytes. In this embodiment, data blocks should be further divided into multiples of sub-blocks each having the same size as the cluster size. In this example, the data block has twelve sub-blocks of 64 KBytes.

[0106] A sub-block can be further broken down into data packets. Each data packet contains a packet header and packet data. The packet data length depends on the maximum transfer unit (MTU) of a physical layer where each channel server's CPU sends data to. In the preferred embodiment, the total size of the packet header and packet data should be less than the MTU. However, for maximum efficiency, the packet data length should be as long as possible.

[0107] In an exemplary embodiment, data in a packet header contains information that permits the subscriber client's STB 300 to decode any received data and determine if the data packet belongs to a selected data file (e.g., protocol signature, version, ID, or packet type information). The packet header may also contain other information, such as block/sub-block/packet number, packet length, cyclic redundancy check (CRC) and offset in a sub-block, and/or encoding information.

[0108] Once received by a channel server 104, data packets are sent to the QAM modulator 206 where another header is added to the data packet to generate a QAM-modulated IF output signal. The maximum bit rate output for the QAM modulator 206 is dependent on available bandwidth. For example, for a QAM modulator 206 with 6 MHz bandwidth, the maximum bit rate is 5.05 (bit/symbol)×6 (MHz)=30.3 Mbit/sec.

[0109] The QAM-modulated IF signals are sent to the up-converters 106 to be converted to RF signals suitable for a specific channel (e.g., for CATV channel 80, 559.250 MHz and 6 MHz bandwidth). For example, if a cable network has high bandwidth (or bit rate), each channel can be used to provide more than one data stream, with each data stream occupying a virtual sub-channel. For example, three MPEG1 data streams can fit into a 6 MHz channel using QAM modulation. The output of the up-converters 106 is applied to the combiner/amplifier 108, which sends the combined signal to the transmission medium 110.

[0110] In an exemplary embodiment, the total system bandwidth (BW) for transmitting “N” data streams is BW=N×bw, where bw is the required bandwidth per data stream. For example, three MPEG-1 data streams can be transmitted at the same time by a DOCSIS cable channel having a system bandwidth of 30.3 Mbits/sec because each MPEG- 1 data stream occupies 9 Mbits/sec of the system bandwidth.

[0111] Typically, bandwidth is consumed regardless of the number of subscribing clients actually accessing the DOD service. Thus, even if no subscribing client is using the DOD service, bandwidth is still consumed to ensure the on-demand capability of the system.

[0112] The STB 300, once turned on, continuously receives and updates a program guide stored in the local memory 308 of a STB 300. In an exemplary embodiment, the STB 300 displays data file information including the latest program guide on a TV screen. Data file information, such as video file information, may include movieID, movie title, description (in multiple languages), category (e.g., action, children), rating (e.g., R, PG13), cable company policy (e.g., price, length of free preview), subscription period, movie poster, and movie preview. In an exemplary embodiment, data file information is sent via a reserved physical channel, such as a channel reserved for firmware update, commercials, and/or emergency information. In another exemplary embodiment, information is sent in a physical channel shared by other data streams.

[0113] A subscribing client can view a list of available data files arranged by categories displayed on a television screen. When the client selects one of the available data files, the STB 300 controls its hardware to tune into a corresponding physical channel and/or a virtual sub-channel to start receiving data packets for that data file. The STB 300 examines every data packet header, decodes data in the data packets, and determines if a received data packet should be retained. If the STB 300 determines that a data packet should not be retained, the data packet is discarded. Otherwise, the packet data is saved in the local memory 308 for later retrieval or is temporarily stored in the buffer memory 309 until it is sent to the decoder 312.

[0114] To improve performance efficiency by avoiding frequent read/write into the local memory 308, in an exemplary embodiment, the STB 300 uses a “sliding window” anticipation technique to lock anticipated data blocks in the memory buffer 309 whenever possible. Data blocks are transferred to the decoder 312 directly out of the memory buffer 309 if a hit in an anticipation window occurs. If an anticipation miss occurs, data blocks are read from the local memory 308 into the memory buffer 309 before the data blocks are transferred to the decoder 312 from the memory buffer 309.

[0115] In an exemplary embodiment, the STB 300 responds to subscribing client's commands via infrared (IR) remote control unit buttons, an IR keyboard, or front panel pushbuttons, including buttons to pause, play in slow motion, rewind, zoom and single step. In an exemplary embodiment, if a subscribing client does not input any action for a predetermined period of time (e.g., scrolling program menu, or selecting a category or movie), a scheduled commercial is played automatically. The scheduled commercial is automatically stopped when the subscribing client provides an action (e.g., press a button in a remote control unit). In another exemplary embodiment, the STB 300 can automatically insert commercials while a video is being played. The service provider (e.g., a cable company) can set up a pricing policy that dictates how frequently commercials should interrupt the video being played.

[0116] If an emergency information bit is found in a data packet header, the STB 300 pauses any data receiving operation and controls its hardware to tune into the channel reserved for receiving data file information to obtain and decode any emergency information to be displayed on an output screen. In an exemplary embodiment, when the STB 300 is idled, it is tuned to the channel reserved for receiving data file information and is always ready to receive and display any emergency information without delay.

[0117] The foregoing examples illustrate certain exemplary embodiments of the invention from which other embodiments, variations, and modifications will be apparent to those skilled in the art. The invention should therefore not be limited to the particular embodiments discussed above, but rather is defined by the following claims.

APPENDIX A Systems and Methods for Providing Video-On-Demand Services for Broadcasting Systems

[0118] The following is a step-by-step description of the exemplary process illustrated in FIG. 4 for generating a scheduling matrix for a data file having six data blocks:

[0119] START

[0120] (Step 402) Receive a number of data blocks for a data file (x); assume the number of data blocks is equal to 6 (x=6).

[0121] (Step 404) Set j=0

[0122] (Step 406) Clear a Reference Array (RA)

[0123] (Step 408) Compare j to x.

[0124] (Step 412) j is less than x (0<6), let i=0

[0125] (Step 414) Compare i to x.

[0126] (Step 418) i is less than x (0<6). Read matrix positions of column [0] in the SM and write to RA; initially, the SM is empty so nothing is written into RA.

[0127] (Step 420) Does RA contain data block i or blk0?

[0128] (Step 422) RA does not contain anything because it is empty. Write blk0 into position [0, 0] in SM and the RA.

[0129] (Step 424) Add 1 to i (i=1) to derive value for position [1, 0]. Go back to Step 414.

[0130] (Step 414) Compare i to x.

[0131] (Step 418) i is less than x (1<6). Read matrix positions of column [1] in the SM and write to RA; initially, the SM is empty so nothing is written into RA.

[0132] (Step 420) Does RA contain data block i or blk1?

[0133] (Step 422) RA does not contain blk1. Write blk1 into position [1, 0] in SM and the RA.

[0134] (Step 424) Add 1 to i (i=2) to derive value for position [2, 0]. Go back to Step 414.

[0135] (Step 414) Compare i to x.

[0136] (Step 418) i is less than x (2<6). Read matrix positions of column [2] in the SM and write to RA; initially, the SM is empty so nothing is written into RA.

[0137] (Step 420) Does RA contain data block i or blk2?

[0138] (Step 422) RA does not contain blk2. Write blk2 into position [2, 0] in SM and the RA.

[0139] (Step 424) Add 1 to i (i=3) to derive value for position [3, 0]. Go back to Step 414.

[0140] (Step 414) Compare i to x.

[0141] (Step 418) i is less than x (3<6). Read matrix positions of column [3] in the SM and write to RA; initially, the SM is empty so nothing is written into RA.

[0142] (Step 420) Does RA contain data block i or blk3?

[0143] (Step 422) RA does not contain blk3. Write blk3 into position [3, 0] in SM and the RA.

[0144] (Step 424) Add 1 to i (i=4) to derive value for position [4, 0]. Go back to Step 414.

[0145] (Step 414) Compare i to x.

[0146] (Step 418) i is less than x (4<6). Read matrix positions of column [4] of the SM and write to RA; initially, the SM is empty so nothing is written into RA.

[0147] (Step 420) Does RA contain data block i or blk4?

[0148] (Step 422) RA does not contain blk4. Write blk4 into position [4, 0] in SM and the RA.

[0149] (Step 424) Add 1 to i (i=5) to derive value for position [5, 0]. Go back to Step 414.

[0150] (Step 414) Compare i to x.

[0151] (Step 418) i is less than x (5<6). Read matrix positions of column [5] of the SM and write to RA; initially, the SM is empty so nothing is written into RA.

[0152] (Step 420) Does RA contain data block i or blk5?

[0153] (Step 422) RA does not contain blk5. Write blk5 into position [5, 0] in SM and the RA.

[0154] (Step 424) Add 1 to i (i=6). Go back to Step 414.

[0155] (Step 414) Compare i to x.

[0156] (Step 416) i is equal to x (6=6). Increment j by 1 (j=1). Go to Step 406.

[0157] (Step 406) Clear a Reference Array (RA)

[0158] (Step 408) Compare j to x.

[0159] (Step 412) j is less than x (1<6), let i=0.

[0160] (Step 414) Compare i to x.

[0161] (Step 418) i is less than x (0<6). Read matrix positions of column [1] in the SM and write to RA. Position [1, 0] contains blk 1; thus, blk 1 is written into RA. All other positions are empty.

[0162] (Step 420) Does RA contain data block i or blk0?

[0163] (Step 422) RA does not contain blk0. Write blk0 into position [1, 1] in the SM and the RA. RA now has blk1 and blk 0.

[0164] (Step 424) Add 1 to i (i=1) to derive value for position [2, 1]. Go back to Step 414.

[0165] (Step 414) Compare i to x.

[0166] (Step 418) i is less than x (1<6). Read matrix positions of column [2] in the SM and write to RA. Position [2, 0] contains blk 2. All other positions are empty. RA now has blk1, blk 0, and blk 2.

[0167] (Step 420) Does RA contain data block i or blk1?

[0168] (Step 424) RA contains blk1. Thus, nothing is written into position [2, 1]. Add 1 to i (i=2) to derive value for position [3, 1]. Go back to Step 414.

[0169] (Step 414) Compare i to x.

[0170] (Step 418) i is less than x (2<6). Read matrix positions in column [3] of the SM and write to RA. Position [3, 0] contains blk3. All other positions are empty. RA now has blk1, blk0, blk2, and blk3.

[0171] (Step 420) Does RA contain data block i or blk2?

[0172] (Step 424) RA does contain blk2. Thus, nothing is written into position [3, 1]. Add 1 to i (i=3) to derive value for position [4, 1]. Go back to Step 414.

[0173] (Step 414) Compare i to x.

[0174] (Step 418) i is less than x (3<6). Read matrix positions of column [4] in the SM and write to RA. Position [4, 0] contains blk4. All other positions are empty. RA now has blk1, blk0, blk2, blk3, and blk4.

[0175] (Step 420) Does RA contain data block i or blk3?

[0176] (Step 424) RA does contain blk3. Thus, nothing is written into position [4, 1]. Add 1 to i (i=4) to derive value for position [5, 1]. Go back to Step 414.

[0177] (Step 414) Compare i to x.

[0178] (Step 418) i is less than x (4<6). Read matrix positions of column [5] in the SM and write to RA. Position [5, 0] contains blk5. All other positions are empty. RA now has blk1, blk0, blk2, blk3, blk4, and blk5.

[0179] (Step 420) Does RA contain data block i or blk4?

[0180] (Step 424) RA does contain blk4. Thus, nothing is written into position [5, 1]. Add 1 to i (i=5) to derive value for position [0, 1]. Go back to Step 414.

[0181] (Step 414) Compare i to x.

[0182] (Step 418) i is less than x (5<6). Read matrix positions of column [0] in the SM and write to RA. Position [0, 0] contains blk0. All other positions are empty. RA already contains blk0; thus, blk0 is discarded.

[0183] (Step 420) Does RA contain data block i or blk5?

[0184] (Step 424) RA does contain blk5. Thus, nothing is written into position [0, 1]. Add 1 to i (i=6). Go back to Step 414.

[0185] (Step 414) Compare i to x.

[0186] (Step 416) i is equal to x (6=6). Increment j by 1 (j=2). Go to Step 406.

[0187] (Step 406) Clear a Reference Array (RA)

[0188] (Step 408) Compare j to x.

[0189] (Step 412) j is less than x (2<6), let i=0.

[0190] (Step 414) Compare i to x.

[0191] (Step 418) i is less than x (0<6). Read matrix positions of column [2] in the SM and write to RA. Position [2, 0] contains blk 2. All other positions are empty. RA now has blk2.

[0192] (Step 420) Does RA contain data block i or blk0?

[0193] (Step 422) RA does not contain blk0. Write blk0 into position [2, 2] in the SM and the RA. RA now has blk2 and blk 0.

[0194] (Step 424) Add 1 to i (i=1) to derive value for position [3, 2]. Go back to Step 414.

[0195] (Step 414) Compare i to x.

[0196] (Step 418) i is less than x (1<6). Read matrix positions of column [3] in the SM and write to RA. Position [3, 0] contains blk3. All other positions are empty. RA now has blk2, blk 0, and blk 3.

[0197] (Step 420) Does RA contain data block i or blk1?

[0198] (Step 422) RA not contain blk1. Write blk1 into position [3, 2] in the SM and the RA. RA now has blk2, blk0, blk3, and blk1.

[0199] (Step 424) Add 1 to i (i=2) to derive value for position [4, 2]. Go back to Step 414.

[0200] (Step 414) Compare i to x.

[0201] (Step 418) i is less than x (2<6). Read matrix positions of column [4] in the SM and write to RA. Position [4, 0] contains blk4. All other positions are empty. RA now has blk2, blk0, blk3, blk1, and blk4.

[0202] (Step 420) Does RA contain data block i or blk2?

[0203] (Step 424) RA does contain blk2. Thus, nothing is written into position [4, 2]. Add 1 to i (i=3) to derive value for position [5, 2]. Go back to Step 414.

[0204] (Step 414) Compare i to x.

[0205] (Step 418) i is less than x (3<6). Read matrix positions of column [5] in the SM and write to RA. Position [5, 0] contains blk5. All other positions are empty. RA now has blk2, blk0, blk3, blk1, blk4, and blk5.

[0206] (Step 420) Does RA contain data block i or blk3?

[0207] (Step 424) RA does contain blk3. Thus, nothing is written into position [5, 2]. Add 1 to i (i=4) to derive value for position [0, 2]. Go back to Step 414.

[0208] (Step 414) Compare i to x.

[0209] (Step 418) i is less than x (4<6). Read matrix positions of column [0] in the SM and write to RA. Position [0, 0] contains blk0. All other positions are empty. RA already contain blk0; thus, blk0 is discarded.

[0210] (Step 420) Does RA contain data block i or blk4?

[0211] (Step 424) RA does contain blk4. Thus, nothing is written into position [0, 2]. Add 1 to i (i=5) to derive value for position [1, 2]. Go back to Step 414.

[0212] (Step 414) Compare i to x.

[0213] (Step 418) i is less than x (5<6). Read matrix positions of column [1] in the SM and write to RA. Position [1, 0] contains blk1 and position [1, 1] contains blk0. RA already contains blk1 and blk0; thus, blk1 and blk0 are discarded. All other positions are empty.

[0214] (Step 420) Does RA contain data block i or blk5?

[0215] (Step 424) RA does contain blk5. Thus, nothing is written into position [1, 2]. Add 1 to i (i=6). Go back to Step 414.

[0216] (Step 414) Compare i to x.

[0217] (Step 416) i is equal to x (6=6). Increment j by 1 (j=3). Go to Step 406.

[0218] (Step 406) Clear a Reference Array (RA)

[0219] (Step 408) Compare j to x.

[0220] (Step 412) j is less than x (3<6), let i=0.

[0221] (Step 414) Compare i to x.

[0222] (Step 418) i is less than x (0<6). Read matrix positions of column [3] in the SM and write to RA. Position [3, 0] contains blk3 and position [3, 2] contains blk1. Blk3 and blk1 are written into RA. All other positions are empty.

[0223] (Step 420) Does RA contain data block i or blk0?

[0224] (Step 422) RA does not contain blk0. Write blk0 into position [3, 3] in the SM and the RA. RA now has blk3, blk1, and blk0.

[0225] (Step 424) Add 1 to i (i=1) to derive value for position [4, 3]. Go back to Step 414.

[0226] (Step 414) Compare i to x.

[0227] (Step 418) i is less than x (1<6). Read matrix positions of column [4] in the SM and write to RA. Position [4, 0] contains blk 4. All other positions are empty. RA now has blk3, blk 1, blk 0 and blk 4.

[0228] (Step 420) Does RA contain data block i or blk1?

[0229] (Step 424) RA contains blk1. Thus, nothing is written into position [4, 3]. Add 1 to i (i=2) to derive value for position [5, 3]. Go back to Step 414.

[0230] (Step 414) Compare i to x.

[0231] (Step 418) i is less than x (2<6). Read matrix positions of column [5] in the SM and write to RA. Position [5, 0] contains blk5. All other positions are empty. RA now has blk3, blk1, blk0, blk4, and blk5.

[0232] (Step 420) Does RA contain data block i or blk2?

[0233] (Step 422) RA does not contain blk2. Write blk2 into position [5, 3] in the SM and the RA. RA now has blk3, blk1, blk0, blk4, blk5, and blk2.

[0234] (Step 424) Add 1 to i (i=3) to derive value for position [0, 3]. Go back to Step 414.

[0235] (Step 414) Compare i to x.

[0236] (Step 418) i is less than x (3<6). Read matrix positions of column [0] in the SM and write to RA. Position [0, 0] contains blk0. All other positions are empty. RA already contains blk0; thus, discard blk0.

[0237] (Step 420) Does RA contain data block i or blk3?

[0238] (Step 424) RA does contain blk3. Thus, nothing is written into position [0, 3]. Add 1 to i (i=4) to derive value for position [1, 3]. Go back to Step 414.

[0239] (Step 414) Compare i to x.

[0240] (Step 418) i is less than x (4<6). Read matrix positions of column [1] in the SM and write to RA. Position [1, 0] contains blk1 and position [1, 1] contains blk0. All other positions are empty. RA already contains blk 1 and blk0; do not write a duplicate copy.

[0241] (Step 420) Does RA contain data block i or blk4?

[0242] (Step 424) RA does contain blk4. Thus, nothing is written into position [1, 3]. Add 1 to i (i=5) to derive value for position [2, 3]. Go back to Step 414.

[0243] (Step 414) Compare i to x.

[0244] (Step 418) i is less than x (5<6). Read matrix positions of column [2] in the SM and write to RA. Position [2, 0] contains blk2 and position [2, 2] contains blk 0. All other positions are empty. RA already contains blk2 and blk0; do not write a duplicate copy.

[0245] (Step 420) Does RA contain data block i or blk5?

[0246] (Step 424) RA does contain blk5. Thus, nothing is written into position [2, 3]. Add 1 to i (i=6). Go back to Step 414.

[0247] (Step 414) Compare i to x.

[0248] (Step 416) i is equal to x (6=6). Increment j by 1 (j=4). Go to Step 406.

[0249] (Step 406) Clear a Reference Array (RA)

[0250] (Step 408) Compare j to x.

[0251] (Step 412) j is less than x (4<6), let i=0.

[0252] (Step 414) Compare i to x.

[0253] (Step 418) i is less than x (0<6). Read matrix positions of column [4] in the SM and write to RA. Position [4, 0] contains blk4. Blk4 is written into RA. All other positions are empty.

[0254] (Step 420) Does RA contain data block i or blk0?

[0255] (Step 422) RA does not contain blk0. Write blk0 into position [4, 4] in the SM and the RA. RA now has blk4 and blk0.

[0256] (Step 424) Add 1 to i (i=1) to derive value for position [5, 4]. Go back to Step 414.

[0257] (Step 414) Compare i to x.

[0258] (Step 418) i is less than x (1<6). Read matrix positions of column [5] in the SM and write to RA. Position [5, 0] contains blk5 and position [5, 3]contains blk2. All other positions are empty. RA now has blk4, blk0, blk 5, and blk2.

[0259] (Step 420) Does RA contain data block i or blk1 ?

[0260] (Step 422) RA does not contain blk1. Write blk1 into position [5, 4] of the SM and the RA. RA now has blk4, blk0, blk5, blk2, and blk1.

[0261] (Step 424) Add 1 to i (i=2) to derive value for position [0, 4]. Go back to Step 414.

[0262] (Step 414) Compare i to x.

[0263] (Step 418) i is less than x (2<6). Read matrix positions of column [0] in the SM and write to RA. Position [0, 0] contains blk0. All other positions are empty. RA already contains blk0; thus, do not write a duplicate copy.

[0264] (Step 420) Does RA contain data block i or blk2?

[0265] (Step 424) RA does contain blk2. Add 1 to i (i=3) to derive value for position [1, 4]. Go back to Step 414.

[0266] (Step 414) Compare i to x.

[0267] (Step 418) i is less than x (3<6). Read matrix positions of column [1] in the SM and write to RA. Position [1, 0] contains blk1 and position [1, 1] contains blk0. All other positions are empty. RA already contains blk1 and blk0; do not write a duplicate copy.

[0268] (Step 420) Does RA contain data block i or blk3?

[0269] (Step 422) RA does not contain blk3. Write blk3 into position [1, 4] of the SM and the RA. RA now has blk4, blk0, blk5, blk2, blk1, and blk3.

[0270] (Step 424) Add 1 to i (i=4) to derive value for position [2, 4]. Go back to Step 414.

[0271] (Step 414) Compare i to x.

[0272] (Step 418) i is less than x (4<6). Read matrix positions of column [2] in the SM and write to RA. Position [2, 0] contains blk2 and position [2, 2] contains blk0. All other positions are empty. RA already contains blk2 and blk0; do not write a duplicate copy.

[0273] (Step 420) Does RA contain data block i or blk4?

[0274] (Step 424) RA does contain blk4. Thus, nothing is written into position [2, 4]. Add 1 to i (i=5) to derive value for position [3, 4]. Go back to Step 414.

[0275] (Step 414) Compare i to x.

[0276] (Step 418) i is less than x (5<6). Read matrix positions of column [3] in the SM and write to RA. Position [3, 0] contains blk3, position [3, 2] contains blk1, and position [3, 3] contains blk0. All other positions are empty. RA already contains blk3, blk1, and blk0; do not write a duplicate copy.

[0277] (Step 420) Does RA contain data block i or blk5?

[0278] (Step 424) RA does contain blk5. Thus, nothing is written into position [3, 4]. Add 1 to i (i=6). Go back to Step 414.

[0279] (Step 414) Compare i to x.

[0280] (Step 416) i is equal to x (6=6). Increment j by 1 (j=5). Go to Step 406.

[0281] (Step 406) Clear a Reference Array (RA)

[0282] (Step 408) Compare j to x.

[0283] (Step 412)j is less than x (5<6), let i=0.

[0284] (Step 414) Compare i to x.

[0285] (Step 418) i is less than x (0<6). Read matrix positions of column [5] in the SM and write to RA. Position [5, 0] contains blk5, position [5, 3] contains blk2, and position [5, 4] contains blk1. Blk5, blk2, and blk1 are written into RA. All other positions are empty.

[0286] (Step 420) Does RA contain data block i or blk0?

[0287] (Step 422) RA does not contain blk0. Write blk0 into position [5, 5] in the SM and the RA. RA now has blk5, blk2, blk1, and blk0.

[0288] (Step 424) Add 1 to i (i=1) to derive value for position [0, 5]. Go back to Step 414.

[0289] (Step 414) Compare i to x.

[0290] (Step 418) i is less than x (1<6). Read matrix positions of column [0] in the SM and write to RA. Position [0, 0] contains blk0 and all other positions are empty. RA now has blk5, blk2, blk1, and blk0.

[0291] (Step 420) Does RA contain data block i or blk1?

[0292] (Step 424) RA does contain blk1. Add 1 to i (i=2) to derive value for position [1, 5]. Go back to Step 414.

[0293] (Step 414) Compare i to x.

[0294] (Step 418) i is less than x (2<6). Read matrix positions of column [1] in the SM and write to RA. Position [1, 0] contains blk 1, position [1, 1] contains blk0, and position [1, 4] contains blk3. All other positions are empty. RA already contains blk0 and blk1; thus, do not write a duplicate copy. Write blk3 into RA. RA now has blk5, blk2, blk2, blk1, blk0, and blk3.

[0295] (Step 420) Does RA contain data block i or blk2?

[0296] (Step 424) RA does contain blk2. Add 1 to i (i=3) to derive value for position [2, 5]. Go back to Step 414.

[0297] (Step 414) Compare i to x.

[0298] (Step 418) i is less than x (3<6). Read matrix positions of column [2] in the SM and write to RA. Position [2, 0] contains blk2 and position [2, 2] contains blk0. All other positions are empty. RA already contains blk2 and blk0; do not write a duplicate copy.

[0299] (Step 420) Does RA contain data block i or blk3?

[0300] (Step 424) RA does contain blk3. Add 1 to i (i=4) to derive value for position [3, 5]. Go back to Step 414.

[0301] (Step 414) Compare i to x.

[0302] (Step 418) i is less than x (4<6). Read matrix positions column [3] in the SM and write to RA. Position [3, 0] contains blk3, position [3, 2] contains blk1, position [3, 3] contains blk0. All other positions are empty. RA already contains blk3, blk1, and blk0; do not write a duplicate copy.

[0303] (Step 420) Does RA contain data block i or blk4?

[0304] (Step 422) RA does not contain blk4. Write blk4 into position [3, 5] of the SM and the RA. The RA now has blk5, blk2, blk1, blk0, blk3, and blk4.

[0305] (Step 424) Add 1 to i (i=5) to derive value for position [4, 5]. Go back to Step 414.

[0306] (Step 414) Compare i to x.

[0307] (Step 418) i is less than x (5<6). Read matrix positions of column [4] in the SM and write to RA. Position [4, 0] contains blk4 and position [4, 4] contains blk0. All other positions are empty. RA already contains blk4 and blk0; do not write a duplicate copy.

[0308] (Step 420) Does RA contain data block i or blk5?

[0309] (Step 424) RA does contain blk5. Thus, nothing is written into position [3, 4].

[0310] (Step 424) Add 1 to i (i=6). Go back to Step 414.

[0311] (Step 414) Compare i to x.

[0312] (Step 416) i is equal to x (6=6). Increment j by 1 (j=5). Go to Step 406.

[0313] (Step 406) Clear a Reference Array (RA)

[0314] (Step 408) Compare j to x.

[0315] (Step 410) j is equal to x (6=6); END.

Referenced by
Citing PatentFiling datePublication dateApplicantTitle
US7878908 *Nov 14, 2002Feb 1, 2011Nintendo Co., Ltd.Multiplexed secure video game play distribution
US8488942 *Jun 28, 2010Jul 16, 2013Cox Communications, Inc.Bookmark exchange
US20110317979 *Jun 28, 2010Dec 29, 2011Cox Communications, Inc.Bookmark exchange
Classifications
U.S. Classification709/219, 348/E07.071, 348/E05.008, 348/E05.003, 348/E05.004
International ClassificationH04N7/173, H04N21/482, H04N21/418, H04N21/84, H04N21/845, H04N21/433, H04N21/2385, H04N21/472, H04N21/262, H04N5/765, H04N7/025, H04N7/08, H04N7/081, H04L29/06, H04N7/03, H04L29/08, H04N7/035
Cooperative ClassificationY10S707/99948, Y10S707/99945, H04N21/472, H04N21/4181, H04N21/4331, H04N21/47202, H04N21/26233, H04N21/26216, H04N21/482, H04N21/84, H04N7/17318, H04N21/845, H04N21/2385, H04N21/26275, H04N21/262, H04N21/26241, H04L29/06027, H04L65/607, H04L65/4084, H04L65/4092, H04L67/06, H04L65/4076, H04L67/42
European ClassificationH04N21/262C4, H04N21/262S, H04N21/262, H04N21/262C3, H04N21/845, H04N21/262C1, H04N21/84, H04N21/472, H04N21/433C, H04N21/2385, H04N21/472D, H04N21/418C, H04N21/482, H04L29/08N5, H04N7/173B2, H04L29/06M6E, H04L29/06M4S2, H04L29/06M4S4, H04L29/06M4S6