TWI244869B - Data-on-demand digital broadcast system utilizing prefetch data transmission - Google Patents

Abstract

A method and system for a decreased idle time scheduling matrix for a data file reduced into data blocks. A scheduling matrix is generated and idle time is filled with data blocks that appear later in the matrix, keeping with the original sequence of data blocks. This is then repeated, or equally a new decreased idle time scheduling matrix is created. A preloading stream can be configured from the decreased time scheduling matrix. Specially designed set-top boxes are then described which can received these data blocks. In a preferred embodiment the set-top box can store a continuously broadcast and optimized preloading stream for increased bandwidth savings.

Description

— 4244869 V. Description of the invention (1) [Technical field to which the invention belongs] _ Sui Xi Xuan Shi: Kong Yixin " "', V0D) system is a kind of DOD. In the vOD system, The video server or server network is provided to one or Tada II. Based on the full understanding of the artisans. ^ Evening users. This system is skilled [prior art] In the conventional VOD structure, one Server or quasi-level user and server type communication. For example, Lu Erkang's data request to a health device (such as a video to output :: In response to the user's request, the server sends the requested file to Liangtian Provided by a quasi-server. The user may store the information received by any user or any of the users in a #storage memory for later use. The user-server model can be a bi-directional jCommunication facilities. Currently, new facilities need to be established for two-way communication because the existing cable cables can only provide one-way communication. Two-way communication facilities are not available, and their service effects may not satisfy most users. ) To provide v〇d service imr wide, There are many restrictions on the type of standard user server. The mechanism of continuously listening and satisfying every request from each user. Because the number of users who can receive services depends on the capacity of this mechanism. There is a system to use A large number of parallel processing computers have a large and fast hard disk array as the ^ server. However, even the fastest existing local server can only

Page 6 1244869 ^ V. Description of the invention (2) "" ata stFeainS) is given to about 1,000-2000 users. Because a: more users, the number of local servers requires more high-level feeders to maintain local feeding :: box ^ ί The other is limited to one receiver set-top box (SeH〇p- Γ 之 i Before the video of this service, ② download the server ™ down: 'Even with a fast download speed, the delay in downloading considerable data for playing the selected 0D may be significant and not feasible. Another limitation of the user's feeding device type is that each user needs to have and self-buffer (c see the total bandwidth required by the two factors Λ 'is proportional to the number of users signed up. Pp ac e η 自 fe body coordination The limitation of the local feeder was used but the buffer memory is also limited, so it cannot be resolved; see the title. # # = Ί For more on-demand video services to meet more users, the existing service == = Add the proportion of users of each local feeding device to more than the local supply m. Use: If a local shrine serving device can provide a service contract, it must be serviced. 10,000 users. If most of them sign When the video service is ordered when * = ^, this technology may be available. However, this (example = 1ΐ Er and set up Because most users like to pick up at the same time. (TV or weekend) to watch TV, so the local server is overloaded with any :: media port: f provides-a kind of system that can be passed without replacing existing facilities. k provides 1 ^ selected services to a large number of users without significant delay. Page 7 1244869 V. Description of the Invention (3) [Summary of the Invention] The present invention teaches a system and method for providing a reduction in access time through an existing DOD system. Data-on-Demand (DOD) service. The present invention also teaches a system and method to provide DOD services via reduced bandwidth. In an exemplary embodiment, on a server side, data is transmitted to a user to provide data-on-demand The service method includes the following steps: providing a linear sequence that reduces idle time and includes a data block of a selected DOD service; and removes the most frequently used data block sequence that reduces idle time Appearing data blocks; placing the removed frequently appearing data blocks in a pre-fetch material stream (make the pre-fetch data stream include In the selected]) 〇D pre-fetched data block of the service; transmitting the pre-fetched data stream via the transmission medium; and transmitting the rest of the data block sequence that reduces idle time via the transmission medium, so that the receiving device can combine the rest The data block sequence for reducing idle time and the pre-fetched shell material block to generate the selected DOD service, thus reducing the bandwidth required to transmit the DOD service. This DOD broadcast server method further includes ... Remove most of the remaining data blocks from the $ = idle time data block; · Place the 'S ί f remaining data blocks in the prefetched data stream so that the prefetched data string' appears most often The data block and its corresponding data block corresponding to the selected DOD service; and the rest of the data to reduce the idle time are transmitted via the transmission medium. Therefore, the sequence and the prefetched data block to generate the selected DOD service The bandwidth required to transmit the DOD service. ~ In the exemplary embodiment, at the client, the processing is received from a servo

1244869 V. Description of the invention (4) The method for the device to provide on-demand data services includes the following steps: receiving a pre-fetched data stream corresponding to the selected DOD service including pre-fetched data blocks; storing the pre-fetched data blocks At a memory location; receiving the original data stream corresponding to the selected DOD service, including the original data block; and processing the original data block and the pre-fetched data block to enable a user to access the selected DOD service. This method may further include receiving an instruction from the user for all services provided by the user; go to a channel corresponding to the selected DOD service to respond to the use of the = input, and from the service corresponding to the selected service. The channel receives the raw data stream. In one embodiment, the method for processing data received from a server is performed by a set-top box on the client side. A lean-on-demand system includes a first set of channel servers, a central control server to control the first set of channel servers, an additional set of f, coupled to the first set of channel servers A combiner / amplifier port to the first set of boosters, and a combiner / amplifier is suitable for transmitting breeding material through a j-body. In an exemplary embodiment, the on-demand data is,)! The I f includes a channel monitoring module to monitor the system, a switching array ^ f a set of channel servers and a second set of frequency boosters. When the system occurs: The monitoring channel monitoring module is used to report to the central control server. The server responded to the report from the channel monitoring module of the system. 11 Second, the array changed one of the first channel server's faulty channel server into one of the two channel server's one channel server, and The first-frequency =. Replace the faulty frequency booster with one of the second frequency booster.

An example teaches a general STB, which can receive and process

1244869 V. Description of the invention (5) A group of digital servers such as V0D and digital broadcasting. This highly flexible architecture can handle the connection skillfully: the data is universally used The architecture includes-the data bus,-the first communication receiver. This letter medium—memory typically includes two-way: sink = long-term temporary memory, a digital decoder, two-way light, fast, and a central processing unit (CPU), which is bidirectionally coupled to data, and & Row. The cpu of this embodiment of the present invention provides ST, /, / examples Γ; a bit decoder and the demodulator. Fine control

The program can receive the parallel-data stream that originates from-reduction of the idle time sorting matrix. It also does not receive such data blocks. A Pu π ΐ 实 ί ί ”, the complex STB architecture allows a data stream of the most STR of the data block to be broadcasted and loaded into an idle, preload of a specific lean block. Entering an STB allows frequency-saving to be seen within a limited time. The pre-loaded (or pre-fetched) data stream can be scheduled based on the requirements of vOd to predeHver different data at the same time. [Embodiment] FIG. 1A shows an exemplary system of one embodiment of the present invention. The system 丨 00. In this embodiment, the DOD system 100 provides a selected data file, such as a video file. The DOD system 100 is not limited to providing selected video files, but can also provide other data files, such as on-demand movie files. The DOD system includes a central control server 102. A central storage 103, a group of channel servos 10 "-104, five, invention description (6), a group of frequency boosters 106a-106n, a combiner / amplifier 108. The central control server 102 controls the channel server 丨 〇 4. Central storage 丨 〇 3 Save data files in digital format. In an exemplary embodiment, the data file stored in the central storage 103 may be any authorized computer such as a central control server connected to a network via a standard network interface such as an Ethernet link ) Access. Each channel server 104 is assigned a channel and is coupled to the ^ Zeng frequency 1 106. The channel server 104 provides a data file taken from the central storage 103 according to the instructions from the central control server 102. The output of each channel server 104 is a quadrupole modulated (QAM) modulated intermediate frequency (if) signal with a suitable frequency for the frequency response booster 106 of Xiangying. The qAM modulated IF signal is related to the σ standard used. The current standard in the United States is the DOCSIS standard for data on cable systems, which requires an IF frequency of about 43.75MHz. The frequency booster 106 will be received from the channel server; [04's IFMt number is converted to radio frequency ^ (RF signal). The RF signal contains frequency and broadband, which are related to the desired channel and the standard used. For example, in the current US cable television channel 80, the RF signal has a frequency of about 5 59 · 25 MHz and a bandwidth of about ⑽H2. The output of the frequency booster 106 is supplied to the combiner / amplifier 08. The combiner / amplifier 108 adjusts and combines the received RF signals and outputs the signals to the transmission medium 11. b In an exemplary embodiment, the central control server 丨 0 2 includes a edge map user interface (not shown) to enable a service provider to perform a pick and place (drag and and (¾ r ο p) operation to sort data Distribution. Further, the central control feeding device 102 confirms and controls the channel feeding device 104 to start and stop according to the distribution matrix. In an exemplary embodiment, the central control server 丨 02 is automatically selected

I244 «69 V. Description of Invention (7) 'One channel and calculate distribution matrix to transmit data files on a selected channel. The central control server 102 provides offline addition, deletion, and update of information (such as duration, type, level, or / and brief description). In addition, the control feed 102 is controlled to update the data files stored therein, and the central storage 103 is controlled. In an inconsistent embodiment, an existing cable television system 20 will continue to feed signals to the coupler / amplifier 108 to Provide non-DOD services to users. Therefore, the DOD system 100 according to an embodiment of the present invention does not interrupt existing cable television services.

FIG. 1β shows an exemplary DOD system 100 according to another embodiment of the present invention. In addition to the components shown in Figure 1A, the D0D system includes a switch matrix 112, a channel monitoring module 11 14, a backup channel server 丨 J h — 丨 丨 6b, and a backup frequency booster 11 8a -118b. In one embodiment, the switch matrix 112 is physically located between the frequency increaser 106 and the combiner / amplifier 108.

The switch matrix 112 is controlled by a central control server J 02. The channel monitoring module 114 includes a group of tangible set-top boxes for detecting users on the side and monitoring the goodness of the DOD system 100. The result of monitoring is the channel monitor module 丨 j *, which is provided to the central control server 102. In the case of a channel failure (such as a channel servo damage, an increased channel damage, or a communication connection damage), the central control server 102 disconnects the failed component via the switch matrix i 丨 2 and connects a good spare component 11 6 and / or j 8 to resume service. In an exemplary embodiment, the data file broadcast from the DOD system is included in the file of the film expert group (MPEG). Each comment ^: 0 files are automatically divided into data = blocks and sub-blocks, which are mapped to specific parts of the data file along the time axis. The shell material block and the sub-block are the three-dimensional analysis provided by the central control server.

Page 12

1244869 V. Description of the invention (8) The matrix is sent out within the predetermined time. For a DOD system that provides DOD services, there is no longer a need to give back channels. G 'stone W Hg channel can be used for other purposes, such as charging or providing Internet services. Figure 2 shows an exemplary channel servo 1 according to an embodiment of the invention. 4. The channel server 104 includes a servo controller 20, a CPU 204, a QAM modulator 206, a local memory 208, and a network interface 210. The servo controller 2 0 instructs the CPU 2 0 4 to divide the data file into blocks (further divided into sub-blocks and data packets, and selects the data block according to the distribution matrix provided by the central control fJ device 102. It transmits, encodes the selected data, compresses the encoded data, and then distributes the compressed data to the QAM module 206 to control the overall operation of the channel feeder 104. The QAM module 206 passes a bus ^^ PC I, CPU local bus) or Internet link to receive the data to be transmitted. In an exemplary embodiment, the QAM modulator may include a downstream C ^^ ream) QAM modulator, an upstream quadrupole amplitude modulation / quadrupole phase shift modulation: Qpsk) a burst demodulator with forward error correction decoding , And / ^ ^ 11 2 〇 6 ^ ^ ^ ^ ^ ^ ^ ^ 1 04 2 罔 Yu Lu ^ Interface 21 〇 Connect the channel server 1 04 to other channel server crying sequence and ^^ Division Server 1〇 2 to execute from the central control feeder ^ and since the central control η: 'report the situation to the central control server 102, the data is received at the next time. Any of the data taken from the central storage 103 can be stored in the local memory 208 in accordance with the instructions from the temple controller 202 in the private example. In-exemplary implementation ^ the member feeding device m can be based on the bandwidth of the electrical channel (such as 6 65 or "

1244869 V. Description of the invention (9) 8MHz) 'QAM modulation (such as QAM64 or “heart” and —β⑽ data stream pressure, ^ quasi ^ bit rate (ie MPEG — or rated _2) bandwidth (Such as 6.65 or 8MΠζ) send one or more D0]) data stream. # 以 = 2members show a universal set-top box (STB) 300 according to an embodiment of the present invention. = ㈣〇 Contains __ demodulator 3〇2, ―cpu3〇4, a local memory 4, 4 grade memory, a decoder 312 with video and audio decoding 3, and Chongfeng module 314, a user interface 318 、 Communication chain system 'Long Liu Pai 322 decodes these elements into CP_2 as shown in the figure, decompresses the decoded data, reassembles the decoded 3U Λ stores the decoded data in the bureau • memory 308 or buffer memory Middle / post is to send ^ data to the decoder 312. In an exemplary embodiment, the large size 3m contains non-volatile memory (such as a hard disk), and the buffer magnification is 3 1 0, which already contains volatile memory. Listed in the example 'QAM demodulator 302 includes transmitting and receiving modules and below) Force: Multi-component: Encryption / Decryption Module, Forward Error Correction Decoding ScuJl Control, Downstream and Upstream Processors, CPU Remember the interface number to save the data. No. w Yueyi, sampling and demodulating this letter The access has been approved, and the decoder 312 is displayed.]: Block decoding to convert the poor blocks into output screen. Second: Xiangxian decoding; 312 obtains instructions from the user who signed the contract. , Then advance a section, rewind the roll, forward and so on. decoder

1244869 V. Description of the invention (10) 312 provides decoded data to an output element 3 24 for use by the user. The output elements 3-4 can be any suitable elements, such as televisions, computers, any suitable display monitors, VCRs or the like. ',, Graphics overlay module 3 1 4 enhances the quality of display graphics, such as providing the ability to reverse the "angle" or the figure. In an exemplary embodiment, the graphics overlay module 3 ^ 4 can be used in the game-type evil Graphics acceleration, for example, when a service provider provides on-demand games using the system of the present invention. ', • A user interface 318 enables the user to control STB300, which can be any suitable device such as remote farming, keys, and The catch phrase is "^ Rihui Card, etc." The communication key 32 0 provides another Z connection, ό. This may be coupled to another computer or used to provide 雔 θ, f ^. The data bus 32 2 is available for commercialized fast-talkers (and those who want to use instant messaging in order to subscribe to breeding materials are preferred. TV ΐ: 例 例 +, although data broadcasting is broadcast to all after-use On-demand data service. In an example of dryness ~: The user can decode and enjoy the smart card in face 318 to obtain it, ask the user to refer to the local store, or provide the feed slot. The smart card can be sold in the exemplary embodiment. Update data in another machine. In another used data file. 糸 ,, charge ?, unlimited access for all users. In the preferred embodiment, any one can be selected at any time with the service. A7. Interactive function allowed—user Start at the selected data target; ::::: gate = user presses -select key to: resources are allocated (such as bandwidth, wait time. Due to more target force serving σσ) for DOD service,

Page 15 1244sm 5. Description of the invention (11) The reaction time is even shorter. In an exemplary embodiment, the response time may be determined based on the evaluation of resource allocation and desired service quality. When combined with the embodiment where a first data block is placed in a parallel data stream, the response time is only the time required to receive and process this first data block. In one embodiment, the number of data blocks (NUM-OF-BLKS) of each data file can be calculated by the following formula: Estimated BLK size = (DataFi le — Size * TS) / DataFile — Length (1) BLK —SIZE = (Estimated BLK size + CLUSTER —SIZE-lByte) /

• (CLUSTER_SIZE) (2) BLK_SIZE_BYTES = BLK_SIZE * CLUSTER_SIZE (3) NUM_OF_BLKS = (DataFile_Si ze + BLK_SIZE_BYTES-1 Byte) / BLK_SIZE_BYTES (4) In formulas (1) and (4), the estimated BLK size is an estimated block size (measured in Bytes); Dataf le — Size is the size of the data file (measured in bytes); TS indicates time Length of slot (in seconds); Data —

Fi le — Length is the length of the data file (in seconds); BLK-SIZE is the number of clusters required for each data block; CLUSTER—SIZE is the feeder for each channel 1 04 (eg 64Kby tes) The size of one group of the local memory 208 'BLK —SIZE —BYTES is the block size in bytes. In this embodiment, the number of blocks (NUM — 0T — BLKS) is equal to the data file size (in Bytes) plus a data block size (in By te) minus 1 By te and divided by a data block size (In By te). Equations (1) to (4) show a special implementation

Page 16 1244869, V. Explanation of the invention (12) Example. Those who are familiar with this technique should know the number of data blocks in other methods. For example, the difference between a data file—data is a function of the estimated block size and the main size of the channel server's, 、, and 22 ^ numbers. Therefore, the present invention should not care about group data books? In one embodiment, generation-ordering moment = P ', Tian private sequence. In an exemplary embodiment, the present application uses # „cut multiplexer ⑴me dlvlslon multriple; monthly” time division multiplexer (FDM) technology in the servo crying end, M) and frequency division in the -exemplary Implement ^ / raw-like compression and sorting. In the embodiment, each data array gives each data target. Generated in the number of blocks. Typically, a sorting matrix provides data] The distribution order of the data blocks of the two distribution data broadcast

^ a " A u ^ No. A user who wants to access the data file at any time is accessed by 0 U. In step 402, the data blocks (χ) of several data files are received, and the first and fourth numbers are received. j is zeroed (step 4 04). A reference array is cleared (step :, person '] and compared with (step 408). If j is less than X, the second variable i is returned = ^ step 412). Next, i is compared with X (step 414). If i is less than X, the row [(i + j) m0dul0 (x)] of the lean block stored in the sorting matrix is written into the reference array (step 418). If the reference array already has this data block, T writes this repeated data. At the beginning, this step & can be omitted because there is no record of the sorting matrix. Then, the reference array is checked whether it contains data block 1 (step 420). At the beginning, because all the entries in the reference

1244869 V. Description of the invention (13)

Step 4 0 6 is cleared and there should be no data in the reference array. If the reference array contains no material block i ', the lean material block i is added to the array position [(i + j) modulo (x), j] of the ranking matrix and the reference array (step 422). After the data block i is added to the sorted short array and the reference array, i is increased by 1 to make i + 1 (step 4 24), and then the procedure is repeated from step 4 14 until i > x. If the reference array contains data block i, i is increased by 1 so that i = i +1 (step 4 2 4), and then the procedure is repeated from step 41 4 until i = X 'when 丨 = X, j increases by 1, Let j = j + 1 (step 416) and the procedure repeats from step 4 to 6 until j = x. When x is set, the entire program is terminated (step 4100). In an exemplary embodiment, if a data file is divided into 6 data blocks (x = 6), the sorting matrix and reference array are as follows: · Sorting matrix (SM)

TSO TS1 TS2 TS3 TS4 TS5 [0,0] blk0 [i, o] biki [2,0] blk2 [3,0] blk3 [4,0 ^^ 4 [5,0] blk5 [0,1] [l , L] blkO P, l] [3,1] Kl] [5,1] [0,2] [1,2] |; 2,2] blk0 [3,2] blkl [4,2] [5 , 2] [0,3] [1,3] P, 3] [3,3] blk0 [4,130] [5,3] blk2 [〇 > 4] [l, 4] blk3 [3,4] [ 4,4] blkO [5,4] blkl [〇, 5] [1 > 5] P, 5] [3,5] blk4 [4,5] [5,5] blkO

Reference Array (RA)

Page 18 TSO = > blkO TS1 = > blkO, blkl, blk3 TS2 = > blkO, blk2 TS3 = > blkO, blkl, blk3, blk4 TS4 = > blkO, blk4 TS5 = > blkO, blkl , blk2, blk5 An example of incapability 1244869 V. Description of the invention (14) space. space 1 space2 space3 space.4 spaced TS0 bW bM blk3 blk4 blk5 TS1 blM bW blk2 blk3 blk4 TS2 blK bW blk3 blkl blk4 TS3 blK bUd tlkO blM blW blk2 TS4 blk4 bM) blk5 blt2 b5 blk blk5 TS Appendix A of the description describes the exemplary procedure shown in FIG. 4, a step-by-step procedure to generate the above-mentioned sorting matrix and reference array. In this exemplary embodiment, based on the above-mentioned sorting matrix, the 6 data blocks of the data file are sent in the following order: ^ ^ Shield Kuangjin 4 is used for exhalation 1 "

The sort matrix sends a number of data blocks 2 ^ one watt $ before a predicted access time. For example, if one determines in advance the duration of the two slots, for any time sample ^: a slot, the fourth data block of the data file (k4) should be, ~ or equal to I ^ Of

1244869 ---- ^ V. Description of the invention (15) " The user was or was received by an STB300, but will not be honoured before TS4. The procedural steps for generating a look-ahead short matrix are substantially similar to the program steps of FIG. 4 described above, except that in this embodiment the look-ahead sort matrix ^ = the order of the look-ahead time is sent out early. Assume one data: two are six tribute blocks, an example is based on the look-ahead sorting matrix. The forward order has two time slots, and the look-ahead time can be expressed as follows: TSO TS1 TS2 TS3 TS4 TS5

-> blkO

= > blkO, blkl, blk3, blk4-> blkO, blk2 = > blkO, blkl, blk3, blk4, blk5 = > blkO, blk5 = > blkO, blkl, blk2

—One solid 3D distribution of a set of data file distribution matrix is generated based on this set of data files j mother = data matrix ranking matrix. In this three-dimensional distribution matrix, f first, ', = generates the identification numbers of each data object containing this set of data files ,,, /). ^ The Sanxiong distribution matrix is calculated to effectively use the available bandwidth of multiple data streams distributed on each channel. In an exemplary embodiment, a method known as convolution (cónv 01 u t iοη), which is well known for this, is used to generate a three-dimensional ^ = matrix for efficient distribution of a set of data files. For example, a manoeuvre Γτς ^ may include the following policies: (1) All data blocks should be sent to the smallest possible number within any given time slot; and (2) Many partial solutions can be used in accordance with the policy (1) , The best solution is among them

Page 20 4244869-* -----. V. Description of the invention (16) The sum of the following data blocks with the least data block sum ... the data blocks sent within any reference time slot, Data blocks sent in the previous time slot (based on the reference time slot) and data blocks sent in the next time slot (based on the reference time slot). For example, if an exemplary system sends out two short data slots, M and N, each of which is divided into 6 data blocks, the order of submission based on the ranking matrix is as follows:

TSO II> blkO TS1-> blkO, blkl, blk3, blk4 TS2 = > blk0, blk2 TS3: > blkO, blkl, blk3, blk4, blk5 TS4 = > blkO, blk5 TS5 = > bikO, blkl, blk2 — A set of data file distribution matrices for one, two, Γ, and 隹 y knives are generated based on the sorting matrix of the female negative coffin of this set of data files. In this three-dimensional distribution matrix, the first three-dimensional distribution matrix contains the identification number of each data file of the set of data files. The "dimensional distribution matrix" is calculated to effectively use the ^ -A 4 stream of each channel. Available bandwidth. In an exemplary embodiment, a distribution matrix is used to sort the 'efficiency score: Use: For example, t contains the following policies: ⑴ All data blocks can be used at any one time. According to the policy, we can expect Λβ, the number of possible beams;

Page 21, 1244869 V. Description of the invention (17) The sum of the following data blocks with the least data block sum: the data block sent in any reference time slot, the previous time slot (reference Data blocks sent within the time slot) and data blocks sent within the next time slot (based on the Cangkao time slot). For example, if a 7-sex system sends two short data files, M and N, each of which is divided into 6 data blocks, the sending order based on the ranking matrix is as follows:

TSO II> b1kO

. TSl = > blkO, blkl, blk3, blk4 TS2 = > blkO, blk2 TS3 = > blkO, blkl, blk3, blk4 TS4 = > blkO, blk4 TS5 = > blkO, blkl, blk2, blk5 Application example The above-mentioned exemplary convolution method, the possible combinations of distribution matrices are as follows: Option 1 · Distribute the total data block of the video file by shifting 0TS

--_____________ TS0 = > M0, NO 2 TS1 = > M0, Ml, M3, NO, Nl, N3 6 TS2 = > M0, M2, NO, N2 4 TS3 = > M0, Ml, M3, M4, NO, Nl, N3, N4 8 TS4 = > M0, M4, NO, N4 a

Page 22, 1244869 V. Description of the invention (18) TS5 = > M0, M1, M2, M5, N0, N1, N2, N5 8 Total tributary block selection 2: Distribute video file by translation ITS TSO = > MO, NO, Nl5 N3 4 TS1II> MO, Ml, M3, NO, N2 5 TS2II> MO, M2, NO, Nl, N3, N4 6 TS3 = > M0, Ml, M3, M4, NO, N4 6

T.S4 = > M0, M4, NO, N1, N2, N5 6TS5 = > MO, Ml, M2, M5, NO 5 Option 3: Distribute the video file total data block TS2 by Pan 2 TS , NO, N2 3 TS1 = > M0, Ml, M3, NO, Nl, N3, N4 7 TS2 = > M0, M2, NO, N4 4 TS3 2> MO, Ml, M3, M4, NO, Nl, N2, N5 8 TS4 = > M0, M4, NO 3

TS5 = > M0, Ml, M2, M5, NO, Nl, N3 7 Choice 4: Distribute the video file total data block TS0 2> MO, NO, Nl, N3, N4 5 Ml, M3, NO, N4 5

li ί \

Page 24 1244869 V. Description of the invention (19) TS2 = > M0, M2, NO, N1, N2, N5 6 TS3 = > M0, Ml, M3, M4, NO, 5 TS4 = > M0? M4, NO, N1, N3 5 TS5 2> MO, Ml, M2, M5, NO, Nl, N2 6 Option 5: Distribute the video file total data block 3TS1 2 by panning 4TS

TS0 = > M0, NO, N4 M.0, Ml, M3, NO, Nl, N2, N5 TS2 = > M0, M2, NO, TS3 2> MO, Ml, M3, M4, NO, Nl, N3 TS4 = > M0, M4, NO, N2 TS5 = > M0, Ml, M2, M5, NO, Nl, N35 N4 Option 6: Distribute video files by panning 5TS. Total data block TS0 = > M0, NO, Nl, N2, N5 5 TS1> MO, Ml, M3, NO 4

TS2 = > M0, M2, NO, Nl, N3 5 TS3 = > M0, Ml, M3, M4, NO, N2 6 TS4 = > M0, M4, NO, Nl, N3, N4 6 TS5 = > M0, Ml, M2, M5, NO, N4 6 Application guideline (1), choose 2, 4 and 6 with the largest data block

Page 24 124486?

The number (that is, 6 data blocks) is sent in any time slot. Application guideline (2), j exemplified ^ The optimal distribution matrix of the embodiment is selection 4, because selection 4 has a data block in any slot of the micaucus plus a data block in an adjacent time slot (such as 16- The data has blocks) with the smallest sum. Therefore, the optimization sequence of lean material level N in this embodiment should be shifted by 3 time slots. In the exemplary embodiment, a distribution matrix of three or two is generated for each channel server 104. = The data block of each shell material file is sent according to a distribution matrix. Large users can access the data file at a random time and the lean material block of the data file will be provided to each contracted user in a timely manner. In the above provided: In the above, it is assumed that the length of a time slot is equal to 5 seconds, and the DOD system 100 is used to send data 1 and N. The data block is sent according to the best distribution matrix (that is, the panned data distribution sequence 3 Time slots) are sent as follows: @ 的 时间 00: 00: 00 = > M0N0N1N3N4 time 00: 00: 05 = > M0M1M3N0N4 time 00: 00: 10 = > M0M2N0N1N2N5 time 00: 00: 15 = > M0M1M3M4N0 time 00: 00: 20 = > M0M4N0N1N3 time 00: 00: 25 = > M0M1M2M5N0N2 time 00: 00: 30 = > M0N0N1N3N4 time 00: 00: 35 = > M0M1M3N0N4 time 00: 00: 40 = > M0M2N0N1N2N5 time 00: 00: 45 = > M0M1M3M4N0 time 00: 00: 50 = > M0M4N0N1N3

1244869 V. Description of the invention (21) Time 0 (K · 0 0: 5 5 = > M0M1M2M5N0N2 Set at time 00 ·· 〇〇 ·· 〇〇, user A selects electricity, user A2Stb 3 0 0 receives' store, put The shadow and rejection data blocks are as follows: Time 0 0: 0 0: 〇〇 = > Receive M0 = > Play M0, Store Μ0 · Time 0 0: 0 0: 0 5 => Receive Μ1, Μ3 2> Playback M1 and left Mn ... 〇〇: 〇〇: 1〇 = > Receive 112 = > Playback heart, store it, '4 {1, men', men. Time 0 0: 0 0: 1 5 = > Receiving M4 = > Playing M3, stored in ⑽ / · time 0 0: 0 0: 2 0 =: > No receiving = > Playing M4, storing '1 ^ 2, ^, ^^ · Time 〇〇: 〇〇: 25 = > Reception Hall = > Show your heart, store it in your heart 'men, men, men ^ 4 · 〇, Ml, M2, M3, M4, M5

Set at time 0 0 ·· 〇〇 ·· 1 〇, user B chooses to call 30 0 to receive, store, play and reject the data block ^ under 'STB time of user B 00: 00: 1 〇 = > receive M 〇, M2 = > Play M〇 time 0 0: 0 0: 1 5 = > receive M1, M3, M4 = > so $: save M〇, M2 MO, M1, M2, M3, M4 heart, I store M0, store M0, store M0, store M0,

M1, M2, M3, M4 M1, M2, M3, M4, M5 M5, M2, M3, M4, M5 M1, M2, M3, M4, M5 time 0 0: 0 0: 2 〇 = > no reception = > Playback M2, time 0 0: 00: 2 5 = > Receive M5 = > Playback M3, time 0 0: 0 0 · 3〇 = > No reception = > Playback μ4, time 00 : 0 0: 3 5 = > no reception = > play Laos 5, set at time 0 0: 0 0: 1 5, user C selects electricity

User C's STB

Shadow M

1244869 V. Description of the invention (22) 3 0 0 Receiving, storing, playing and rejecting the data blocks are as follows: 0 0: 0 0 ·· 15 = > Receiving NO 2> Playing N0, storing Ν〇 · Time 00 ·· 0 0 · 2 0 2 > Receive N1, N3 2> Play N1, store N time 0 0: 0 0 · 2 5 = > Receive N2 = > Play N2, store ㈣, ^ '^, 1 ^ 3 · Time 00 ·· 0 0 ·· 30 = > Receive Ν4 = > Play N3, store Ν〇, 'Ν' Ν2, Ν3 · Time 0 0: 0 0 · 3 5 = > None Receiving = > Play M, store Ν〇, Ν 'Ν2, Ν3, Ν4, 00 ... 00 = 40, > Receive Ν5 = > Play Ν5, store Ν〇' / 2, Ν3, Ν4 Hours, 1) Ν2 ^ 3, Ν4, Ν5

Set at time 0: 0 0:30, user D selects the electric scene 4 300 to receive, store, play, and reject the data block as y ': STB time of user D 00: 00: 3 0 = &gt; receiving foot, 1 ^ 1, ^ = &gt; Put No, NU3.K_: 00: 35 = &gt; No Reception = &gt; N Hall J NO, Nl, N3, N4 ~ 1, Stored in room 00 · 00 ·· 4〇 = &gt; Receiving N2, N5 = &gt; Playback payment 〇〇, Ν1, Ν2, Ν3, Ν4, Ν5. Time 0 0: 0 0 Time 00: 00 ^ m〇〇: 〇0: i, ^ # Ν〇 ^ Ν1 ^ 2 ^ 3, Ν4, Ν5-&gt; ", Receive = &gt; Play N4, store Ν0, ν1, Ν2, Ν3, ν4, ν5 As the above example, 'Ufl> Play Ν5, store Ν〇, Ν1, Ν2, Ν3, Ν4, Ν5 select and open p β, 'and 5 users can choose independently at a random time = server: the data slot of the provider. The above-mentioned "receiving" celebrities, but Incumbent-already ^ :: often received-continuous string of known points determined by the time slot 'The received STB requires only a certain 1244869 Invention Description (23) The received information of the received information has been described as "necessary to receive π [Pinya stores other received data blocks. This is correct. Therefore, "receiving" may be referred to as "π non-return (n〇n re) ect)", which is better than "receiving," which can be described as "returning π except M4". Return all. ”From the above example, K. Manbe is that the available bandwidth is not fully utilized in at least one taxi. This event occurs. This idle time :: There is" idle time "in the slot, no transmission option 4 As an example, the potentially inefficient use of bandwidth in 苴. Take the aforementioned •. In other words, two data blocks are transmitted in the time slot: "time", and the data block is transmitted "two of the three bandwidths are suitable for transmitting six data blocks, four times, but in the data: ;;; = Set: Although it is not strict to optimize the utilization in Choice 4: ::: It is more serious when the material block is large. That is, a part of the empty block space is placed to combine the breeding materials. 'There may still be a considerable amount of empty space in this empty block. ★ Sundial · Wide. The purpose of the present invention is Α: the bandwidth used.' -The embodiment is in the row; the idle time can be reduced. Therefore, the present invention reduces the idle time = after performing another step, it is referred to here as a model of an ordering matrix that reduces the idle time to reduce the idle time. Hum on the second, the idle time of the data block is transmitted. For the sake of brevity, the "V" table may be TSO- ^ blkO, &lt; &lt; <-&Gt;

1244869

TS2 => blkO, blk2, &lt; — &gt;, &lt; — &gt; TS3 = &gt; blkO, blkl, blk3, blk4 TS "&gt; blkO, blk4, TS5 2> blkO, blkl, blk3, blk5 Figure 5 As shown in the form of a table, the sorting matrix obviously has unused bandwidth in idle time in many time slots. The present invention uses a certain bandwidth between the time slot and the time slot to reduce this idle time. Achieved The key to reducing idle transmission time by using ^ fixed bandwidth is to understand that the distribution sequence of ^ data blocks must be attached to 'when the data block is transmitted', which is not appropriate unless it must be accessed at the time or before The time data block must be two: According to t 'the use of a certain bandwidth is transmitted within each time slot according to the originating distribution sequence-a certain number of data blocks, and the time slot specified by the sorting matrix is irrelevant. / 、 The gate is in the 6 block sorting matrix described in the previous two, there is a large amount of idle time in TS0, TS1, TS2, and TS4. The widths of the disks γ and ν correspond to the transmission # P1 擗 4 · &amp; α For example, suppose that a certain frequency block is expected to be ordered and transmitted. The four data areas in the slot are moved to &quot;:〗 The next data block is taken, and the block is taken as an example. The first area in tsi, Mk〇

The block is moved to TS0. After TS1, blko 4 and 1 A, because TS0 still has a blank data ^ one block has also been moved forward. Of course, TS0 to the skin, faculty, and ‘block space’, bl k3 from TS1, and TS0 now filled all the space, it now looks like:

1244 «servings

TSO = &gt; blkO, blkO, blkl, blk3 Now TS1 and most of TS2 are blank, so the data block from TS3 is moved forward. Once this procedure has been completed, the matrix looks like: TS0 2> blkO, blkO, blkl, blk3 TS1 2> blkO, blk2, blkO, blkl, TS2 = &gt; blk3, blk4, blkO, blk4 TS3 = &gt; blkO, blkl, blk2, blk5 TS4 = &gt;

TS5 2>, this is also shown in the table in Figure 6. Blank and incomplete time TS4 and TS5 in this example are very simple to fill the time slot by repeating the original light weight such as ^ 3. So the first 6 time slots are as follows: Where TSO = &gt; blkO, blkO, blkl, blk3 TSl = &gt; blkO, blk2, blkO, blkl, TS2- &gt; blk3, blk4, blkO, blk4 TS3 = &gt; blkO , blkl, blk2, blk5 TS4 = &gt; blkO, blkO, blkl, blk3 TS5 = &gt; blkO, blk2, blkO, blkl The two time slots in this program are ^ and TS7, which contain TS2 and

1244869

V. Description of the invention (26) The same data p for TS3 is a shorter sorting matrix. The middle and the bottom of this sequence are only the producers, and the Yu-Xin display is shown in the table of Figure 7 full of idleness. From the above example, it is obvious that the opposite can be sent to the middle slot of the original sort matrix in real time and when received, r. A user can even enter the system.] The starting block b 1 k 0 starts to use the data. The data block becomes id: most of it becomes a computable short story. When the system starts to receive data m? In the stream, a user can jump to step 51 of this price list, which is shown in Figure 4/4 in 4 steps This additional step is performed after step 41. A certain value between ξι-10; the foregoing description and the selected bandwidth are set to be equal to the whole number of data blocks :: an integer number. Of course, @ ， 此-fixed bandwidth does not need to be developed due to ^^. Instead, it is replaced by a simple condition, that is, the data string attached to the chart = \\ send sequence. The distribution sequence hardware equipment developed in Figure 8 (such as the low-order m 1 card or channel server that provides a digital data broadcast control for wide-angle rear). Given the low-level hardware equipment of the archival material block, it is better to refer to the low-level hardware than the low-level hardware in the extraction phase of the distribution sequence. Instead, the distribution matrix provides the sequence, and the specified size portion can be fully utilized. -Once the bandwidth is available again: low-end devices will temporarily suspend broadcasting this particular data

Page 31 1244869 V. Description of the invention (27) ^ ----- ^ In the above example, the maximum bandwidth used in the original sorting matrix is used to reduce the idle time matrix. No matter at this point, the user starts to receive data, and the maximum waiting time has not changed. However, it will be apparent to those skilled in the art that bandwidth can be adjusted between time cost or profit. The important thing is that for an on-demand data service, the maximum time required will not exceed the time required to execute the file. If this happens, the result is that the total number of time slots in the sorting matrix is greater than the number of time slots contained in the original sorting matrix. If this is a 2 hour movie, for example, it may take 3 hours to show the movie, leaving the space in the middle of the movie. However, some applications ’may allow or even expect this feature, such as data streaming can be downloaded without immediate use. Single data streams with a certain, optimized bandwidth can simply be combined. The result will be a group of stream.stream bandwidths whose total width is the sum of the individual streams of the group. As shown, it is useful to reduce the idle time to calculate the sorting matrix for a single data stream. In this way, a specified amount of bandwidth can be fully utilized when transmitting a data stream. As mentioned above, however, it is an aspect of the present invention to generate a three-dimensional distribution matrix. With a three-dimensional distribution matrix, a distribution matrix that reduces idle time can also be calculated and established in the same way. However, once the distribution matrix is used to reduce the idle time for a single stream, and then many fully optimized single streams are combined, in many cases this will tend to over-manipulate the three-dimensional matrix. What is specifically shown here is the use of a computer as a tool to transmit an on-demand data file containing an action, preparing a distribution matrix to specify a repeating data transmission sequence for broadcasting via a medium to a group in an unspecified way.

1244869 V. Description of invention (28) households. The action of preparing the distribution matrix is a data block, which has at least one first block ^ including a data transmission sequence that reduces the data file to a plurality. Therefore, one can use ^ to arrange the lean material block into the retransmission sequence and receive the duplicate data transfer to the data file while receiving the first block. This repeating data transmission sequence ♦ I start in ten-minute mode to transmit repeating data with the least idle time = default bandwidth, and the transmission requires a transmission sequence that is independent of the number of users. And Figure 9 on-demand information summarizes the sequence in the form of a flowchart. First at 5 20, an original sorting moment Chen ^ = idle time sorting. The shoulder-to-sequence sorting matrix is generated according to the simplicity of the present invention. This ordered matrix. For the purpose of clarity, "the priority of ordering instead of reducing idle time is not in the structure of the matrix itself, but in the second order; because of arrays," it becomes the most important. The sorting moment of the small idle time is 500 Λ / This original matrix is therefore regarded as a sort sequence. The gate Λ can be used to add idle m denier bandwidth to the original matrix. The data block has been specified from the matrix to all idle time slots. Removed. At 55 °, intelligently, if the cut, sequence, idle time slot is eliminated. -Once this step is completed 2: the sequence of the starting sort matrix is repeated. Termination occurs when there is a new repetitive sequence, this I is regarded as a new reduced idle time sorting matrix 56. It is important to note that the difference between the sorting sequence and the sorting sequence that reduces idle time is the main difference. We can be depicted as a linear sequence and the other-a repeated matrix, but the result is that a user receives a stable stream and

Page 33 K44869

V. Description of the invention (29) Non-user-specific data blocks A method to further reduce the data ordering matrix of broadcast data blocks is to continuously broadcast the data appearing in a specified channel. It can be seen from the matrix that the selected data blocks are more than ^, and $. Other data blocks appear more often. The original points in the idle when this occurs are represented within Γ as follows: TSO = &gt; blkO, TS1 2> blkO, blkl, blk3, &lt;-&gt;, T'S2 = &gt; blkO, blk2, <->, <-> TS3 = &gt; blkO, blkl, blk3, blk4 TS4 = &gt; blkO, blk4, blkO, blkl, blk2, blk5 The distribution moment car produced by the program of Fig. 9 with reduced idle time is expressed as follows: TSO = &gt; blkO, blkO, blkl, blk3 TSl = &gt; blkO, blk2, blkO, blkl TS2 = &gt; blk3, blk4, blkO, blk4 TS3 = &gt; blkO, blkl, blk2, blk5 Repeat the data stream linearly A representative example of the reduction in idle time is as follows:

Page 34-12 of 12448-Description of the invention (30) streamO-blkO, blkO, blkl, blk3, blk0, blk2, blk0, blkl, blk3, blk4, blk0, blk4, blk0, blkl, blk2, blk5 from The linear representation of this exemplary distribution matrix shows that b 1 kO is transmitted more often than blocks 1 to 5. Different distribution matrices within a given data block will result in different more or less frequently occurring data blocks. The data blocks of any distribution matrix that appear earlier in the sequence will appear more often, with block 0 appearing most often. Because b 1 k 0 appears more frequently in the data stream than other data blocks, a more independent transmission bandwidth can send b 丨 k 〇 and other frequently-occurring blocks from the data stream. obtain. This stream may have significantly reduced bandwidth compared to the original stream, and the bandwidth assigned to the original stream may also be reduced by transmitting only less frequently occurring data blocks. For example, "If the above stream is split into two separate streams, a pre-fetch stream only carries data b 1 k 0 and an original stream with the remaining lean blocks" these two repeated streams Will appear in the following form: primary stream = &gt; blkl, blk3, blk2, blkl, blk3, blk4, blk4, blkl, blk2, blk5 So send b 1 k 0 in a separate data stream, and send the original data stream Reduced nest bandwidth by 37.5%. After this reduction, 7 1 k 0 contains 6 of all 16 data blocks in the original data stream, which effectively removes b 1 k 0 and reduces 6 data blocks transmitted in the original data stream. Required to transmit packets

Page 35 1244869 V. Description of the invention (31) The increase in the pre-fetched data stream containing b 1 k 0 depends on the amount of buffer performed by the STB. This amount of buffering is small, which is discussed in detail. The only advantage of the "Only Reaching" is to make the map more detailed. The obvious advantage of this transmission = method is to reduce access-the selected on-demand data service. Once a selected)) blkO service is received, the user can start using the selected service, but if there is no prefetch stream, the user must wait until bl kO is streaming in the original data Appears. Since Mk0 is transmitted on a separate stream, a service does not have to wait for time-Mk0-contains many different data areas to be transmitted continuously. Of course, in order to smoothly use the on-demand data system 'blkl must be received and available immediately when MkO is completed, this requires that the raw data stream has a sufficient amount of bandwidth to ensure that b 1 is received at the end of b 丨 k 〇 k 1. FIG. 10 shows a program 60 0 ′ for sorting a DOD data block to transmit an original data stream and a pre-fetched data stream according to an embodiment of the present invention. In step 602, a sort of reducing idle time is arranged in a linear order of data blocks according to the sequence of data blocks to be transmitted. At step 604, the most frequently occurring data blocks are removed from the sequence, and the remaining shorter sequence data blocks require a narrower bandwidth. As previously discussed, b 1 k 0 often occurs most often. At step 606, the data blocks removed from the reduced idle time series are placed in a pre-fetched data stream containing all b 1 k 0 data blocks. Then in step 608, the truncated data block sequence is placed in the original data stream. Then in step 6 10, the original data stream and the pre-fetched data stream send two different repeated data streams to the receiving set-top box at different bandwidths via the transmission medium 11 0 (Fig. 1B). FIG. 11 shows a procedure 6 50 according to an embodiment for sorting the D0D data area.

Page 36 1244869 V. Description of the invention (32) block to transmit a raw data string, a lot of DOD distribution matrix D]]: take] material stream. * The medium from-transmission is therefore minimized. The transmission is a ghost, and the ordering system is reduced in the -pre-fetch data stream: Ann ;. Material =-: Step 652,-Linear sequence of data blocks #-Arranged in the order in which the blocks are to be transmitted — Nothing. At step 654, the most cautious cautious block is removed from the sequence to obtain the narrow bandwidth required by the Beco that appears. The data block sequence of the original data block sequence that is better known in the step is placed in the prefetch time self-decreasing, and the idle time series is moved out of the Fan Zhi A prefetching material stream. At step 6 58, a match is made. You ... The frequency of starting the stream is better, and the original requirement of transmitting a shorter block of data is: ΐ ΐ Reduced to a predetermined threshold value. Steps may be required if the source data is streamed: f: as understood by those skilled in the art. Step 660. Yu Niu RRn: See below the door value, then the procedure continues to the transmission medium, the original data stream and the pre-fetched data stream through Hgang 1 'through the 11G (Figure 1B) in different bandwidths. Two different duplicate data streams are transmitted to the receiving set-top box. If the bandwidth is above the threshold, the program returns to step 6 5 4 and the most frequently seen data block of the + greedy block is moved *. Then, the removed data block is added to the prefetched data stream. The program repeats until the required transmission bandwidth is lower than the threshold value determined in step 6 5 8 ', and the program stops at step 66. In another embodiment, other thresholds are used instead of threshold standards, such as minimizing the sum of the bandwidth required for the original and pre-fetched data streams. In this way, the bandwidth required to transmit the DOD service is higher than the US Declaration No. 9/982, 017, named 11 Decreased Idle Time, which Khoi Hoang applied for on June 25, 2001.

Page 37 1244869 V. Description of the invention (33)

The method of Constant Bandwidth Data-On ~ Demand Broadcast Delivery Matrices11 (Application No. 9 0 1 2 3 2 8 3 of the Republic of China on September 21, 1990) has been further reduced. Removing frequently occurring data blocks from the original data stream has the effect of greatly reducing the total number of data blocks contained in the original data stream, thus reducing the bandwidth required to communicate the original breeding stream. The following table describes the sample bandwidth saved by removing selected data blocks from the original data stream: Data block 1 C pre-worn in] Data block estimated occurrence frequency C in 6 block sequences] ^ Preserved bandwidth BlkO., 丄 0〇 heart Blkl ^ ~ 5 09 ^ ^ SBW- Blk2- -3396 *, Blk3 ^ ~ 25 heart 25BW ^ Blk4v- R 1 hc, ^ ~ 16 Know Table 1: 6 Block sequence saves bandwidth for special pre-loaded data blocks. In order to immediately access the DOD service transmitted by the above method, the received QTR v / pen must be pre-loaded and stored one or all of which are included in the pre-load. Take the second one from the data stream. Because the STB must first load and store the blkO to be displayed by any D0D service. There is a trade-off between saving transmission bandwidth and access delay time to preload the prefetched data stream and store the prefetched data area Block, with selected delays to access the selected DOD service. A received STB needs to have enough memory to store the data contained in the prefetched data stream. Each of Figures 12 shows a set-top A 00 of a pre-loaded program according to an embodiment of the present invention. At step 702, the set-top box is placed in an interposed or passive mode. Canon

Ϊ244869 V. Description of invention (34) This mode should be the default mode for all users' set-top boxes. At step 704, the set-top box receives a pre-fetched data stream at a specified bandwidth. In an exemplary embodiment, the pre-fetched data stream is received from an electronic programming guide channel. In step 706, the set-top box determines whether the pre-fetched data block received is earlier than the previously stored data block is new. An identification code in the prefetched data block indicates how new the set-top box's asset block is. If the received data block is newer, the set-top box stores the most pre-fetched data block in an internal memory 308 (Figure 3). This is step 708, which is typically a hard disk drive magnetic storage device. . Typically, the ^ data block is covered by the newer prefetched data block (〇verwitte, although the old version may still be retained for various reasons. ^ # Ί ί Γ # V ^^ 11 ^ ^ ^ ^ ^ ^ — H Chengbei ’s receiver automatically switches to the active mode. As a consistent example, this set-top box stays in the active mode between 3 and passive mode. After 1 it returns to step 712, the set-top box receives a

service. At this time, it is put by a user 钤 Α ρ 7 ~ The D0D self-electronic two corresponding to the selected service code or the electronic program is deducted from the program list. The set-top box displays the self-storage in step 7. In step D0D service, the -data block (b_. Select the appropriate channel in Niu Su block and receive and store _ = 6. The set-top box tunes the stream to memory 3.8 (Figure 3). An example of sexual interest: The raw data string 714 of the spear force occurs in parallel until the user stops the Λ t 1,4 steps and the step 4D0D service. At step 124486, V. Description of the invention (35) 718 'If the selected DOD All pre-fetched data blocks of the service have been played, and the process continues to step 72. At step 72, the rest of the DOD service from the original streaming data block previously received at step 716 is played. This step allows Prefetched data block stored in the source data block of the selected DOD service when downloaded from a server. The first data block (blkO) of the 2D0D service or the data area of the first several DOD services The block is played. This system allows the viewing of seamless D0D services with minimal access The requirement of time delay and ^ Y bandwidth. In order to optimize the function, sufficient prefetched data area ^ must be stored and played to allow data blocks and for streaming from the original data. At this time may need to increase The bandwidth of the pre-fetch stream or the original Beco stream. Survival = The data of the pre-fetched data stream that is eventually loaded into the idle set-top box will be changed to reflect the operation after a day, week or month. The user ’s savings are the biggest bandwidth savings. For example, in the fall on Monday night, sports events will be more popular in the pre-fetch data stream, but the most important thing is the new family characteristics. The movie release will be sent in the pre-fetched sequence in the pre-fetched data stream. At the end, the box user can start the desired program at any time without delay. Stb This pre-sequence # This box is already stored in idle mode In response to the user's prior modification of the program (for example, the sequence is more) or the user's request for presetting, although the present invention has been disclosed above in a preferred embodiment, it is not intended to

IH

Page 1244 44869

Limiting the present invention, within the scope and scope, when the scope is attached, depending on what is attached to the person skilled in the art to make a few changes and the scope of patent application does not depart from the adjustment of the present invention, so the definition of the present invention shall prevail. Protection of spirit

Appendix A The On-Demand Data Broadcast Distribution Matrix to Reduce Idle Time and Quantitative Bandwidth The following is a step-by-step description of the exemplary program ranking matrix shown in Figure 4 for a data file with 6 data blocks: Start setting data blocks ( Step 4 0 2) Receive a group of data blocks to a data slot (χ) with a number of 6 (X = 6). (Step 404) Set j = 0. (Step 4 06) Clear a reference array (ra). (Step 4 0 8) j is compared with X. (Step 412) j is less than χ (0 &lt; 6) such that i = 〇. (Step 4 1 4) i is compared with X. (Step 418) i is less than x (0 &lt; 6), and the matrix at row [0] is read and written into RA; at the beginning, the SM is empty and no data is written into RA. (Step 42) Does it contain data block i * blk〇? (Step 422) RA does not contain any data because it is empty. Write in SM and RA

1 1 I 1! I Ϊ 1 II I I Li 1 I 1 II Page 41 1244869 V. Description of the invention (37) Enter blkO at position [〇, 〇]. (Step 424) Add 1 to i (i = 1) to introduce the value of position [1, 0], and return to step 414 (step 414) i is compared with X. (Step 418) i is less than χ (1 &lt; 6), the SM reads the matrix located in row [1] and writes it to RA; at the beginning, the SM is empty and no data is written to RA. (Step 420) Does RA contain data block i or blkl? (Step 422) RA does not contain blkl. Write blkl at position [1,0] ° in SM and RA. Step 4 24) Add 1 to i (i = 2) to import the value of position [2, 〇] and return to step 414 〇 (Step 4 1 4) Compare i with X. (Step 418) i is less than x (2 &lt; 6), and the SM reads the matrix located in row [2] and writes it to RA; at the beginning, the SM is empty and no data is written to RA. (Step 4 20) Does the RA contain data block i or bl k2? (Step 422) The RA does not contain blk2. Write blk2 at position [2,0] ° in SM and RA (step 424) plus 1 to i (i = 3) to import the value of position [3, 〇], and return to step 414 〇 (step 4 1 4 ) i is compared to X. (Step 418) i is less than x (3 &lt; 6), and the SM reads the matrix located in row [3] and writes it to RA; at the beginning, the SM is empty and no data is written to RA. (Step 420) Does the RA contain data block i or blk3? (Step 422) The RA does not contain blk3. Write blk3 in position in SM and RA

_ 1

Page 42 1244869 V. Description of the invention (38) [3, 0]. (Step 4 2 4) Add 1 to i (i = 4) to introduce the value of position [4,0] and return to step 414 ° (Step 4 1 4) i and X are compared. (Step 418) i is less than χ (4 &lt; 6), the SM reads the matrix located in row [4] and writes it to RA; at the beginning, the SM is empty, so no data is written to RA. (Step 420) Does RA contain data block i or blk4? (Step 422) RA does not contain blk4. Write blk4 at position [4,0] ° in SM and RA (step 4 2 4) plus 1 to i (i = 5) to import the value of position [5, 〇], and return to step 414 (step 4 1 4) Compare i with X. (Step 418) i is less than x (5 &lt; 6), and the SM reads the matrix in row [4] and writes it to RA; at the beginning, the SM is empty and no data is written to RA. (Step 420) Whether RA contains data block i or (Step 422) RA does not contain blk5. Write blk5 to position [5, 0] in SM and RA (step 424) and add 1 to i (i = 6). Return to step 414. (Step 4 1 4) i is compared with X. (Step 416) i is equal to x (6 = 6). j is increased by 1 (j = l). Return to step 4〇6. ............... (^ 406) Clear a reference array ( RA). (Step 4 0 8) j is compared with X. (Step 412) j is less than χ (1 &lt; 6) so that i = 0.

Page 43 n44m

(Step 4 1 4) i is compared with x. (Step 418) i is less than χ (0 &lt; 6), and the matrix at row Π] is read at SM and written into RA. Position [1, 0] contains blkl; therefore, blkl is written to RA. All other locations are empty. (Step 420) Does RA contain a data block? [Or blkO? (Step 422) RA does not contain blkO. Write blkO at position [1,1] in SM and RA. RA now has blkl and blkO. (Step 424) Add 1 to i (Bu1) to introduce the value of position [2, 1], and return to Step 414. (Step 414) i is compared with X. (Step 418) i is less than x (l &lt; 6), reads the matrix in row [2] at SM and writes it to RA. Position [2, 0] contains bl k2; all other positions are empty. ra now has blkl, blkO, and blk2. (Step 4 20) Does RA contain data block i or blkl? (Step 424) RA contains blkl. Therefore, no data is written to location [2, 1]. Add 1 to i (i = 2) to import the value of position [3, 1], and return to step 41 4. (Step 4 1 4) i is compared with X. (Step 418) i is less than x (2 &lt; 6), read the matrix in row [3] at SM and write it to RA. Position [3, 0] contains blk3; all other positions are empty. RA now has blkl, blkO, blk2, and blk3. (Step 4 20) Does RA contain data block i or blk2? (Step 424) RA contains blk2. Therefore, there is no information on the nesting position [3, 1]. Add 1 to i (i = 3) to import the value of position [4, 1], and return to step 4 1 4. (Step 4 1 4) i is compared with X.

1244869 —— V. Description of the invention (40) (step 418) i is less than x (3 &lt; 6), read the matrix in row [4] in SM and write it into RA. Position [4, 0] contains bl k4; all other positions are empty. The RA now has blkl, blk0, blk2, blk3, and blk4. (Step 4 20) Does RA contain data block i or blk3? (Step 424) RA contains blk3. Therefore, no data is written to location [4, 1]. Add 1 to i (i = 4) to import the value of position [5, 1], and return to step 414. (Step 4 14) i is compared with X. (Step 418) i is less than x (4 &lt; 6), read the matrix in row [5] at SM and write it to RA. Position [5, 0] contains blk5; all other positions are empty. The RA now has blkl, blk0, blk2, blk3, blk4, and blk5. (Step 4 20) Does RA contain data block i or blk4? (Step 424) RA contains blk4. Therefore, no data is written to location [5, 1]. Add 1 to i (i = 5) to import the value of position [0, 1], and return to step 414. (Step 4 1 4) i is compared with X. (Step 418) i is less than χ (5 &lt; 6), and the matrix at row [0] is read at SM and written into RA. Position [0, 0] contains blkO; all other positions are empty. ra now has b 1 k 0; therefore, b 1 k 0 is removed. (Step 4 20) Does RA contain data block j or b 1 k5? (Step 424) RA contains blk5. Therefore, no data is written to the location [0, ι]. Add 1 to i (i = 6). Go back to step 41 4. (Step 414) i is compared to X. (Step 416) i is equal to χ (6 = 6) and j is increased by 1 (B 2). Go back to step 40 6.

Page 45 1244869 V. Description of the invention (41) (step 4 0 6) Clear a reference array (RA). (Step 4 0 8) j is compared with X. (Step 412) j is less than x (2 &lt; 6) such that i = 0. (Step 4 1 4) i is compared with X. (Step 418) i is less than x (0 &lt; 6), read the matrix in row [2] at SM and write it to RA. Position [2, 0] contains bl k2; all other positions are empty. RA now has blk2. (Step 420) Does RA contain data block i or bikO? (Step 422) RA does not contain blkO. Write blkO in SM and RA at position Γ2,2] ° RA now has blk2 and blkO. (Step 4 2 4) Add 1 to i (i = 1) to import the value of position [3, 2], and return to step 414. (Step 4 1 4) i is compared with X. (Step 418) i is less than x (l &lt; 6), and the matrix at row [3] is read at SM and written into RA. Position [3, 0] contains bl k3; all other positions are empty. ra now has blk2, blkO, and blk3. (Step 4 20) Does RA contain data block i or blkl? (Step 422) RA does not contain blkl. Write blkl at position [3,2] in SM and RA ° RA now has blk2, blkO, blk3, and blkl. (Step 424) Add 1 to i (i = 2) to introduce the value of position [4, 2], and return to step 414. (Step 414) i is compared to X. (Step 418) i is less than x (2 &lt; 6), read the matrix in row [4] at SM and write it to RA. Position [4, 0] contains blk4; all other positions are empty. ra now has blk2, blkO, blk3, blkl, and blk4.

Page 46 1244869 A 丨 _ 丨 丨 · '' · _ · Ν · _ __ 丨 __ 5. Explanation of the invention (42) (Step 4 20) Does the RA contain data block i or blk2? (Step 4 24) RA contains blk2. Therefore, no data is written to location [4, 2]. Add 1 to i (i = 3) to import the value of position [5, 2] and return to step 4 1 4. (Step 4 1 4) i is compared with X. (Step 418) i is less than x (3 &lt; 6), read the matrix in row [5] at SM and write it to RA. Position [5, 0] contains blk5; all other positions are empty. The RA now has blk2, blk0, blk3, blkl, blk4, and blk5 ° (step 4 20) Does the RA contain data block i or blk3? (Step 424) The RA contains blk3. Therefore, no data is written to location [5, 2]. Add 1 to i (i = 4) to import the value of position [0, 2], and return to step 414. (Step 414) i is compared with X. (Step 418) i is less than x (4 &lt; 6), read the matrix at row [0] at SM and write it to RA. Position [0,0] contains blkO; all other positions are empty. Therefore, b 1 k 0 is discarded. (Step 4 20) Does RA contain data block i or blk4? (Step 4 24) RA contains blk4. Therefore, no data is written to location [0,2]. Add 1 to i (i = 5) to import the value of position [1, 2] and return to step 4 1 4. (Step 4 1 4) i is compared with X. (Step 418) i is less than χ (5 &lt; 6), and the matrix at row [1] is read at SM and written into RA. RA already contains blkl and blkO; therefore, blkl and blkO are discarded. All other positions are empty. (Step 4 20) Does RA contain data block i or blk5? (Step 4 24) RA contains blk5. Therefore, no data is written to location [1, 2.]. Add 1 to i (i = 6) and return to step 41 4.

^ 244869, Description of the Invention (43) Step 4 1 4) i and X are compared. Return to step 4 06. Step 4 1 6) i is equal to X (6 2 6). Increase j by 1 (Bu 3) (step 4 0 6) to clear a reference array (RA). (Step 4 08) j is compared with X. (Step 4l2) j is less than x (3 &lt; 6) so that i = 0. (Step 414) i is compared to X. (Step 418) i is less than x (0 &lt; 6), read the matrix located in row [3] at SM and write

People RA. Location [3,0] contains blk3 and location [3,2] contains blkl; blk3 and blkl are written to the RA. All other locations are empty. (Step 420) Does RA contain data block i or blkO? (Step 422) RA does not contain blkO. Write blkO in position [3,3] in SM and RA. RA now has blk3, blkl, and blkO. (Step 4 24) Add 1 to i (i = 1) to introduce the value of position [4, 3], and return to step 414 (step 4 1 4) i and X are compared.

(Step 418) i is less than x (l &lt; 6), reads the matrix in row [4] at SM and writes it to RA. Position [4, 0] contains b 1 k4; all other positions are empty. ra now has blk3, blkl, blk0, and blk4. (Step 42) Does ra contain the data block i or blkl? (Step 424) RA contains blkl. Therefore, no data is written to the location [4, 3]. Add 1 to i (i = 2) to import the value of position [5, 3], and return to step 414. (Step 414) i is compared to X.

1244869 V. Description of the invention (44) (step 418) i is less than x (2 &lt; 6), read the matrix located in row [5] in SM and write it into RA. Position [5, 0] contains bl k5; all other positions are empty. RA now has blk3, blkl, blkO, blk4, and blk5. (Step 4 20) Does RA contain data block i or blk2? (Step 4 22) RA does not contain blk2. Write blk2 at position [5,3] in SM and RA. RA now has blk3, blkl, blkO, blk4, blk5, and blk2. (Step 4 2 4) Add 1 to i (i = 3) to introduce the value of position [0, 3], and return to step 414 (step 4 1 4) i and X are compared. (Step 418) i is less than x (3 &lt; 6), and the matrix at row [0] is read at SM and written into RA. Position [0, 〇] contains blkO; all other positions are empty. RA already contains blkO; therefore, blkO is discarded. (Step 4 20) Does RA contain data blocks i, blk3? (Step 424) RA contains blk3. Therefore, no data is written to location [0, 3]. Add 1 to i (i = 4) to import the value of position [1, 3] and return to step 4 1 4. (Step 41 4) i is compared with X. (Step 4 18) i is less than χ (4 &lt; 6), read the matrix in row [1] at SM and write it to RA. Position [1, 0] contains blkl and position [1, 1] contains blkO; all other positions are empty. RA already contains blkl and blkO; no rewrites. (Step 420) Does RA contain data block i or blk4? (Step 424) RA contains MM. Therefore, no data is written to location [1, 3]. Add 1 to i (i = 5) to import the value of position [2, 3], and return to step 41 4. (Step 414) i is compared to X.

1244869 V. Description of the invention (45) (step 418) i is less than χ (5 &lt; 6), reads the matrix located in row [2] in SM and writes it to RA. Position [2, 0] contains blk2 and position [2, 2] contains blkO; all other positions are empty. RA already contains blk2 and blkO and is not rewritten. (Step 4 20) Does RA contain data block i or blk5? (Step 424) RA contains blk5. Therefore, no data is written to location [2,3]. Add 1 to i (i = 6) and return to step 414. (Step 414) i is compared to X. (Step 416) i is equal to χ (6 = 6) increased by l (j = 4). Return to step 4〇6. (Step 4 06) Clear a reference array (RA). (Step 4 08) j is compared with X. (Step 412) j is less than x (4 &lt; 6) so that i = 0. (Step 4 1 4) i is compared with X. (Step 418) i is less than x (0 &lt; 6), read the matrix in row [4] at SM and write it to RA. Position [4, 0] contains blk4; blk4 is written to RA. All other locations are empty. (Step 420) Does RA contain data block i or blkO? (Step 422) RA does not contain blkO. Write blkO in position [4, 4] in SM and RA. RA now has blk4 and blkO. (Step 424) Add 1 to i (i = l) to introduce the value of position [5, 4], and return to step 414 ° (step 414) i is compared with X. (Step 418) i is less than x (l &lt; 6), read the matrix at row [5] and write at SM

Page 50 1244869 V. Description of Invention (46) Enter RA. Position [5,0] contains blk5 and position [5,3] contains blk2; all other positions are empty. The RA now has blk4, blkO, blk5, and blk2. (Step 420) Does RA contain data block i or blkl? (Step 422) RA does not contain blkl. Write blkl at position [5,4] in SM and RA. RA now has blk4, blkO, blk5, blk2, and blkl. (Step 4 2 4) Add 1 to i (i = 2) to introduce the value of position [0, 4], and return to step 414 (step 414) i and X are compared. (Step 4 1 8) i is less than X (2 &lt; 6), read the matrix in row [0] at SM and write it to RA. Position [0, 0] contains bl kO; all other positions are empty. ra already contains blkO, so no duplicates are written. (Step 420) Does RA contain data block i or blk2? (Step 424) RA does not contain blk2. Add 1 to i (i = 3) to introduce the value of position [1, 4] and return to step 41 4 0 (step 4 1 4) i is compared with X. (Step 418) i is less than x (3 &lt; 6), read the matrix in row [1] at SM and write R A. Position [1, 0] contains b 1 k 1; all other positions are empty. R A now contains blkl and blkO; no duplicate writes. (Step 420) Does RA contain data block i or blk3? (Step 422) RA does not contain blk3. Write blk3 at position [!, 4] in SM and RA. 1 to 8 now have blk4, blk0, blk5, blk2, blkl, and blk3. (Step 424) Add 1 to i (i = 4) to import the value of position [2, 4], and return to step 41 4 0 (step 414) i is compared with X.

Page 51 1244869 V. Description of the invention (47) (step 418) i is less than x (4 &lt; 6), read the matrix in row [2] in SM and write it into RA. Position [2,0] contains blk2 and position [2,2] contains blkO; all other positions are empty. RA already contains blk2 and blkO and is not rewritten. (Step 420) Does RA contain data block i or 3lk4? (Step 424) RA contains blk4. Therefore, no data is written to location [2,4]. Add 1 to i (i = 5) to import the value of position [3, 4]. Go back to step 41 4. (Step 4 1 4) i is compared with X. (Step 4 1 8) If i is less than x (5 &lt; 6), read the matrix in row [3] at 3 ^ 1 and write it to RA. Position [3, 0] contains blk3, position [3, 2] contains blkl and position [3, 3] contains b 1 k 0; all other positions are empty. r a already contains blk3, blkl, and blkO; do not write repeatedly. (Step 4 20) Does RA contain data block i or blk5? (Step 424) RA contains bl k5. Therefore, no data is written to location [3, 4]. Add 1 to i (i = 6) and return to step 41 4. (Step 4 1 4) i is compared with X. (Step 416) i is equal to χ (6 = 6). j is increased by 1 (j = 5). Go back to step 4 0 6. (Step 4 06) Clear a reference array (RA). (Step 4 08) j is compared with X. (Step 412) j is less than x (5 &lt; 6) so that i = 0. (Step 414M is compared with X. (Step 418) i is less than χ (0 &lt; 6), and the matrix at row [5] is read at SM and written to RA. Position [5,0] contains blk5 position [5, 3] contains blk2 and position, [5,4] contains blkl; blk5 and blk2 and blkl are written to RA. All others

I. 44869 V. Description of Invention (48) The position is empty. (Step 4 20) Does RA contain data block i or blkO? (Step 422) RA does not contain blkO. Write blkO at position [5,5] in SM and RA. RA now has blk5, blk2, blkl, and blkO. (Step 4 2 4) Add 1 to i (i = 1) to introduce the value of position [0,5], and return to step 414. (Step 414) i is compared with X.

(Step 418) i is less than x (l &lt; 6), and the matrix at row [0] is read at SM and written into RA. Position [0, 0] contains blkO and all other positions are empty. RA now contains blk5, blk2, blkl, and blkO. (Step 4 20) Does RA contain data block i or blkl? (Step 424) RA contains blkl. Add 1 to i (i = 2) to import the value of position [1, 5] and return to step 41 4. (Step 414) i is compared with X.

(Step 418) i is less than x (2 &lt; 6). The matrix at row [1] is read at SM and written to RA. Position [1,0] contains blkl, position [1,1] contains blkO and position [1,4] contains blk3; all other positions are empty. ra already contains blkO and blkl; therefore, no duplicate writes. Write blk3 to RA. The RA now contains blk5, blk2, blkl, blk0, and blk3. (Step 420) Does RA contain data block i or blk2? (Step 424) RA contains blk2. Add 1 to i (i = 3) to import the value of position [2,5] / return to step 41 4. (Step 4 1 4) i is compared with X. (Step 418) i is less than x (3 &lt; 6). Read the matrix in row [2] and write at SM

Page 53 1244869 V. Description of Invention (49) Enter RA. Position [2,0] contains blk2, position [2,2] contains blkO; all other positions are empty. RA already contains blk2 and blkO; no repeated writes. (Step 420) Does RA contain data block i or blk3? (Step 4 2 4) RA contains blk3. Add 1 to i (i = 4) to import the value of position [3, 5] and return to step 41 4. (Step 4 1 4) i is compared with X. (Step 418) i is less than χ (4 &lt; 6), and the matrix at row [3] is read at SM and written into RA. Position [3, 0] contains blk3, position [3, 2] contains blkl, and position [3, 3] contains blkO. All other positions are empty. RA already contains b'lk3, blkl, and blkO; no rewrites. (Step 4 20) Does RA contain data block i or blk4? (Step 4 22) RA does not contain blk4. Write blk4 at position [3,5] in SM and RA. 'RA now has blk5, blk2, blkl, blkO, blk3, and blk4 0 (step 424) plus 1 (i = 5) to import position [4, 5], return to step 414 (step 414) i and X. (Step 418) i is less than x (5 &lt; 6), and the matrix at row [4] is read at 3 ^ 1 and written into RA. Position [4, 0] contains blk4 and position [4, 4] contains blkO. All other positions are empty. RA already contains blk4 and blkO; no rewrites. (Step 420) Does RA contain data block i or blk5? (Step 422> RA contains blk5. Therefore, no data is written to location [3, 4]. (Step 424) Add 1 to i (i = 6). Return to step 414. (Step 4 1 4) i is compared with X. _________________

Page 54 1244869 V. Description of the invention (50) (step 4 1 6) i is equal to X (6 = 6). j is increased by 1 (j = 5). Go back to step 4 0 6. (Step 4 0 6) Clear a reference array (RA). (Step 4 0 8) j • Compare with X. (Step 410) j is equal to x (6 = 6); Done.

Page 1212 44869

Device Figure IA Figure IB Figure 2 shows one display of the present invention, another display of the present invention, according to an example of the embodiment of the present invention, an example of an embodiment, an exemplary DOD system, a DoD system, an exemplary channel servo Matrix map 3 Figure 4 Figure 5 shows the present invention showing a universal set-top box (gTB) of the present invention showing a consistent embodiment of the present invention. The sequence of generating a sort matrix is a known example of six data block sorting moments. 6 The data block in the sorting moment slot that is filled in the array shown in FIG. 5 is moved up to the whole figure 7. The sorting matrix shows a new embodiment of the present invention to reduce the idle bandwidth. FIG. 8 describes the additional idle time reduction. Embodiment Figure 9 describes the implementation of the sorting method for reducing the interposition time in the form of a flowchart. Figure 10 is a flowchart showing a procedure according to one embodiment of the present invention for sorting DOD data blocks to transmit a block of data. Raw data stream and a pre-fetched data stream Figure 11 is a flowchart showing a procedure according to another embodiment of the present invention for sorting DOD data blocks to transmit a raw data stream and a pre-fetched data stream Flow diagram 1 2 It is a flowchart showing a pre-installation procedure of a set-top box according to an embodiment of the present invention. Symbol description:

1244869 Brief description of the diagram 80 Cable TV channel 100 D 0 D system 102 Central control server 103 Central storage 104a-1 04η Channel server 106a-106η Frequency booster 108 Combiner / amplifier 110 Transmission medium 112 Switch matrix 118a-118b Spare Inverter 120 Cable TV system 102 Central control server 202 Servo controller 2 04 CPU 206 QAM modulator 208 Local memory 210 Network interface 302 QAM demodulator 304 CPU 308 Local memory 310 Buffer memory 312 Decoder 314 Graphics Overlay module 318 user interface · 32 0 communication chain 322 fast data bus 324 output element 402, 40 4 ____......... 422, 424 step 5 1 0, 52 0, 530, 54 0, 550, 5 60, 4 1 0 steps

Page 57

Claims (1)

1244869 VI. Scope of patent application1. A general-purpose broadcast method using a computer as a tool, including the action of preparing a distribution matrix for a group of users to define the data transmission sequence (data transmission seqUence) suitable for broadcasting. On-demand data in a non-user-specific manner, in which a first stream including a data transmission sequence having a first subset and a second data transmission are transmitted The second stream of the second sequence is as follows: 2. The application of the patent as described in the first patent application method is computer-based and the method 'where the first and second episodes do not include any: there is a shortage = block. 3. The method of using a computer as a tool according to item 2 of the patent application, wherein the first-time set includes an optimized data block set, and the second set is the remaining part of the data transmission sequence. The data block set is related to the frequency of data block allocation. '-竑 佳 化 贝 4. If the brainstorm method is used as the first item in the scope of the patent application, the first stream further includes a preview; the universal broadcast method 5: it is preloaded as it is Broken Λ message f to a, universal set-top box storage. 6 If applied ^ Chuanzhou · Electric Universal Broadcasting on the Universal Set-Top Box: Method: Of which; Dedicated = Set-top benefits using a computer as a tool enclosed on the second page S The universal set-top box is idle page 58 1244869 ~-6. The first stream can be loaded when applying for a patent. 7. For the general broadcasting method using a computer as a tool in the scope of patent application item 1, wherein the first set includes a minimum amount of data blocks required to start a program, the minimum amount is related to the available amount. Bandwidth related. 8. For the general-purpose broadcast method using a computer as a tool in the scope of patent application item 1, wherein the ratio reserved for the transmission sequence between the first episode and the second episode is based on the amount of available transmission bandwidth. Optimization planning. 9. For example, the general-purpose broadcasting method using a computer as a tool in the scope of patent application, wherein the transmission of the on-demand data file requires an amount of transmission bandwidth that is independent of the number of users. 10. For a computer-based universal broadcast method using item 9 of the scope of the patent application, the action of generating a distribution matrix includes the following actions: preparing a first sorting matrix to be suitable for the transmission of the first data file, the first A data file is represented by a first group of data blocks, and the first sorting matrix provides a first sequence to sequentially transmit the first group of data blocks within a time slot, in a manner that any user receives The first data file transmitted from the sorting matrix can start to access the first data file within a time slot. 11. The general-purpose broadcasting method using a computer as a tool according to item 10 of the patent application range, wherein the first sorting matrix is a sorting matrix with a certain amount of bandwidth. ___Circle Page 59 1244869 6. Scope of Patent Application 12. For the general broadcasting method using a computer as a tool in item 10 of the scope of patent application, the first sorting matrix is a sorting matrix with variable frequency. 13. For example, a computer-based universal broadcast method using item 11 in the scope of patent application, in which a certain amount of data from the first group of data blocks is sorted for transmission at a reserved bandwidth. 14. For the general broadcast method using a computer as a tool in the scope of patent application No. 13 in which the transmission of the reserved bandwidth is controlled by a low-level hardware device holder. 15. For example, the universal broadcast method using a computer as a tool in the scope of patent application, wherein the first stream is a prefetch stream, and the prefetch stream is stored by a universal set-top box with a set of prefetch receiving scripts take. 16. For the general broadcasting method using a computer as a tool in the scope of patent application No. 15, the pre-fetching receiving script includes a user pre-loading a command to the set-top box. 17. The general-purpose broadcasting method using a computer as a tool in the scope of patent application item 1, wherein the set of prefetching receiving scripts includes a reserved program from a user 0 18. A method using a computer as a tool for generating a certain amount bandwidth, Page 60 1244869 Applicable patent scope Eight ~ Intermediate time Knife feed on-demand data produces a row ~ 1 良 Good first group J, J starts at-1 用户 User access starts and depends on the decision The block set-top box 19 contains: a. B · stream, c. In stream; d · and find reflow and projection e. The ordering moment of the first part 'the method order matrix makes the data in the slot between data blocks according to the time The desired sorting matrix is assigned to the stream; the set-top box does not pass a general-purpose set-top array, which makes a non-user-specific format suitable for at least containing suitable representations. The sequence sends the following actions: The first order is the first group of assets. The first data sent from the first order matrix of the matrix feed block is provided for a first. The order of switching to the current computer and automatically dividing the first transmission bandwidth from the data according to the order and loading it to a display box for access is quantified with a data file. Bandwidth is divided by data area One of the streams to, where the sequence stream is the amount of bandwidth and less the separate display device. Video selection method, at least block; Streaming data idle mode; At a certain time when setting the mode, access a preloaded transmission string stored data block on the readable medium in the preloaded transmission string, and set the mode Switch to an active mode and it is a user instruction, a part, and the first part of the pre-loaded transmission string from the stored; 2. the correct data block, to the first in the program There is no interruption between the other parts of Langmu; 1244869 VI. The scope of patent application for Langmu without having to enter the recovery step allows the one-step access to broadcast data. 2 0. The method of item 19 in the scope of patent application has the additional function of periodically updating the prefetch stream in the idle mode. 21 The method of claim 20 in the scope of patent application, wherein the periodic updating step is based on a user's instruction. 22. The method of claim 20 in the scope of patent application, wherein the periodic call for update step is based on a preference of an on-demand video. · 23 · The method of claim 20, wherein the step of periodically updating is based on a user's historical record. 24. The method of claim 19, wherein the step of converting to an idle mode is performed under a set of idle mode scripts. 25. The method of claim 24, wherein the idle mode script includes user inactivity. Pre-loaded with a broadcast resource 26. A computer-based method of set-top box (STB), including the following actions, to convert the STB to an idle mode; Page 62 I244S69 6. The scope of the patent application automatically tunes the STB to the-channel, selects data, and the first channel contains-prefetched data ~ strung ^ pre-arranged the STB selection when the user converts the STB to an activity mode group data area Block, the process includes at least the following steps: &quot; processing one of the received to decode the received data block; 'uncompress the received data block; reassemble the received data block as needed; and Store the received data block to a STB memory; and u partly provide the first data record to the _㈣ device by the user of the universal STB. 2: round: == ㈣; Among the 26 items, it is a tool method. The method Gan Shizheng recognizes as the patent application No. 26 of the patent scope is to use a computer as a tool &quot; ν μ rain out device as a display monitor. 2 9.. Among them, the round out °: = the method of using the computer as a tool in the 26th scope of the patent, the patented video cassette recorder (VCR) in the scope of the patent. 30. If applied for-computer system: M computer is a method of tool ’, where the wheel-out device 31. The method of using a computer as a tool in item 18 of the patent scope —F244869 Sixth, the scope of patent application where the correct allocation is based on the available bandwidth 32. A method of data distribution, at least including: a data file is divided into a data block group · 3 · The data block group is the following Steps An 丄, Γ-, and Wen become a borrowing time: a) Differentiate the data file as a data block group; b) Reset the first variable to zero; c) Clear a reference array; First variable and data Compare the total number of block groups; e, the first variable is less than the total number of data block groups, zero a second variable, and ^ compare the second variable with the total number of data block groups; g) if The second variable is less than the total number of data block groups. One or more data blocks stored in one row of a sort matrix are written into the reference array. The row is determined by [(HDmodU)], where i is the first Two variables,] is the first variable; X is the number of data blocks; h) if the reference array already has at least one of the stored data blocks, do not write another version; i) check the reference Whether the array contains a block corresponding to the second variable; j) if the parameter The test array does not include the data block corresponding to the second variable. The data block is added to the reference array and the ranking matrix at the position of the matrix at [(i + j) mod (x), j]. Two variables increase by 1; k) if the reference array contains the data area corresponding to the second variable 12 桃 69 6. For the patent application range block, the second variable is increased by 1; 1) Repeat steps g) to k) until the second variable is equal to the total number of data blocks; m) the first variable is increased by 1; η) Repeat steps c) to m) until the first variable is equal to the total number of data blocks; and 0) rearrange the sorting matrix into a group of streams; wherein the order is transmitted via a medium with a bandwidth assigned to the data file- Repeated signals, and wherein the bandwidth is fully utilized by the repeated signals. 3 3. The data distribution method according to item 32 of the scope of patent application, wherein the step of rearranging the sorting matrix into a group of streams includes determining the size of the bandwidth given to the data file and determining a first distribution The stream is optimized in size so that the first distribution stream contains the starting sequence of the data file. 34. If the data distribution method of item 33 of the patent application scope is adopted, the size of the bandwidth assigned to the data file is determined to minimize the bandwidth. 35. For the data distribution method of item 33 in the scope of patent application, which determines the size of the bandwidth assigned to the data file to maximize the bandwidth. 36. The data distribution method according to item 32 of the patent application scope, wherein the data distribution stream group is obtained from a data distribution matrix including a different data right. Page 65 1244869 VI. Application scope 37. A general-purpose data broadcasting method using a computer as a tool, including at least the following steps: In a general-purpose data broadcasting system, perform the following actions: Prepare a distribution matrix and define a suitable Broadcast data transmission sequence to a group of users, non-user-specific on-demand data, where the on-demand data includes a first stream containing a first stream of the data transmission sequence and a second stream containing a The data transmission sequence of the second episode; wherein the first stream is preloaded transmission data; 'providing a first channel server adapted to transmit the preloaded transmission data via the first channel; before the data broadcast, Preparing a second channel server to transmit an electronic program guide, the electronic program guide (EPG) includes a message on a third channel having at least the second stream; and from the first channel and the second channel Transmitting data; and performing a general STB, performing the following actions: when the general STB is in a passive mode, receiving a digital data stream on the first stream of the first channel When the universal STB is in the passive mode, the digital data in the first stream is stored in a computer-readable medium; the digital data of the EPG is received; the EPG data is provided to one of the universal STBs for use One of the users of the self-used STB receives the data processing instruction; and one of the users of the self-used STB uses the instruction. Page 66 4244869 6. Scope of patent application: The scope of patent application, which generates ~ Item 37, the general use of computer as a tool to send a general-purpose material distribution matrix, including at least the following actions 3 8 · As expected broadcast method: Prepare a first sort matrix data The first sequence of the first group of data is received by the user in a time slot. In this way, any data file can be opened according to the number of data blocks in the pre-loaded string. The file is not suitable for the transmission of the first data file. The first block indicates that the first sorting matrix provides the first group of data blocks to be transmitted in sequence. According to the first ^ _ The first data file in the slot, in which the number of blocks of the stream; including any of the 39 included in the talk stream, such as the computer-based and general-purpose broadcast method such as the 38th patent application scope Progressive _ step included before the data broadcast ^ Prepare a third channel server for on-demand data information] =, the channel server includes-retrieving the distribution via the third channel server and ㈣ includes ☆ Distribution by sorting matrix = § The first channel transmits data on the third channel in the memory of the third channel server. &quot; Action &quot; and since 4.0. For example, the 39th scope of the patent application &lt; computer-based broadcasting method, wherein the first ranking matrix A + 4 ^ is used. Sorting matrix for a certain amount of bandwidth 1244 雠 41. For example, if a computer is used as a broadcasting method for item 40 in the scope of the patent application, a certain amount of the universal data of the first data area is transmitted in each time slot. The “叩 ghost group” is ranked as 42. For example, the computer-based broadcast method is used in item 40 of the scope of the patent application, wherein the first ranking matrix is a universal matrix. 1 See sorting moment 43. An on-demand data (DOD) broadcast server method that accesses services suitable for broadcasting to a group of users via a non-user-specific type, including at least the following actions:, 迗. 、; | Guangzhou provides a first data stream including a group of first. Data blocks and-outside breeding blocks, the first data block and the additional data area, including a selected DOD service; ^ ^ Removing the first data block group from the first data stream; placing at least one of the first data block in a second data stream; and transmitting the second data stream via the transmission medium; and via the The transmission medium transmits the first data stream so that a user receiving the first and second data streams can combine at least a part of the first and second data streams in order to access the selected DOD service. 44. The on-demand data (DOD) broadcast server method according to item 43 of the patent application, wherein the first and second data streams are arranged as a set-top box Page 68 1244869 '' Received. 4 5. If the method of π server is used in item 43 of the scope of patent application, where the amount = material and a group of third data blocks. Including a group of young people, a poor material block 46. If the patent application scope of the 45th method of the server, which further includes the following actions; ^ shell material (_broadcast feed. 2! Second data block moved out of the second data area Block, · = At least one of the breeding blocks is placed on the second data stream one and the first one; the user receives the first and second data streams and can use the first data stream: the lean material block At least a part of the combination is used to access the selection. 7. If the server method of the 45th scope of the patent application is applied, the remote server accesses the remote server, the remote remote server, and the remote remote server. The DOD service includes viewing the DOD, a part of the video performance. • A remote receiving (000) broadcast reception (recepfi) method, t ,, and two are accessed by the ~ DOD receiver from The DOD service transmitted by a non-user-specific DOD broadcast server system includes at least the following actions: °, receiving a first data stream containing a part of a selected DOD service via a transmission medium; and slowly transmitting it through a transmission medium Receive part of the service that includes the selected DOD Page 69 1244869 6. The second data stream within the scope of the patent application; and combining the first and second data streams to access the selected DOD service. 49. If the on-demand data (DOD) broadcast reception method of item 48 of the scope of patent application, further includes at least: eight pre-cuts = at least a part of the second data stream in a memory area; At least a portion of the loaded data stream is combined with at least a portion of the first data stream to project at least a portion of the OD service. 50. If the on-demand data (DOD) broadcast reception method of item 48 of the patent application scope further includes receiving at least an electronic ^ 0EPG), the EPG allows the DOD receiver to select a accessed d 〇d service 51.—A kind of on-demand data (DOD) broadcast feeder method, in order to provide users with a way to broadcast a service to a group of users via a transmission medium, including at least the following actions: provide-reduce idle A linear sequence of data blocks of time contains data that includes a selected DOD service; one of the most frequently occurring data blocks is removed from the sequence of data blocks that should reduce idle time; the most frequently occurring data block is moved to one Prefetched data stream so that the prefetched data stream includes prefetched funds corresponding to the selected DOD service 1244869 Applying for a patent range of material blocks, transmitting the pre-fetched data stream via the transmission medium; and transmitting the remaining sequence of reduced material blocks between the intermediary groin via the transmission medium, so that a receiving device can reduce the remaining idle time by The sequence of data blocks and the pre-fetched data blocks to generate the distant dod service, thus reducing the bandwidth requirements for transmitting the DOD service. 52 · If the on-demand data (DOD) broadcast server method of item 51 of the patent application scope, wherein the prefetched data stream includes an electronic program guide (EPG), the EPG includes indicating which services can be broadcast from the DOD Information provided by the server. 53. The on-demand data (DOD) broadcast feeder method of claim 52, wherein the EPG allows a user to select the selected DOD service for viewing. 54. If the on-demand data (DOD) broadcast server method of item 51 of the patent application scope further includes at least: Remove a group of additional data blocks from the data block sequence that reduces idle time, and place at least a part of the group of additional data blocks in the prefetched data; stream the prefetched data string> άk # 具 + 山? Item 4—nnn J includes the data blocks that appear in the lifting and the additional data blocks of the pair in the 忒 &amp; 疋 DOD service; and the remaining data blocks that reduce the idle time through the transmission medium. 1244869 VI. The patent application sequence allows a receiving device to combine the remaining sequence of data blocks with reduced intermission time and the pre-fetched data blocks to generate the selected J} 〇J) service, thereby further reducing transmission D 〇 Bandwidth requirements for D services.印 55 · If the on-demand data (DOD) broadcast method of the 54th scope of the patent application is applied, the group of additional data blocks includes a group of the second most frequently used shell material blocks, thus further reducing the transmission of The bandwidth of the DOD service needs 56. · If the scope of patent application is the 5th service = method, the data block of this group of additional data, so the demand is further reduced. The on-demand data (DOD) broadcast block of the item includes a group of the third most frequently requested data area for transmitting the bandwidth of the DOD service. 58 · Information area of server method. For example, the on-demand data (DOD) broadcast service of the 56th scope of Shen Qing's patent, where the group of additional data blocks includes a group of the fourth most frequently produced block, so further reducing the bandwidth for transmitting the DOD service requires patent application. On-demand data (DOD) broadcast of scope item 57 where the group of additional data blocks includes a group of the fifth most frequently produced block thus further reducing the bandwidth requirement for transmitting the DOD service 124486ft The broadcast server transmits and the EPG includes instructions]) 0I) the service receives the information for the DOD user. It is possible to make a 60-degree on-demand data (DOD) broadcast receiving party DOD receiver from a non-user-specific broadcast server, including at least the following actions ... methods for accessing the DOD transmitted through a server system receive a prefetch The data stream includes a pre-fetched data block corresponding to the selected DOD service. The pre-fetched data block is stored in a memory area. A raw data stream including the corresponding DOD service is received. Data block processing The original data block and the pre-fetched data access to the selected DOD service. The block is allowed to be used, 61. If the on-demand data (DOD) broadcast receiving method of item 60 of the patent application scope, further includes at least receiving an electronic program guide (EPG), including a message indicating that a DOD service is available. 62. If the on-demand data (DOD) broadcast reception method of item 60 of the patent application scope further includes at least: receiving input from a user, instructing the selected DOD service; switching a channel corresponding to the selected DOD service to respond Should be input by the user; and receive the raw data stream 0 from the channel corresponding to the selected D 0 D service 1244869 y 63. The on-demand data (DOD) broadcast receiving method according to item 62 of the patent application scope includes receiving an electronic program guide (EPG). y 64. If the on-demand data (DOD) broadcast receiving method of item 63 of the scope of patent application 'is used, the electronic program guide provides information to the user, indicating the DOD service that can be provided from the DOD broadcast server. ^ 65. If the on-demand data (DOD) broadcast reception method of item 64 of the patent application scope ', wherein the user can view a selected DOD service by selecting a message received from the EPG corresponding to the selected DOD service . ^ 66. The on-demand data (DOD) broadcast receiving method according to item 63 of the patent application scope further includes at least playing the DOD service through a video playback device. 67 · —A general-purpose set-top box (STB) that can receive and process a group of digital services, such as DOD and digital broadcasting. At least one of the digital services transmits a group of independent data streams. The general-purpose STB includes at least: a data A bus; a first communication device adapted to be coupled to a digital broadcast communication medium; the first communication device operable to receive digital data including a raw data stream and a pre-fetched data stream; bi-directionally tapping to the data Memory of the bus; a digital data decoder bidirectionally combined to the data bus; and a central processing unit (CPU) bidirectionally coupled to the data bus, the cpu acts as a tool of the STB control program to control the memory, the Digital decoder and the Page 74 1244869 &gt; Patent-pending demodulator, the STB control program is operable to process digital data received from the first communication device, and the CPU is further operable to process the raw data stream and pre-fetched data stream flow. 68. The general-purpose set-top box (STB) of item 67 of the scope of patent application, wherein the prefetched material is stored in the memory. 6 9. Γ The general set-top box (STB) of item 6 of the patent scope, wherein the data bank k is a high-speed data g_ suitable for performing in the-real-time mode til 2 for completion of real-time processing received from the- This digital need for communication equipment. ^ The "Second and Twenty-Second Patent" refers to the universal set-top box (STB) around item M, in which the -K material bank is a USB data bus. The universal set-top box (item 8) of item 67 in the patent F! Of the oblique U2 can be used. Among them, the high-speed (f i rewire) data bus is taken as the frame 7′々 丨 L. &gt; Please refer to the general-purpose set-top box (STB) of item 67 of the patent, in which the §memory includes a large number of storage devices. 73. If = please use the universal set-top box in item 72 of the patent, where the mass storage device is a hard disk. Eight Page 75 · 1244869 Sixth, the scope of the patent application is t ΐ, 11; J; JJ f6; ^ ^ ^ ^ ^^ STB) l # v ^ The general-purpose set-top box for speed item 74)) 'its cu It is a random access memory. Number of frames ^: The universal set-top box (STB) of item 67 of the Ming patent, in which the digital shell decoder has video and audio decoding capabilities. The universal set-top box (stb) of item 67 of the 7Htf patent scope in China, wherein the digital decoder is an MPEG decoder. The universal set-top box (STB), which accounted for item 67 in the scope of the patent application, has a ^^^^ feedstock decoder that supports a variety of digital data commands including play, stop, pause, forward-segment and forward. T + If the universal set-top box (STB) of the 67th area of the patent application is applied, the communication device includes a demodulator. The eighth of this patent claims the universal set-top box (STB) of item 67 of the patent scope, in which the anti-theft system is a QAM demodulator. ’For example, the general-purpose set-top box (STB) in the 67th area of the patent application, which is commonly used as a wired communication interface (Μ 〇 d e m). -4-24486 ^ VI. Scope of patent application ^ ~-82 · If you request the general set-top box (stb) of item 67 of the patent scope, the CPU is used as a user interface driver tool, which is suitable for explaining the reception from a coupling to User interface commands for the data bus. δ3. A general-purpose set-top box (STB) such as item 82 of the patent application, wherein the user interface includes a remote control device. 84. A general-purpose set-top box (STB) as claimed in item 82 of the patent application, wherein the user interface includes a keyboard. 85. The general-purpose set-top box (STB) in item 82 of the patent, wherein the user interface includes a computer system. 8 6. If the scope of patent application / item 67 is a general-purpose set-top box (STB), the STB control program can determine the nature of the materials received in a group of channels based on the information provided by an electronic program guide. 87. The general-purpose set-top box (STB) of item 86 in the scope of patent application, wherein the STB control program is operable to tune two or more of the channel group at the same time, and simultaneously process from two or more of the channel group. Information. 88. A general-purpose set-top box (STB), such as the 87th in the scope of patent application, wherein the STB control program is operable to provide EPG data to users of the general-purpose STB. Page 77 1244869 VI. Scope of patent application 8 9. If the general-purpose set-top box (STB) of the scope of patent application No. 88, the STB control program is operable to receive instructions from the user of the general-purpose STB. 90. The general-purpose set-top box (STB) of item 87 of the patent application park, wherein the STB control program is operable to tune the STB to a first channel to select data requested by the user, and determine the selected data. By nature, decoding the selected lean material 'decompresses the selected lean material' and reassembles the decoded lean material 5 stores the selected data in the memory and provides the selected data to an output device after proper processing. Page 78