CN101521942A - Method for dispatching high-speed uplink package access system - Google Patents

Abstract

The invention discloses a method for dispatching a high-speed uplink package access system (HSUPA), comprising the following steps of: firstly, estimating the resource requested by UE to be dispatched and the interference generated after the UE is dispatched; subsequently, according to the estimated resource requested by the UE and the interference generated when the UE is dispatched, determining the UE that can be dispatched in corresponding threshold from high to low according to the determined sending sequence priority; and finally, according to the estimated resource requested by the UE, authorizing corresponding resource to the UE that can be dispatched. The method can reasonably distribute the time-slot code-channel physical resource and effectively control the interference in the cell and the interference to the adjacent cells during the dispatching process.

Description

Scheduling method for high-speed uplink packet access system

Technical Field

The invention relates to a High Speed Uplink Packet Access (HSUPA) technology, in particular to an HSUPA scheduling method.

Background

In order to meet the development requirement of high-speed data service in a mobile network, an HSUPA technology is introduced into a time division synchronous code division multiple access (TD-SCDMA) system, and an uplink enhanced dedicated channel (E-DCH) is an uplink channel newly added by the HSUPA technology. Key technologies for E-DCH include: adaptive Modulation and Coding (AMC), hybrid automatic repeat request (HARQ), and base station (Node B) controlled uplink fast scheduling.

The HSUPA scheduler in Node B is used for controlling the uplink fast scheduling, and the uplink fast scheduling comprises the following steps: rate scheduling (rate can also be equivalent to corresponding power according to a certain relationship) and physical resource scheduling, wherein the former can rapidly control the transmission rate of a User Equipment (UE) based on an interference level, and the latter can rapidly control the effective allocation of timeslot code channel physical resources based on the burst characteristic of a service and a time-varying channel environment. The HSUPA scheduler needs to control both the rise-over-noise (RoT) in the cell to be within a higher range within the threshold and the interference of the UE to the neighboring cell to be within the control range, so how to effectively control the interference in the cell and the interference to the neighboring cell, and reasonably allocate the timeslot code channel physical resources and give consideration to the rate request of the UE is the key to successfully implement TD-SCDMA HSUPA in the scheduling process.

The existing HSUPA scheduling method in Frequency Division Duplex (FDD) mode is mainly to control the neighboring cell interference level of the whole system by adjusting the transmission rate of the neighboring cell according to the neighboring cell interference level suffered by the serving cell of the scheduled UE. However, TD-SCDMA is a system in Time Division Duplex (TDD) mode, where TDD mode and FDD mode have a great difference in HSUPA technology, and an HSUPA scheduler in TDD mode cannot adjust the transmission rate of a neighboring cell according to the interference level of the neighboring cell received by a serving cell of a scheduled UE, but only can control the possible interference of the scheduled UE to the neighboring cell, so as to achieve controllable interference level of the neighboring cell of the entire system. It can be seen that the existing FDD HSUPA scheduling method cannot be directly used for implementing HSUPA scheduling in TD-SCDMA system.

Also, due to the difference in processing between the uplink and downlink, the existing High Speed Downlink Packet Access (HSDPA) scheduling method cannot be directly used to implement HSUPA scheduling. In addition, no scheduling method related to HSUPA in TDD mode has been found in the currently published patents and documents.

Therefore, there is a need to propose an HSUPA scheduling method suitable for TDD mode.

Disclosure of Invention

In view of the above, the main objective of the present invention is to provide an HSUPA scheduling method, so as to reasonably allocate timeslot code channel physical resources and effectively control intra-cell interference and interference to neighboring cells during the scheduling process.

In order to achieve the purpose, the technical scheme of the invention is realized as follows:

a high speed uplink packet access system scheduling method includes:

A. estimating the request rate of each user terminal UE to be scheduled, the required time slot code channel physical resource, and the interference increment in a cell and the interference increment to an adjacent cell, which are generated when the UE is scheduled;

B. determining the priority of the sending sequence of the UE to be scheduled;

C. determining the UE which can be scheduled according to the estimated time slot code channel physical resources required by each UE to be scheduled, the interference increment in the cell and the interference increment to the adjacent cell which are generated when the UE is scheduled, and the sequence of the priority of the sending sequence from high to low in the preset cell total load threshold, the adjacent cell interference threshold and the resource pool threshold;

D. and according to the estimated request rate of each UE to be scheduled and the required physical resource of the time slot code channel, corresponding power and physical resource of the time slot code channel are authorized for the UE which can be scheduled.

Before the step a, the method may further include: receiving and storing scheduling information reported by UE to be scheduled;

step a the estimating may comprise: and estimating according to the stored scheduling information.

The step a may be executed by the base station Node B in the first scheduling time interval TTI of the scheduling period of each UE to be scheduled;

the steps B, C and D may be performed by the Node B in every TTI.

Step a said estimating an intra-cell interference increment that the UE will generate when scheduled may comprise: and estimating by adopting a load increment equivalent estimation mode.

The step C may include:

c1, taking the UE with the highest priority in the priority of the sending sequence as the current UE to be scheduled;

c2, adding the intra-cell interference increment of the current UE to be scheduled to the current total load of the cell, adding the interference increment of the current UE to be scheduled to the adjacent cell to the current total interference of the adjacent cell, adding the physical resource of the time slot code channel required by the current UE to be scheduled to the current total allocation amount of the physical resource of the time slot code channel, if the current total load of the cell does not exceed the cell total load threshold, the current total interference of the adjacent cell does not exceed the adjacent cell interference threshold, and the current total allocation amount of the physical resource of the time slot code channel does not exceed the resource pool threshold, determining the current UE to be scheduled as the UE which can be scheduled, taking the next UE to be scheduled in the sending sequence priority as the current UE to be scheduled, returning to the step C2, otherwise, continuing to execute the step D.

The step C may include:

c3, taking the UE with the highest priority in the priority of the sending sequence as the current UE to be scheduled;

c4, adding the intra-cell interference increment of the current UE to be scheduled to the current total load of the cell, adding the interference increment of the current UE to be scheduled to the adjacent cell to the current total interference to the adjacent cell, adding the physical resource of the time slot code channel required by the current UE to be scheduled to the current total allocation amount of the physical resource of the time slot code channel, if the current total load of the cell does not exceed the cell total load threshold, the current total interference to the adjacent cell does not exceed the adjacent cell interference threshold, and the current total allocation amount of the physical resource of the time slot code channel does not exceed the resource pool threshold, determining the current UE to be scheduled as the UE which can be scheduled, continuing to execute the step D, otherwise, ending the process of the method;

after the step D, the method may further include: and taking the UE next to the UE to be scheduled currently in the sending sequence priority as the UE to be scheduled currently, and returning to the step C3.

The step B may include: and determining the priority of the sending sequence of the UE to be scheduled by adopting a polling RR scheduling algorithm.

The step a may further include: estimating the uplink channel quality of the current TTI;

the step B comprises the following steps: and determining the priority of the sending sequence of the UE to be scheduled by adopting a maximum carrier-to-interference ratio MAX C/I scheduling algorithm according to the estimated uplink channel quality of the current TTI.

The step a may further include: estimating the average sending rate of each UE to be scheduled, the uplink channel quality and the uplink average channel quality of the current TTI, or estimating the average throughput of each UE to be scheduled, the uplink channel quality and the uplink average channel quality of the current TTI;

the step B comprises the following steps: and determining the priority of the sending sequence of the UE to be scheduled by adopting a Proportional Fair (PF) scheduling algorithm according to the estimated request rate and average sending rate of each UE to be scheduled, the uplink channel quality and the uplink average channel quality of the current TTI, or according to the estimated request rate and average throughput of each UE to be scheduled, the uplink channel quality and the uplink average channel quality of the current TTI.

According to the technical scheme, the HSUPA scheduling method estimates the resource requested by the UE to be scheduled and the interference generated when the UE is scheduled, then determines the UE which can be scheduled according to the estimated resource requested by the UE and the interference generated when the UE is scheduled according to the estimated resource requested by the UE and the priority of the determined sending sequence from high to low in the corresponding threshold, and finally authorizes the corresponding resource for the UE which can be scheduled according to the estimated resource requested by the UE. The invention estimates the resource requested by the UE to be scheduled and the interference generated when the UE is scheduled before the resource authorization, thereby being capable of scheduling in the corresponding threshold range, more reasonably allocating the time slot code channel physical resource and effectively controlling the interference in the cell and the interference to the adjacent cell to be in the higher range of the corresponding threshold.

Drawings

Fig. 1 is a schematic flow chart of an HSUPA scheduling method according to the present invention;

fig. 2 is a schematic diagram of a scheduling preprocessing process in the HSUPA scheduling method of the present invention;

fig. 3 is a schematic diagram of a scheduling process in the HSUPA scheduling method of the present invention;

fig. 4 is a schematic diagram of a scheduling post-processing procedure in the HSUPA scheduling method of the present invention.

Detailed Description

In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and examples.

The main idea of the invention is to estimate the resource requested by the UE to be scheduled and the interference generated when the UE is scheduled, then to determine the UE which can be scheduled according to the estimated resource requested by the UE and the interference generated when the UE is scheduled, from high to low in the corresponding threshold according to the determined priority of the sending sequence, and finally to authorize the corresponding resource to the UE which can be scheduled according to the estimated resource requested by the UE. The invention estimates the resource requested by the UE to be scheduled and the interference generated when the UE is scheduled before the resource authorization, thereby being capable of scheduling in the corresponding threshold, more reasonably allocating the time slot code channel physical resource and effectively controlling the interference in the cell and the interference to the adjacent cell to be in the higher range of the corresponding threshold.

Fig. 1 is a flow chart illustrating an HSUPA scheduling method according to the present invention. Referring to fig. 1, the method includes:

step 101: estimating the request rate of each UE to be scheduled, the required time slot code channel physical resource, and the intra-cell interference increment and the interference increment to the adjacent cell which are generated when the UE is scheduled;

step 102: determining the priority of the sending sequence of the UE to be scheduled;

step 103: determining the UE which can be scheduled according to the estimated time slot code channel physical resources required by each UE to be scheduled, the interference increment in the cell and the interference increment to the adjacent cell which are generated when the UE is scheduled, and the sequence of the priority of the sending sequence from high to low in the preset cell total load threshold, the adjacent cell interference threshold and the resource pool threshold;

step 104: and according to the estimated request rate of each UE to be scheduled and the required physical resource of the time slot code channel, corresponding power and physical resource of the time slot code channel are authorized for the UE which can be scheduled.

This concludes the HSUPA scheduling method of the present invention.

The method shown in fig. 1 may be executed by a Node B, and specifically: step 101 may be performed by the Node B in a first scheduling time interval (TTI) of a scheduling period of each UE to be scheduled; steps 102 to 104 may be performed by the Node B in every TTI.

Before executing step 101 shown in fig. 1, the Node B may receive and store scheduling information reported by the UE to be scheduled; at this time, the estimating of step 101 includes: and estimating according to the scheduling information stored in the Node B.

In practical applications, the transmission order priority of the UE to be scheduled in step 102 may be determined in various manners, for example:

1) a simpler polling (RR) algorithm can be adopted, UEs to be scheduled in the RR algorithm are scheduled one by one, and the time for each UE to be scheduled to obtain scheduling is equal;

2) or, a maximum carrier-to-interference ratio (MAX C/I) scheduling algorithm may be adopted, the MAX C/I scheduling algorithm needs to estimate the uplink channel quality of the current TTI in advance (which may be estimated in step 101), and then MAX C/I scheduling is performed according to the estimated uplink channel quality of the current TTI, so as to determine the priority of the transmission sequence of the UE to be scheduled;

3) a Proportional Fair (PF) scheduling algorithm that considers user fairness and cell throughput may also be employed, the PF scheduling algorithm needs to estimate in advance the average transmission rate of each UE to be scheduled, the uplink channel quality of the current TTI, and the uplink average channel quality (which may be estimated in step 101), and then PF scheduling is performed according to the estimated request rate, average transmission rate, uplink channel quality of the current TTI, and uplink average channel quality of each UE to be scheduled, thereby determining the priority of the transmission order of the UEs to be scheduled. In the PF scheduling algorithm, the average transmission rate of the UE may be replaced by the average throughput of the UE.

When determining the UEs that can be scheduled in step 103 shown in fig. 1 is implemented, the following manner may be adopted:

firstly, the UE with the highest priority in the priority of the sending sequence is taken as the current UE to be scheduled;

then, adding the intra-cell interference increment of the current UE to be scheduled to the current total load of the cell, adding the interference increment of the current UE to be scheduled to the neighboring cell to the current total interference to the neighboring cell, adding the physical resource of the time slot code channel required by the current UE to be scheduled to the current total allocation amount of the physical resource of the time slot code channel, and carrying out the following judgment: if the current total load of the cell does not exceed the cell total load threshold, the current total interference to the adjacent cell does not exceed the adjacent cell interference threshold, and the current total allocation amount of the time slot code channel physical resources does not exceed the resource pool threshold, determining the current UE to be scheduled as the UE which can be scheduled; otherwise, the operation is ended.

When all the thresholds are not exceeded, the operation is executed once, one UE which can be scheduled can be determined, corresponding power and time slot code channel physical resources are required to be authorized for the UE which can be scheduled next, and whether the UE to be scheduled next in the priority of the sending sequence is the UE which can be scheduled or not is continuously judged. In practical application, a UE that can be scheduled can be determined, corresponding authorization is performed on the UE, then the UE next to the UE to be scheduled currently in the priority of the transmission sequence is used as the UE to be scheduled currently, and the operation of "determining the UE that can be scheduled" is continuously performed; or all UEs that can be scheduled may be determined first, and then corresponding grants may be performed for all UEs that can be scheduled.

Embodiments of the steps of the present invention will be described in more detail below with reference to the accompanying drawings.

Since the operation of receiving and storing the scheduling information reported by the UE to be scheduled before step 101 and step 101 is actually preprocessing before scheduling, in the following description of the present invention, the above operation is simply referred to as a scheduling preprocessing process; since step 102 and step 103 are both operations related to determining which UEs are scheduled in what order, step 102 and step 103 will be collectively referred to as a scheduling process in the following description of the present invention; step 104 is to perform corresponding authorization operation on the UE that can be scheduled, and in the following description of the present invention, step 104 is referred to as a post-scheduling processing procedure.

Fig. 2 is a schematic diagram of a scheduling preprocessing process in the HSUPA scheduling method of the present invention. Referring to fig. 2, the scheduling pre-processing procedure includes:

step 201: and updating the scheduling information of the UE.

The scheduling information is usually reported based on timer trigger, and if an HSUPA scheduler in the Node B receives a scheduling information request (SI) reported by the UE, the scheduling information of the UE temporarily stored at the Node B side is updated. In relation to the present invention, the scheduling information of the UE may include: total buffer status (TEBS), UE Power Headroom (UPH), serving cell neighbor path loss (SNPL), etc.

Step 202: the request rate of the UE is estimated.

The request rate of the UE estimated in this step can be used to be equivalent to the corresponding power, and the Node B performs corresponding power authorization on the UE in the process of scheduling post-processing. In addition, when the transmission sequence priority of the UE to be scheduled needs to be determined by adopting the PF scheduling algorithm, the request rate of the UE estimated in this step may be used for the PF scheduling algorithm.

Hereinafter, the requested rate of the UE in the nth TTI is denoted as R_req(n)，R_reqAnd (n) can be estimated according to the formula (1) based on the TEBS and UPH reported by the UE:

R_req(n)＝min(R_max(UPH(n))，argmax{R|TEBS(n)≥R·Tsp}) (1)

(1) in the formula, R_max(UPH (n)) is the maximum allowed transmission rate of the UE in the nth TTI based on the power headroom UPH (n) of the UE in the nth TTI;

argmax { R | TEBS (n) ≧ R · Tsp } is the UE maximum requested rate R estimated based on the UE's total buffer condition TEBS (n) in the nth TTI and the scheduling period Tsp, and argmax { R | TEBS (n) ≧ R · Tsp } is calculated as: the maximum R for which the inequality in the parentheses holds.

Step 203: the average transmission rate and average throughput of the UE are estimated.

When the priority of the sending sequence of the UE to be scheduled needs to be determined by adopting a PF scheduling algorithm, the average sending rate and the average throughput of the UE estimated in the step can be used for the PF scheduling algorithm.

For each TTI, the HSUPA scheduler in the Node B may calculate the average transmission rate and average throughput for each UE based on equations (2) and (3), respectively:

<math> <mrow> <mover> <mrow> <msubsup> <mi>R</mi> <mi>i</mi> <mi>t</mi> </msubsup> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> </mrow> <mo>&OverBar;</mo> </mover> <mo>=</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>-</mo> <mfrac> <mn>1</mn> <msub> <mi>T</mi> <mn>1</mn> </msub> </mfrac> <mo>)</mo> </mrow> <mover> <mrow> <msubsup> <mi>R</mi> <mi>i</mi> <mi>t</mi> </msubsup> <mrow> <mo>(</mo> <mi>n</mi> <mo>-</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow> <mo>&OverBar;</mo> </mover> <mo>+</mo> <mfrac> <mn>1</mn> <msub> <mi>T</mi> <mn>1</mn> </msub> </mfrac> <msubsup> <mi>R</mi> <mi>i</mi> <mi>t</mi> </msubsup> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>2</mn> <mo>)</mo> </mrow> </mrow></math>

<math> <mrow> <mover> <mrow> <msub> <mi>R</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> </mrow> <mo>&OverBar;</mo> </mover> <mo>=</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>-</mo> <mfrac> <mn>1</mn> <msub> <mi>T</mi> <mn>2</mn> </msub> </mfrac> <mo>)</mo> </mrow> <mover> <mrow> <msub> <mi>R</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>n</mi> <mo>-</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow> <mo>&OverBar;</mo> </mover> <mo>+</mo> <mfrac> <mn>1</mn> <msub> <mi>T</mi> <mn>2</mn> </msub> </mfrac> <msub> <mi>R</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>3</mn> <mo>)</mo> </mrow> </mrow></math>

wherein i represents the number of the UE;

and

respectively representing the average sending rate and the average throughput of the UE of the nth TTI;

and R_i(n) respectively indicate the transmission rate and throughput of the nth TTI,can be obtained based on the ratio of the transport block size received in the nth TTI to the TTI, R_i(n) may be derived based on a ratio of a transport block size successfully received for the nth TTI to the TTI;

T₁and T₂Respectively, are preset filtering factors.

Step 204: an uplink average channel quality (UCQI) of the UE is estimated.

When the sending sequence priority of the UE to be scheduled needs to be determined by adopting the MAX C/I scheduling algorithm, the UCQI of the UE estimated in the step can be used for the MAX C/I scheduling algorithm. Specifically, the SNPL reported by the UE may be used as the UE uplink instantaneous channel quality UCQI, and for each TTI, the uplink average channel quality of the UECan be obtained based on formula (4):

<math> <mrow> <mover> <mrow> <msub> <mi>UCQI</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> </mrow> <mo>&OverBar;</mo> </mover> <mo>=</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>-</mo> <mfrac> <mn>1</mn> <msub> <mi>T</mi> <mn>3</mn> </msub> </mfrac> <mo>)</mo> </mrow> <mover> <mrow> <msub> <mi>UCQI</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>n</mi> <mo>-</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow> <mo>&OverBar;</mo> </mover> <mo>+</mo> <mfrac> <mn>1</mn> <msub> <mi>T</mi> <mn>3</mn> </msub> </mfrac> <msub> <mi>UCQI</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>4</mn> <mo>)</mo> </mrow> </mrow></math>

(4) in the formula, UCQI_i(n) SNPL in the latest received SI stored in Node B;

T₃is a preset filtering factor.

Step 205: an intra-cell interference delta that the UE would produce when scheduled is estimated.

In this step, the intra-cell interference increment that the UE will generate is estimated under the assumption that the UE is scheduled. Specifically, the intra-cell interference increment to be generated by the UE can be estimated by means of equivalent load increment estimation.

Suppose that the ith UE gets scheduled, its load increment

The calculation can be performed according to equation (5):

$\mathrm{Cell}\_{\mathrm{load}}_i^{\mathrm{hyp}}=(1-\mathrm{JD})*L_i=(1-\mathrm{JD})*\frac{{\mathrm{CIR}}_i}{1+(1-\mathrm{JD})*{\mathrm{CIR}}_i}---\left(5\right)$

JD is an uplink joint inspection factor;

CIR_iis the received carrier-to-interference ratio of the ith UE, and ${\mathrm{CIR}}_i={\mathrm{CIR}}_{\mathrm{base}}*{10}^{\frac{{\mathrm{AG}}_i}{10}}*\frac{16}{{\mathrm{SF}}_i},$ wherein:

CIR_basefor the UE-side closed loop power component P_e-baseA corresponding CIR;

SF_iauthorizing a Spreading Factor (SF) corresponding to the allocated channelization code for the power of the ith user;

AG_ipower grant for ith user may be based on UE request rate R_req(n) and assumed code rate λ_eCalculating to obtain a power gain factor beta_0eThus obtaining the product.

Step 206: an inter-cell interference increment that the UE will generate when scheduled is estimated.

In this step, the inter-cell interference increment to be generated by the UE is estimated, assuming that the UE is scheduled.

Suppose that the ith UE gets scheduled, its interference increment to the non-serving neighbor I_inter ⁱThe estimation can be performed according to equation (6):

<math> <mrow> <msup> <msub> <mi>I</mi> <mi>int er</mi> </msub> <mi>i</mi> </msup> <mo>=</mo> <mfrac> <mn>1</mn> <msub> <mi>SNPL</mi> <mi>i</mi> </msub> </mfrac> <mo>*</mo> <msup> <mn>10</mn> <mrow> <msub> <mi>P</mi> <mrow> <mi>e</mi> <mo>-</mo> <mi>base</mi> </mrow> </msub> <mo>&prime;</mo> <mfrac> <msub> <mi>AG</mi> <mi>i</mi> </msub> <mn>10</mn> </mfrac> </mrow> </msup> <mo>*</mo> <mfrac> <mn>16</mn> <msub> <mi>SF</mi> <mi>i</mi> </msub> </mfrac> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>6</mn> <mo>)</mo> </mrow> </mrow></math>

wherein, SNPL_iReporting the latest SNPL for the i UE;

P_e-base' is the closed loop power component of the UE side estimated by the Node B;

SF_iand AG_iConsistent with the description in step 205.

Step 207: and estimating the time slot code channel physical resource needed by the UE.

In this step, firstly, the coding rate λ corresponding to the assumed grant can be determined based on the AMC principle_eAnd a modulation strategy; specifically, the appropriate λ may be determined based on the size of the SNPL index value reported by the UE_eWith greater SNPL requiring a greater lambda_eAnd 16QAM, with smaller SNPL requiring smaller λ_eAnd QPSK;

then, the maximum allowed E-TFC of the UE corresponding to the assumed authorization is determined, so as to be based on <math> <mrow> <msub> <mi>&lambda;</mi> <mi>e</mi> </msub> <mo>=</mo> <mfrac> <msub> <mi>S</mi> <mi>e</mi> </msub> <msub> <mi>R</mi> <mi>e</mi> </msub> </mfrac> </mrow></math> Determination of R_eIn which S is_eFor the transport block size, R, of the selected E-TFC_eAnd the bit number of the physical channel output from the physical channel mapping module in the E-DCH channel coding multiplexing process. According to R_eAnd determining the physical resource of the time slot code channel required by the assumed authorization according to the determined modulation strategy and the principle that each UE only has one E-DCH physical uplink channel (E-PUCH) in each time slot.

The scheduling preprocessing process in the HSUPA scheduling method of the present invention is ended.

Fig. 3 is a schematic diagram of a scheduling process in the HSUPA scheduling method of the present invention. Referring to fig. 3, the scheduling process includes:

step 301: and determining the priority of the sending sequence of the UE to be scheduled.

As described above, the transmission sequence priority of the UE to be scheduled may be determined by using the existing RR scheduling algorithm, MAC C/I scheduling algorithm, PF scheduling algorithm, and the like. Specifically, the method comprises the following steps:

1) for the RR scheduling algorithm, the UE is scheduled one by one, and the scheduling time of each UE to be scheduled is equal;

2) for the MAC C/I scheduling algorithm, the priority of the UE with the number I in the nth TTI can be calculated according to the formula (7)

(n)：

<math> <mrow> <msubsup> <mi>P</mi> <mi>i</mi> <mrow> <mi>MAX C</mi> <mo>/</mo> <mi>I</mi> </mrow> </msubsup> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mo>=</mo> <msub> <mi>UCQI</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mo>,</mo> <mi>i</mi> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>,</mo> <mi>K</mi> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>7</mn> <mo>)</mo> </mrow> </mrow></math>

Wherein,(n) the larger the corresponding priority;

3) for the PF scheduling algorithm, the priority of the UE numbered i in the nth TTI can be calculated according to the formula (8)

(n)：

<math> <mrow> <msubsup> <mi>P</mi> <mi>i</mi> <mi>MPF</mi> </msubsup> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> <mo>=</mo> <msup> <mrow> <mo>(</mo> <mfrac> <mrow> <msub> <mi>R</mi> <mi>req</mi> </msub> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> </mrow> <mrow> <msubsup> <mi>R</mi> <mi>i</mi> <mi>t</mi> </msubsup> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> </mrow> </mfrac> <mo>)</mo> </mrow> <mi>&alpha;</mi> </msup> <mo>&CenterDot;</mo> <msup> <mrow> <mo>(</mo> <mfrac> <mrow> <msub> <mi>UCQI</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> </mrow> <mrow> <msub> <mi>UCQI</mi> <mi>i</mi> </msub> <mrow> <mo>(</mo> <mi>n</mi> <mo>)</mo> </mrow> </mrow> </mfrac> <mo>)</mo> </mrow> <mi>&beta;</mi> </msup> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>8</mn> <mo>)</mo> </mrow> </mrow></math>

R_req(n) is the UE request rate calculated according to the formula (1);

the average transmission rate of the UE calculated according to equation (2) may be expressed in equation (8)

Replacing the average throughput of the UE calculated by the formula (3)

；

UCQI_i(n) and

the uplink channel quality and the uplink average channel quality of the nth TTI in the formula (4) respectively;

alpha and beta are respectively preset weight adjustment factors.

Step 302: and taking the UE with the highest priority in the priority of the sending sequence as the current UE to be scheduled.

Step 303: and accumulating the intra-cell interference increment of the current UE to be scheduled to the current total load of the cell, judging whether the current total load of the cell exceeds the total load threshold of the cell, if not, continuing to execute the step 304, otherwise, ending the processing flow.

Suppose that the uplink interference threshold of the cell is I_total ^targetThe rise-over-noise (RoT) threshold of the local cell can be derived from the equation (9)

Further converting to obtain the total load threshold of the cell

：

$\mathrm{Cell}\_{\mathrm{load}}_j^{t\arg \mathrm{et}}=1-\frac{1}{{\mathrm{RoT}}_j^{t\arg \mathrm{et}}}=1-\frac{P_N}{{I_{\mathrm{total}}}^{t\arg \mathrm{et}}}---\left(9\right)$

Wherein subscript j represents a cell number;

P_Nthe uplink received noise floor can be configured by a Radio Network Controller (RNC) or self-determined by a Node B.

Similarly, if the uplink interference threshold I of the cell in the formula (9) is set_total ^targetCurrent uplink interference I replaced by cell_total ^currentThe current total load of the cell can be estimated based on equation (9)

. Wherein, I_total ^currentAnd the RTWP and the ISCP are respectively the uplink received wideband total power and the interference signal code power measured by the Node B.

Assuming that the number of the current UE to be scheduled is i, in this step, the load increment of the ith UE estimated in step 205 may be obtained

Adding up to the current total load of the cell

And make a judgment on

Whether or not to exceed the total load threshold of the cell

If not, the process continues to step 304, otherwise, the process is terminated.

Step 304: and accumulating the interference increment of the current UE to be scheduled to the adjacent cell to the current total interference to the adjacent cell, judging whether the current total interference to the adjacent cell exceeds an adjacent cell interference threshold, if not, continuing to execute the step 305, otherwise, ending the processing flow.

Assuming that the number of the current UE to be scheduled is i, the interference increment of the current UE to be scheduled to the neighboring cell in this step is the inter-cell interference increment of the ith UE estimated in step 206。

Step 305: and accumulating the physical resources of the time slot code channels required by the current UE to be scheduled to the current total allocation amount of the physical resources of the time slot code channels, judging whether the current total allocation amount of the physical resources of the time slot code channels exceeds a resource pool threshold, if not, continuing to execute the step 306, otherwise, ending the processing flow.

The physical resource of the timeslot code channel needed by the UE to be currently scheduled in this step is the physical resource of the timeslot code channel estimated in step 207.

Step 306: and determining the current UE to be scheduled as a UE that can be scheduled, and taking the UE next to the current UE to be scheduled in the priority of the transmission sequence as the current UE to be scheduled, and returning to step 303.

The scheduling process in the HSUPA scheduling method of the present invention is ended.

The order of the three determination operations of steps 303, 304 and 305 shown in fig. 3 can be changed arbitrarily, and as long as any one threshold is exceeded, it indicates that no more UEs can be scheduled in the TTI, and at this time, the process flow needs to be ended.

According to the processing flow shown in fig. 3, after all the UEs that can be scheduled in the TTI are determined, corresponding authorization is performed on the UEs that can be scheduled, as described above, in practical applications, authorization may be performed every time a UE that can be scheduled is determined.

After determining the UE that can be scheduled, the post-scheduling process can be performed according to the post-scheduling process schematic diagram in the HSUPA scheduling method of the present invention shown in fig. 4. Referring to fig. 4, the scheduling pre-processing procedure includes:

step 401: a power grant is allocated for a UE that may be scheduled.

In this step, the UE request rate estimated in step 202 may be equivalent to a corresponding power, and then, a corresponding power grant is allocated to the UE.

Step 402: and allocating the time slot code channel physical resource authorization to the UE which can be scheduled.

In this step, corresponding time slot code channel physical resource grant may be allocated to the UE that can be scheduled according to the time slot code channel physical resource estimated to be needed by the UE in step 207.

Step 403: and sending the authorization allocated to the UE which can be scheduled to the UE.

In this step, the grant allocated to the UE that can be scheduled can be sent to the UE through an E-DCH absolute grant channel (E-AGCH).

And ending the scheduling post-processing process in the HSUPA scheduling method.

It can be seen from the foregoing embodiments that, in the HSUPA scheduling method provided by the present invention, the resource requested by the UE to be scheduled and the interference that will be generated when the UE is scheduled are estimated, then the UE that can be scheduled is determined according to the estimated resource requested by the UE and the interference that will be generated when the UE is scheduled, from high to low in the priority of the determined transmission sequence within the corresponding threshold, and finally the corresponding resource is granted to the UE that can be scheduled according to the estimated resource requested by the UE. The invention estimates the resource requested by the UE to be scheduled and the interference generated when the UE is scheduled before the resource authorization, thereby being capable of scheduling in the corresponding threshold range, more reasonably allocating the time slot code channel physical resource and effectively controlling the interference in the cell and the interference to the adjacent cell to be in the higher range of the corresponding threshold.

The above description is only for the preferred embodiment of the present invention, and is not intended to limit the scope of the present invention. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims (9)

1. A scheduling method for a high speed uplink packet access system is characterized in that the method comprises the following steps:

A. estimating the request rate of each user terminal UE to be scheduled, the required time slot code channel physical resource, and the interference increment in a cell and the interference increment to an adjacent cell, which are generated when the UE is scheduled;

B. determining the priority of the sending sequence of the UE to be scheduled;

C. determining the UE which can be scheduled according to the estimated time slot code channel physical resources required by each UE to be scheduled, the interference increment in the cell and the interference increment to the adjacent cell which are generated when the UE is scheduled, and the sequence of the priority of the sending sequence from high to low in the preset cell total load threshold, the adjacent cell interference threshold and the resource pool threshold;

D. and according to the estimated request rate of each UE to be scheduled and the required physical resource of the time slot code channel, corresponding power and physical resource of the time slot code channel are authorized for the UE which can be scheduled.

2. The method of claim 1, wherein step a is preceded by the further step of: receiving and storing scheduling information reported by UE to be scheduled;

step a the estimating comprises: and estimating according to the stored scheduling information.

3. The method according to claim 2, wherein said step a is performed by the base station Node B in the first scheduling time interval TTI of the scheduling period of each UE to be scheduled;

and the step B, the step C and the step D are executed by the Node B in each TTI.

4. The method of claim 3, wherein step A of estimating an increase in intra-cell interference that the UE will generate when scheduled comprises:

and estimating by adopting a load increment equivalent estimation mode.

5. The method of claim 4, wherein step C comprises:

c1, taking the UE with the highest priority in the priority of the sending sequence as the current UE to be scheduled;

c2, adding the interference increment of the current UE to be scheduled to the current total load of the cell, adding the interference increment of the current UE to be scheduled to the adjacent cell to the current total interference to the adjacent cell, adding the physical resource of the time slot code channel required by the current UE to be scheduled to the current total allocation amount of the physical resource of the time slot code channel, if the current total load of the cell does not exceed the cell total load threshold, the current total interference to the adjacent cell does not exceed the adjacent cell interference threshold, and the current total allocation amount of the physical resource of the time slot code channel does not exceed the resource pool threshold, determining the current UE to be scheduled as the UE which can be scheduled, taking the next UE of the current UE to be scheduled in the sending sequence priority as the current UE to be scheduled, returning to the step C2, otherwise, continuing to execute the step D.

6. The method of claim 4, wherein step C comprises:

c3, taking the UE with the highest priority in the priority of the sending sequence as the current UE to be scheduled;

c4, adding the intra-cell interference increment of the current UE to be scheduled to the current total load of the cell, adding the interference increment of the current UE to be scheduled to the adjacent cell to the current total interference to the adjacent cell, adding the physical resource of the time slot code channel required by the current UE to be scheduled to the current total allocation amount of the physical resource of the time slot code channel, if the current total load of the cell does not exceed the cell total load threshold, the current total interference to the adjacent cell does not exceed the adjacent cell interference threshold, and the current total allocation amount of the physical resource of the time slot code channel does not exceed the resource pool threshold, determining the current UE to be scheduled as the UE which can be scheduled, continuing to execute the step D, otherwise, ending the process of the method;

after the step D, further comprising: and taking the UE next to the UE to be scheduled currently in the sending sequence priority as the UE to be scheduled currently, and returning to the step C3.

7. The method according to any one of claims 1 to 6, wherein said step B comprises: and determining the priority of the sending sequence of the UE to be scheduled by adopting a polling RR scheduling algorithm.

8. The method of any one of claims 1 to 6, wherein step A further comprises: estimating the uplink channel quality of the current TTI;

the step B comprises the following steps: and determining the priority of the sending sequence of the UE to be scheduled by adopting a maximum carrier-to-interference ratio MAX C/I scheduling algorithm according to the estimated uplink channel quality of the current TTI.

9. The method of any one of claims 1 to 6, wherein step A further comprises: estimating the average sending rate of each UE to be scheduled, the uplink channel quality and the uplink average channel quality of the current TTI, or estimating the average throughput of each UE to be scheduled, the uplink channel quality and the uplink average channel quality of the current TTI;

the step B comprises the following steps: and determining the priority of the sending sequence of the UE to be scheduled by adopting a Proportional Fair (PF) scheduling algorithm according to the estimated request rate and average sending rate of each UE to be scheduled, the uplink channel quality and the uplink average channel quality of the current TTI, or according to the estimated request rate and average throughput of each UE to be scheduled, the uplink channel quality and the uplink average channel quality of the current TTI.

Images