CN1179057A - Delivery and acquisition of data segments with optimized inter-arrival time - Google Patents

Abstract

Data pages of an interactive program guide (IPG) for television are transmitted according to a shuffle function. A page of data, which corresponds to a full-screen image, is divided into segments and retrieved by the receivers over time. The segments are shuffled to provide an optimal separation in the data stream. The pages may be arranged sequentially, or with the even-numbered pages separated from the odd-numbered pages. The pages are partitioned into a number of subsets, and, within the pages of each subset, the segments are shuffled according to a perfect shuffle function such that respective adjacent segment pairs are arranged in an order which maximizes a minimum of their inter-segment distance after shuffling. The minimum inter-segment distance of all the subsets is used to determine a characteristic inter-segment arrival time, which must be large enough to correspond to the receiver's processing capability.

Description

Transmission and collection with the data segment of the mutual time of advent through optimizing

The invention relates to and for example be used to provide data to the transmission of receiver with the data segment of generation screen television broadcast program guide.Particularly propose a kind of method and apparatus, make one to receive function can also be optimized receiver simultaneously from data flow image data section with the lower data speed of the rating data speed that is lower than data flow response time.

Recently the broadcast program service that can be used for consumer and other users' various videos etc. increases day by day.The consumer can receive broadcast program service by cable, terrestrial broadcasting and direct satellite broadcasting link.Available broadcast program service includes traditional program that the government broadcasting network provides, satisfy those at the program that has the various specialized content of particular interest aspect news, politics, motion, the Nature, film, meteorology, history, shopping or the like, and the broadcast program of regional corporations.In addition, audio frequency and data broadcast program service are also popularized day by day.The language ability that audio service provides the music broadcast program maybe can exchange, and data broadcast program provides the information such as stock price, travelling and shopping etc.And can predict, traditional television program service will combine with the computer based service provide spectators can by the more service of selection.

Thereby be necessary so that the form of using is notified the broadcast program project of these countless Gong employings of spectators.Various screen graphs show might be used to provide programm name, viewing time and as the information of the explanation of the protagonist of a film etc. and so on of resembling.For example, common display format was enumerated in the given period, for example the relevant broadcast program information in one or two day from now on.In addition, this demonstration can also provide conversational characteristic, for example makes spectators' energy converted channel direct viewing one program, subscribe pay-per-view, recorded program obtains for example detailed film comment of additional information of a relevant program, perhaps obtains bill information by the broadcast program service supplier.Such screen display is referred to as dialog mode program guide (IPG).

In addition, can be for the data of upgrading IPG by transmitting with the same channel of broadcast program service.A kind of such being used to provides the U.S. Patent application of the system of IPG data at M.Eyer and Z.Guo " for the method and apparatus of dialog mode guide that available incident on the information network is provided " (sequence number no.502774, Aug.11.1995, transfer assignee General Instrument Corp. of the present invention) in introduction is arranged, be cited as a reference here.In this system, be used for transmitting continuously with low rate than the data of the broadcast program of short-term (for example two days from now on), " trickle " data flow, the data that are used for the broadcast program of long term (for example seven days from now on) then transmit continuously with the higher rate of one " request " data flow.This trickle data flow is by receiver automatic reception and processing, with update displayed gradually such as the variation of current information such as urgent broadcast program or inventory correction.Like this, the trickle data flow provides the continuous update ability and only requires receiver to deposit data corresponding to two days broadcast program.

On the contrary, the request data stream of two-forty will not collected and handle to receiver, do unless spectators order like this.For example, this wishes to obtain just may need during by the information of row's broadcast program more than two days for following spectators.Have again, when spectators require one to need the function of this request data stream, just wish to retrieve as quickly as possible and handle this information to avoid that spectators are produced inconvenient delay.

But on the receiver that industrialness is produced, the size of data input buffer and processing speed are limited.And different spectators will require the IPG of different piece arbitrarily preset time.Thereby just being desirable to provide the method and apparatus that a kind of Data transmission is given receiver, it can provide fast respond but unlikelyly surpass the disposal ability of receiver or the buffer of receiver is overflowed.In addition, this system should be able to such Apple talk Data Stream Protocol Apple Ta compatibility, the data that wherein are used for a single graphical display and are the page are by with a plurality of and a section carrying, and a plurality of receiver may need the different masses of data flow or the data of section at one time.Have again, need to have between the different spectators of different information the stand-by period of relative equilibrium at one time.The invention provides one has above-mentioned and data communication schemes other advantages.

According to the present invention, a kind of method and apparatus is proposed, make one to receive function with a lower data speed data flow image data section and also to make the reaction time of receiver simultaneously be minimum thus that is lower than the rating data speed of data flow.The present invention is specially adapted to transmit the dialog mode program guide (IPG) of notifying possible broadcast program service of one specific period of televiewer.

One is used for comprising the step of arranging the page with first sequence of pages by the method that communication channel transmits the page of data of a transmission cycle.Specifically, can sequentially arrange the page, perhaps the even number page and the odd number page can be separated.Then page division is become a plurality of subclass.

Each page comprises a plurality of by with first section tactic data segment.Then shuffle function array data section once more completely, with the section of the order that obtains to realize best intersegmental distance according to one.This best intersegmental distance makes corresponding to one that distance becomes maximum order between the minimal segment of each adjacent section of the section of winning order.And distance is subjected to receiver may receive constraint with the maximal rate of deal with data between this minimal segment.Generally, this speed speed of service of being subjected to the input of receiver to pay device size and processor limits.Any dead band that is present in the page of data all will be removed in this arranges once more.

Have, the page can comprise dissimilar pieces again.Each piece all is sections of one group.In this case, dissimilar pieces can be arranged in the transmission cycle one by one of first transmission cycle and its back, makes dissimilar pieces provide with desirable relative frequency.For example, the data block with higher-priority can provide with higher relative frequency in transmission cycle.By this way, when data flow is temporarily lost, just can reduce the time of gathering this data flow again.

Corresponding apparatus also is provided.

Also propose to be used for the receiver that pack processing contains the data flow of a plurality of page of data.This receiver comprises the device of the particular segment that is used for searching page.For example a specific I PG page can be split up into five sections, and receiver will one by one be assembled these sections and assemble whole five sections and can handle these data and the desirable image of reproduction on video screen up to it.Section in the data flow is shuffled function fully according to this and is handled to realize the best intersegmental distance in the data flow.Specifically, these sections make to be carried out in the order that is become maximum by distance between according to a minimal segment of each adjacent before shuffling function fully and handling section with one provides.

This receiver also comprises an input buffer that has for the distinctive capacity of receiving data stream.Promptly be exactly that this buffer only may store a certain amount of data.This receiver also has a processor, and it has for handling the distinctive processing speed of the data that receive by input buffer.Like this, this processor just is restricted to the speed of its energy deal with data.Thereby best intersegmental distance promptly is subjected to this constraint of handling speed.

Fig. 1 represents the ordering according to the page of data flow of the present invention;

Fig. 2 represents that becoming 25 data segments according to 5 data pages of the present invention segmentation is shuffled ordering with these 25 data segments;

Fig. 3 represents to sort according to the page of the present invention again;

Fig. 4 represents the repetition rate according to the minimizing of the explanation data block that is used to transmit of the present invention;

Fig. 5 represents according to the base page for the repetition rate that increases of the present invention;

Fig. 6 represents the ordering that has the data flow that page subregion and all data block types transmit with same frequency according to of the present invention;

Fig. 7 represents the ordering that has the data flow that page subregion and different types of data transmit with different frequency according to of the present invention;

Fig. 8 represents according to of the present invention for optimizing the process of the intersegmental time of advent;

Fig. 9 is for being used to transmit the block diagram of the equipment of IPG data according to the present invention; With

Figure 10 is for being used to receive the block diagram of the equipment of IPG data according to the present invention.

Dialog mode program guide (IPG) data can transmit in the time-division multiplex mode in conjunction with the video broadcast program data flow.Time-division multiplexization is specially adapted to transmission of digital data, and wherein data transmit with a plurality of coherent packets.Each packet can comprise the header data of the bag identifier (PID) that contains identification bag type.Receiver can be estimated the PID of each bag, only those interested bags is retrieved and is handled.

But, if with the speed that is lower than input traffic than under the low rate during operation receiver might be able to not estimate the PID of each bag.And the data input buffer of receiver may be deposited whole page of data inadequately greatly.In this case, require another approach cause one special receiver to carry out retrieval rightly synchronously to suitable packet.

According to the present invention, having proposed a kind of is the method and apparatus that shuffles the IPG data segment, and the text message that wherein defines same page of data is done temporal expansion so that the collection of receiver and processing.

The present invention will " shuffle " a plurality of data segments that function is applied to the data flow page fully.This shuffles function fully is a well-known processing element and the interconnective method of memory module.And shuffle the code efficiency that can be used to improve in the data communication or disperse burst error.

Shuffle function at this point fully, consider several X of the product of one or two integer Y and Z, for example X=YZ.And suppose that x and y are the integer of 0≤x＜X and 0≤y＜Y.Then Y-shuffles function and just is defined as: This shuffles function fully can be by considering that one group of X opens shuffling intuitively of card and understands.Card is divided into Y subclass, and the size of each is Z.This Y-shuffles the fully staggered card of taking from different subclass that inserts of function, its process is to get first card in each subclass as input, arrange this first card in turn in output place, get second card in each subclass then, after following first group of card closely, output arranges second card in turn, and so on.Carry out like this being aligned to output up to all input cards are all processed.

For example, the 3-that the 2-of consideration Y=2 shuffles function and Y=3 shuffles function, is defined as follows, wherein X=18: When 2-shuffles function, can be expressed as: list entries 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17 are shuffled into output sequence 0,9,1,10,2,11,3,12,4,13,5,14,6,15,7,16,8,17.And this shuffles function fully and can adopt the distance of shuffling in the ordering between two card x and the x+1 of X card to characterize.It is to be noted that x and x+1 are separated by a card in original ordering.For example, when 3-shuffles for x=14 and x+1=15, Dx=D14=|3-shuffle (14)-3-shuffle (15) |=| 8-11|=3, and D11=D14=|3-shuffle (11)-3-shuffle (12) |=| 16-2|=14.More perfect definition can take into account the effect that repeats this card sets periodically, but this will can not influence the definition of minimum range D ', as below being explained in more detail.

Suppose effective value D '=min{Dx} to all x.Then when Y＜X, the D ' that Y-shuffles=Y.As special circumstances, obtain D '=1 when Y=X (or Z=1), because X-Shuffle (x)=x.This minimum range D ' for a given IPG system configuration, will determine to be defined as to belong to intersegmental time of advent of the T of minimum time-delay between the arrival of any two sections x of the same request msg page at receiver place and x+1.

Fig. 1 shows the ordering according to the page in the data flow of the present invention.Totally be expressed as 100 data flow and comprise respectively transmission cycles that link up with 110,130 and 150 expressions.First transmission cycle 110 includes a base page 112, timetable-list block 114 and illustrated block 116. Piece 114 and 116 is formed a data page together to (as page m). Piece 132 and 134 also forms a page (as page n).These pieces are subpages, because they are subclass of a complete page.And each piece all comprises one or more data segment, as following.The broadcast program that can be used for a given service of each one specific period of page description of the piece in each transmission cycle.For example the piece 114 of first transmission cycle 110 and 116 can illustrate available program during certain day 6pm to 10pm, and the piece 132 and 134 of first transmission cycle 110 then can illustrate the program that can use in another period.Middle piece is with the broadcast program of order corresponding to interim.Be called between antephase the period that transmission cycle is crossed over.Be called time slot the period that the page is crossed over.

The page comprises the data of the graphical display that is used to provide IPG.Specifically, but the base page 112,136 of transmission cycle 110,130 and 150 and the data of the widespread usage of 156 each self-contained non-timed, it indicates program subject matter classification (as music, physical culture, film), program specification attribute-name is (as stereo, black and white), broadcast program comes the parent name source (as NBC, HBO), the huffman table of using in the data compression, or the like.Timetable-list block 114 ..., 132,138 ..., 152 and 158... comprise the title of available programs, illustrated block 116 ..., 134,140 ..., 154,160... includes joint purpose additional information, for example be worth, featured performer, or the like.On the other hand, a piece that only provides about the information of programm name can only be provided an IPG page.

But problem is that at arbitrary given time, different spectators wish to see corresponding to the different programs of the different pages of data flow and the IPG data of time slot.And general receiver buffer will supply to deposit entire I PG page of data enough greatly.Therefore force the data of the whole given program/time slot of receiver primary retrieval will cause the situation of overflowing.

Thereby, the segmentation of IPG page of data is come receiver is sent.Preferably respectively the page of the section of being divided into is loaded with same data volume, for example 1024 bytes (1Kbyte).Data segment can be shuffled the hardware constraints (as bandwidth) that adapts to receiver then, make spectators the time of watching the IPG data to wait for reduce to minimum simultaneously.For example, streaming rate can be 1.5Mbps, and receiver then can have the maximum bandwidth of 0.15Mbps.Receiver will only be reformulated complete message after receiving all sections.

This discrete method is one to relate to three parameters " M among the N " scheme, is " table expansion " number specifically, the reading of total hop count (N) and the indication of the hop count (M) that message is carried in the message (as piece).Can be to table or the message image of arbitrary single type of message definition more than one.The table extension field is separated a message and another.In this segmentation method, all sections of same message must be isometric, even its back segment must fill up with null byte.This length should be big as far as possible under being no more than according to the predetermined peaked condition of the input buffer size (as 1024byte) of receiver.Like this, if the hop count in the message is N, will need N-1 null byte at most.

In addition, because the equal and opposite in direction of each message section, just can grow and multiply by total hop count simply and calculate by the message body in will be arbitrary received section for preserving the required RAM of the whole image of message body.For example, a given message is 20 sections, every section 1kbyte, and total image size just will be 20Kbyte.

In a word, the calculating of N and section size relates to find a N value to make the size of each section be no more than 1Kbyte for the maximum possible value needs only it.Should be noted also that to storing the calculating of the required RAM size of whole image, owing to need obtain the hop count of integer, can be greater than a small amount of several bytes of the actual size of whole message.

After in each section that receives a message any, the image of the message that the configurable RAM of receiver rallies is filled in the message header before message body and is filled in the part (for example 1/N) of message body.When another section arrived, the other part of definition message body was until receiving all parts.

Shuffling in the scheme according to of the present invention section, supposing has I the page to send in each transmission cycle.Contained each piece such as said segmentation in addition in the page.Then according to Z=max{Z1 ... .ZI} determines an integer Z, wherein Zi (1≤i≤I) for the piece on the page i be divided into section number.For example, if page i contains timetable-list block and the illustrated block that is segmented into 10 and 15 sections separately, then Zi=10+15=25.Then remove the integer d that X determines that 0≤d＜Z scope is interior with Z, wherein X=(Z1+...+Zi+d), that is X/Z=Y, Y are a certain integer.

Then the X section is carried out Y-as described and shuffle, last here d section is a dead band, and the section through shuffling that obtains is at last compressed by the deletion dead band.Should point out, shuffle operation and do not launch data segment between the two adjacent pages, therefore will depend on this situation and promptly will utilize difference bag identifier (PID) in separately the head the collection of two adjacent page.

Fig. 2 represents 5 data pages are divided into together with 25 data segments that 3 dead bands are arranged with according to the ordering of shuffling of 25 data segments of the present invention.In this example, request IPG data are carried on 5 pages, comprise 1 base page and 4 timetable pages.Notice that this page is sorted successively.The ordering of 5 data pages and 1 empty page shown in 200, first section top that is in sequence so that the timetable page arrange by ascending.The ordering of the section after shuffling is represented as data sequence 250.

The timetable page can only comprise timetable-list block and section, perhaps timetable-tabulation and illustrated block and section.For the sake of simplicity, Fig. 2 does not show two kinds of difference between segment type.As showing previously, if there are these two kinds of segment types on the page, timetable-tabulation section will be before the explanation section.Utilize the segmentation method of being discussed, the page 1,2,3,4 and 5 are segmented into 3,6,4,5 and 7 sections separately.Like this, Z=max{Z1, Z2, Z3, Z4, Z5}=max{3,6,4,5,7}=7.

Specifically, being expressed as 205 first page is base page, the section of including 0-2; Second page section of the comprising 3-8 with 210 expressions; The 3rd page is with 215 expressions, the section of comprising 9-12; The 4th page section of comprising 13-17 with 220 expressions; The 5th page section of comprising 18-24 with 225 expressions; Comprise dead band 25-27 with empty page with 230 expressions.In this example, d=3 makes (Z1+Z2+Z3+Z4+Z5+d) can be with 7 smallest positive integrals of removing.Its integer quotient is Y=4.Therefore, X=YZ=28 section.

This last three (d=3) section is aligned to shown in 200 at first for 28 data segments of dead band.Because Y=4 shuffles so these sections are carried out 4-, the result obtains the data sequence of shuffling of 250 expressions.At last, obtain by removing dead band 25-27 with the ordering after compressed the shuffling of 280 expressions.

For further specifying, consider that now spectators are input as the decoding of watching corresponding to the order of IPG time slot of the pages 1 of 215 expressions the time and handle by data flow 250 of shuffling and 280 resulting advantages.Suppose in per 1/28 second data flow 200 or 250 one section of carrying again, so be 1 second by 28 sections defined transmission cycles.Like this, for one can be with the receiver less than the maximum rate processing section of 28 sections of per seconds, this receiver be that three adjacent segment of searching page 1 just must be waited for three cycles (for example 3 seconds) when being the arrangement of common data flow 200.

But for according to the data flow 250 through shuffling provided by the present invention, three sections three sections that are received current uninterested other pages of machine of the page 1 separate.Thereby receiver just can be with per second only 7 sections or processing speed all three sections of searching page 1 in a single cycle faster.In fact, the required processing speed of receiver reduces 28/7=4 doubly at least, but acquisition time is much improved.But also should see that this represents three sections to be a kind of ideal situation that receives respectively in three coherent cycles.Under physical condition, receiver may be lost in each cycle same section or a plurality of sections continuously, and therefore can not receive the partial data of the page 1.

Fig. 3 represents the ordering again according to the page of the present invention.The two or more PID of ordering requirements successively of the timetable page in the data flow 300 are used to send the message of segmentation.This is because section is shuffled separately not on greater than 1 distance configuration from the section of adjacent page.When desirable time slot need be set up from the data of two pages, obtain two pages that may be assigned to two different PID respectively with regard to adopting two pid filters.This requirement can be avoided by the timetable page is sorted with the pattern that is shuffled, and is before this all even number page all is arranged on the page of all odd numbers, perhaps opposite.This point can be by noticing that when not making shuffle process the section on the same page is in the situation of phase mutual edge distance 1 (for example section is adjacent) and understands.Utilize shuffling of section, the interval of section increases in a given range.But it apart is 1 state that the section that belongs to page i and i+1 respectively may still be in.As an example, belong to separately in Fig. 2 data flow 200 again in the compression ordering of section 14 and 21 in data flow 280 of the page 4 and 5 and adjoin each other.

Like this, if the page arrange like this with the simple incremental order page 1, the page 2, page 3 or the like, even from the section of the page of order adjacency carry out 3 sections may be still after shuffling apart 1.In this case, utilize same pid filter just can't to be obtained from the section of the adjacency page.To need two or more PID that same data flow is separately become two data flow every one page ground with data, and can utilize a page filter to handle a PID then.In other words, each page filter will only be searched two in the page one.

But, if the page is arranged in the order page 1, the page 3, the page 5... page 2, the page 4, page 6... or the like, the page of adjacency successively, for example the page 3 and 4 is all non-conterminous in arbitrary transmission cycle.Any section adjacent before shuffling is all non-conterminous after shuffling.Utilize this row sharp, page filter just can be searched the page from the adjacency of same PID, and data flow need not to cut apart.

Specifically with 300 orderings successively of making 7 timetable pages of total expression.302 expressions, one base page.The page 1 with 305 expressions comprises the piece of one 3 timetables-tabulation section and the piece of one 3 explanation sections, 6 sections altogether.The page 2 with 310 expressions comprises the piece of one 2 timetables-tabulation section and the piece of one 3 explanation sections, 5 sections altogether.The page 3 with 315 expressions comprises the piece of one 3 timetables-tabulation section and the piece of one 2 explanation sections, 5 sections altogether.The page 4 with 320 expressions comprises the piece of one 2 timetables-tabulation section and the piece of one 2 explanation sections, 4 sections altogether.The page 5 with 325 expressions comprises the piece of one 4 timetables-tabulation section and the piece of one 4 explanation sections, 8 sections altogether.The page 6 with 330 expressions comprises the piece of one 4 timetables-tabulation section and the piece of one 3 explanation sections, 7 sections altogether.The page 7 with 335 expressions comprises the piece of one 3 timetables-tabulation section and the piece of one 2 explanation sections, 5 sections altogether.

In addition, be arranged on the beginning of sequence 300 with the base page of 302 expressions.Base page 302 and timetable page 305-335 form a transmission cycle together.

Data sequence 350 shows the ordering again according to page of data of the present invention.The page 1 to 7 is sorted again is sequence: the page 1, the page 3, the page 5, the page 7, the page 2, the page 4, the page 6.Like this, the odd number page is arranged on before the even number page.The page ordering of shuffling is with any amount of PID work.If only adopt a PID, just must utilize same pid filter to obtain the two adjacent pages (as the page 1 and 2).

Fig. 4 represents the repetition rate that reduces of the explanation data block that is used to transmit according to the present invention.The data that are transmitted are corresponding to the page of the data sequence 300 of Fig. 3.Piece repeats, is that transmission frequency F is defined as the average time that each transmission cycle one given categorical data piece is sent out.In the example in front, supposed that all data block types are all had equal repetition rate.Promptly be exactly, each piece, no matter its type is how, each cycle all is transmitted once.Here the more general transmission plan that is disclosed makes dissimilar pieces to transmit with different frequencies.For example, suppose Fd, Ft and Ft are respectively the repetition rate of explanation, timetable-tabulation, base page.Following relation of plane should be set up.

F _d≤ F _t≤ F _fAnd Ft equals 1 by definition; In other words, each timetable-list block is transmitted once at each transmission cycle.Increase in advance that to utilize different repetition rates be desired and be essential sometimes at passage or database.For example, identical if message transmission rate R keeps along with the increase of database size, then the program title acquisition time in the receiver may proportional increase when all block types all transmit with same frequency.Undesirable increase on this acquisition time can be by avoiding to transmit the explanation data than low frequency, and in this case, each cycle is only transmitted some illustrated block.As a result, the consumer can at first obtain program title information relatively soon, can obtain program specific if desired then.Should point out that the consumer may lose interest in to any explanation of first group of shown program title, but may wish to watch other program title before watching selection making.

The situation of data sequence 400 and 450 expression Fd=1/2.That is the illustrated block of each page of data transmits with the speed of 1/2 of each transmission cycle, and promptly per two transmission cycles transmit one.In the data sequence 400, first half block of illustrated block only transmits in the odd number transmission cycle.Thereby in first transmission cycle, data sequence 400 comprises respectively with 405, the 410 and 415 represented pages 1,2 and 3 timetable-list block and data declaration piece, but only comprises respectively with the pages 4,5,6 of 420,425,430 and 435 expressions and timetable-list block of 7.Base page 402 transmits in odd cycle, and base page 403 then transmits in even cycle.

In even cycle, for second half of the page that is not transmitted in odd cycle transmits illustrated block.Like this, to second transmission cycle, data sequence 450 comprises respectively with the pages 4,5,6 of 480,465,485 and 470 expressions and 7 timetable-list block and data declaration piece, but only comprises respectively with the pages 1,2 of 455,475 and 460 expressions and timetable-list block of 3.As can be appreciated, in the process of several transmission cycles, timetable-list block will transmit with each transmission cycle effective speed once, and illustrated block will transmit with per two transmission cycles effective speed once.Should point out that base page is to transmit with each transmission cycle speed once.Modification to such scheme is possible, for example Fd can be set to 1/3,1/4 etc., and Ff can change also.In a word, will determine suitable transmission frequency for the desirable relative acquisition time of the different types of data that must transmit.

Fig. 5 represents the base page to the repetition rate of increase according to the present invention.Because function does not lack base page so far to IPG, transmit base page more than once gathering quickly so that receive function so may wish each cycle.Data sequence 500 is identical with the odd cycle data sequence 400 of Fig. 4, unique different be to add base page 502 to be provided with between the pages 7 of 435 expressions and the pages 2 with 410 expressions.Thereby Ff=2, because base page provides with the speed of every transmission cycle two pages.Similarly, data sequence 550 is identical with the odd cycle data sequence 450 of Fig. 4, but is provided with additional base page 503 between the pages 2 with 470 pages of representing 7 and 475 expressions.

Fig. 6 represents to have page subregion and all block types all with the ordering of the data flow of same frequency transmission according to of the present invention.Should point out that the aforesaid measure of shuffling is applied to all data segments simultaneously.In general, as long as the page of data of one group of preformatting comprises request IPG data, just respectively the section of each subclass of the page is shuffled and operate so that optimize the intersegmental time of advent.Specifically, by page subregion, the page in each transmission cycle is split up into G subclass of size about equally.Common G 〉=1, the G representative desires to send in advance in one-period all pages all belong to the inessential situation of same subclass.In data sequence 600, G=2, this sequence comprises first subclass 640 and second subclass 680.The sequence 350 through ordering again of data sequence 600 and Fig. 3 is identical, but the base page and the page 1,3,5 and 7 be comprised in first subclass 640, and the page 2,4 and 6 is comprised in second subclass 680.

Fig. 7 represents the ordering that has the data flow that page subregion and different masses type transmit with different frequency according to of the present invention.Here, data sequence 700 is identical with the sequence 500 of Fig. 5, but the base page and the page 1,3,5 and 7 be comprised in first subclass, is comprised in second subclass and face directly substantially with the page 2,4 and 6.

Other page subregion modification also is possible.Can provide a plurality of subclass in each transmission cycle, and block type and transmission frequency change in each subclass.The purpose of page subregion is to ask for the optimum value of minimum range D.For a given system configuration (for example, having data designated speed, database elder generation's line period and groove crack size), distance will be determined intersegmental time of advent of the T of this minimal segment between minimal segment.T must be corresponding to the processing speed of receiver, and it allows time-delay to determine by this minimum of two data segments of the same page.

Optimum distance is one to give and to make the distance of minimum T of T 〉=Td in advance.For example suppose that the minimum to receiver allows time-delay to be Td=50msec.So, if two subregions cause T=212msec and 100msec respectively, then second subregion is preferable.If two other subregions produce 70 and intersegmental time of advent of 40msec respectively, be considered to best corresponding to the subregion of 70msec.Be unacceptable the intersegmental time of advent of 40msec, because the processing speed of it and receiver is incompatible.Therefore it is one optimally partitioned to cause the subregion of best intersegmental distance to be.Adopt and optimally partitionedly will improve optimal acquisition time in the receiver and time under the unlikely increase worst case, this moment, the acquisition time of the different pages may be different, for example changed because change page-size.In practice, may adopt the suboptimum subregion, it provides the distance of a receiver time-delay Td who allows greater than minimum so that the variation in decryption stream, communication channel and/or the receiver.

Fig. 8 represents according to the optimization of the present invention process of the intersegmental time of advent.The optimization of the intersegmental time of advent is then the section in each subclass of the page to be shuffled and reached by trying to achieve a best page subregion.Optimization process is when IPG system start-up and change any IPG system structure parameter, as carrying out after data speed, database elder generation's line period or the groove crack size.At first the page of data of transmission cycle is arranged to divide odd and page even number again at frame 805.Select the repetition rate of different masses type at frame 810.At frame 815, number of subsets G is set to 1.Like this, frame 805-815 determines initialization step.Divide page of data into G the roughly subclass of equal size at frame 820.Shuffle as data segment in 825 pairs of each i subclass of frame.That is, in each subclass, shuffle operation respectively.Should point out that each subclass of the page may have the data segment of varying number.

At frame 830, each of G subclass is determined between minimal segment the Ti time of advent, as below discussing.Determine between minimum G minimal segments the T time of advent at frame 830, make T=min{Ti}, 1≤i≤G.At frame 840, if 1.5Td＜T＜2.5Td, wherein Td is all period interval of minimum receiver, then assert that at frame 860 corresponding subregion is best.Otherwise, if at frame 845T≤1.5Td, then subclass G number is subtracted 1, so that reach optimally partitioned at frame 860 at frame 850.Get the maximum of G-1 and 1 at frame 850.Otherwise at frame 855 subclass G number is increased 1, and once more page of data is divided into G subclass (frame 820).

Should point out that said process is that the minimum receiver cycle interval T d of supposition is known.If also can change into and handled with process of the test but Td is the unknown.Specifically, G can increased by 1 by time shown in Fig. 8, and warning receiver still can obtain data segment to guarantee it at every turn.When G is increased to certain level, as G _k, when this receiver no longer can be collected data segment because intersegmental time of advent of T is too little, so optimally partitioned just will be corresponding to G=max{G _k-2,1}.For example, if G _k=5, then G=3 subclass is exactly optimally partitioned.

Press the optimizing process of Fig. 8, can do following evaluation the intersegmental time of advent.This evaluation is an explanation of simplifying, can be different with the realization of reality.Following variable is same as in calculating and the explanation:

L elder generation line period (fate)

S groove crack size (hourage)

D defines the minimum range between any two continuous segments of same time slot, general D＜D ' (section)

R request msg transmission rate (Mbps)

Tk transmits 1Mb data required times (msec)

Minimum time-delay (msec) between any two continuous segments that T defines identical time slot arrive

For zoneless data flow, quote the data sequence 350 of Fig. 3 again, wherein transmission cycle definition-subclass.Sequence 350 comprises a base page and seven data pages, the page 1,3,5,7,2,4 and 6.Suppose that again seven pages contain the broadcast program data of seven day time, each page is corresponding on the same day a broadcast program not.Period L=7 day in advance then, groove crack size S=24 hour, and seven request msg pages (ignoring base page) are arranged in each transmission cycle.

In the data sequence 350, owing to there are seven data pages, each it is desirable to that data segment is carried out 7-and shuffles at one day broadcast program, provides between minimal segment apart from D '=7.But D ' may reduce 1 section when being provided with dead band in original data sequence, as in the example of Fig. 2, has 3 dead band 25-27 to be added to data sequence 200 here.And when page-size not simultaneously D ' must be reduced by at least another data segment, as data sequence 350, here the page 1 with 305 expressions contains 6 sections, the page 2 with 310 expressions contains 5 sections, the page 3 with 315 expressions contains 5 sections, contains 4 sections with 320 pages of representing 4, contains 8 sections with 325 pages of representing 5, the page 6 with 330 expressions contains 7 sections, contains 5 sections with 335 pages of representing 7.

Like this, for the data sequence 350 of Fig. 3, D=D '-1-1=7-1-1=5 section.Tentation data speed is that 1.5Mbps (as R=1.5) and each section are the size of 1Kbyte again, and the time of then transmitting the 1kbyte data is Tk=8bit/byte/R=8/1.5=5.3msec.。Thereby be T=D * T the intersegmental time of advent _k=5 * 5.3msec=26.3msec.

Consider that now each page contains the data conditions that is useful on one 4 hours time slots of arrangement.Here will need 42 pages that 7 days IPG date is provided, because 7 days * 24 hours/day/4 hours/page=42 pages.Thereby minimum range D '=42, D=D '-1-1=40.Be T=D * T the corresponding intersegmental time of advent _k=40 * 5.3msec=212msec.

Below table 1 expression to the result of different pieces of information speed and groove crack size, can see, data hop count fixedly time the in a transmission cycle, intersegmental time-delay T will reducing and increase proportionally with the big or small S of time slot.

Table 1 is estimated the intersegmental time of advent: no page subregion, identical piece repetition rate

L (my god)	??R (Mbps)	S (hour)	D (section)	???T ?(msec)
					??7	1	??4	?40	??320
??6	?26	??208
			??8	?19			??152
??12	?12	??96
			??24	?5			??40
1.5	??4	?40						??212
			??6	?26		??137.8
	??8	?19					??100.7
			??12	?12		??63.6
	??24	?5					??26.5
			2.0	??4		?40		??160
??6	?26	??104
				??8		?19	??76
??12	?12	??48
				??24		?5	??20

For the data flow that has subregion, will reduce the intersegmental time of advent.For example consider the data sequence 600 of Fig. 6.Transmission cycle is divided into two subclass 640 and 680, and all block types all transmit with same frequency.When page of data contain be useful on 24 hours time slot (S=24) the IPG data time, for first subclass 640 4 pages are arranged, D '=4, but 3 pages, D '=3 are only arranged for second subclass 680.Because intersegmental is constraint apart from the smaller, D '=3 must be used for whole transmission cycle.Thereby D=D '-1-1=3-1-1=1.Because transmit 1Mbyte data (as a section) required time T during R=1.5Mbps _k=5.3msec is so be T=D * T the intersegmental time of advent _k=1 * 5.3msec=5.3msec.

For S=4 hour time slot, requiring altogether once more, 42 pages provided seven days IPG date.These 42 pages are done uniform distribution, and 21 pages are in first subclass 640, and 21 pages are in second subclass 680, thus minimum range D '=21, D=D '-1-1=19.Be T=D * T the intersegmental time of advent _k=19 * 5.3msec=100.7msec.Following table 2 expression is to the result of different pieces of information speed and groove crack size.

Should point out, generally speaking, preferably can carry out subregion to the transmission cycle page as far as possible equably, so that each subclass can have the page of roughly the same quantity, because this will produce maximum D '.For example, disposed pro rata with original distribution, for example, will be obtained the subregion of non-the best with 4: 3 proportional arrangement if having 42 data pages of 4 hours time slots.Specifically, under this non-optimal cases, first subclass 640 will comprise 4 * 6=24 page, and second subclass 680 will comprise 3 * 6=18 page.Like this, D ' will be the smaller in 24 and 18, i.e. D '=18.As already discussed, when other factors are identical, preferably can obtain between a bigger minimal segment apart from D ', because it will produce the bigger intersegmental time of advent.Table 2 is estimated mutually the time of advent: the page divides 2 subclass into, identical repetition rate

L (my god)	????R ??(Mbps)	S (hour)	D (section)	???T ?(msec)
					??7	??1	??4	??19	??152
??6	??12	??96
			??8	??8			??64
??12	??5	??40
			??24	??1			??8
??1.5	??4	??19						??100.7
			??6	??12		??63.6
	??8	??8					??42.4
			??12	??5		??26.5
	??24	??1					??5.3
			??2.0	??4		??19		??76
??6	??12	??48
				??8		??8	??32
??12	??5	??20
				??24		??1	??4

For having the different piece repetition rates and the situation of no page subregion, referring again to the data sequence 500 of Fig. 5.Here, have the data segment of 7 pages in each transmission cycle, disregard master data.In addition, wherein three pages each all be loaded with timetable-tabulation and illustrated block, and other four pages only comprise timetable-list block separately.Specifically, the page 1,2 and 3 with 405,410 and 415 expressions is loaded with timetable-tabulation and illustrated block separately respectively, and each then only is loaded with timetable-list block to the page 4,5,6 and 7 (respectively with 420,425,430 and 435 expressions).

For example, be assumed to 24 hours time slots (S=24) and X days elder generation's line periods (L=7).Suppose that also timetable-tabulation and illustrated block are onesize.Then shuffle, just the page 4,5,6 and 7 can be handled as two pages that are loaded with timetable-list block and illustrated block in fact separately together for the section of work.Therefore, for whole transmission cycle, D '=3+4/2=5 section and D=D '-1-1=3.At R=1.5Mbps and T _kDuring=5.3msec, be T=D * T the corresponding intersegmental time of advent _k=3 * 5.3msec=15.9msec.

For one 4 hours groove crack size (S=4) situation, 42 pages altogether will be arranged, wherein 21 can be configured to the page 1,2 and 3, and wherein 21/2 can be configured to the page 4,5,6 and 7.Like this, for whole data sequence 500, D '=21+21/2 ≈ 31 and D=D '-1-1=29, be T=D * T the mutual time of advent during R=1.5Mbps _k=29 * 5.3msec=153.7msec.Table 3 expression is to the result of different pieces of information speed and groove crack size.

Table 3 is estimated each other the time of advent: no page subregion, different repetition rates

L (my god)	???R ?(Mbps)	S (hour)	D (section)	??T ?(msec)
					??7	??1	??4	?29	??232
??6	?19	??152
			??8	?13			??104
??12	?8	??64
			??24	?3			??24
??1.5	??4	?29						??153.7
			??6	?19		??100.7
	??8	?13					??68.9
			??12	?8		??42.4
	??24	?3					??15.9
			??2.0	??4		?29		??116
??6	?19	??76
				??8		?13	??52
??12	?8	??32
				??24		?3	??12

For the situation of different masses repetition rate and page subregion, referring again to the data sequence 700 of Fig. 7.Data sequence 700 comprises first subclass 740 and second subclass 780.For 24 hours time slots (S=24), first subclass 740 comprises 4 pages, still disregards base page 402.Second subclass 780 comprises 3 pages, and one of them is loaded with timetable-tabulation and illustrated block (for example the page 2, with 410 expressions), and wherein two only are loaded with illustrated block (as respectively with the pages 4 and 6 of 420 and 430 expressions) separately.So for second subclass 780, D '=1+2/2=2, and D '-1-1=0.But, by definition, D 〉=1, thereby D=1 is appropriate result in this case.In a word, adopt among the embodiment of different piece repetition rates and page subregion in the present invention one, be close in the subclass half the page each will be loaded with timetable and illustrated block, and second half page will only be loaded with illustrated block separately.

Thereby, for second subclass 780, at R=1.5Mbps and T _kDuring=5.3msec, be T=D * T the intersegmental time of advent _k=1 * 5.3msec=5.3msec.Can determine similarly the intersegmental time of advent for first subclass 740.

For the situation of 4 hours time slots, also will have 42 pages, 21 by the carrying of first subclass 740, and 21 by 780 carryings of second subclass.According to above reasoning, 21 pages that carry in second subclass 780 will comprise 10 sections of the timetable of being loaded with and illustrated block and only be loaded with 11 sections of illustrated block.Like this, D '=10+11/2 ≈ 10+5=15 and D=D '-1-1=13, and be T=D * T the intersegmental time of advent _k=13 * 5.3msec=68.9msec.Result when table 4 shows different pieces of information speed and groove crack size.

Table 4 is estimated each other the time of advent: the page divides two subclass into, different repetition rates.

L (my god)	??R (Mbps)	S (hour)	D (section)	??T (msec)
					??7	??1	??4	??13	??104
??6	??8	??64
			??8	??5			??40
??12	??3	??24
			??24	??1			??8
??1.5	??4	??13						??68.9
			??6	??8		??42.4
	??8	??5					??26.5
			??12	??3		??15.9
	??24	??1					??5.3
			??2.0	??4		??13		??52
??6	??8	??32
				??8		??5	??20
??12	??3	??12
				??24		??1	??4

The various supposition that relevant aforementioned calculation was done in the intersegmental time of advent should be pointed out, each data segment is assumed that kilobytes are long.If in fact the segment length is shorter, the intersegmental time of advent also will be short slightly.And, be that the different page of supposition has difference but similarly big or small in the above-mentioned example, this makes intersegmental distance dwindle 1 by D ', this D ' is the page number (for example time slot) in the period L of going ahead of the rest.If situation is not like this, for example when one of page was much bigger than other, distance D can further reduce.In addition, the result in the table 4 supposes that illustrated block will be big or small on an equal basis with timetable-list block.This can not change at actual database.

Fig. 9 is for according to the block diagram that is used to transmit the equipment of IPG data of the present invention.Specifically, the shown encoder device broadcast program service that can be used to provide by a communication network with various desires is made Port Multiplier and is concentrated and send dialog mode program guide (IPG) packet.Bag stream Port Multiplier 914 receives N different service data packet that are input to this Port Multiplier by a plurality of terminals 910,912.The IPG bag also is input to bag stream Port Multiplier 914 and is used for carrying out the demultiplexing processing with different service data packet after handling by the present invention.Bag stream Port Multiplier output from Port Multiplier 914 is transmitted by communication network by a common transmitter 922.This communication network can comprise for example satellite communication network, cable TV network, or telephone network.

The IPG schedule information is input to an IPG data processor 916 by operator interface 918.Operator interface for example can comprise that one has the work station that the operator is used for importing the keyboard of various schedule informations.The schedule information generally time slot in a specific period is organized.This time slot can be size arbitrarily, for example 2,4,6,8 or 12 hours.For each item, can provide title with the operable time of this item.Also can be used as the explanation that item is provided via the IPG section data of operator interface input.

According to the present invention, the step of setting in the IPG processor execution graph 8, output request data stream 917 and trickle data flow 919.Specifically, the data segment that the process that request data stream comprises to be provided in a plurality of page of data is shuffled, and also page of data can be configured in the subclass of data flow.As already mentioned, the trickle data flow is a low rate IPG stream, and it is used to can maintain current broadcast program with the memory in the assurance receiver user is response performance and the user friendly performance that what be new improves program guide function.And, the part no matter when user wishes to watch the program guide data storehouse that is not deposited into the receiver memory, desired portion can be by obtaining in the high-speed requests stream.Like this, the trickle data just need not to be used for to have and surpass the farther program for making dispositions future of the retainable program of available receiver institute with maximum IPGRAM storage unit.Every other data all provide by request stream.

Realize for simplifying, preferably the trickle data stream format is changed into the structure same with request data stream.But there is no need to handle the trickle data flow according to the solution of the present invention, because it is to provide than the much lower speed of request data stream.In receiver hardware, carry out filtering by the data block of trickle data flow reception and represent the data that receiver RAM can preserve that surpass far away to reject those.Best, multichannel is handled a trickle data flow also only is set each time, and all current timetable data are carried in the individual traffic.On the other hand, request data stream then can be set in the different data flow of being carried in the demultiplexing output of a plurality of bag stream Port Multiplier 914 outputs.

Trickle and request data stream are done the demultiplexing processing then together and are divided into packet respectively by 916 outputs of IPG data processor in IPG Port Multiplier and packetizer 920.The IPG packet that obtains at last be input to bag stream Port Multiplier 914 and with the multiline message that is sent out in the packet of the various broadcast program service of carrying combined.

For most of the time table information among the receiver RAM timetable of current date (for example to) is provided, once and RAM be loaded the back user and can have time-delay ground and retrieve this information.Other data in the timetable database, i.e. request msg must as far as possible reasonably be retrieved with the minimum time-delay in the scope of the restriction of system cost and complexity.Like this, if the user selects the interested period in a future, he must see the program hurdle (containing the arrangement to the item in this period) in this following period in the short as far as possible time.This time answered no more than several seconds.Program specific information is for should can see (for example one to three second) after being no more than the several seconds at the program of seeing its title on the screen.The IPG data that necessary low acquisition time requires also not to be stored among the RAM are sent with high transmission speed by request data stream.

Figure 10 is for according to the block diagram that is used to receive the equipment of IPG data of the present invention.Data sink 1032 receives the data flow that is transmitted by input 1030.The data that received are provided for bag stream demultplexer 1034, and it will be asked and trickle IPG packet outputs to IPG microprocessor 1036.Transport other packets in the data flow, wherein can comprise video and packets of audio data, also by 1034 outputs of bag stream demultplexer.

Microprocessor 1036 is handled request and trickle data flow respectively.Function 1040 provides the processing of the request msg section through shuffling.Function 1044 provides trickle to handle.In a preferred embodiment, request is handled than the trickle processing and is carried out with much higher speed.For example, the data rate of request data stream will be the order of magnitude of 1-2Mbps, and the data rate of trickle will be the order of magnitude of 10Kbps.Because the trickle data are stored in the receiver memory by this locality, there is no need to be placed in the high-rate data stream, because it will be taken by receiver RAM immediately.

The selected part cargo shipment of trickle data and request msg is advanced the RAM1050 of system by memory management device 1048 controls of being coupled to microprocessor 1036.The memory management device stores trickle with usual method addressing RAM1050 and request msg supplies subsequently by microprocessor retrieval and demonstration on the monitor 1054 that is coupled to vision processor 1052.Carry out the selection of particular time-slot of the schedule information in future contained in the request data stream by user interface 1046.This user interface can comprise a for example remote control of being coupled to the input instruction of microprocessor 1036.

A function of memory management device 1048 is free time storage tolerances available among the surveillance RAM1050.At available storage capability less than for storage title of relevant time slot and declare record aequum the time, the memory management device can be by removing declare record among the RAM of system so that provide the space for all header records.Under this mode,, heading message just becomes immediately that the user can use in case being loaded among the RAM of system it.If there are not enough spaces to store corresponding descriptive information, the declare record of the incident that the user asked can obtain from request data stream as required.Because request msg transmits with two-forty, the acquisition time of the explanation of the RAM1050 of the system that also is not stored in that is used for asking will shorten greatly.

Best, the current time that the amount of distributing to the system RAM1050 of IPG data will be enough to preserve at least 24 hours is shown information.Like this, just can once collect the schedule information of at least one all day of item.Thereby all schedule informations of item can be provided in trickle so that download among the RAM1050 of system to same day at least.

When being provided in the page separately by request and the contained data of trickle data flow, and each page is carried on the bag that separates when stream that is indicated by the specific PID that transports in the Port Multiplier, and microprocessor 1036 can be to obtain and crosses over two and connect time slots table information and prepare the first and second PID processors.This PID processor separately can hardware or software realize that a PID processor will be included in schedule information in first page to the first time slot collection.The 2nd PID processor will be included in schedule information in second page to following the second time slot collection behind first time slot closely.For screen display one length in the given time interval, the big I of time slot is selected as to make any single display panel will need no more than two IPG page of data.Microprocessor will optionally make up the part-time table information that is obtained by the first and second PID processors, to be provided at the timetable of item available in the period that crosses over first and second time slots.The timetable that is combined is exported to processor 1052 to show on display 1054.

For simplifying the processing that microprocessor 1036 is provided, contained on an information network service can be among a plurality of different data flow, and each has its PID.In a kind of like this embodiment, handle obtaining simplifying, because each other data rate is all less.When higher rate, may also need hardware filtering.

The basic PID that the formation request IPG download service of two kinds of different patterns is arranged.A kind of pattern only is loaded with the record of explanation time slot.Another pattern is loaded with master data.Illustrate that the record of time slot comprises timetable/header record and the declare record of every day.For example, the record that time slot is described is to be combined into title and descriptive information " timetable record " form carrying of the arrangement of every day.

Thereby the intersegmental time of advent that can see the IPG data segment in the data flow is mainly by message transmission rate R, the database period L of going ahead of the rest, groove crack size S, the relative size of page of data and piece, and segment length's decision.Design specification is to select between minimal segment the T time of advent, and it is no more than the acquisition capacity of receiver.The invention enables and to adjust various standards, comprise during the time slot of each transmission cycle and page number, so that can obtain preferred plan.And, the invention provides the transmission frequency of different types of data piece in the different-format selection of relevant page subregion and the page or section.

Though the present invention utilizes various specific embodiments to be illustrated, those skilled in the art that will be understood that, can to a large amount of adjustment of do and modification and do not break away from invention spirit and the category that proposes in the claim.

Claims (21)

1. one kind is to transmit the method that the data that comprise a plurality of data segments flow to receiver, includes step:

Disposal ability according to described receiver is carried out shuffle process so that described section in second section order to be provided to described section in the described data flow by first section order.

2. according to the process of claim 1 wherein:

In described second section order, adjacent segment is to being separated by the intersegmental distance of correspondence in described first section order; With

The described step of shuffling is with described intersegmental minimum value and value maximization.

3. according to the method for claim 1 or 2, wherein: described data segment is discharged to conduct corresponding to a plurality of pages in first sequence of pages of described first section order; Also include step:

Provide the staggered page of the described page in second sequence of pages so that in described first sequence of pages in the described data flow to be grouped in described second sequence of pages.

4. according to the method for one of aforementioned claim, wherein: described section is grouped into a plurality of that comprise at least the first and second type blocks; Also comprise step:

On the transmission cycle of following of first transmission cycle of described data flow and its heel, arrange described first and second type blocks, so that described first and second type blocks are provided in the described data flow with desirable frequency separately.

5. according to the method for one of aforementioned claim, wherein said data segment is arranged in one corresponding to a plurality of pages in first sequence of pages of described first section order; Also comprise step:

Described a plurality of page subregions are become its at least the first and second subclass; Wherein:

Described section shuffle in each described subclass carried out dividually.

6. according to the method for claim 5, wherein: in described second section order, each adjacent in described first section order section is to being separated by the intersegmental distance of correspondence; With

The described step of shuffling makes described intersegmental minimum value and value maximization to each described subclass.

7. according to the method for claim 6, wherein: also comprise step:

Determine the distinctive intersegmental time of advent corresponding to the described intersegmental minimum value and value of described subclass; With

Determine the described described disposal ability that whether is adapted to described receiver the distinctive intersegmental time of advent.

8. one for the data flow that comprises a plurality of data segments is sent to the equipment of receiver, and it comprises:

For the disposal ability according to described receiver to described section is carried out shuffle process so that described section device in second section order to be provided by first section order in described data in flowing.

9. according to the equipment of claim 8, wherein:

In described second section order, each adjacent in described first section order section is to being separated by the intersegmental distance with correspondence; With

Described mixed washing apparatus makes described intersegmental minimum value and value maximization.

10. according to the equipment of claim 8 or 9, wherein: described data segment is arranged as corresponding to a plurality of pages in first sequence of pages of described first section order; Also comprise:

Provide the device of the described page in the described data flow with second sequence of pages, so that the alternately page in described first sequence of pages is grouped in described second sequence of pages.

11. according to any equipment in the claim 8 to 10, wherein: described section is grouped into a plurality of that comprise at least the first and second type blocks; Also comprise:

Be used on first transmission cycle of described data flow and its next transmission cycle subsequently, arranging the device of described first and second type blocks, so that described first and second type blocks provide with desirable frequency separately in described data flow.

12. according to any equipment in the claim 8 to 11, wherein: described data segment is arranged as a plurality of pages corresponding to one first sequence of pages of described first section order; Also comprise:

Described a plurality of pages are divided into the device of its at least the first and second subclass; Wherein:

Described mixed washing apparatus shuffles described section dividually in another described subclass.

13. according to the equipment of claim 12, wherein: in described second section order, the adjacent correspondent section of described first section order is to by with the intersegmental distance of correspondence separately; With

The described step of shuffling maximizes the described intersegmental minimum value and value of each described subclass.

14. the equipment according to claim 13 also comprises:

For determining device corresponding to the distinctive intersegmental time of advent of the described intersegmental minimum value and value of described subclass; With

For determining the described distinctive device that whether adapts to the described disposal ability of described receiver the intersegmental time of advent.

15. for handling the receiver of the data flow that comprises a plurality of data segments, described receiver has distinctive disposal ability, comprising:

For retrieving described section specific device; With

Described section quilt provides with an order of being shuffled according to described distinctive disposal ability.

16. according to the receiver of claim 15, wherein:

Described data segment quilt is carried out shuffle process to obtain the described order of being shuffled, so that the corresponding section adjacent intersegmental distance to quilt correspondence in described order of being shuffled separated in described first order by one first section order; With

Described intersegmental minimum value and value maximization.

17. according to the receiver of claim 15 or 16, wherein:

Described data segment is arranged as a plurality of pages;

The described page done by first sequence of pages shuffle process to corresponding to described by the section of shuffling second sequence of pages in proper order, so that the page that replaces in described first sequence of pages is grouped into described second sequence of pages.

18. according to any receiver in the claim 15 to 17, wherein:

Described section is grouped into a plurality of that comprise at least the first and second type blocks; With

Described first and second type blocks are arranged in next transmission cycle of first transmission cycle of described data flow and its heel, so that described first and second type blocks are provided with desirable frequency separately in described data flow.

19. according to any receiver in the claim 15 to 18, it also comprises:

One has the input buffer of the capacity of the described data flow of distinctive reception;

One has the processor for the distinctive processing speed of handling the described data that receive by described input buffer; Wherein:

Described distinctive capacity and described distinctive processing speed characterize described distinctive disposal ability.

20. according to any receiver in the claim 15 to 19, wherein:

Described section is grouped into a plurality of pages;

The described page is by at least the first and second subclass that divide it into; With

Described section quilt made shuffle process dividually in each described subclass.

21. according to the receiver of claim 20, wherein:

In each described subclass, described data segment is carried out shuffle process obtaining described order through shuffling by first section order so that in described first order adjacent each section to described in shuffling order with the intersegmental distance of correspondence separately; With

The described intersegmental minimum value and value maximization of described subclass.

Images