TH65951A - An on-demand broadcast matrix that reduces downtime and consumes constant bandwidth. - Google Patents

Abstract

DC60 (04/02/46) This describes a method and system for reducing scheduling matrices that uses file division into data blocks. After the scheduling matrix is created, the scheduling time in the matrix is reduced by replacing it with the data block next to that scheduling time, while maintaining the original block transmission order from the original scheduling matrix. This process is repeated until a scheduling matrix with reduced scheduling time is obtained. The operation of a set-top box designed for these data blocks is also described. A set-top box designed for these data blocks.

Claims (35)

1. A method of applying computer technology for universal data broadcasting involves preparing a delivery matrix that determines the optimal sequence for transmitting data files to the desired recipients. These recipients do not need to specify their requirements to the server. The bandwidth required for transmitting the requested data files is independent of the number of recipients. 2. The computer application method claimed in Clause 1, when constructing the transmission matrix, consists of the following actions: Preparing a first scheduling matrix, a matrix suitable for transmitting the first data file, where this first data file is represented by the first group of data blocks. This first scheduling matrix arranges the first sequence for transmitting these first group of data blocks sequentially within a number of time slots, so that when any server receives the transmission of the first data file according to the first scheduling matrix, it can begin accessing the first data file within one time slot. 3. The application of computing as claimed in point 2, when the first scheduling matrix is a constant bandwidth scheduling matrix. 4. The application of computing as claimed in clause 3, when a constant amount of data from the first data block is delivered within the allocated bandwidth period. 5. Methods of computer application as claimed in Clause 4, where control of transmission over the allocated bandwidth period is performed by a low-level hardware device. 6. The application of computing as claimed in paragraph 3, when the first scheduling matrix is a variable bandwidth scheduling matrix. 7. A computer application is used to create a scheduling matrix that reduces idle time and uses a constant bandwidth for data transmission as needed, without the receiver having to specify the requirements to the server. This computer application involves the following steps: 1. Create a suitable scheduling matrix for transmitting the first data file, which is represented by the first data block. This scheduling matrix prepares the first sequence for transmitting this first data block within a certain time slot, so that any receiver that receives the first data file according to this scheduling matrix can begin accessing it within one time slot. 2. Determine the required constant bandwidth for transmission. This constant bandwidth is used to transmit the stream of data blocks in the sequence specified in the first scheduling matrix. 8. The application of computers to control set-top boxes (STBs) involves the following actions: receiving digital data from more than one channel and receiving an electronic program guide (EPG) detailing the data transmission for each channel. When one of these channels has a data-on-demand program, which is used to provide data on request without the STB needing to specify the request to the server, the EPG contains a first data file represented by a first data block. This first data block is prepared sequentially within a certain time frame so that a user of the universal STB can access this first data file at any time within that time frame. The EPG data is then prepared for the user of the universal STB, and commands are received to process the data. From the user of the aforementioned universal set-top box (STB) who wishes to access the first data file and execute the command received from the user of the aforementioned universal set-top box (STB). 9. The computer application method as claimed in Clause 8, when using such instructions received from the user of the universal set-top box (STB), consists of the following actions: adjusting the STB channel to the first channel to select the data the user wishes to process, the first data block; upon receiving the first data block, such processing consists of at least one of the following actions: decoding the received data block; decompressing the received data block; reassembling the received data block as necessary; and storing the received data block in the memory of the set-top box (STB); and preparing the first data file for the output device selected by the user of the universal set-top box (STB). 10. The application of the computer as claimed in clause 9 when the output device is a television. 11. The application of the computer as claimed in Article 9 when the output device is a display monitor. 12. The application of the computer as claimed in Article 9 when the output device is a video cassette recorder (VCR). 13. The application of the computer as claimed in Article 9 when such output device is a computer device. 14. The application of computing as claimed in Clause 8, when the first group of data blocks has been provided, uses a constant bandwidth to receive a fixed number of data blocks in each time slot. 15. The application of computers for universal digital data broadcasting consists of the following actions: At the universal digital data broadcasting system or server, the following actions are performed: A transmission matrix is prepared, specifying the optimal data transmission order for broadcasting on-demand data to more than one server receiver, where the server receiver does not need to specify its requirements to the server (universal digital data broadcasting system). When the on-demand data transmission requires a bandwidth that is independent of the number of server receivers, a suitable first channel server is prepared for transmitting the on-demand data through the first channel before broadcasting. This first channel server is prepared for transmitting the on-demand data message. This preparation of the first channel server includes recording the transmission matrix into the server's memory and recording the data blocks prepared for transmission by the transmission matrix into the same memory of the first channel server. An Electronic Program Guide (EPG) containing the on-demand data message is sent. The first signal, and the receiver or universal set-top box (STB) of the subscriber, performs the following actions: receives digital data from the first channel and from the EPG; prepares the EPG data for the subscriber of the universal set-top box (STB); receives processing commands from the subscriber of the universal set-top box (STB); and executes the processing commands received from the subscriber of the universal set-top box (STB). 16. The method of applying the computer as claimed in paragraph 15 when constructing the transmission matrix consists of the following actions: A suitable first schedule matrix is prepared for the transmission of the first data file, whereby the first data file is represented by the first group data block. The first schedule matrix prepares the first sequence for the transmission of the first group data block in sequence within a certain time slot so that any server receiving the transmission of the data file according to the first schedule matrix can begin accessing the first data file within one time slot. 17. The application of computing as claimed in paragraph 16, when the first scheduling matrix is a scheduling matrix that uses a fixed bandwidth. 18. The application of computing as claimed in Article 17, where a fixed number of data blocks are scheduled for transmission in each time slot. 19. The application of computing as claimed in paragraph 15, when the first scheduling matrix is a scheduling matrix that uses adaptive bandwidth. 20. A data delivery matrix is formed by dividing a data file into a certain number of data blocks. These data blocks are then arranged in a specified order using the following steps: a) Divide the data file into the specified number of data blocks. b) Set the value of the first variable to zero. c) Clear the values stored in the reference array (RA). d) Compare the first variable to the total number of data blocks. e) If the first variable is less than the total number of data blocks, set the second variable to zero. f) Compare the second variable to the total number of data blocks. g) If the second variable is less than the total number of data blocks, store one or more data blocks stored in one column of the delivery matrix in the reference array. This column is column [(i+j) mod (x)], where i is the second variable, j is the first variable, and x is the number of data blocks. h) If the reference array contains the stored data blocks, As already mentioned, at least one block does not need to be saved. The stored data block does not need to be saved again. ฌ) Check if the array contains a data block with the number matching the second variable. ญ) If the array does not contain such a data block with the number matching the second variable, that data block is added to the array and to the scheduling matrix at position [(i+j) mod (x) j], and the second variable is incremented by one. ฎ) If the array contains a data block with the number matching the second variable, increment the second variable by one. ฏ) Repeat steps ฌ) through ฌ) until the second variable equals the total number of data blocks. ฐ) Increment the first variable by one. ฑ) Repeat steps ฌ) through ฌ) until the first variable equals the total number of data blocks. ฆ) Rearrange the scheduling matrix into the stream. When the sequence is sent repeatedly as a signal over the medium with the bandwidth allocated to the data file, Once that bandwidth has been fully utilized by the repeated signals, 21. The data transmission matrix as claimed in Clause 20, when the matrix allocation procedure is redefined in the stream, involves determining the size of the bandwidth allocated to the data file. 22. The data transmission matrix as claimed in clause 21, where the sizing of such bandwidth to such data file results in the minimum possible bandwidth. 23. The data transmission matrix as claimed in clause 21, where the bandwidth is sized for the data file as follows, maximizes that bandwidth. 24. A data delivery system that has a data stream derived from the data delivery matrix as claimed in clause 20, when such data file contains more than one different data file. 25. A method for applying computer technology to transmit data files on demand, comprising: preparing a transmission matrix that defines an appropriate repeating data transmission sequence for broadcasting data signals through a transmission medium to more than one client device, where these client devices do not need to specify their requirements to the server. This transmission matrix preparation also includes dividing the data file into a number of data blocks, with at least one block being the first, and assigning the order of these blocks to the repeating sequence. When a client receives this repeating sequence, they begin using the data file without interruption immediately upon receiving the first data block. This repeating sequence requires a pre-defined bandwidth and minimizes downtime. Furthermore, the on-demand data transmission requires a certain amount of transmission bandwidth independent of the number of client devices. 26. A method for applying computer applications for the transmission of data files as claimed in Clause 25, where such repeated data transmission sequences are transformed into a new scheduling matrix with a decreased idle time. 27. A method of applying computing for the transmission of data files as requested in Clause 25, where the transmission sequence is repetitive and has a constant bandwidth. 28. The application of computing for the transmission of data files as requested in Clause 27, when a fixed number of such data blocks have been scheduled for transmission in each time slot. 29. A method of applying computing for the transmission of data files as requested in Clause 27, where such transmission sequence has adaptive bandwidth. 30. The application of computers for universal data broadcasting consists of the following actions: Preparing a defined transmission matrix and the optimal transmission sequence for broadcasting on-demand data to more than one client client, where the client client does not need to specify the requirements to the server. The bandwidth required for on-demand data transmission is independent of the number of clients, and the bandwidth utilization is optimized. Preparing a suitable first channel server to transmit the on-demand data through the first channel before broadcasting. This preparation of the first channel server for transmitting the on-demand message includes: Recording the transmission matrix into the first channel server's memory and recording the scheduled data blocks for transmission by the transmission matrix into the first channel server's memory. Sending an electronic program guide (EPG) containing the information indicating the on-demand data available on the first channel, and transmitting the data through the first channel. The second channel, as mentioned above, and the user's universal set-top box (STB), perform the following functions: receiving digital data from the first channel and the EPG; preparing the EPG data for the user of the universal set-top box (STB); receiving data processing commands from the user of the universal set-top box (STB); and executing the commands received from the user of the universal set-top box (STB). 31. The method of applying the computer as claimed in paragraph 30 when constructing the transmission matrix consists of the following: A first scheduling matrix is prepared that is appropriate for transmitting the first data file, where such first data file is represented by the first group of data blocks. The first scheduling matrix prepares the first sequence of transmissions of such first data blocks in order within a certain time slot so that any server receiving such first data file according to the scheduling matrix can begin accessing such first data file within one time slot. 32. The application of computing as claimed in paragraph 31 when the first scheduling matrix is a fixed-bandwidth scheduling matrix. 33. The application of the computer as claimed in paragraph 32, when a fixed number of blocks of the first data group are scheduled for transmission in each time slot. 34. The application of computing as claimed in Article 30, when the first scheduling matrix is a bandwidth-adjustable scheduling matrix. 35. A method for applying computing to create a scheduling matrix that minimizes wasted time and uses a constant, optimal bandwidth for requesting data transmission without the client's receiver needing to provide detailed requirements to the server. This method involves the following actions: Create a suitable scheduling matrix for transmitting the first data file, represented by the first data block. The first scheduling matrix prepares the first sequence for transmitting this first data block sequentially within a certain time slot, so that any receiver receiving the first data file according to the first scheduling matrix can begin accessing it within one time slot. Set a constant bandwidth for the required transmission. Once this constant bandwidth is allocated, a fixed number of data blocks are transmitted in each time slot, and for subsequent time slots, the sequential number of data blocks to be transmitted is selected equal to the fixed number of blocks allocated. Loop the transmission back to the beginning of the first sequence of the first data block transmission. Schedule the entire transmission of the first sequence of data blocks in the first group, utilizing the constant bandwidth as optimally as possible.