CN1567769A - A system information dynamic scheduling method in WCDMA system - Google Patents
A system information dynamic scheduling method in WCDMA system Download PDFInfo
- Publication number
- CN1567769A CN1567769A CN 03137374 CN03137374A CN1567769A CN 1567769 A CN1567769 A CN 1567769A CN 03137374 CN03137374 CN 03137374 CN 03137374 A CN03137374 A CN 03137374A CN 1567769 A CN1567769 A CN 1567769A
- Authority
- CN
- China
- Prior art keywords
- priority
- sib
- current
- information
- block
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Abstract
The invention discloses a system information dynamically-scheduling method in wide-band code division multiple access system, and its characteristic: it includes the steps: A. determine main information block, schedule block, the priority of each system information blocks (SIB) and in the system information, upper and lower limits of cycle corresponding to each priority; B. obtaining the size of each SIB through compression code, using transmission block as a unit, segmenting each SIB, and according to segment number of each SIB, forecasting MIB and SB; C. according to priority sequence from high to low, staging MIB, SB and SIB, and at the same time, according to the staging result, re-segmenting SIB; D. according to the priority sequence from high to low and the upper and lower limits of cycle, determining updating cycle of system information, and according to the updating cycle and segments and staging conditions, allocating transmitting time in broadcast channel to each system information.
Description
Technical field
The invention belongs to the mobile communication technology field, relate in particular to the method for the system message dynamic dispatching in a kind of mobile communication system.
Background technology
Code division multiple access (CDMA) is as a kind of spread spectrum mobile communication technology, and it is mainly used in the military communication field at first, because its remarkable performance, this technology is current to obtain increasingly extensive application in the commercial communication field.Current, just exist cdma cellular mobile communication system with commercialization to run on concrete instance in the telecommunications network.
In cellular mobile telecommunication system, whole network is made up of some sub-districts that are divided, and different districts disposes different cell configuration attributes according to actual conditions.Configuration attribute specifically can comprise affiliated public land mobile network (PLMN) zone, sub-district, sub-district available channel type etc.These configuration attributes are only relevant with the sub-district, and little with the customer relationship in the sub-district.In order effectively to improve the efficient of such configuration attribute information of Network Transmission, generally adopt the mode of broadcasting to transmit these information in the various mobile communication system.Its concrete means comprise the system information of cell configuration attribute information for to increase broadcast channel in each sub-district by period of broadcast channel broadcasting.The travelling carriage that enters this sub-district obtains this system information of subdistricts by receiving broadcast, thereby finishes in the mobile communication system network terminal to the general controls of users of all cells.
Wideband Code Division Multiple Access (WCDMA) (WCDMA) system promptly is a kind of in the above-mentioned cdma cellular mobile communication system, in this system, the system information that broadcast channel sent comprises: system information block (SIB), Master Information Block (MIB) and schedule information piece (SB), wherein, SIB has a variety of, is used for notifying the information of information, common signal channel of information, the registration area of all subscriber-related core net in the sub-district and information of adjacent cells etc.; Comprise about the information of whole network and to some control informations of SIB the indication that whether changes such as corresponding SIB etc. among the MIB; When the control information of the SIB that can't comprise all realizations among the MIB, SB is put in the SIB control information that needs to dispatch, and SB can have two at most according to actual needs, also can not have.In above information, SIB can segmentation, and MIB and SB then can not segmentations; For satisfying system requirements, and according to the importance difference of information, it is shorter that MIB and SB send the cycle, and that SIB sends the cycle is longer.
Owing to can comprise the mobility management information, common channel information of base attribute information, the sub-district of sub-district and the corresponding configuration of the information that other can be pre-configured to said system information, therefore, can cause the dynamic change of the length of system information owing to the difference of configuration result, in addition, because comprise optional information SB in the above-mentioned information, having or not of SB also can cause system information length generation dynamic change.Therefore, need carry out dynamic dispatching to indicate the delivery time of different information in broadcast channel to system information; And as required, the structure or the number of information block of the system information block that broadcast channel sends also can change, and at this moment, also need system information block is carried out the corresponding dynamic scheduling, to satisfy the transmission requirement of broadcast channel.
In the prior art, the method of finishing system message scheduling is: need in the system at first to determine the System information block number of broadcasting, then according to the system information that realizes behind coding physical length and the parameter configuration of broadcast channel determine whether that needs are with the corresponding system information segmentation, at last, the scheduling to each system information block is finished in hand computation according to the segmentation situation, and schedule information is fixed in program or the database, so that use in each block of information transmission course.There is following shortcoming in this method:
(1) in the scheduling process of system message, do not embody system information block importance difference;
(2) require at first to realize the coding of system message for the scheduling of system information block, obtain the length behind its coding, thereby increased requirement, and make system message scheduling process complexity the system message scheduling;
(3) whether and for the scheduling of system information block the segmentation of system information block all needs artificial participation, thus make the system message scheduling be difficult to accurately, unified;
(4) do not realize cascade between the system information block, make the less system information block of length waste the broadcast channel capacity;
(5) under the situation of system information configuration modification, need manually to finish again the scheduling of all system information blocks, cause the duplication of labour, make that the efficient of dispatching patcher message is low.
Summary of the invention
In view of this, main purpose of the present invention is to provide the method for system message dynamic dispatching under a kind of WCDMA, and to realize: the broadcast cycle of (1) each system information block is minimum as far as possible; (2) system information block scheduling information dynamically generates, and need not artificial participation; (3) system information block automatic segmentation and cascade; (4) system information block importance difference is embodied in the schedule information.
The present invention is the method for system message dynamic dispatching in a kind of Wideband Code Division Multiple Access (WCDMA) (WCDMA), it is characterized in that this method may further comprise the steps:
A, determine Master Information Block (MIB), schedule information piece (SB), the priority of each system information block (SIB) and the cycle upper and lower bound of each priority correspondence in the system message;
B, obtaining the size behind each SIB compressed encoding, is that unit carries out segmentation to each SIB with the transmission block size, according to segments prediction MIB and the SB of each SIB;
C, according to priority order from high to low, carry out the cascade of MIB, SB and SIB, and simultaneously carry out the segmentation again of SIB according to the cascade result at cascade;
D, according to the priority order from high to low and the cycle upper and lower bound of priority correspondence, determine the update cycle of system message, be distributed in delivery time in the broadcast channel according to update cycle and segmentation and cascade situation for each system message.
Wherein, determine described in the steps A that priority is:
The priority of setting MIB is for the highest, and the priority of SB is for being lower than MIB but be higher than all SIB priority;
Successively according to the real-time of SIB content and renewal frequency require, the importance of content and the priority that range of application is determined SIB;
The cycle upper and lower bound of described definite each priority correspondence is:
According to the renewal frequency requirement of each SIB and the definite cycle lower limit separately of importance of content;
The cycle upper limit according to the SIB that designs needs configuration high priority is limited to the maximum update cycle that system can be provided with on the cycle of the SIB of configuration low priority.
Wherein, segments prediction MIB and the SB according to each SIB comprises described in the step B:
Limit priority begins in all SIB, calculate the required bit number of SIB of scheduling current priority correspondence step by step, judge whether this bit number is less than or equal to the bit number of current residual among the MIB, if, then the SIB of this priority correspondence of mark is dispatched by MIB, the current residual bit number deducts this bit number among the MIB, otherwise, judge whether this bit number is less than or equal to the bit number of current residual among the SB1, if then the SIB of this current priority correspondence of mark is dispatched by SB1, the current residual bit number deducts this bit number among the SB1, otherwise, judge this bit number whether less than the bit number of current residual among the SB2, if, then the SIB of this current priority correspondence of mark is dispatched by SB2, the current residual bit number deducts this bit number among the SB2, otherwise, finish this step and return error message; According to priority repeat above-mentioned steps in descending order, finish all SIB until scheduling.
Wherein, step C comprises:
C1, current priority is set is the limit priority in all block of informations, wherein, block of information is MIB, SB or SIB;
C2, the latter end size that deducts current priority corresponding informance piece with the maximum message data size of current priority obtain the maximum available message data size of current priority, whether the block of information of judging the current priority correspondence simultaneously cascade, if not, execution in step C3 then, otherwise, current priority is set to next stage priority, returns step C2, corresponds to lowest priority until current priority;
C3, the next stage that an interim priority is set is current priority;
C4, the block of information cascade whether of judging current interim priority correspondence, if, execution in step C6 then; Otherwise, judge current interim priority corresponding informance piece latter end size whether greater than the maximum available message data of current priority size, if, execution in step C6 then; Otherwise the block of information of mark current priority correspondence is for to be linked in the block of information of current priority correspondence by the block of information level of cascade, current interim priority correspondence respectively;
C5, judge whether the block of information of current interim priority correspondence is one section, if, execution in step C6 then; Otherwise, block of information segmentation again to current interim priority correspondence, make that first section size of this block of information is the former latter end size of this block of information, then, the maximum available message data size current latter end size that deducts the block of information of current interim priority correspondence obtains current maximum available message data size;
C6, interim priority reduce one-level, return step C4, are lowest priority up to interim priority;
C7, current priority reduce one-level, judge then whether current priority is lowest priority, if, then return cascade and fragmentation state, end step C, otherwise, return step C2, be lowest priority until current priority.
Wherein, described among the step D according to the priority order from high to low and the cycle upper and lower bound of priority correspondence, determine that the update cycle of system message comprises:
D1, obtain a maximum cycle in all SIB current period lower limits, judge the block of information that can dispatch all realizations in this cycle, if, then return the update cycle that this maximum cycle is a system message, otherwise, execution in step D2; Wherein, block of information comprises MIB, SB or SIB;
D2, all SIB limit priorities begin certainly, in the cycle of the current priority upper limit, current period lower limit to the current priority correspondence doubles and returns step D1, when current priority is all SIB lowest priorities, current priority is changed to all SIB limit priorities, return step D1, in D1, obtain the update cycle of system message.
Wherein, judge described in the step D1 that can the block of information that dispatch all realizations in this maximum cycle comprise:
Calculate the shared umber of cycle of each block of information in the described maximum cycle respectively, multiply by the segments of the not cascade of block of information separately respectively with this umber, the multiplied result that adds up obtains the required system message number of block of information of all realizations of scheduling in this maximum cycle;
Whether the comparison system message count can the system for transmitting message count greater than described maximum cycle institute, if, then can not dispatch the block of information of all realizations in this maximum cycle, otherwise, the block of information of all realizations can be dispatched in this maximum cycle;
Wherein, block of information comprises MIB, SB and SIB.
Wherein, among the step D, describedly comprise for the delivery time that each system message is distributed in the broadcast channel according to update cycle and segmentation and cascade situation:
The length of E1, initialization schedule information table is the described update cycle, and initialization information table array is unallocated state and current priority is set is the limit priority in all block of informations;
E2, according to the mark on the block of information, the block of information of judging the current priority correspondence whether level is linked on the out of Memory piece, if, execution in step E3 then, otherwise, execution in step E4;
E3, search the current priority correspondence block of information the latter end position of the block of information linked of level, this position of mark in first section of current priority corresponding informance piece, then, judge whether current priority corresponding informance piece also has other segmentation, if do not have, execution in step E5 then, otherwise, second segmentation from current priority corresponding informance piece begins, next unallocated position in the sequential search schedule information table, in the schedule information table this position of mark be distribution state and in current segmentation this position of mark, until finishing execution in step E5 for the position in all segment assignments schedule information tables of current priority corresponding informance piece;
E4, begin from first segmentation of current priority corresponding informance piece, next unallocated position in the sequential search schedule information table, in the schedule information table this position of mark for distribution state and in current segmentation this position of mark, until finishing execution in step E5 for the position in all segment assignments schedule information tables of current priority corresponding informance piece;
E5, current priority reduce one-level, return step e 2, are lowest priority until current priority.
Wherein, in step D, after the update cycle of determining system message, this method further comprises:
Return steps A, redefine described cycle lower limit according to the system message update cycle of determining.
As seen, the present invention embodies the importance difference of each SIB by the priority setting, and the cycle upper limit and the cycle lower limit of each SIB be set respectively according to priority, according to priority and the cycle upper limit and cycle lower limit prediction MIB/SB, then with MIB, SB and SIB cascade and according to the cascade result to SIB segmentation again, obtain cascade and again after the segmentation result, the present invention determines the update cycle according to the cycle upper limit and the cycle lower limit of above result and each SIB, utilizes the update cycle to be MIB/SB/SIB allocation schedule information then.This method can realize dynamic auto dispatching patcher information, need not artificial participation, and can improve the efficiency of transmission of system information in broadcast channel.
Description of drawings
Fig. 1 is an overview flow chart of the present invention.
Fig. 2 realizes the flow chart of segmentation and cascade for the present invention.
Fig. 3 realizes predicting the flow chart of MIB and SB for the present invention.
Fig. 4 realizes MIB, SB and SIB cascade and the heavy flow chart of segmentation for the present invention.
Fig. 5 is for determining the flow chart of update cycle among the present invention.
Fig. 6 is to be the flow chart of MIB, SB and SIB allocation schedule information among the present invention.
Embodiment
The present invention is the method for system message dynamic dispatching under a kind of WCDMA, and this method can realize the dynamic dispatching to system message, and can embody the importance of different system information in scheduling process, and improves the efficiency of transmission of system information in broadcast channel.
Describe the present invention below in conjunction with accompanying drawing.Referring to shown in Figure 1, overall procedure of the present invention may further comprise the steps:
Step 100: parameter configuration, comprise the priority of MIB, SIB and each SB in the initialization system message, and the cycle upper limit and the cycle lower limit of setting each priority, in the present embodiment, concrete setting content is:
(1) priority level initializing:
In the embodiment of the invention, with 0 as limit priority, corresponding respectively each priority of successively decreasing successively of the positive integer that increases progressively successively; In other embodiment of the present invention, also can be set to other numerical value by limit priority, and also can set priority and reduce along with the reduction of its numerical value, the mode of this kind priority definition does not influence realization of the present invention;
The embodiment of the invention is a limit priority 0 with the priority level initializing of MIB; Wherein, because MIB has determined to comprise the scheduling situation of the system message of SB, the most important on the content, therefore, not only the priority of MIB is set to limit priority 0 in the present embodiment, and in other Application Example of the present invention, the priority of MIB is made as limit priority equally;
The priority of SB1 and SB2 is set at 1 and 2 respectively; Wherein, because SB1 and SB2 are used to send the scheduling message of other message, in case system message update then must at first upgrade corresponding SB message, therefore, in other Application Example of the present invention, SB1 and SB2 are set to two priority that are only second to limit priority equally respectively;
According to the real-time of SIB content, the priority that renewal frequency requires to set each SIB, under the not high situation of renewal frequency, consider importance and the range of application setting priority of SIB respectively; The embodiment of the invention is provided with as follows to the priority of SIB:
A. real-time and the renewal frequency according to the SIB content requires to be provided with priority:
Because SIB7 comprises the uplink interference value, with respect to other SIB, its renewal frequency is higher, therefore distributes priority 3 for it;
B. the importance according to the SIB content is provided with priority:
Comprise district common channel among the SIB5/6, when the user initiates to insert, must obtain this category information, so its importance is higher, so be SIB5/6 distribution priority 4 and 5; And the relative SIB5/6 of SIB3/4 is time important, but is that the SIB11/12 of Neighboring Cell List is more important than main contents, therefore, is that SIB3/4 distributes priority 7 and 8, is that SIB11/12 distributes priority 9 and 10; Wherein, for each to SIB3/4, SIB5/6, SIB11/12, the former of the every centering relevant parameter that corresponding connection mode provided respectively, and latter's relevant parameter that corresponding idle pulley provided respectively, obviously connection mode should have higher priority with respect to idle pulley, therefore, the former of every centering is than the latter's priority height;
C. the range of application according to SIB is provided with priority:
On the basis of considering renewal frequency and content importance, consider that again range of application is provided with priority: because the range of application of SIB1 is PLMN, and the range of application of other SIB is the sub-district, in a single day the user enters the sub-district, its SIB all will upgrade, therefore range of application is that the renewal frequency of SIB of sub-district is higher, so the priority of embodiment of the invention SIB2 is set to 11, and the priority of SIB1 is set to 12.
(2) determine the cycle upper limit and the cycle lower limit of each priority, definite principle of cycle upper and lower bound is: the periodic regime bound of different priorities can be identical, but the minimum period of low priority can not be less than the minimum period of high priority, the maximum cycle of low priority can not be less than the maximum cycle of high priority, and concrete grammar is:
Determine the cycle lower limit:
According to the priority of SIB, the general respectively minimum period of determining each SIB;
Determine the cycle upper limit:
For the higher SIB of priority, dispose this SIB cycle upper limit according to the system design needs; For the lower SIB of priority, the maximum update cycle that the system that simply is set to allows gets final product.
Table 1 has provided according to said method, the priority of each SIB that the embodiment of the invention is set and the cycle upper limit and the cycle lower limit of each priority correspondence.
| Type | Priority | The cycle lower limit | The cycle upper limit |
| ????MIB | ????0 | ????8 | ????8 |
| ????SB1 | ????1 | ????16 | ????16 |
| ????SB2 | ????2 | ????16 | ????32 |
| ????SIB1 | ????12 | ????32 | ????4,096 |
| ????SIB2 | ????11 | ????32 | ????4,096 |
| ????SIB3 | ????7 | ????32 | ????4,096 |
| ????SIB4 | ????8 | ????32 | ????4,096 |
| ????SIB5 | ????4 | ????32 | ????128 |
| ????SIB6 | ????5 | ????32 | ????128 |
| ????SIB7 | ????3 | ????16 | ????64 |
| ????SIB11 | ????9 | ????32 | ????4,096 |
| ????SIB12 | ????10 | ????32 | ????4,096 |
Table 1
By table 1 as seen, the setting of priority can be discontinuous, and this mode does not influence realization of the present invention;
Step 101: each global variable in this dispatching method of initialization, comprise: the mapping table of SIB structural array, priority and the cycle upper limit and cycle lower limit, wherein, the SIB structural array is used to store the priority, dispatching cycle, segmentation number, cascade of each corresponding SIB and the SIB sequence number of being linked by cascade state and level; Mapping table is used to write down the cycle upper limit and the cycle lower limit of each priority correspondence;
Step 102: obtain the size behind each SIB compressed encoding, and obtain each SIB corresponding priorities respectively according to the parameter configuration result; Wherein, finish by other module in the system, belong to prior art for the compressed encoding of SIB;
Step 103: according to size prediction MIB and the SB of the SIB behind the compressed encoding, carry out segmentation and the cascade of MIB, SB and SIB then, referring to shown in Figure 2, embodiment of the invention performing step 103 specifically comprises:
Step 201: do not consider cascade, be that transmission block (TB) size is carried out segmentation to SIB according to normal method with each piece, and write down the segmentation number of each SIB;
Step 202: prediction MIB size and the number of SB when judging whether to need SB and needing SB;
Step 203:, carry out the heavily segmentation of cascade and the SIB of MIB, SB and SIB according to predicting the outcome of MIB and SB;
The specific implementation that regards to step 202 and step 203 is described respectively down:
(1) Fig. 3 demonstrates the flow process of present embodiment performing step 202, specifically comprises:
Step 301: finish initialization, comprise respectively:
The setting current priority is the limit priority among all SIB;
Initialization array size[max_SIB] be 0, this array is used to deposit the required bit number of each SIB of scheduling;
Obtain the segments of each SIB by step 201, at structural array SIB[max_SIB] in deposit the segments of each SIB respectively;
Initialization structural array MIB[max_SIB respectively], SB1[max_SIB], SB2[max_SIB] be 0, be used for writing down respectively the SIB number of MIB, SB1 and SB2 scheduling;
Give freeMIB with the bit number FREE_NUM_FOR_MIB assignment that offers schedule information among the MIB, give freeSB1 with the bit number FREE_NUM_FOR_SB assignment that offers schedule information among the SB1, give freeSB2 with the bit number FREE_NUM_FOR_SB assignment that offers schedule information among the SB2, and obtain the needed bit number NUM_OF_SEG_SCHEDU of segmentation of a SIB of scheduling;
Step 302: the current priority assignment is given index, calculates the required bit number of SIB of scheduling current priority correspondence, size[index]=NUM_OF_SEG_SCHEDU * SIB[index];
Step 303～step 305: the SIB of current priority is put into MIB dispatch, calculate the remaining bit number of MIB, freeMIB=freeMIB-size[index], whether judge freeMIB smaller or equal to 0, if, then execution in step 306, otherwise, execution in step 315, this SIB of mark is dispatched by MIB, MIB[max_SIB]=MIB[max_SIB]+1, execution in step 313;
Step 306～step 308: the SIB schedule information of current priority is taken out from MIB, and calculate freeMIB=freeMIB+size[index]; The SIB of current priority is put into SB1 dispatch, calculate remaining bit number among the SB1, freeSB1=freeSB1-size[index]; Whether judge freeSB1 smaller or equal to 0, if then execution in step 309, otherwise, execution in step 316, this SIB of mark is dispatched SB1[max_SIB by SB1]=SB1[max_SIB]+1, execution in step 313;
Step 309～step 312: the SIB schedule information of current priority is taken out freeSB1=freeSB1+size[index from SB1]; The SIB of current priority is put into SB2 dispatch, calculate remaining bit number among the SB2, freeSB2=freeSB2-size[index]; Whether judge freeSB2 smaller or equal to 0, if then return the error message of " can't dispatch ", otherwise this SIB of mark is dispatched SB2[max_SIB by SB2]=SB2[max_SIB]+1, execution in step 313;
Step 313～step 314: current priority reduces one-level, judge whether current priority is lower than lowest priority, if, then return the situation of MIB, SB1 and SB2 scheduling SIB, just return MIB[max_SIB], SB1[max_SIB] and SB2[max_SIB], comprise to SIB control information among MIB, SB1 and the SB2 this moment; Otherwise, return step 302, be lower than lowest priority until current priority;
(2) Fig. 4 demonstrates the flow process of present embodiment performing step 203, for sake of convenience, MIB, SB and SIB is referred to as block of information (IB) herein, and this flow process specifically comprises:
Step 401: the cascade state of each MIB/SB/SIB of initialization;
Step 402: defined variable PRI represents current priority, gives variable PRI with the limit priority assignment;
Step 403: the maximum available message data size of calculating current priority PRI: the size of the latter end of the corresponding SIB of maximum available message data size=maximum message data size-PRI; Wherein, maximum message data size refers to the maximum data bit number that can transmit in the broadcast channel in the TTI, maximum available message data size refers to the data bit bits number that the interior broadcast channel of a TTI does not have use, and these data reinitialize when PRI changes;
Step 404: whether the IB that judges the PRI correspondence cascade, if then execution in step 405, otherwise, execution in step 415;
Step 405: interim priority parameters tmpPRI is set, tmpPRI is made as the low one-level priority of PRI; Step 405a judges whether this tmpPRI is 1 or 2, if then tmpPRI reduces one-level, returns execution in step 405, until tmpPRI be not 1 or 2 o'clock till, satisfy the principle of cascade with this:
(1) SIB and first segmentation of low priority SIB or the SIB cascade that has only a section to form that only allows last segmentation of high priority SIB or have only a section to form;
(2) MIB and SB can with other SIB cascade;
The execution result of above-mentioned 405a step makes does not carry out following cascade step between MIB and the SB;
Step 406: whether the IB that judges the tmpPRI correspondence cascade, if then execution in step 413; Otherwise whether the IB latter end size of judging the tmpPRI correspondence greater than current maximum available message data size, if, then execution in step 413, otherwise, the IB of PRI correspondence is labeled as by cascade, and the IB of tmpPRI correspondence is labeled as level links among the IB of PRI correspondence;
Step 410～step 412: whether the IB that judges the tmpPRI correspondence only is divided into a section, if, then execution in step 413, otherwise, recomputate maximum available message data size: the IB latter end size of maximum available message data size=maximum available message data size-tmpPRI correspondence, and to the SIB segmentation again of tmpPRI correspondence, the first section size of this IB is original latter end size after the feasible segmentation again;
Step 413～step 414: tmpPRI priority is reduced one-level, judge then whether current tmpPRI is lowest priority, if, execution in step 415, otherwise, return step 406, begin next priority IB is carried out cascade and heavily segmentation, arrive lowest priority, execution in step 415 until tmpPRI;
Step 415:PRI priority reduces one-level, judges whether current PRI is lowest priority, if, then return in the cascade segmentation flow process shown in Figure 2, otherwise, step 403 returned, begin the IB of current PRI priority is carried out cascade and segmentation again, arrive lowest priority until PRI.
Continue below step shown in Figure 1 is described:
Step 104: segmentation and cascade result according to each SIB that obtains in the step 103 in conjunction with to the predefined periodic regime of each priority, according to priority order from high to low, calculate the update cycle; Referring to shown in Figure 5, the embodiment of the invention is by following flow process performing step 104:
Step 501: by the cycle lower limit that obtains all SIB in the mapping table of priority and the cycle upper limit and cycle lower limit, from wherein select maximum one as maximum cycle Tmax (unit is frame frame), calculating is at Tmax in the time, the needed total message number of IB that scheduling has realized is designated as the MessageNum:MessageNum=∑
All IB sequence numbers that realize(Tmax/IB
iCycle) * IB
iThe segmentation number of cascade not, wherein, IB comprises MIB, SB and SIB, the subscript I in the formula represents the sequence number of each IB;
Step 503: the minimum value in all numerical priority value of temporary variable CurrPri=is set, just the tree value of limit priority is composed and given variable CurrPri; Because in the present invention, the numerical priority value minimum of limit priority, the numerical priority value maximum of lowest priority, therefore, the represented implication of the order from small to large of the numerical priority value in the subsequent step of the present invention is a priority order from high to low;
Step 504: because in the embodiment of the invention, per 2 frame transmit a SYSTEMINFORMATION message, and the number of frame and period T is big or small identical, therefore, judge that whether MessageNum is greater than Tmax/2, if, show that the cycle of current distribution does not meet the demands, then execution in step 505, otherwise, the cycle that shows current distribution meets the demands, and finishes the update cycle and determines flow process, returns the next step 105 in update cycle and the continuation execution flow process shown in Figure 1;
Step 505～step 506: judge whether current priority CurrPri reaches the maximum of priority,, begin to determine the cycle from limit priority again if then current priority CurrPri returns priority minimum, otherwise direct execution in step 507:
Step 507～step 508: judge whether current priority CurrPri has corresponding SIB, whether the SIB that just judges the current priority correspondence realizes, if, then execution in step 509, otherwise, show the SIB assignment period that need not according to the current priority correspondence, current priority CurrPri numerical value raises one, returns step 505;
The cycle lower limit of the corresponding SIB of step 509:CurrPri doubles, judge whether the cycle after doubling exceeds the maximum cycle value that this SIB sets, if, then the current period with the corresponding SIB of CurrPri reduces by half, and with one of CurrPri numerical value rising, return step 505, begin the SIB cycle lower limit of next priority is doubled to determine the update cycle; Otherwise, execution in step 511;
Step 511～step 513: determine the Tmax in all SIB current period lower limits, at this moment, the cycle lower limit of the SIB of corresponding CurrPri doubles; Calculate at Tmax in the time as the described mode of step 502, the needed total message number of SIB that scheduling has realized, and with one of CurrPri numerical value rising, in order to carrying out by the corresponding SIB cycle lower limit of next priority is doubled to determine the update cycle, return step 504, judge whether this current Tmax meets the demands; So circulation is until finding the update cycle that meets the demands.
Step 105: according to the update cycle of determining, distribute each MIB, SB and the SIB delivery time in broadcast channel, be its allocation schedule information, for sake of convenience, MIB, SB and SIB are referred to as block of information (IB) herein.Referring to shown in Figure 6, embodiment of the invention performing step 105 needs following process:
Step 601～step 602: initialization schedule information table array is unallocated state, and the length of schedule information table is defined as determined update cycle Tmax in the step 104; And definition temporary variable PRI=limit priority;
Step 603: the IB that judges the current priority correspondence whether level links among other IB, if then execution in step 604, otherwise, execution in step 612;
Step 604: search the position of latter end in the schedule information table of the IB of cascade mutually, this position of mark in first section of the corresponding IB of PRI with the corresponding IB of PRI;
Step 606: judge whether the corresponding IB of PRI also has other segmentations, if, execution in step 607, otherwise, execution in step 617;
Step 607～step 611: second segmentation from the corresponding IB of PRI begins, the next unallocated position of sequential search in the schedule information table, then this position mark is distribution state, and this current location in this schedule information table of current fragment bit tagging of the corresponding IB of PRI, finish execution in step 617 until last segment processing to the corresponding IB of PRI;
Step 612～step 616: first segmentation from the corresponding IB of PRI begins, the next unallocated position of sequential search in the schedule information table, then this position mark is distribution state, and the current location in this schedule information table of current fragment bit tagging of the corresponding IB of PRI, finish execution in step 617 until last segment processing to the corresponding IB of PRI;
Step 617～step 618:PRI reduces by one, judges whether PRI is lowest priority, if, then finish the allocation schedule information process, return the schedule information position of each segmentation of MIB/SB/SIB, return flow process shown in Figure 1; Otherwise, return step 603, begin IB allocation schedule information to next priority correspondence, finish until IB allocation schedule information to the lowest priority correspondence, return the schedule information position of each segmentation of MIB/SB/SIB, return flow process shown in Figure 1, finish whole scheduling process.
Wherein, among aforesaid each step, the step that every SIB that relates to a priority correspondence operates, whether the SIB that all can judge this priority correspondence before operating realizes in actual applications, if, then carry out corresponding steps, otherwise, carry out the operation of next priority; What the embodiment of the invention adopted is exactly this kind method, just in order to narrate the cause of simplification, so be not described in each flow chart and the pairing narration of flow chart.
As seen, the present invention has realized the dynamic dispatching to system's message, and its useful effect is as follows:
(1) when the SIB structure change that realizes or additions and deletions, need not the dynamic generation that artificial participation can realize the SIB schedule information;
(2) by the parameter configuration of priority and periodic regime, can finish the control function of the SIB dispatching cycle of care;
(3) by the setting of priority, embodied the importance difference of system information block;
(4) by this patented method, can make the broadcast cycle of each system information block reach within the specific limits minimum;
(5) realize that the automatic segmentation of system information block and level connect, and reduce the broadcast channel transfer delay.
Claims (8)
1, the system message dynamic dispatching method in a kind of broadband CDMA system is characterized in that this method may further comprise the steps:
A, determine Master Information Block (MIB), schedule information piece (SB), the priority of each system information block (SIB) and the cycle upper and lower bound of each priority correspondence in the system message;
B, obtaining the size behind each SIB compressed encoding, is that unit carries out segmentation to each SIB with the transmission block size, according to segments prediction MIB and the SB of each SIB;
C, according to priority order from high to low, carry out the cascade of MIB, SB and SIB, and simultaneously carry out the segmentation again of SIB according to the cascade result at cascade;
D, according to the priority order from high to low and the cycle upper and lower bound of priority correspondence, determine the update cycle of system message, be distributed in delivery time in the broadcast channel according to update cycle and segmentation and cascade situation for each system message.
2, method according to claim 1 is characterized in that determining described in the steps A that priority is:
The priority of setting MIB is for the highest, and the priority of SB is for being lower than MIB but be higher than all SIB priority;
Successively according to the real-time of SIB content and renewal frequency require, the importance of content and the priority that range of application is determined SIB;
The cycle upper and lower bound of described definite each priority correspondence is:
According to the renewal frequency requirement of each SIB and the definite cycle lower limit separately of importance of content;
The cycle upper limit according to the SIB that designs needs configuration high priority is limited to the maximum update cycle that system can be provided with on the cycle of the SIB of configuration low priority.
3, method according to claim 1 is characterized in that segments prediction MIB and the SB according to each SIB comprises described in the step B:
Limit priority begins in all SIB, calculate the required bit number of SIB of scheduling current priority correspondence step by step, judge whether this bit number is less than or equal to the bit number of current residual among the MIB, if, then the SIB of this priority correspondence of mark is dispatched by MIB, the current residual bit number deducts this bit number among the MIB, otherwise, judge whether this bit number is less than or equal to the bit number of current residual among the SB1, if then the SIB of this current priority correspondence of mark is dispatched by SB1, the current residual bit number deducts this bit number among the SB1, otherwise, judge this bit number whether less than the bit number of current residual among the SB2, if, then the SIB of this current priority correspondence of mark is dispatched by SB2, the current residual bit number deducts this bit number among the SB2, otherwise, finish this step and return error message; According to priority repeat above-mentioned steps in descending order, finish all SIB until scheduling.
4, method according to claim 1 is characterized in that step C comprises:
C1, current priority is set is the limit priority in all block of informations, wherein, block of information is MIB, SB or SIB;
C2, the latter end size that deducts current priority corresponding informance piece with the maximum message data size of current priority obtain the maximum available message data size of current priority, whether the block of information of judging the current priority correspondence simultaneously cascade, if not, execution in step C3 then, otherwise, current priority is set to next stage priority, returns step C2, corresponds to lowest priority until current priority;
C3, the next stage that an interim priority is set is current priority;
C4, the block of information cascade whether of judging current interim priority correspondence, if, execution in step C6 then; Otherwise, judge current interim priority corresponding informance piece latter end size whether greater than the maximum available message data of current priority size, if, execution in step C6 then; Otherwise the block of information of mark current priority correspondence is for to be linked in the block of information of current priority correspondence by the block of information level of cascade, current interim priority correspondence respectively;
C5, judge whether the block of information of current interim priority correspondence is one section, if, execution in step C6 then; Otherwise, block of information segmentation again to current interim priority correspondence, make that first section size of this block of information is the former latter end size of this block of information, then, the maximum available message data size current latter end size that deducts the block of information of current interim priority correspondence obtains current maximum available message data size;
C6, interim priority reduce one-level, return step C4, are lowest priority up to interim priority;
C7, current priority reduce one-level, judge then whether current priority is lowest priority, if, then return cascade and fragmentation state, end step C, otherwise, return step C2, be lowest priority until current priority.
5, method according to claim 1 is characterized in that among the step D, and is described according to the priority order from high to low and the cycle upper and lower bound of priority correspondence, determines that the update cycle of system message comprises:
D1, obtain a maximum cycle in all SIB current period lower limits, judge the block of information that can dispatch all realizations in this cycle, if, then return the update cycle that this maximum cycle is a system message, otherwise, execution in step D2; Wherein, block of information comprises MIB, SB or SIB;
D2, all SIB limit priorities begin certainly, in the cycle of the current priority upper limit, current period lower limit to the current priority correspondence doubles and returns step D1, when current priority is all SIB lowest priorities, current priority is changed to all SIB limit priorities, return step D1, in D1, obtain the update cycle of system message.
6, method according to claim 5 is characterized in that judging described in the step D1 that can the block of information that dispatch all realizations in this maximum cycle comprise:
Calculate the shared umber of cycle of each block of information in the described maximum cycle respectively, multiply by the segments of the not cascade of block of information separately respectively with this umber, the multiplied result that adds up obtains the required system message number of block of information of all realizations of scheduling in this maximum cycle;
Whether the comparison system message count can the system for transmitting message count greater than described maximum cycle institute, if, then can not dispatch the block of information of all realizations in this maximum cycle, otherwise, the block of information of all realizations can be dispatched in this maximum cycle;
Wherein, block of information comprises MIB, SB and SIB.
7, method according to claim 1 is characterized in that among the step D, describedly comprises for the delivery time that each system message is distributed in the broadcast channel according to update cycle and segmentation and cascade situation:
The length of E1, initialization schedule information table is the described update cycle, and initialization information table array is unallocated state and current priority is set is the limit priority in all block of informations;
E2, according to the mark on the block of information, the block of information of judging the current priority correspondence whether level is linked on the out of Memory piece, if, execution in step E3 then, otherwise, execution in step E4;
E3, search the current priority correspondence block of information the latter end position of the block of information linked of level, this position of mark in first section of current priority corresponding informance piece, then, judge whether current priority corresponding informance piece also has other segmentation, if do not have, execution in step E5 then, otherwise, second segmentation from current priority corresponding informance piece begins, next unallocated position in the sequential search schedule information table, in the schedule information table this position of mark be distribution state and in current segmentation this position of mark, until finishing execution in step E5 for the position in all segment assignments schedule information tables of current priority corresponding informance piece;
E4, begin from first segmentation of current priority corresponding informance piece, next unallocated position in the sequential search schedule information table, in the schedule information table this position of mark for distribution state and in current segmentation this position of mark, until finishing execution in step E5 for the position in all segment assignments schedule information tables of current priority corresponding informance piece;
E5, current priority reduce one-level, return step e 2, are lowest priority until current priority.
8, method according to claim 1, in step D, after the update cycle of determining system message, this method further comprises:
Return steps A, redefine described cycle lower limit according to the system message update cycle of determining.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB031373747A CN100571086C (en) | 2003-06-19 | 2003-06-19 | System message dynamic dispatching method in a kind of broadband CDMA system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB031373747A CN100571086C (en) | 2003-06-19 | 2003-06-19 | System message dynamic dispatching method in a kind of broadband CDMA system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1567769A true CN1567769A (en) | 2005-01-19 |
| CN100571086C CN100571086C (en) | 2009-12-16 |
Family
ID=34470381
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB031373747A Expired - Fee Related CN100571086C (en) | 2003-06-19 | 2003-06-19 | System message dynamic dispatching method in a kind of broadband CDMA system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100571086C (en) |
Cited By (27)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB2429882A (en) * | 2005-08-31 | 2007-03-07 | Infineon Technologies Ag | Formation of system information medium access control protocol messages and ascertainment of system information from system information medium access control |
| EP1943777A1 (en) * | 2005-10-31 | 2008-07-16 | LG Electronics Inc. | Method for processing control information in a wireless mobile communication system |
| CN100466849C (en) * | 2006-06-15 | 2009-03-04 | 华为技术有限公司 | Method and system for controlling user terminal to read system message |
| WO2009076803A1 (en) * | 2007-12-12 | 2009-06-25 | Zte Corporation | Method for sending, transmitting and scheduling system message in long term evolution system |
| WO2009092303A1 (en) * | 2008-01-08 | 2009-07-30 | Huawei Technologies Co., Ltd. | System information scheduling method, device and terminal |
| WO2009117895A1 (en) * | 2008-03-25 | 2009-10-01 | 中兴通讯股份有限公司 | A system information transmitting and receiving method |
| WO2010012224A1 (en) * | 2008-07-31 | 2010-02-04 | 华为技术有限公司 | Scheduling method, apparatus and data interaction system |
| WO2010017734A1 (en) * | 2008-08-14 | 2010-02-18 | 华为技术有限公司 | Method for acquiring system information, and communication system and mobile terminal thereof |
| WO2010031348A1 (en) * | 2008-09-22 | 2010-03-25 | 中兴通讯股份有限公司 | System message receiving and transmitting method of earthquake and tsunami warning system |
| CN101114869B (en) * | 2006-07-26 | 2010-10-20 | 大唐移动通信设备有限公司 | System message block scheduling method and device in UMTS system |
| CN101212799B (en) * | 2006-12-29 | 2011-02-02 | 华为技术有限公司 | Method for indicating system message changes, method and device for obtaining system message |
| CN101369962B (en) * | 2007-08-13 | 2011-06-08 | 华为技术有限公司 | Method and network appliance for forwarding packet |
| CN101207885B (en) * | 2006-12-22 | 2011-07-06 | 华为技术有限公司 | Method and equipment for sending measurement control information |
| CN102651890A (en) * | 2011-02-24 | 2012-08-29 | 电信科学技术研究院 | Method and device for transmitting system information |
| CN101547186B (en) * | 2008-03-25 | 2012-09-05 | 中兴通讯股份有限公司 | Method and device for sending system message, and method for receiving system message |
| CN102761406A (en) * | 2007-06-19 | 2012-10-31 | 株式会社Ntt都科摩 | Base station and broadcast channel transmission method |
| CN101651490B (en) * | 2008-08-11 | 2013-01-16 | 中兴通讯股份有限公司 | Method for scheduling and receiving system message blocks |
| CN102917437A (en) * | 2007-09-18 | 2013-02-06 | Lg电子株式会社 | Method of acquiring system information in wireless communication system |
| CN101572595B (en) * | 2008-04-29 | 2013-02-27 | 中兴通讯股份有限公司 | Dispatching method of system messages |
| CN101803242B (en) * | 2007-09-14 | 2013-11-06 | 英特尔公司 | Efficient use of persistent scheduling with OFDMA wireless communications |
| CN101212795B (en) * | 2006-12-29 | 2014-06-25 | 电信科学技术研究院 | Method and device for changing system message |
| US8817737B2 (en) | 2005-10-31 | 2014-08-26 | Lg Electronics Inc. | Method of transmitting and receiving data in a mobile communication network |
| US8830945B2 (en) | 2005-10-31 | 2014-09-09 | Lg Electronics Inc. | Method for processing control information in a wireless mobile communication system |
| US8879449B2 (en) | 2007-09-18 | 2014-11-04 | Lg Electronics Inc. | Method of acquiring system information in wireless communication system |
| US8886184B2 (en) | 2007-09-18 | 2014-11-11 | Lg Electronics Inc. | Method of performing cell reselection procedure in wireless communication system |
| CN105519195A (en) * | 2014-01-28 | 2016-04-20 | 华为技术有限公司 | System information scheduling method and user device |
| US10506445B2 (en) | 2017-12-01 | 2019-12-10 | At&T Intellectual Property I, L.P. | Radio access resource sharing and intelligent dynamic carrier capacity division in 5G or other next generation networks |
-
2003
- 2003-06-19 CN CNB031373747A patent/CN100571086C/en not_active Expired - Fee Related
Cited By (49)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8977271B2 (en) | 2005-08-31 | 2015-03-10 | Intel Mobile Communications GmbH | Computer-aided mapping of system information medium access control protocol messages |
| GB2429882B (en) * | 2005-08-31 | 2008-04-30 | Infineon Technologies Ag | Method and medium access control unit generating system information medium access control protocol messages |
| US8380204B2 (en) | 2005-08-31 | 2013-02-19 | Intel Mobile Communications GmbH | Computed-aided mapping of system information medium access control protocol messages |
| DE102005041273B4 (en) * | 2005-08-31 | 2014-05-08 | Intel Mobile Communications GmbH | A method of computer-aided forming of system information medium access control log messages, medium access control unit and computer program element |
| US10321277B2 (en) | 2005-08-31 | 2019-06-11 | Intel Deutschland Gmbh | Computer-aided mapping of system information medium access control protocol messages |
| GB2429882A (en) * | 2005-08-31 | 2007-03-07 | Infineon Technologies Ag | Formation of system information medium access control protocol messages and ascertainment of system information from system information medium access control |
| US8817737B2 (en) | 2005-10-31 | 2014-08-26 | Lg Electronics Inc. | Method of transmitting and receiving data in a mobile communication network |
| US8830945B2 (en) | 2005-10-31 | 2014-09-09 | Lg Electronics Inc. | Method for processing control information in a wireless mobile communication system |
| EP1943777B1 (en) * | 2005-10-31 | 2016-07-20 | LG Electronics Inc. | Method for processing control information in a wireless mobile communication system |
| EP1943777A1 (en) * | 2005-10-31 | 2008-07-16 | LG Electronics Inc. | Method for processing control information in a wireless mobile communication system |
| US9930580B2 (en) | 2005-10-31 | 2018-03-27 | Lg Electronics Inc. | Data transfer management in a radio communications network |
| US8831616B2 (en) | 2005-10-31 | 2014-09-09 | Lg Electronics Inc. | Data transfer management in a radio communications network |
| US10129795B2 (en) | 2005-10-31 | 2018-11-13 | Lg Electronics Inc. | Data transfer management in a radio communications network |
| US9516573B2 (en) | 2005-10-31 | 2016-12-06 | Lg Electronics Inc. | Data transfer management in a radio communications network |
| CN100466849C (en) * | 2006-06-15 | 2009-03-04 | 华为技术有限公司 | Method and system for controlling user terminal to read system message |
| CN101114869B (en) * | 2006-07-26 | 2010-10-20 | 大唐移动通信设备有限公司 | System message block scheduling method and device in UMTS system |
| CN101207885B (en) * | 2006-12-22 | 2011-07-06 | 华为技术有限公司 | Method and equipment for sending measurement control information |
| CN101212795B (en) * | 2006-12-29 | 2014-06-25 | 电信科学技术研究院 | Method and device for changing system message |
| CN101212799B (en) * | 2006-12-29 | 2011-02-02 | 华为技术有限公司 | Method for indicating system message changes, method and device for obtaining system message |
| CN101690063B (en) * | 2007-06-19 | 2013-04-03 | 株式会社Ntt都科摩 | Base station device and notice channel transmitting method |
| CN102761406A (en) * | 2007-06-19 | 2012-10-31 | 株式会社Ntt都科摩 | Base station and broadcast channel transmission method |
| CN102761406B (en) * | 2007-06-19 | 2015-03-18 | 株式会社Ntt都科摩 | Base station and transmission method |
| CN101369962B (en) * | 2007-08-13 | 2011-06-08 | 华为技术有限公司 | Method and network appliance for forwarding packet |
| CN101803242B (en) * | 2007-09-14 | 2013-11-06 | 英特尔公司 | Efficient use of persistent scheduling with OFDMA wireless communications |
| CN102917437B (en) * | 2007-09-18 | 2015-03-04 | Lg电子株式会社 | Method of acquiring system information in wireless communication system |
| US8879449B2 (en) | 2007-09-18 | 2014-11-04 | Lg Electronics Inc. | Method of acquiring system information in wireless communication system |
| US8886184B2 (en) | 2007-09-18 | 2014-11-11 | Lg Electronics Inc. | Method of performing cell reselection procedure in wireless communication system |
| CN102917437A (en) * | 2007-09-18 | 2013-02-06 | Lg电子株式会社 | Method of acquiring system information in wireless communication system |
| WO2009076803A1 (en) * | 2007-12-12 | 2009-06-25 | Zte Corporation | Method for sending, transmitting and scheduling system message in long term evolution system |
| KR101085338B1 (en) | 2007-12-12 | 2011-11-23 | 지티이 코포레이션 | Method for sending, transmitting and scheduling system message in long term evolution system |
| WO2009079819A1 (en) * | 2007-12-12 | 2009-07-02 | Zte Corporation | Method for sending, transmitting and scheduling system message in long term evolution system |
| CN101483903B (en) * | 2008-01-08 | 2011-06-08 | 华为技术有限公司 | System information scheduling method, apparatus and a terminal |
| WO2009092303A1 (en) * | 2008-01-08 | 2009-07-30 | Huawei Technologies Co., Ltd. | System information scheduling method, device and terminal |
| RU2474962C2 (en) * | 2008-03-25 | 2013-02-10 | Зте Корпарейшен | Method of transmitting and system information |
| WO2009117895A1 (en) * | 2008-03-25 | 2009-10-01 | 中兴通讯股份有限公司 | A system information transmitting and receiving method |
| CN101547186B (en) * | 2008-03-25 | 2012-09-05 | 中兴通讯股份有限公司 | Method and device for sending system message, and method for receiving system message |
| US8861484B2 (en) | 2008-03-25 | 2014-10-14 | Zte Corporation | Method for transmitting and receiving system information |
| CN101547075B (en) * | 2008-03-25 | 2013-08-21 | 中兴通讯股份有限公司 | Method for sending and receiving system messages |
| CN101572595B (en) * | 2008-04-29 | 2013-02-27 | 中兴通讯股份有限公司 | Dispatching method of system messages |
| WO2010012224A1 (en) * | 2008-07-31 | 2010-02-04 | 华为技术有限公司 | Scheduling method, apparatus and data interaction system |
| CN101651490B (en) * | 2008-08-11 | 2013-01-16 | 中兴通讯股份有限公司 | Method for scheduling and receiving system message blocks |
| WO2010017734A1 (en) * | 2008-08-14 | 2010-02-18 | 华为技术有限公司 | Method for acquiring system information, and communication system and mobile terminal thereof |
| WO2010031348A1 (en) * | 2008-09-22 | 2010-03-25 | 中兴通讯股份有限公司 | System message receiving and transmitting method of earthquake and tsunami warning system |
| CN102651890A (en) * | 2011-02-24 | 2012-08-29 | 电信科学技术研究院 | Method and device for transmitting system information |
| CN105519195A (en) * | 2014-01-28 | 2016-04-20 | 华为技术有限公司 | System information scheduling method and user device |
| CN105519195B (en) * | 2014-01-28 | 2019-08-20 | 华为技术有限公司 | A kind of dispatching method and user equipment of system information |
| CN110430609A (en) * | 2014-01-28 | 2019-11-08 | 华为技术有限公司 | A kind of dispatching method and user equipment of system information |
| CN110430609B (en) * | 2014-01-28 | 2022-03-25 | 华为技术有限公司 | Scheduling method of system information and user equipment |
| US10506445B2 (en) | 2017-12-01 | 2019-12-10 | At&T Intellectual Property I, L.P. | Radio access resource sharing and intelligent dynamic carrier capacity division in 5G or other next generation networks |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100571086C (en) | 2009-12-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1567769A (en) | A system information dynamic scheduling method in WCDMA system | |
| CN1218591C (en) | Dynamic allocation of packet data channels | |
| CN1264379C (en) | Method and apparatus for upstream and downstream resource allocation in time division duplexing mobile communication system | |
| CN1132485C (en) | Methods for reducing channel acquisition times in a radiotelephone communications system and related mobile terminals | |
| CN1832613A (en) | Parallel frequency spectrum distribution method for preventing interference in cognitive radio system | |
| CN1232051C (en) | Method, apparatus and computer program for code allocation for variable data rates in a CDMA system | |
| CN1968486A (en) | Method and system for adjusting wireless network resource | |
| CN1862993A (en) | Method and system for carrier-power planning in a cellular telecomunications network | |
| CN1754393A (en) | Method for implementing fast-dynamic channel allocation radio resource management procedures | |
| CN1992962A (en) | Inter-cell interference coordination method based on evolution network architecture of 3G system | |
| CN1435068A (en) | Flexible, Feature-based system selection protocol | |
| CN1675956A (en) | An apparatus and method for resource allocation in a communication system | |
| CN1132584A (en) | Method for determining base station locations, and device for applying the method | |
| CN1166095C (en) | Combining method for selecting transmission mode of transmission channels in mobile station and corresponding mobile station | |
| CN1917690A (en) | Method for assigning dynamic frequency spectrum of multiple radio system based on dynamic boundary of virtual frequency spectrum | |
| CN1852043A (en) | Power control method of multi-carrier-wave wireless honeycomb communication system | |
| CN1529449A (en) | Method for realizing pocket data business service quality of CDMA zooo system | |
| CN1870813A (en) | Channel priority dispatching and service priovity dispatching implementing method | |
| CN1933653A (en) | Up bandwidth distributing method for wide band wireless access system | |
| CN1905549A (en) | System and method for resource allocation of OFDM system | |
| CN1802801A (en) | Scheduler and method of scheduling data for communication between a node station and plurality of radio terminals | |
| CN1202679C (en) | Method for shearing capacity in CDMA mobile radio communication system | |
| CN1647549A (en) | Method of multi-service allocation in multi-access systems | |
| CN1675957A (en) | Resource utilisation between different frequency bands by compensating handover parameter values with a frequency band preference parameter | |
| CN1520199A (en) | Method for allotting wireless resources of multiple time slot packets |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20091216 Termination date: 20200619 |