CN103068055A - System information dispatching cycle determination method and device - Google Patents

Abstract

The invention provides a system information dispatching cycle determination method. Coding is carried out according to repetition periods of each information block needing scheduling to obtain an individual, the repetition periods of each information block is changed, an initial group {S1,S2,..., Si,...SP-1, SP} is obtained, the P is a natural number, a genetic algorithm is called for the initial group, and one iterative operation is carried out. The method comprises calculating fitness of each individual, conducting selection operation, crossover operation and variation operation to obtain a next generation of group, and enabling the individual in initial group with biggest fitness to be added in a candidate individual set; using the next generation of group to serve as the initial group and executing calling of the genetic algorithm to conduct iterative operation steps until iteration times achieve preset iteration times; and decoding to obtain system message scheduling periods according to the individual in the candidate individual set with the biggest fitness. The invention further provides a system information dispatching cycle determination device. Shortest dispatching cycles of system information can be obtained, and system resources are saved.

Description

A kind of scheduling system information cycle is determined method and apparatus

Technical field

The present invention relates to system information scheduling method in a kind of mobile communication system, 3-G (Generation Three mobile communication system) (3rd Generation particularly, WCDMA 3G) (Wideband Code Division Multiple Access, Wideband Code Division Multiple Access (WCDMA)) the scheduling system information cycle is determined method and apparatus and in TD-SCDMA (Time Division-Synchronous Code Division Multiple Access, the TD SDMA) system.

Background technology

The WCDMA system is the 3G (Third Generation) Moblie 3G international standard that the manufacturer that communicates by letter of Europe and Japan proposes.It is the Wideband CDMA Technology of 5MHz that WCDMA has mainly adopted bandwidth, FDD (Frequency Division Duplex, Frequency Division Duplexing (FDD)) mode, and the control of up/down row fast power, down transmission diversity can asynchronous operation between the base station.

The TD-SCDMA system is the 3G international standard that China proposes.TD-SCDMA adopts TDD (Time Division Duplex, time division duplex) mode, need not to use paired frequency resource; Single carrier only needs the bandwidth of 1.6MHz, has the higher availability of frequency spectrum.

In mobile communication system, the effect of system information is that intrasystem user is carried out integration control.In general, all can carry out cell search process after UE (User Equipment, the subscriber equipment) start.After searching a suitable cell, UE can read from the common broadcast channel of this residential quarter and storing system information.The various information (such as network identity) that system information has not only comprised current system have also comprised the information (such as current area public resource assignment information) of current area.According to the parameters in the system information, UE just can and base station (Node B) successfully connect.There is not the broadcasting of system information just can't finish whole mobile communication process yet.

System information comprises MIB (Master Information Block, Master Information Block), SB (Scheduling Block, Scheduling Block) and SIB (System Information Block, system information block).Wherein, system information block SIB is used for notifying the information relevant with core net, lane place, Acceditation Area, common signal channel and abutting subdistrict etc.; Comprise the important information relevant with whole network among the Master Information Block MIB and the relevant control information with SIB, as indicated corresponding SIB whether to change etc.; Scheduling Block SB comprises SB1 and SB2, and SB1 and SB2 can occur, and also SB1 can not occur or only occur.The effect of Scheduling Block is when Master Information Block can't hold the schedule information of all system information blocks that will send, and the schedule information of the system information block that can't hold can be put into Scheduling Block.System information block can be divided into some sections according to the length of beared information, and Master Information Block and Scheduling Block are fixed as one section.

Those skilled in the art can understand, before system information is broadcasted, to carry out the following necessary operation to all system information blocks that will dispatch: comprise the cascade in may situation of coding, segmentation, different system information block, determine the system information block (so just having determined MIB, the length of SB1/SB2 and all SIB) dispatched at MIB and SB1/SB2.Then the minimum dispatching cycle of searching system information under the condition of the repetition period of having set all system information blocks is in order to system information can be sent within the short as far as possible cycle.

The method in general really degree of setting the tone cycle is as follows at present:

Default MIB, the expectation repetition period (P of SB1/2 and all SIB _SIB1, P _SIB2..., P _SIBn).

P dispatching cycle of system information _SchBe the maximum in all expectation repetition periods, i.e. P _SCH=Max (P _SIB1, P _SIB2..., P _SIBn).

Calculate P dispatching cycle _SchThe interior total hop count NTotalSeg that needs the system information of broadcasting.

Judge that whether NTotalSeg is less than or equal to P _SchIf satisfy then P _SchIt is exactly the scheduling system information cycle of estimation.If do not satisfy, then select the repetition period multiplication with some system informations, repeat again above step.

For example, application number is " CN03137374 ", and denomination of invention has just been described and the similar content of said method for the Chinese patent application of " the system message dynamic dispatching method in a kind of broadband CDMA system ".Said method did not have in the distribution to system information can estimate in the situation of special requirement and obtains dispatching cycle, and can guarantee that system information sends within a short as far as possible cycle.

The shortcoming that said method exists is:

Can not guarantee scheduling system information cycle of being lacked most;

3GPP (3 ^RdGeneration Partnership Project, the 3rd generation partner program) TS25.331 protocol requirement system message uses compact arrangement (namely to require to only have MIB can interrupt SB1/2 and all SIB, and can not interrupt mutually between SB1/SB2 and all SIB), said method can not guarantee to obtain system information can both dispatch successful dispatching cycle;

Need default MIB, the expectation repetition period of SB1/SB2 and all SIB.The one, need more initial condition, the 2nd, verified inappropriate expectation repetition period of emulation can be caused the scheduling system information excessive cycle, will waste the system broadcasts resource like this.

Summary of the invention

The technical problem to be solved in the present invention provides a kind of scheduling system information cycle and determines method and apparatus, avoids the scheduling system information excessive cycle, waste system broadcasts resource, and avoid dispatching unsuccessful.

In order to address the above problem, the invention provides a kind of scheduling system information cycle and determine method, comprising:

The repetition period of each block of information of scheduling encodes as required, obtains S _i={ d _{I, 1}, d _{I, 2}..., d _{I, M}, each d _{I, j}, the repetition period of the block of information of the corresponding needs scheduling of j=1...M, the number of M representative information piece changes repetition period of each block of information, obtains initial population { S ₁, S ₂..., S _i..., S _P-1, S _P, P is natural number, described block of information comprises Master Information Block (MIB) and system information block (SIB), perhaps, comprises MIB, Scheduling Block (SB) and SIB;

Initial population is called genetic algorithm, carry out interative computation one time, comprising: calculate each individual fitness, and carry out Selecting operation, crossing operation and variation computing, obtain colony of future generation, with the individuality adding candidate individual collections of fitness maximum in the initial population; As initial population, execution is called genetic algorithm and is carried out the interative computation step, until iterations reaches default iterations with colony of future generation;

Decode according to the individuality of fitness maximum in described candidate's individual collections and to obtain the scheduling system information cycle.

Further, said method also can have following characteristics, and the relation of repetition period and encoded radio is as follows:

${\mathrm{period}}_m=2^{(2+d_{i,m})}$

Period _mExpression d _{I, m}The repetition period of corresponding block of information.

Further, said method also can have following characteristics, and each individual fitness of described calculating comprises:

Judge whether each individuality of current initial population can be dispatched successfully, calculate this ideal adaptation degree according to scheduling result, wherein, when dispatching successfully, the scheduling system information cycle when repetition period of the block of information that each element is corresponding in ideal adaptation degree and this individuality and the success of described individual schedule is relevant, and each block of information repetition period and scheduling system information cycle are larger, and described ideal adaptation degree is less; Dispatch when unsuccessful, the ideal adaptation degree is relevant maximum dispatching cycle with system information with the maximum repetition period of each block of information, and the maximum repetition period of each block of information and system information are larger maximum dispatching cycle, and the ideal adaptation degree is less.

Further, said method also can have following characteristics, and whether described each individuality of judging initial population can be dispatched successfully and comprise:

To arbitrary individuality, each element decoded of this individuality is obtained repetition period of each block of information, with the maximum of repetition period wherein as attempting dispatching cycle; Generating length is the scheduling sequence of attempting the blank of dispatching cycle;

Extracting needs the block of information of scheduling to be filled in the described scheduling sequence, wherein, to each block of information that need to dispatch, according to folding described scheduling sequence of the repetition period of this block of information that need to dispatch, in each section scheduling sequence after folding between the available area of search length more than or equal to the repeat length of the current block of information that needs scheduling, if exist, select the free space of length minimum to fill the current block of information that needs scheduling, this block of information is dispatched successfully; If there is no, this block of information is dispatched unsuccessfully, finishes this scheduling;

When all block of informations that need to dispatch are dispatched successfully, this individual schedule success, otherwise, this individual schedule failure.

Further, said method also can have following characteristics, before the block of information that extraction need to be dispatched is filled in the described scheduling sequence, judge that also described trial dispatching cycle is whether greater than the maximum in system information broadcast cycle of agreement regulation, perhaps, all block of informations that need to dispatch at the total length of attempting taking in dispatching cycle whether greater than the maximum in system information broadcast cycle of agreement regulation, if, then dispatch unsuccessfully, otherwise extracting needs the block of information of scheduling to be filled into described scheduling sequence.

Further, said method also can have following characteristics, when extraction needs the block of information of scheduling to be filled in the described scheduling sequence, determine the internal priority of block of information according to default internal priority rule, according to the internal priority of block of information from high to low the information extraction piece be filled in the described scheduling sequence;

Described default internal priority rule comprises:

The MIB internal priority is the highest; The SB internal priority is specified in advance;

The internal priority of all the other block of informations is determined as follows:

The repetition period of block of information is less, and internal priority is higher;

Then repeat length was longer when the repetition period of block of information was identical, and internal priority is higher;

The block of information that repetition period is identical with repeat length, its internal priority is identical.

Further, said method also can have following characteristics, and when searching free space, if the non-MIB of the block of information of current scheduling, then described free space is interrupted by MIB only.

Further, said method also can have following characteristics, during the individual schedule success, and the scheduling sequence of also preserving this individuality;

Decode according to the individuality of fitness maximum in described candidate's individual collections and to obtain the scheduling system information cycle and comprise: the scheduling sequence according to this individuality obtains the scheduling system information cycle, also obtains repetition period and the scheduling offset information of all block of informations.

Further, said method also can have following characteristics, describedly calculates this ideal adaptation degree according to scheduling result and comprises:

Can successfully dispatch when individuality, then fitness value is:

$\mathrm{fitness}=\frac{1}{X*Y}$

$X={\mathrm{\θ}}_1*\underset{m=1}{\overset{M}{\mathrm{\Σ}}}{\left(d_{i,m}\right)}^2+{\mathrm{\ξ}}_1$

Y＝θ ₂*log ₂(SchPeriod)+ξ ₂

d _{I, m}Be individual encoded radio S _i={ d _{I, 1}, d _{I, 2}..., d _{I, M}In m element; SchPeriod attempts dispatching the dispatching cycle that successfully obtains for this individuality; θ ₁, θ ₂Value is non-zero real,, ξ ₁, ξ ₂Be real number, and value is so that X, Y is non-zero;

If the individual schedule failure, then fitness value is:

$\mathrm{fitness}=\frac{1}{2*X_{\max }*Y_{\max }}$

Wherein:

X _Max, Y _MaxBe above-mentioned parameter X, Y is desirable maximum separately.

The embodiment of the invention also provides a kind of scheduling system information cycle to determine device, comprising:

Coding module is used for as required the repetition period of each block of information of scheduling to encode, and obtains S _i={ d _{I, 1}, d _{I, 2}..., d _{I, M}, each d _{I, j}, the repetition period of the block of information of the corresponding needs scheduling of j=1...M, the number of M representative information piece changes repetition period of each block of information, obtains initial population { S ₁, S ₂..., S _i..., S _P-1, S _P, P is natural number, described block of information comprises MIB and SIB, perhaps, comprises MIB, SB and SIB;

Iteration module is used for initial population is called genetic algorithm, carries out interative computation one time, comprising: calculate each individual fitness, and carry out Selecting operation, crossing operation and variation computing, obtain colony of future generation; The individuality of fitness maximum in the initial population is added candidate's individual collections; As initial population, execution is called genetic algorithm and is carried out the interative computation step, until iterations reaches default iterations with colony of future generation;

Output module obtains the scheduling system information cycle for decoding according to the individuality of described candidate's individual collections fitness maximum.

Further, said apparatus also can have following characteristics, and during described coding module coding, the relation of repetition period and encoded radio is as follows:

${\mathrm{period}}_m=2^{(2+d_{i,m})}$

Period _mExpression d _{I, m}The repetition period of corresponding block of information.

Further, said apparatus also can have following characteristics, and described iteration module inclusive fitness computing unit is used for comprising according to calculating each individual fitness:

Judge whether each individuality of current initial population can be dispatched successfully, calculate this ideal adaptation degree according to scheduling result, wherein, when dispatching successfully, the scheduling system information cycle when repetition period of the block of information that each element is corresponding in ideal adaptation degree and this individuality and the success of described individual schedule is relevant, and each block of information repetition period and scheduling system information cycle are larger, and described ideal adaptation degree is less; Dispatch when unsuccessful, the ideal adaptation degree is relevant maximum dispatching cycle with system information with the maximum repetition period of each block of information, and the maximum repetition period of each block of information and system information are larger maximum dispatching cycle, and the ideal adaptation degree is less.

Further, said apparatus also can have following characteristics, and described fitness computing unit further comprises initialization subelement, scheduling trial subelement and fitness computation subunit, wherein:

Described initialization subelement is used for: to arbitrary individuality, each element decoded of this individuality is obtained repetition period of each block of information, the maximum of repetition period wherein as attempting dispatching cycle, is generated length and is the scheduling sequence of the blank of attempting dispatching cycle;

Described scheduling is attempted subelement and is used for: the block of information of extracting the needs scheduling is filled into described scheduling sequence, wherein, to each block of information that need to dispatch, according to folding described scheduling sequence of the repetition period of this block of information that need to dispatch, in each section scheduling sequence after folding between the available area of search length more than or equal to the repeat length of the current block of information that needs scheduling, if exist, select the free space of length minimum to fill the current block of information that needs scheduling, this block of information is dispatched successfully; If there is no, this block of information is dispatched unsuccessfully; When all block of informations that need to dispatch are dispatched successfully, this individual schedule success, otherwise, the individual schedule failure; The output scheduling result is to the fitness computation subunit;

Described fitness computation subunit is used for: calculate this ideal adaptation degree according to described scheduling result.

Further, said apparatus also can have following characteristics, described scheduling is attempted subelement and also is used for: the block of information of extracting the needs scheduling is filled into before the described scheduling sequence, judge that described trial dispatching cycle is whether greater than the maximum in system information broadcast cycle of agreement regulation, perhaps, all block of informations that need to dispatch at the total length of attempting taking in dispatching cycle whether greater than the maximum in system information broadcast cycle of agreement regulation, if, then dispatch unsuccessfully, otherwise extracting needs the block of information of scheduling to be filled into described scheduling sequence.

Further, said apparatus also can have following characteristics, described scheduling attempt subelement be for: when extracting the block of information that needs scheduling and being filled into described scheduling sequence, determine the internal priority of block of information according to default internal priority rule, according to the internal priority of block of information from high to low the information extraction piece be filled in the described scheduling sequence;

Described default internal priority rule comprises:

The MIB internal priority is the highest; The SB internal priority is specified in advance;

The internal priority of all the other block of informations is determined as follows:

The repetition period of block of information is less, and internal priority is higher;

Then repeat length was longer when the repetition period of block of information was identical, and internal priority is higher;

The block of information that repetition period is identical with repeat length, its internal priority is identical.

Further, said apparatus also can have following characteristics, and when described scheduling trial subelement was searched free space, if the non-MIB of the block of information of current scheduling, then described free space was interrupted by MIB only.

Further, said apparatus also can have following characteristics, and described scheduling is attempted subelement when the individual schedule success, the scheduling sequence of also preserving this individuality;

Described output module be for: the scheduling sequence according to the individuality of described candidate's individual collections fitness maximum obtains the scheduling system information cycle, also obtains repetition period and the scheduling offset information of all block of informations according to described scheduling sequence.

Further, said apparatus also can have following characteristics, and described fitness computing unit calculates this ideal adaptation degree according to following mode:

Can successfully dispatch when individuality, then fitness value is:

$\mathrm{fitness}=\frac{1}{X*Y}$

$X={\mathrm{\θ}}_1*\underset{m=1}{\overset{M}{\mathrm{\Σ}}}{\left(d_{i,m}\right)}^2+{\mathrm{\ξ}}_1$

Y＝θ ₂*log ₂(SchPeriod)+ξ ₂

d _{I, m}Be individual encoded radio S _i={ d _{I, 1}, d _{I, 2}..., d _{I, M}In m element; SchPeriod attempts dispatching the dispatching cycle that successfully obtains for this individuality; θ ₁, θ ₂Value is non-zero real,, ξ ₁, ξ ₂Be real number, and X, Y is non-zero;

If the individual schedule failure, then fitness value is:

$\mathrm{fitness}=\frac{1}{2*X_{\max }*Y_{\max }}$

Wherein:

X _Max, Y _MaxBe above-mentioned parameter X, Y is desirable maximum separately.

The present invention need not the configuration information piece when system message is used compact arrangement the expectation repetition period just can obtain the minor of system information and spend the cycle.Adopt technical solution of the present invention, as long as the block of information condition of input is can dispatch the successful minor that just necessarily can obtain system information to spend the cycle, and can guarantee that all block of information can both be with the shortest repetition period scheduling within dispatching cycle, namely each block of information can both occur with the highest frequency, so that scheduling space resources utilization maximization.

Description of drawings

Fig. 1 is overall procedure of the present invention;

Fig. 2 is the decomposition of step B among Fig. 1;

Fig. 3 is the decomposition of step B1 among Fig. 2;

Fig. 4 is embodiment of the invention scheduling MIB schematic diagram;

Fig. 5 is embodiment of the invention scheduling SB1 schematic diagram;

Fig. 6 is embodiment of the invention scheduling SIB1 schematic diagram;

Fig. 7 is the scheduling result diagram of application example one;

Fig. 8 is the scheduling result diagram of application example two;

Fig. 9 determines the device block diagram in the embodiment of the invention scheduling system information cycle;

Figure 10 is embodiment of the invention fitness computing unit block diagram.

Embodiment

For making the purpose, technical solutions and advantages of the present invention clearer, hereinafter in connection with accompanying drawing embodiments of the invention are elaborated.Need to prove that in the situation of not conflicting, the embodiment among the application and the feature among the embodiment be combination in any mutually.

The embodiment of the invention provides a kind of scheduling system information cycle to determine method, comprising:

The repetition period of each block of information of scheduling encodes as required, obtains S _i={ d _{I, 1}, d _{I, 2}..., d _{I, M}, each d _{I, j}, the repetition period of the block of information of the corresponding needs scheduling of j=1...M, the number of M representative information piece changes repetition period of each block of information, obtains initial population { S ₁, S ₂..., S _i..., S _P-1, S _P, P is natural number, described block of information comprises MIB and SIB, perhaps, comprises MIB, SB and SIB;

Initial population is called genetic algorithm, carry out interative computation one time, comprising: calculate each individual fitness, and carry out Selecting operation, crossing operation and variation computing, obtain colony of future generation, with the individuality adding candidate individual collections of fitness maximum in the initial population; As initial population, execution is called genetic algorithm and is carried out the interative computation step, until iterations reaches default iterations with colony of future generation;

Decode according to the individuality of fitness maximum in described candidate's individual collections and to obtain the scheduling system information cycle.

Wherein, the relation of a kind of repetition period and encoded radio is as follows:

${\mathrm{period}}_m=2^{(2+d_{i,m})}$

Period _mExpression d _{I, m}The repetition period of corresponding block of information.

Wherein, each individual fitness of described calculating comprises:

Judge whether each individuality of current initial population can be dispatched successfully, calculate this ideal adaptation degree according to scheduling result, wherein, when dispatching successfully, the scheduling system information cycle when repetition period of the block of information that each element is corresponding in ideal adaptation degree and this individuality and the success of described individual schedule is relevant, and each block of information repetition period and scheduling system information cycle are larger, and described ideal adaptation degree is less; Dispatch when unsuccessful, the ideal adaptation degree is relevant maximum dispatching cycle with system information with the maximum repetition period of each block of information, and the maximum repetition period of each block of information and system information are larger maximum dispatching cycle, and the ideal adaptation degree is less.

Wherein, whether described each individuality of judging initial population can be dispatched successfully and comprise:

To arbitrary individuality, each element decoded of this individuality is obtained repetition period of each block of information, with the maximum of repetition period wherein as attempting dispatching cycle;

Generating length is the scheduling sequence of attempting the blank of dispatching cycle; Extracting needs the block of information of scheduling to be filled in the described scheduling sequence, wherein, to each block of information that need to dispatch, according to folding described scheduling sequence of the repetition period of this block of information that need to dispatch, in each section scheduling sequence after folding between the available area of search length more than or equal to the repeat length of the current block of information that needs scheduling, if exist, select the free space of length minimum to fill the current block of information that needs scheduling, this block of information is dispatched successfully; If there is no, this block of information is dispatched unsuccessfully, finishes this scheduling;

When all block of informations that need to dispatch are dispatched successfully, this individual schedule success, otherwise, this individual schedule failure.

Before the block of information that extraction need to be dispatched is filled in the described scheduling sequence, judge that also described trial dispatching cycle is whether greater than the maximum in system information broadcast cycle of agreement regulation, perhaps, all block of informations that need to dispatch at the total length of attempting taking in dispatching cycle whether greater than the maximum in system information broadcast cycle of agreement regulation, if, then dispatch unsuccessfully, otherwise extracting needs the block of information of scheduling to be filled into described scheduling sequence.Rear one judge also shouldn't, if total length greater than the agreement maximum in expensive system information broadcast cycle, then when extracting the block of information that needs scheduling and be filled in the described scheduling sequence, the scheduling meeting failure.

Wherein, when extract needing the block of information of scheduling to be filled in the described scheduling sequence, determine the internal priority of block of information according to default internal priority rule, according to the internal priority of block of information from high to low the information extraction piece be filled in the described scheduling sequence;

Described default internal priority rule comprises:

The MIB internal priority is the highest; The SB internal priority is specified in advance;

The internal priority of all the other block of informations is determined as follows:

The repetition period of block of information is less, and internal priority is higher;

Then repeat length was longer when the repetition period of block of information was identical, and internal priority is higher;

The block of information that repetition period is identical with repeat length, its internal priority is identical.

Wherein, when searching free space, if the non-MIB of the block of information of current scheduling, then described free space is interrupted by MIB only.

Wherein, during the individual schedule success, the scheduling sequence of also preserving this individuality;

Decode according to the individuality of fitness maximum in described candidate's individual collections and to obtain the scheduling system information cycle and comprise: the scheduling sequence according to this individuality obtains the scheduling system information cycle, also obtains repetition period and the scheduling offset information of all block of informations.

Wherein, a kind of method of calculating this ideal adaptation degree according to scheduling result is:

Can successfully dispatch when individuality, then fitness value is:

$\mathrm{fitness}=\frac{1}{X*Y}$

$X={\mathrm{\θ}}_1*\underset{m=1}{\overset{M}{\mathrm{\Σ}}}{\left(d_{i,m}\right)}^2+{\mathrm{\ξ}}_1$

Y＝θ ₂*log ₂(SchPeriod)+ξ ₂

d _{I, m}Be individual encoded radio S _i={ d _{I, 1}, d _{I, 2}..., d _{I, M}In m element; SchPeriod attempts dispatching the dispatching cycle that successfully obtains for this individuality; θ ₁, θ ₂Value is non-zero real,, ξ ₁, ξ ₂Be real number, and value is so that X, Y is non-zero;

If the individual schedule failure, then fitness value is:

$\mathrm{fitness}=\frac{1}{2*X_{\max }*Y_{\max }}$

Wherein:

X _Max, Y _MaxBe above-mentioned parameter X, Y is desirable maximum separately.

The embodiment of the invention is all to have finished coding, segmentation, cascade in each block of information, determined respectively the system information block dispatched at MIB and SB1/2, and under the condition of the length of definite MIB and SB1/2, utilize genetic algorithm to determine that the minor of system information spends the cycle.Specifically, be that the repetition period of block of information is encoded with a decimal integer when individuality is encoded.The corresponding crossover and mutation computing of genetic algorithm all is that decimally mode is carried out.The all short as far as possible requirements of scheduling system information cycle and each have been embodied arranging of fitness function block of information repetition period.Embody scheduling whether successfully on the impact of fitness value by scheduling exploration process in the fitness function.Embody the dense degree of block of information resource occupation with internal priority in the scheduling exploration process, thereby the minor that guarantees to obtain system information is spent the cycle.The individual probability that participates in heredity is directly proportional with its fitness value in Selecting operation.

The general step of genetic algorithm is as follows:

1) determines individual encoding scheme;

2) generate initial population;

3) fitness calculates;

4) Selecting operation;

5) crossing operation;

6) variation computing.

Specific to the present invention, detailed step is as follows:

As shown in Figure 1, comprising:

Steps A: generate initial population;

All restricted to the repetition period of the maximum in system information broadcast cycle and block of information in the different system, take TD-SCDMA as example, maximum to the system information broadcast cycle in the 3GPP TS25.331 agreement (hereinafter to be referred as " agreement ") is restricted to 2048 segmentations (4096 radio frames), the repetition period of MIB is restricted to 4,8 or 16 segmentations.For the successful dispatching patcher information of energy, require the repetition period of other all block of informations all (to be understood that easily more than or equal to the repetition period of MIB in the embodiment of the invention, under block of information quantity is not few especially situation, the cycle of block of information is less than the repetition period of MIB, can't successful dispatching patcher information).The repetition period of stipulating all block of informations in the agreement all must be 2 integral number power, and the repetition period of all block of informations all is from 2 like this ²Change to 2 ¹¹The repetition period of arbitrary like this block of information can be expressed as 2 ⁽²⁺ⁿ⁾, 0≤n≤9 (MIB also needs further restriction).So decimal number n is exactly the encoded radio of the repetition period of this block of information, this coded system is an example, can use as required other coded system, can represent that the repetition period of block of information gets final product.Arbitrary individuality of genetic algorithm all represents a MIB, the encoded radio set of the repetition period of SB1/SB2 and all SIB.Make that M is MIB, the sum of SB1/SB2 and all SIB, arbitrary like this individuality can be encoded to a decimal number sequence S _i={ d _{I, 1}, d _{I, 2}..., d _{I, M}.Set MIB in the embodiment of the invention, the corresponding d of SB1 _{I, 1}, d _{I, 2}Two elements, i.e. MIB, SB1 appears at first and second of encoded radio; SB2 does not always occur.The repetition period of agreement regulation MIB can only be 4,8 or 16, like this span d of MIB encoded radio _{I, 1}Different with the out of Memory piece, be 0≤d _{I, 1}≤ 2.Similarly, if the maximum of repetition period of SB1 is had requirement, then can limit accordingly its encoded radio d _{I, 2}Span.Maximum such as the repetition period of restriction SB1 among the present invention is 64, then 0≤d _{I, 2}≤ 4.

Above-mentioned restriction SB2 does not occur, and limits MIB, the corresponding d of SB1 _{I, 1}, d _{I, 2}Two elements just for convenience, order can arbitrary arrangement, SB2 also can occur, coding method is similar, repeat no more herein, in addition, if exist except MIB, SB, the block of information of outer other type of SIB also can use said method to encode.In addition, the span of encoded radio is set according to system's needs, if system arranges change, then the span of corresponding change encoded radio the invention is not restricted to above-mentioned span.Above-mentioned coding rule can change as required.

The implication of M the same (following no longer repetition).Make that the initial population sample number is P (can get P=200 in the embodiment of the invention).Then initial population is expressed as { S ₁, S ₂..., S _i..., S _P-1, S _P, d _{I, m}Be body encoded radio S one by one _i={ d _{I, 1}, d _{I, 2}..., d _{I, M}In m element.D then _{I, m}Be decimal integer (d who generates at random _{I, 1}, d _{I, 2}Need to be limited in the span separately, below lay special stress on no longer).

Step B: call genetic algorithm and obtain colony of future generation;

One time iteration comprises initial population through fitness calculating, Selecting operation, and crossing operation generates progeny population after the variation computing, and with the initial population of progeny population as next iteration.The iteration individuality of all preserving the fitness value maximum is individual as the candidate each time, and the content of preservation comprises individual encoded radio, and whether individual fitness value, individuality dispatch successful information and scheduling sequence information (dispatch unsuccessful, the scheduling sequence is sky).

Step C: the individuality of fitness maximum in the initial population is added candidate's individual collections;

Step D: judge whether to reach iterations, if reach, execution in step F, otherwise, execution in step G;

Wherein, iterations can be set as required.

Step F: select the decoding of the individuality of fitness value maximum to be optimal solution in candidate's individual collections, finish;

Wherein, the individuality of fitness value maximum has when a plurality of optional one; Whether dispatching successful information and can determine whether the initial condition of algorithm input can dispatch successfully according to this individuality of preserving.If can dispatch successfully, then can be exported by the scheduling sequence repetition period and the scheduling offset information of all block of informations.

Step G: current colony as initial population, is returned step B.

Wherein, as shown in Figure 2, step B further comprises the steps:

Step B1: carry out fitness and calculate;

Each individuality is called " individual schedule flow process ", defines as follows according to the scheduling result fitness function:

If individual combination of corresponding repetition period can successfully be dispatched, then fitness value calculates according to following formula:

$\mathrm{fitness}=\frac{1}{X*Y}$

Wherein:

$X={\mathrm{\θ}}_1*\underset{m=1}{\overset{M}{\mathrm{\Σ}}}{\left(d_{i,m}\right)}^2+{\mathrm{\ξ}}_1$

Y＝θ ₂*log ₂(SchPeriod)+ξ ₂

d _{I, m}Be individual encoded radio S _i={ d _{I, 1}, d _{I, 2}..., d _{I, M}In m element;

SchPeriod attempts dispatching the dispatching cycle that successfully obtains for this individuality;

θ ₁, θ ₂Value is non-zero real,, ξ ₁, ξ ₂Be real number, can set by exploration and emulation, and θ ₁, θ ₂, ξ ₁, ξ ₂Value is so that X, and Y is non-zero.

If individual combination of corresponding repetition period can't successfully be dispatched, then fitness value calculates according to following formula:

$\mathrm{fitness}=\frac{1}{2*X_{\max }*Y_{\max }}$

Wherein:

X _Max, Y _MaxBe the parameter X of a upper joint definition, Y is desirable maximum separately.

That is the fitness value when, dispatching fitness value when unsuccessful and can all get maximum and get maximum dispatching cycle less than individual encoded radio.

The method of above-mentioned calculating fitness only is example, can carry out multiple conversion, satisfying following principle gets final product: when dispatching successfully, the scheduling system information cycle when repetition period of the block of information that each element is corresponding in ideal adaptation degree and this individuality and the success of described individual schedule is relevant, and each block of information repetition period and scheduling system information cycle are larger, and described ideal adaptation degree is less; Dispatch when unsuccessful, the ideal adaptation degree is relevant maximum dispatching cycle with system information with the maximum repetition period of each block of information, and the maximum repetition period of each block of information and system information are larger maximum dispatching cycle, and the ideal adaptation degree is less.Such as, the value of X can be directly with the repetition period addition, the value of Y can be not to taking the logarithm dispatching cycle, etc., do not enumerate one by one herein.

When the design of fitness function, embodied the requirement to scheduling result.X has represented the requirement to the repetition period of each block of information, and when namely the repetition period of all block of informations was all got smaller value, fitness value just may be got higher value; Y has represented the requirement to the scheduling system information cycle, and namely hour fitness value just may be got higher value the scheduling system information cycle.So, as long as the fitness value of sample is larger, the inevitable corresponding less and less scheduling result of scheduling system information cycle of repetition period of each block of information after the sample decoding then.

The individual schedule flow process is as follows:

Be input as the one by one encoded radio of body.

By the encoded radio d of following transformational relation from i m individual SIB _{I, m}Obtain the repetition period period of this SIB _mThe decoding of individuality (namely to):

${\mathrm{period}}_m=2^{(2+d_{i,m})}$

Obtain the maximum of the repetition period of all block of informations, this maximum is attempts dispatching cycle.

Calculate each block of information that need to dispatch in the number of repetition of attempting in dispatching cycle.

Calculate each block of information that need to dispatch the length of attempting taking in dispatching cycle and.

The length that each block of information that need to dispatch is taken and again summation just obtain all block of informations at the total length of attempting taking in dispatching cycle.

If this total length is then dispatched unsuccessfully greater than attempting dispatching cycle or attempting dispatching cycle greater than the maximum in the system information broadcast cycle of agreement regulation.

If this total length then calls " scheduling is attempted " flow process and attempts scheduling less than or equal to attempting dispatching cycle and being not more than the maximum in the system information broadcast cycle of agreement regulation.

Scheduling trial flow process is as follows:

Be that the blank scheduling sequence of attempting dispatching cycle is indicated scheduling result (as represent the blank sequence of dispatching with full 0) with a length.

To removing MIB, all outer block of informations of SB are called " internal priority is determined flow process " and are obtained internal priority.

For SB1/SB2 specifies corresponding internal priority, SB1/SB2 is follow-up to be processed equally with SIB, no longer distinguishes as required.Of the present invention for example in the dispatching sequence of SB1 always behind MIB, namely in the internal priority of SB1 always greater than the internal priority of all SIB; And SB2 does not always occur.The internal priority of SB is specified according to the agreement needs.

All block of informations except MIB are sorted from high to low according to internal priority.

MIB is at first scheduling always.Since first fill take " MIB repetition period " as the cycle length in the scheduling sequence for the position of " MIB length " as MIB take (as, represent this position with digital 1 and taken by MIB).

The remaining information piece is processed successively according to internal priority order from high to low.

Call " available range lookup flow process " take repetition period of current information piece and dispatching cycle as input and obtain original position and siding-to-siding block length between the clear area.

If can not find between the clear area, then to dispatch unsuccessfully, flow process finishes, and finds then and continues.

Search between these clear areas siding-to-siding block length more than or equal to the interval of current SIB repeat length as candidate regions between.

If can not find between candidate regions, then to dispatch unsuccessfully, flow process finishes.Found then and continued.

If have between candidate regions a plurality of, select siding-to-siding block length the shortest as a result of interval (siding-to-siding block length the shortest have a plurality of, optional one as a result of interval.)。

Fill the scheduling sequence.Take the current SIB repetition period as the above results interval original position begin to fill length in the scheduling sequence as the position of current SIB repeat length as current SIB take (as, the sequence number that occurs with this SIB add 1 represent by current SIB take), run into the position that is taken by MIB during filling and then postpone backward, until reach the requirement of current SIB repeat length in the position that current SIB filled in the repetition period.

The remaining block of information of reprocessing, if all SIB dispatch successfully, then output scheduling trial and success information and the scheduling sequence.Otherwise failure information is attempted in output scheduling.If all SIB can be dispatched successfully, then current trial is current individual corresponding system message dispatching cycle dispatching cycle, otherwise current individual schedule is failed.

Internal priority determines that flow process comprises:

Internal priority is used for weighing the dense degree of resource occupation.

The repetition period of block of information is less, and internal priority is higher;

The repetition period of block of information, identical then repeat length was longer, and internal priority is higher;

If the repetition period is all identical with repeat length, then internal priority is identical.

Certainly, also can set as required the rule that other determines internal priority.

Available range lookup flow process comprises:

Except wanting the input scheduling sequence, also need to input the repetition period of the block of information of current scheduling in this flow process.

Use a length to represent lookup result as the blank as a result sequence (blank as representing with full 0) of repetition period.

The scheduling sequence is divided into some subsequences that length is the repetition period since first.

Value such as a certain position in all subsequences all be blank, then as a result the value of sequence this position also compose into blank (as, represent with 0).

Only occur that MIB takies or blank such as the value of a certain position in all subsequences, then as a result the value of this position of sequence also compose for MIB take (as, represent MIB with 1 and take).

As long as the value such as a certain position in all subsequences has occurred (being comprised SB1 by a certain SIB, SB2) take, then as a result the value of this position of sequence also compose for a certain SIB (comprising SB1, SB2) take (as, representing a certain SIB (comprising SB1, SB2) with 2 takies).

The position that MIB in the sequence is as a result taken is removed and is obtained transform sequence.Obtain in position and the sequence as a result in the transform sequence corresponding relation.

Obtain the continuously original position of space bit and the continuously length of space bit, the namely original position between the clear area and siding-to-siding block length in the transform sequence.

Original position between these clear areas in the transform sequence is obtained position corresponding in sequence as a result according to corresponding relation, reposition is as the original position between the clear area of flow process output, and siding-to-siding block length obtained in the previous step is exported as the siding-to-siding block length between the clear area.

In the time of can't finding space bit, the original position between the clear area and siding-to-siding block length all are output as sky.

Step B2: Selecting operation;

The individual probability that participates in heredity is decided by fitness value.The ratio of ideal adaptation degree value and colony's fitness value sum is exactly the individual probability that participates in heredity specifically.

If the fitness value of the individuality that iteration obtains is:

Fitness＝{fitness ₁，fitness ₂，...，fitness _P-1，fitness _P}

Order,

${\mathrm{Pr}}_i=\underset{k=1}{\overset{i}{\mathrm{\Σ}}}{\mathrm{fitness}}_k,1\≤k\≤P$

Then add numerical value 0 and obtain sequence

Pr′＝{0，pr ₁，pr ₂，...，pr _P-1，pr _P}

Can determine P interval take this sequence as end points, be [pr such as i interval _I-1, pr _i) (special, P interval is [pr _P-1, pr _P]).

Generate at random the P of value between [0,1] at random real number

R＝{r _i}，1≤i≤P

Each real number r _iFall in some in the above-mentioned P interval in the capital, such as m interval, select then that in the sample m is individual to participate in heredity, namely as initial individuality of future generation.

Step B3: crossing operation;

The sample of selecting some in the colony according to crossover probability is to carrying out crossing operation, and establishing crossover probability is Pr _Cr, namely select at random P*Pr at every turn _CrIndividuality matches to carry out crossing operation in twos.

Crossing operation is defined as follows, and a pair of individual encoded radio that will carry out crossing operation is made as S _i={ d _{I, 1}, d _{I, 2}..., d _{I, M}, S _j={ d _{J, 1}, d _{J, 2}..., d _{J, M}, establishing the crossing operation position that generates at random is cr, 1＜cr≤M, and then this to individual encoded radio is behind the crossing operation:

S _i＝{d _i，1，...，d _i，cr-1，d _j，cr，...，d _j，M}，S _j＝{d _j，1，...，d _j，cr-1，d _i，cr，...，d _i，M}

Step B4: the variation computing, finish.

Sample according to some in the variation probability selection colony is carried out crossing operation, and establishing the variation probability is Pr _Mu, namely select at random P*Pr at every turn _MuIndividuality is carried out the variation computing.

The variation operation definition is as follows, and the individual encoded radio of the computing that make a variation is made as S _i={ d _{I, 1}, d _{I, 2}..., d _{I, M}, establishing the variation work location that generates at random is mu, 1＜mu≤M, and individual encoded radio is after the computing that then makes a variation: S _i={ d _{I, 1}..., d _{I, mu-1}, d ' _{J, mu}, d _{I, mu+1}..., d _{J, M}, d ' wherein _{J, mu}For being not equal to d _{J, mu}The integer of value between 0～9.

Wherein, as shown in Figure 3, step B1 further comprises:

Step B11: individuality decoded obtains block of information repetition period combination;

By the encoded radio d of following transformational relation from i m individual block of information _{I, m}Obtain the repetition period period of this block of information _mThe decoding of individuality (namely to):

${\mathrm{period}}_m=2^{(2+d_{i,m})}$

Step B12: calculate and attempt dispatching cycle;

Obtain the maximum of the repetition period of all block of informations, this maximum is just for attempting dispatching cycle.

Step B13: determine SB that all need to be dispatched and the internal priority of SIB;

Step B14: generate blank scheduling sequence;

The length of this blank scheduling sequence is for attempting dispatching cycle;

Step B15: according to the repetition period of MIB and the occupied information of repeat length filling MIB in the scheduling sequence;

Step B16: folding scheduling of the repetition period of the block of information that need to dispatch according to next one sequence;

Wherein, this block of information is SIB or SB, chooses according to internal priority, at first chooses the high block of information of internal priority and dispatches;

Step B17: search length is more than or equal to current information piece repeat length all " between available areas " in the scheduling sequence after folding;

Step B18: judge whether to exist " between available area ", if exist, turn step B19, otherwise, turn step B113;

Step B19: " between the available area " of selection siding-to-siding block length minimum filled the occupied information of current information piece in the scheduling sequence;

Step B110: judge whether the next not block of information of scheduling, if having, execution in step B16; Otherwise, execution in step B111;

Step B111 judges whether that all block of informations all dispatch successfully, if so, and execution in step B112, otherwise, execution in step B113;

Step B112 dispatches successfully, finishes;

Step B113 dispatches unsuccessfully, finishes.

If all SIB can be dispatched successfully, then current trial is current individual corresponding system message dispatching cycle dispatching cycle, otherwise current individual schedule is failed.

The below provides a kind of concrete filling process and further specifies the present invention.

Abovementioned steps has determined that is attempted a dispatching cycle.Initialization scheduling sequence is empty entirely, and the scheduling sequence is used for recording the deployment position of MIB/SB/SIB.

In the present embodiment, the scheduling sequence length is 32.

Agreement regulation MIB always uses fixing skew 0 (skew of other block of informations is the Output rusults of this algorithm just), namely always begins scheduling from the original position in system information broadcast cycle.

As shown in Figure 4, scheduling MIB, establishing the MIB repetition period is 4, and repeat length is 1, and attempting dispatching cycle is 32, fills MIB in blank scheduling sequence bend position;

2. that the next scheduling of hypothesis is SB1, and establishing the SB1 repetition period is 8, and repeat length is 1

As shown in Figure 5, it is 4 subsequences of 8 that the scheduling sequence is divided into length, with all subsequence alignment, search length is 1 free space in each subsequence, but correspondence position time spent all in all subsequences is designated availablely, and correspondence position is designated MIB when only having MIB and room, dispatch SB1 at first free space, determine the whole deployment position of SB1 in the scheduling sequence.

3. dispatch SIB1.For simplicity, supposing does not have SB2, has the words process of SB2 similar; And suppose that SIB1 is the highest block of information of internal priority among all SIB.

As shown in Figure 6, establishing the SIB1 repetition period is 8, and repeat length is 3;

It is several subsequences (being 4) of 8 in this example that sequence is divided into length, all subsequences alignment;

But correspondence position time spent all in all subsequences, this station location marker is available, and correspondence position is designated MIB when only having MIB and room, and correspondence position is designated when SB or SIB are arranged and takies;

Between first available area, dispatch SIB1, interval middle can being interrupted by MIB;

Determine to attempt the whole deployment position of SIB1 in dispatching cycle.

4. dispatch successively remaining other SIB according to internal priority.

If all SIB can be dispatched successfully, then dispatch successfully, otherwise, dispatch unsuccessfully.

Application example one

Initial condition arranges as follows, and the length of MIB is 1 (unit is segmentation, and is lower same), and the length of SB1 is 1, does not have SB2.The length information of all SIB is as follows:

The initial sample number P of genetic algorithm is 200, crossover probability Pr _CrBe made as 60%, variation probability P r _MuBe made as 0.3%.

Fitness function is set to definition:

If individual combination of corresponding repetition period can successfully be dispatched, then fitness value is:

$\mathrm{fitness}=\frac{1}{(\underset{m=1}{\overset{M}{\mathrm{\Σ}}}{\left(d_{i,m}\right)}^2+1)*({\log }_2\left(\mathrm{SchPeriod}\right)-1)}$

That is:

$X=\underset{m=1}{\overset{M}{\mathrm{\Σ}}}{\left(d_{i,m}\right)}^2+1$

Y＝log ₂(SchPeriod)-1

Parameter θ to be determined ₁, θ ₂, ξ ₁, ξ ₂Value is as follows:

θ ₁＝1

θ ₂＝1

ξ ₁＝1

ξ ₂＝-1

If individual combination of corresponding repetition period can't successfully be dispatched, then fitness value is:

$\mathrm{fitness}=\frac{1}{2*({\left({\mathrm{IndiLog}}_{\max }\right)}^2*M+1)*({\log }_2\left({\mathrm{SchPeriod}}_{\max }\right)-1)}$

That is:

X _max＝(IndiLog _max) ²*M+1

Y _max＝log ₂(SchPeriod _max)-1

Wherein, IndiLog _MaxBeing individual encoded radio excursion maximum, is 11-2=9 in embodiments of the present invention, SchPeriod _MaxFor the maximum in scheduling system information cycle of agreement constraint, be 2048 in embodiments of the present invention.Definite process of two parameters is referring to step B1.

Through after 100 iteration, the scheduling system information cycle that the sample of fitness value maximum is corresponding be 128 (unit: segmentation), the schedule information of each block of information is as follows:

Shown intuitively above-mentioned scheduling result in the accompanying drawing 7.

Application example two:

Initial condition arranges as follows, and the length of MIB is that the length of 1, SB1 is 1, does not have SB2.The length information of all SIB is as follows:

The parameter of genetic algorithm arranges constant, and initial sample number P is 200, crossover probability Pr _CrBe made as 60%, variation probability P r _MuBe made as 0.3%.

Fitness function arranges identical with " application example one ".

Through after 100 iteration, the scheduling system information cycle that the sample of fitness value maximum is corresponding be 32 (unit: segmentation), the schedule information of each block of information is as follows:

Shown intuitively above-mentioned scheduling result in the accompanying drawing 8.

The embodiment of the invention also provides a kind of scheduling system information cycle to determine device, as shown in Figure 9, comprising: coding module, iteration module and output module, wherein:

Coding module is used for as required the repetition period of each block of information of scheduling to encode, and obtains S _i={ d _{I, 1}, d _{I, 2}..., d _{I, M}, each d _{I, j}, the repetition period of the block of information of the corresponding needs scheduling of j=1...M, the number of M representative information piece changes repetition period of each block of information, obtains initial population { S ₁, S ₂..., S _i..., S _P-1, S _P, P is natural number, described block of information comprises MIB and SIB, perhaps, comprises MIB, SB and SIB;

Iteration module is used for initial population is called genetic algorithm, carries out interative computation one time, comprising: calculate each individual fitness, and carry out Selecting operation, crossing operation and variation computing, obtain colony of future generation; The individuality of fitness maximum in the initial population is added candidate's individual collections; As initial population, execution is called genetic algorithm and is carried out the interative computation step, until iterations reaches default iterations with colony of future generation;

Output module obtains the scheduling system information cycle for decoding according to the individuality of described candidate's individual collections fitness maximum.

Wherein, during described coding module coding, a kind of relation of repetition period and encoded radio is as follows:

${\mathrm{period}}_m=2^{(2+d_{i,m})}$

Period _mExpression d _{I, m}The repetition period of corresponding block of information.

Wherein, described iteration module inclusive fitness computing unit, computational methods reference method embodiment, concrete, judge whether each individuality of current initial population can be dispatched successfully, calculate this ideal adaptation degree according to scheduling result, wherein, when dispatching successfully, the scheduling system information cycle when repetition period of the block of information that each element is corresponding in ideal adaptation degree and this individuality and the success of described individual schedule is relevant, and each block of information repetition period and scheduling system information cycle are larger, and described ideal adaptation degree is less; Dispatch when unsuccessful, the ideal adaptation degree is relevant maximum dispatching cycle with system information with the maximum repetition period of each block of information, and the maximum repetition period of each block of information and system information are larger maximum dispatching cycle, and the ideal adaptation degree is less.

Wherein, described fitness computing unit further comprises initialization subelement, scheduling trial subelement and fitness computation subunit, as shown in figure 10, and wherein:

Described initialization subelement is used for: to arbitrary individuality, each element decoded of this individuality is obtained repetition period of each block of information, the maximum of repetition period wherein as attempting dispatching cycle, is generated length and is the scheduling sequence of the blank of attempting dispatching cycle;

Described scheduling is attempted subelement and is used for: the block of information of extracting the needs scheduling is filled into described scheduling sequence, wherein, to each block of information that need to dispatch, according to folding described scheduling sequence of the repetition period of this block of information that need to dispatch, in each section scheduling sequence after folding between the available area of search length more than or equal to the repeat length of the current block of information that needs scheduling, if exist, select the free space of length minimum to fill the current block of information that needs scheduling, this block of information is dispatched successfully; If there is no, this block of information is dispatched unsuccessfully; When all block of informations that need to dispatch are dispatched successfully, this individual schedule success, otherwise, the individual schedule failure; The output scheduling result is to the fitness computation subunit;

Described fitness computation subunit is used for: calculate this ideal adaptation degree according to described scheduling result.Circular reference method embodiment.

Wherein, described scheduling is attempted subelement and also is used for: the block of information of extracting the needs scheduling is filled into before the described scheduling sequence, judge that described trial dispatching cycle is whether greater than the maximum in system information broadcast cycle of agreement regulation, perhaps, whether all block of informations that need to dispatch, if so, then dispatch unsuccessfully greater than the maximum in system information broadcast cycle of agreement regulation at the total length of attempting taking in dispatching cycle, otherwise extracting needs the block of information of scheduling to be filled into described scheduling sequence.

Wherein, described scheduling attempt subelement be for: when extracting the block of information that needs scheduling and being filled into described scheduling sequence, determine the internal priority of block of information according to default internal priority rule, according to the internal priority of block of information from high to low the information extraction piece be filled in the described scheduling sequence;

Described default internal priority rule comprises:

The MIB internal priority is the highest; The SB internal priority is specified in advance;

The internal priority of all the other block of informations is determined as follows:

The repetition period of block of information is less, and internal priority is higher;

Then repeat length was longer when the repetition period of block of information was identical, and internal priority is higher;

The block of information that repetition period is identical with repeat length, its internal priority is identical.

Wherein, when described scheduling trial subelement was searched free space, if the non-MIB of the block of information of current scheduling, then described free space was interrupted by MIB only.

Wherein, described scheduling is attempted subelement when the individual schedule success, the scheduling sequence of also preserving this individuality;

Described output module be for: the scheduling sequence according to the individuality of described candidate's individual collections fitness maximum obtains the scheduling system information cycle, also obtains repetition period and the scheduling offset information of all block of informations according to described scheduling sequence.

Can find out by above example, when adopting technical solution of the present invention, as long as the block of information condition of input can be dispatched successfully, the minor that just necessarily can obtain system information is spent the cycle (no matter being that the requirement compact arrangement also is non-compact arrangement), and can guarantee that all block of information can both be with the shortest repetition period scheduling within dispatching cycle, namely each block of information can both occur with the highest frequency.Simplify on the one hand the parameter setting before the scheduling, can guarantee on the other hand the maximization of the system broadcasts utilization of resources.

One of ordinary skill in the art will appreciate that all or part of step in the said method can come the instruction related hardware to finish by program, described program can be stored in the computer-readable recording medium, such as read-only memory, disk or CD etc.Alternatively, all or part of step of above-described embodiment also can realize with one or more integrated circuits.Correspondingly, each the module/unit in above-described embodiment can adopt the form of hardware to realize, also can adopt the form of software function module to realize.The present invention is not restricted to the combination of the hardware and software of any particular form.

Claims (18)

1. a scheduling system information cycle is determined method, it is characterized in that, comprising:

The repetition period of each block of information of scheduling encodes as required, obtains S _i={ d _{I, 1}, d _{I, 2}..., d _{I, M}, each d _{I, j}, the repetition period of the block of information of the corresponding needs scheduling of j=1...M, the number of M representative information piece changes repetition period of each block of information, obtains initial population { S ₁, S ₂..., S _i..., S _P-1, S _P, P is natural number, described block of information comprises Master Information Block (MIB) and system information block (SIB), perhaps, comprises MIB, Scheduling Block (SB) and SIB;

Initial population is called genetic algorithm, carry out interative computation one time, comprising: calculate each individual fitness, and carry out Selecting operation, crossing operation and variation computing, obtain colony of future generation, with the individuality adding candidate individual collections of fitness maximum in the initial population; As initial population, execution is called genetic algorithm and is carried out the interative computation step, until iterations reaches default iterations with colony of future generation;

Decode according to the individuality of fitness maximum in described candidate's individual collections and to obtain the scheduling system information cycle.

2. the method for claim 1 is characterized in that, the relation of repetition period and encoded radio is as follows:

${\mathrm{period}}_m=2^{(2+d_{i,m})}$

Period _mExpression d _{I, m}The repetition period of corresponding block of information.

3. method as claimed in claim 2 is characterized in that, each individual fitness of described calculating comprises:

Judge whether each individuality of current initial population can be dispatched successfully, calculate this ideal adaptation degree according to scheduling result, wherein, when dispatching successfully, the scheduling system information cycle when repetition period of the block of information that each element is corresponding in ideal adaptation degree and this individuality and the success of described individual schedule is relevant, and each block of information repetition period and scheduling system information cycle are larger, and described ideal adaptation degree is less; Dispatch when unsuccessful, the ideal adaptation degree is relevant maximum dispatching cycle with system information with the maximum repetition period of each block of information, and the maximum repetition period of each block of information and system information are larger maximum dispatching cycle, and the ideal adaptation degree is less.

4. method as claimed in claim 3 is characterized in that, whether described each individuality of judging initial population can be dispatched successfully and comprise:

To arbitrary individuality, each element decoded of this individuality is obtained repetition period of each block of information, with the maximum of repetition period wherein as attempting dispatching cycle; Generating length is the scheduling sequence of attempting the blank of dispatching cycle;

Extracting needs the block of information of scheduling to be filled in the described scheduling sequence, wherein, to each block of information that need to dispatch, according to folding described scheduling sequence of the repetition period of this block of information that need to dispatch, in each section scheduling sequence after folding between the available area of search length more than or equal to the repeat length of the current block of information that needs scheduling, if exist, select the free space of length minimum to fill the current block of information that needs scheduling, this block of information is dispatched successfully; If there is no, this block of information is dispatched unsuccessfully, finishes this scheduling;

When all block of informations that need to dispatch are dispatched successfully, this individual schedule success, otherwise, this individual schedule failure.

5. method as claimed in claim 4, it is characterized in that, before the block of information that extraction need to be dispatched is filled in the described scheduling sequence, judge that also described trial dispatching cycle is whether greater than the maximum in system information broadcast cycle of agreement regulation, perhaps, all block of informations that need to dispatch at the total length of attempting taking in dispatching cycle whether greater than the maximum in system information broadcast cycle of agreement regulation, if, then dispatch unsuccessfully, otherwise extracting needs the block of information of scheduling to be filled into described scheduling sequence.

6. method as claimed in claim 4 is characterized in that,

When extract needing the block of information of scheduling to be filled in the described scheduling sequence, determine the internal priority of block of information according to default internal priority rule, according to the internal priority of block of information from high to low the information extraction piece be filled in the described scheduling sequence;

Described default internal priority rule comprises:

The MIB internal priority is the highest; The SB internal priority is specified in advance;

The internal priority of all the other block of informations is determined as follows:

The repetition period of block of information is less, and internal priority is higher;

Then repeat length was longer when the repetition period of block of information was identical, and internal priority is higher;

The block of information that repetition period is identical with repeat length, its internal priority is identical.

7. method as claimed in claim 4 is characterized in that,

Wherein, when searching free space, if the non-MIB of the block of information of current scheduling, then described free space is interrupted by MIB only.

8. such as the arbitrary described method of claim 4 to 7, it is characterized in that, during the individual schedule success, the scheduling sequence of also preserving this individuality;

Decode according to the individuality of fitness maximum in described candidate's individual collections and to obtain the scheduling system information cycle and comprise: the scheduling sequence according to this individuality obtains the scheduling system information cycle, also obtains repetition period and the scheduling offset information of all block of informations.

9. method as claimed in claim 3 is characterized in that, describedly calculates this ideal adaptation degree according to scheduling result and comprises:

Can successfully dispatch when individuality, then fitness value is:

$\mathrm{fitness}=\frac{1}{X*Y}$

$X={\mathrm{\θ}}_1*\underset{m=1}{\overset{M}{\mathrm{\Σ}}}{\left(d_{i,m}\right)}^2+{\mathrm{\ξ}}_1$

Y＝θ ₂*log ₂(SchPeriod)+ξ ₂

d _{I, m}Be individual encoded radio S _i={ d _{I, 1}, d _{I, 2}..., d _{I, M}In m element; SchPeriod attempts dispatching the dispatching cycle that successfully obtains for this individuality; θ ₁, θ ₂Value is non-zero real,, ξ ₁, ξ ₂Be real number, and value is so that X, Y is non-zero;

If the individual schedule failure, then fitness value is:

$\mathrm{fitness}=\frac{1}{2*X_{\max }*Y_{\max }}$

Wherein:

X _Max, Y _MaxBe above-mentioned parameter X, Y is desirable maximum separately.

10. a scheduling system information cycle is determined device, it is characterized in that, comprising:

Coding module is used for as required the repetition period of each block of information of scheduling to encode, and obtains S _i={ d _{I, 1}, d _{I, 2}..., d _{I, M}, each d _{I, j}, the repetition period of the block of information of the corresponding needs scheduling of j=1...M, the number of M representative information piece changes repetition period of each block of information, obtains initial population { S ₁, S ₂..., S _i..., S _P-1, S _P, P is natural number, described block of information comprises MIB and SIB, perhaps, comprises MIB, SB and SIB;

Iteration module is used for initial population is called genetic algorithm, carries out interative computation one time, comprising: calculate each individual fitness, and carry out Selecting operation, crossing operation and variation computing, obtain colony of future generation; The individuality of fitness maximum in the initial population is added candidate's individual collections; As initial population, execution is called genetic algorithm and is carried out the interative computation step, until iterations reaches default iterations with colony of future generation;

Output module obtains the scheduling system information cycle for decoding according to the individuality of described candidate's individual collections fitness maximum.

11. device as claimed in claim 10 is characterized in that, during described coding module coding, the relation of repetition period and encoded radio is as follows:

${\mathrm{period}}_m=2^{(2+d_{i,m})}$

Period _mExpression d _{I, m}The repetition period of corresponding block of information.

12. device as claimed in claim 11 is characterized in that, described iteration module inclusive fitness computing unit is used for comprising according to calculating each individual fitness:

Judge whether each individuality of current initial population can be dispatched successfully, calculate this ideal adaptation degree according to scheduling result, wherein, when dispatching successfully, the scheduling system information cycle when repetition period of the block of information that each element is corresponding in ideal adaptation degree and this individuality and the success of described individual schedule is relevant, and each block of information repetition period and scheduling system information cycle are larger, and described ideal adaptation degree is less; Dispatch when unsuccessful, the ideal adaptation degree is relevant maximum dispatching cycle with system information with the maximum repetition period of each block of information, and the maximum repetition period of each block of information and system information are larger maximum dispatching cycle, and the ideal adaptation degree is less.

13. device as claimed in claim 12 is characterized in that, described fitness computing unit further comprises initialization subelement, scheduling trial subelement and fitness computation subunit, wherein:

Described initialization subelement is used for: to arbitrary individuality, each element decoded of this individuality is obtained repetition period of each block of information, the maximum of repetition period wherein as attempting dispatching cycle, is generated length and is the scheduling sequence of the blank of attempting dispatching cycle;

Described scheduling is attempted subelement and is used for: the block of information of extracting the needs scheduling is filled into described scheduling sequence, wherein, to each block of information that need to dispatch, according to folding described scheduling sequence of the repetition period of this block of information that need to dispatch, in each section scheduling sequence after folding between the available area of search length more than or equal to the repeat length of the current block of information that needs scheduling, if exist, select the free space of length minimum to fill the current block of information that needs scheduling, this block of information is dispatched successfully; If there is no, this block of information is dispatched unsuccessfully; When all block of informations that need to dispatch are dispatched successfully, this individual schedule success, otherwise, the individual schedule failure; The output scheduling result is to the fitness computation subunit;

Described fitness computation subunit is used for: calculate this ideal adaptation degree according to described scheduling result.

14. device as claimed in claim 13, it is characterized in that, described scheduling is attempted subelement and also is used for: the block of information of extracting the needs scheduling is filled into before the described scheduling sequence, judge that described trial dispatching cycle is whether greater than the maximum in system information broadcast cycle of agreement regulation, perhaps, all block of informations that need to dispatch at the total length of attempting taking in dispatching cycle whether greater than the maximum in system information broadcast cycle of agreement regulation, if, then dispatch unsuccessfully, otherwise extracting needs the block of information of scheduling to be filled into described scheduling sequence.

15. device as claimed in claim 13 is characterized in that,

Described scheduling attempt subelement be for: when extracting the block of information that needs scheduling and being filled into described scheduling sequence, determine the internal priority of block of information according to default internal priority rule, according to the internal priority of block of information from high to low the information extraction piece be filled in the described scheduling sequence;

Described default internal priority rule comprises:

The MIB internal priority is the highest; The SB internal priority is specified in advance;

The internal priority of all the other block of informations is determined as follows:

The repetition period of block of information is less, and internal priority is higher;

Then repeat length was longer when the repetition period of block of information was identical, and internal priority is higher;

The block of information that repetition period is identical with repeat length, its internal priority is identical.

16. device as claimed in claim 13 is characterized in that,

When described scheduling trial subelement was searched free space, if the non-MIB of the block of information of current scheduling, then described free space was interrupted by MIB only.

17., it is characterized in that described scheduling is attempted subelement when the individual schedule success, the scheduling sequence of also preserving this individuality such as the arbitrary described device of claim 13 to 16;

Described output module be for: the scheduling sequence according to the individuality of described candidate's individual collections fitness maximum obtains the scheduling system information cycle, also obtains repetition period and the scheduling offset information of all block of informations according to described scheduling sequence.

18., it is characterized in that described fitness computing unit calculates this ideal adaptation degree according to following mode such as the arbitrary described device of claim 12 to 16:

Can successfully dispatch when individuality, then fitness value is:

$\mathrm{fitness}=\frac{1}{X*Y}$

$X={\mathrm{\θ}}_1*\underset{m=1}{\overset{M}{\mathrm{\Σ}}}{\left(d_{i,m}\right)}^2+{\mathrm{\ξ}}_1$

Y＝θ ₂*log ₂(SchPeriod)+ξ ₂

d _{I, m}Be individual encoded radio S _i={ d _{I, 1}, d _{I, 2}..., d _{I, M}In m element; SchPeriod attempts dispatching the dispatching cycle that successfully obtains for this individuality; θ ₁, θ ₂Value is non-zero real,, ξ ₁, ξ ₂Be real number, and value is so that X, Y is non-zero;

If the individual schedule failure, then fitness value is:

$\mathrm{fitness}=\frac{1}{2*X_{\max }*Y_{\max }}$

Wherein:

X _Max, Y _MaxBe above-mentioned parameter X, Y is desirable maximum separately.

Images