CN102215588B - HSUPA (High Speed Uplink Packet Access) scheduler and scheduling method by adopting MU MIMO (Multiple User Multiple Input Multiple Output) technology - Google Patents

Abstract

The invention provides an HSUPA (High Speed Uplink Packet Access) scheduler and a scheduling method by adopting MU MIMO (Multiple User Multiple Input Multiple Output) technology, aiming to realize the scheduling of UE so as to share the resource except the resource occupied by the uplink channels scheduling E-PUCH (Enhanced Physical Uplink Channel) resource in MU MIMO mode or the uplink idle resource. The scheduling of the uplink channels out of the E-PUCH includes but not limited to: UL-DPCH (Uplink Dedicated Physical Channel), unscheduled E-PUCH, SPSE-PUCH, HS-SICH (High Speed Shared Information Channel), PRACH (Physical Random Access Channel) and E-RUCCH (E-DCH (Enhanced Dedicated Channel) Random-Access Uplink Control Channel). If the uplink channel types in the later TD-SCDMA (Time Division-Synchronous Code Division Multiple Access) system increase, the invention can be extended to apply to the increased uplink channels, namely the scheme can realize the scheduling of UE to multiplex uplink resources constituted by all uplink time slots in MU MIMO mode, so the uplink throughputs and the uplink peak rate of the HSUPA can be improved. The invention also provides a midamble shift in a default configuration mode to distribute the midamble shift for the HSUPA UEs which multiplex the same resource.

Description

Adopt HSUPA scheduler and the dispatching method of MU MIMO technology

Technical field

The present invention relates to the mobile communication technology field, particularly high speed uplink bag (HSUPA) access technology, relate in particular to a kind of HSUPA scheduler and dispatching method that adopts multi-user's multiple-input and multiple-output (MU MIMO) technology.

Background technology

At present, introduced multi-user (MU) multiple-input and multiple-output (MIMO) technology in high speed uplink bag access (HSUPA).That is: at up direction, a plurality of HSUPA subscriber equipmenies (UE) can be shared identical scheduling enhanced dedicated channel physical uplink channel (E-PUCH) resource.These UE that share identical scheduling E-PUCH resource have different training sequence deviation (Midamble Shift), and described training sequence deviation is as the foundation of the wireless channel of distinguishing these UE.The configuration mode of the default training sequence deviation based on special, distribute different training sequence deviation to these UE.Concrete grammar is as follows:

K in the HSUPA Zhong，Jiang community that adopts MU MIMO technology _mindividual training sequence deviation is divided into the M group, in order to support M HSUPA UE, in MU MIMO mode, shares identical scheduling E-PUCH resource.The group number of M group training sequence deviation is respectively 0,1 ..., M-1.Work as K _m=2 o'clock, M=2; Work as K _m∈ during 4,6,8,10,12,14,16}, M=2 or 4.K _mwith the value combination of M, have: 1+7 * 2=15 kind.

For every kind of K _mvalue combination with M, in M group training sequence deviation, m ∈ { 0,1, ..., each training sequence deviation that M-1} group training sequence deviation comprises and the mapping relations between Orthogonal Variable Spreading Factor OVSF (OVSF) channel code are defined with special default training sequence deviation configuration mode in the 3GPP agreement.In the 3GPP agreement, this mode is meaned with the form of chart.

Work as K _uEwhen≤M HSUPA UE shares identical scheduling E-PUCH resource, need to distribute different training sequence deviation to each UE.For K _uE" k " individual UE in individual UE, can organize in training sequence deviation and select m at M _kthe group training sequence deviation.Then according to shared OVSF channel code and the m of E-PUCH resource that distributes to this UE _keach training sequence deviation comprised in the group training sequence deviation and the mapping relations between the OVSF channel code, determine the training sequence deviation of distributing to this UE.K in addition _uE-1 UE can not select m again _kthe group training sequence deviation.Here, m _kone may value be: m _k=k-1.The NODEB(base station) determining the scheduling E-PUCH resource of distributing to " k " individual UE and the group number m that distributes to the training sequence deviation place of this UE _kafter, just will distribute to information and the group number m of the scheduling E-PUCH resource of this UE _kby scheduling, E-AGCH(strengthens the dedicated channel absolute grant channel) send to " k " individual UE.This UE monitors scheduling E-AGCH, and can determine according to the information of the E-PUCH resource of carrying on scheduling E-AGCH the shared OVSF channel code of scheduling E-PUCH of distributing to it.This UE is according to the group number m carried on this OVSF channel code and scheduling E-AGCH _klook into m _kmapping relations in group between training sequence deviation and OVSF channel code, can determine the training sequence deviation of distributing to it.The training sequence deviation of UE by distributing to it and E-PUCH resource send E-DCH(and strengthen dedicated channel) data block is to NODEB.NODEB after receiving the E-DCH data block that UE sends, if NODEB to this data block correct decoding, NODEB just generates ACK(and confirms) information; Otherwise NODEB just generates the non-confirmation of NACK() information.NODEB determines that according to distributing to the E-PUCH resource information of UE and group number m E-HICH(strengthens the dedicated channel hybrid automatic repeat request indication channel) on a signature sequence.When NODEB generates ACK information, NODEB just feeds back to UE by the antitone sequence of this signature sequence by E-HICH; When NODEB generates nack message, NODEB just feeds back to UE by the former sequence of this signature sequence by E-HICH.When UE detects the antitone sequence that sequence that NODEB feeds back by E-HICH is corresponding sequence/former sequence, just determine that the NODEB feedack is ACK/NACK information.When UE receives ACK information, UE will no longer retransmit this E-DCH data block.When UE receives nack message, if this E-DCH data block does not reach maximum number of retransmissions, UE will retransmit this data block; Otherwise UE will no longer retransmit this data block.

Flow process based on MU MIMO technology scheduling E-PUCH resource in prior art as shown in Figure 1, comprises the steps:

Step 101: base station (NODEB), after determining the group number m at the scheduling E-PUCH resource of distributing to UE and the training sequence deviation place of distributing to UE, information and the group number m that just will distribute to the scheduling E-PUCH resource of UE send to UE by scheduling E-AGCH.

Step 102:UE, according to the information of the scheduling E-PUCH resource of carrying on scheduling E-AGCH, determines the shared OVSF channel code of scheduling E-PUCH of distributing to it.UE inquires about the mapping relations between the interior training sequence deviation of m group and OVSF channel code according to this OVSF channel code and group number m, determines the training sequence deviation of distributing to it.

Step 103:UE sends the E-DCH data block to NODEB by training sequence deviation and the E-PUCH resource of distributing to it.

Step 104:NODEB after the E-DCH data block received from UE, if NODEB to this data block correct decoding, NODEB just generates and confirms (ACK) information; Otherwise NODEB just generates non-confirmation (NACK) information.

Step 105:NODEB determines a signature sequence on E-HICH according to the E-PUCH resource information and the group number m that distribute to UE.When NODEB generates ACK information, NODEB just feeds back to UE by the antitone sequence of this signature sequence by E-HICH; When NODEB generates nack message, NODEB just feeds back to UE by the former sequence of this signature sequence by E-HICH.

Step 106: when UE detects the antitone sequence that sequence that NODEB feeds back by E-HICH is corresponding sequence/former sequence, just determine that the NODEB feedack is ACK/NACK information.

According to prior art, in above-mentioned HSUPA, MU MIMO technology only is applied to the scheduling E-PUCH resource.That is: a plurality of HSUPA UE can share the resource in the uplink scheduling resource pool in MU MIMO mode.Only account for a part in the ascending resource formed at all ascending time slots due to the uplink scheduling resource pool, therefore, in HSUPA, MU MIMO technology is all very limited for the raising of the raising of uplink throughput in HSUPA and up peak rate at present.

According to prior art, in the ascending resource formed at all ascending time slots, the shared resource of uplink special physical channel (UL DPCH) of distributing to each UE all can not adopt MU MIMO technology with the shared resource of non-scheduled E-PUCH of distributing to each UE.Once these ascending resources are distributed to certain UE, just can not be used for other UE.

According to prior art, in the ascending resource formed at all ascending time slots, semi-persistent scheduling (SPS) the E-PUCH resource of distributing to each UE can not adopt MU MIMO technology equally.Once NODEB distributes to certain UE using certain part ascending resource as SPS E-PUCH, this resource just can not be used for other UE.Unless NODEB discharges the SPS E-PUCH resource of UE, distributes to the SPS E-PUCH resource of UE and can be regained by NODEB.

According to prior art, in the ascending resource formed at all ascending time slots, the resource that high-speed shared information channel (HS-SICH), Physical Random Access Channel (PRACH) and the Uplink Shared Channels such as random access ascending control channel (E-RUCCH) that strengthen take can not adopt MU MIMO technology equally.

While beyond RNC configures the ascending resource pond to NODEB, having idle ascending resource (ascending resource be not used), this idle ascending resource is not applied MU MIMO technology equally.Such as: RNC is used for supporting the UL DPCH of 4 SF=8 at the channel code resources of reserved 4 SF=8 of TS1.Only configure 1 UL DPCH in current subframe (n), taken the channel code of 1 SF=8.The channel code of all the other 3 SF=8 is temporarily vacant.In this case, the channel code resources of 3 vacant SF=8 just belongs to idle ascending resource.This idle ascending resource does not adopt MU MIMO technology equally.

When time-division S-CDMA—Synchronous Code Division Multiple Access (TD-SCDMA) system adopts the Typical Disposition of 2:4, in two ascending time slots, the uplink scheduling resource pool takies an ascending time slot usually, and the resource of another ascending time slot is for being allocated as follows up channel; When the TD-SCDMA system adopts the Typical Disposition of 3:3, in three ascending time slots, the uplink scheduling resource pool takies two ascending time slots usually, and the resource of another ascending time slot is for being allocated as follows up channel:

（1） UL DPCH

(2) non-scheduled E-PUCH

（3） SPS E-PUCH

（4） HS-SICH

（5） PRACH

（6） E-RUCCH

If resource and idle ascending resource for the ascending time slot that distributes described up channel (1)～(6) can adopt MU MIMO technology, just can adopt the ascending time slot number of MU MIMO technology to expand to whole two ascending time slots (while adopting the 2:4 configuration) or whole three ascending time slots (while adopting the 3:3 configuration) by 1 time slot (while adopting the 2:4 configuration) or 2 time slots (while adopting the configuration of 3:3).One that increases adopts the ascending time slot of MU MIMO technology can effectively promote uplink throughput and up peak rate in HSUPA.Therefore, the present invention proposes: MU MIMO technological expansion is applied to other up channels except scheduling E-PUCH and idle ascending resource, makes the ascending resource that HSUPA UE can multiplexing all ascending time slots formations.

Simultaneously, prior art only is supported in HSUPA with the special default training sequence deviation method of salary distribution MU MIMO technology that adopts.But, do not adopt the special default training sequence deviation method of salary distribution can support equally the multiplexing identical scheduling E-PUCH resource of a plurality of UE.Such as, the default training sequence deviation method of salary distribution in up employing, when between the wireless channel of UE1 and UE2, correlation is very weak, by the channel code of 1 SF=1 in TS1 and first training sequence deviation of M1() distribute to UE1, by channel code in TS1 number, be 2, channel code and M5 that spreading factor is SF=2 distribute to UE2, and these two UE equally can multiplexing identical resource: the channel code of the SF=1 of UE1 comprises the channel code of the SF=2 that UE2 is used.

For the HSUPA UE that does not support the special default training sequence deviation method of salary distribution, the channel code that it can only take according to the scheduling E-PUCH of distributing to it by the configuration mode of default training sequence deviation is determined the training sequence deviation of distributing to it.It does not support the group number that will distribute to its training sequence deviation place by E-AGCH to notify to it.Therefore, prior art only the default training sequence deviation method of salary distribution based on special to UE, distribute training sequence deviation to have defect: this mode makes the E-PUCH resource that the UE that do not support the special default training sequence deviation method of salary distribution can't multiplexing other UE.So the present invention proposes: can adopt the UE distribution training sequence deviation of the default training sequence deviation method of salary distribution to multiplexing identical E-PUCH resource.Can make like this not support the E-PUCH resource of multiplexing other UE of UE of the special default training sequence deviation method of salary distribution.

Summary of the invention

The invention provides a kind of HSUPA scheduler and dispatching method of the MU of employing MIMO technology, MU MIMO technological expansion can be applied to other up channels except the scheduling E-PUCH resource and idle ascending resource, thereby improve HSUPA uplink throughput and up peak rate.Here, other up channels outside the scheduling E-PUCH resource and idle ascending resource can form a lot of channel combinations, HSUPA scheduler and the dispatching method of employing MU MIMO technology provided by the invention, can be applied to MU MIMO technological expansion the resource that all any one channels that consist of other up channels and idle ascending resource combine the various channel occupancies that comprise.

The embodiment of the present invention proposes a kind of high speed uplink bag access HSUPA dispatching method that adopts multi-user's multiple-input and multiple-output MU MIMO technology, comprises the steps:

A, in current subframe, determine the multiplexing uplink scheduling resource pool of user equipment (UE) of the subframe that is scheduled, described uplink scheduling resource pool at least comprises a kind of in other ascending resources beyond scheduling enhanced dedicated channel physical uplink channel E-PUCH resource, other ascending resources beyond described scheduling E-PUCH resource comprise: up idling-resource, uplink special physical channel UL DPCH resource, non-scheduled E-PUCH resource, semi-persistent scheduling SPS E-PUCH resource, high-speed shared information channel HS-SICH resource, the random access ascending control channel E-RUCCH resource of Physical Random Access Channel PRACH resource and enhancing,

B, determine the maximum multiplexing number of every kind of ascending resource in described uplink scheduling resource pool; If total K kind ascending resource in the uplink scheduling resource pool, wherein the maximum multiplexing number of k kind ascending resource is denoted as Q _k, k, K are natural number, and k≤K;

Select one in C, the UE that never is scheduled as current UE, from the uplink scheduling resource pool, select a part of ascending resource to distribute to current UE as the scheduling E-PUCH of UE, and multiplexing number corresponding to ascending resource be assigned with subtracted to 1;

D, judge whether the UE be not scheduled in addition, if return to step C; Otherwise, using next subframe as current subframe, return to steps A.

Preferably, set in advance the mapping table of application scenarios and predefine uplink scheduling resource pool;

Steps A comprises: determine the application scenarios of the subframe that is scheduled, according to described application scenarios, search described mapping table, obtain corresponding predefine uplink scheduling resource pool; And

Using the described predefine uplink scheduling resource pool uplink scheduling resource pool multiplexing as the UE of the subframe that is scheduled.

If the E-AGCH more than 1 is arranged on the HSUPA carrier wave, described predefined uplink scheduling resource pool by the scheduling E-PUCH resource and as follows any one ascending resource constitute:

Combination a1: idle ascending resource;

Combination a2: non-scheduled E-PUCH resource and SPS E-PUCH resource;

Combination a3: idle ascending resource, non-scheduled E-PUCH resource and SPS E-PUCH resource;

Combination a4: idle ascending resource, non-scheduled E-PUCH resource, SPS E-PUCH resource and UL DPCH resource; Perhaps

Combination a5: idle ascending resource, non-scheduled E-PUCH resource, SPS E-PUCH resource, UL DPCH resource, HS-SICH resource, PRACH resource and E-RUCCH resource.

Wherein in the described uplink scheduling resource pool of step B, the maximum multiplexing number of every kind of ascending resource can unify to be set to identical numerical value Q.

If strengthening the number of dedicated channel absolute grant channel E-AGCH on the HSUPA carrier wave is 1, the maximum multiplexing number of scheduling E-PUCH resource is 1, the multiplexing number of the other kinds resource that the uplink scheduling resource pool comprises is 2 or is greater than 2 positive integer, and the multiplexing number of up idling-resource is 1 or is greater than 1 positive integer.

If on the HSUPA carrier wave, the number of E-AGCH is a plurality of, the maximum multiplexing number of scheduling E-PUCH resource is 1, the multiplexing number of the other kinds resource that the uplink scheduling resource pool comprises is 2 or is greater than 2 positive integer, and the multiplexing number of up idling-resource is 1 or is greater than 1 positive integer.

If current subframe is the n subframe, the subframe that is scheduled is the n+d1+2 subframe; D1 means that base station carries out the time delay of HSUPA scheduling, the subframe that this time delay sends for the E-AGCH that gives the UE be scheduled in current sub-frame allocation and the timing difference between current subframe.

Preferably, step B comprises:

According to determined uplink scheduling resource pool, the multiplexing form of initialization uplink scheduling resource pool, in this form, j is listed as in the corresponding uplink scheduling resource pool of the capable element of i i node in j time slot, j is listed as the value z (j of the element that i is capable, i) mean in the uplink scheduling resource pool that in j time slot, i node can be shared in MU MIMO mode by the individual UE of z (j, i); I means node number, i=0, and 1 ..., 30; J means j time slot of uplink scheduling resource pool, j=1 ..., N; N is the shared time slot sum of uplink scheduling resource pool; t _jtimeslot number for j time slot in the uplink scheduling resource pool.

Preferably, the multiplexing form of described initialization uplink scheduling resource pool comprises:

B1, judgement uplink scheduling resource pool are at time slot t _jwhether comprise channel code c, if, execution step B2, otherwise execution step B3;

B2, determine node i corresponding to this channel code c; When if this channel code is the channel code that in UL DPCH, non-scheduled E-PUCH, SPS E-PUCH, HS-SICH, PRACH and E-RUCCH, any one up channel takies, j in above table is listed as to the maximum multiplexing number that the i row element is initialized as the respective channels resource and subtracts 1; If the channel code that this channel code is the scheduling E-PUCH resource occupation, be listed as by j in above table the maximum multiplexing number that the i row element is initialized as the scheduling E-PUCH resource; If this channel code is the channel code that idle ascending resource takies, j in above table is listed as to the maximum multiplexing number that the i row element is initialized as idle ascending resource; Then perform step B4;

B3, determine node i corresponding to this channel code c, j in form is listed as to the i row element and is initialized as 0, that is: z (j, i)=0; Determine all father nodes of node i, the corresponding j of any one father node v of node i is listed as to the v row element and is initialized as 0, that is: z (j, v)=0; Then perform step B4;

B4, determine time slot t _jinterior 16 nodes corresponding with the channel code of 16 SF=16, for any one node wherein, if the element in the corresponding form of this node is not initialised, but, the element that the father node of this node is corresponding is initialised, and just by this node, corresponding element is initialized as the element corresponding with its father node and has identical numerical value;

B5, for the element not yet be initialised in j row, it is initialized as to the minimum value of the corresponding element of all child nodes of the node that this element is corresponding.

Preferably, before described steps A, further comprise: determine the UE that current subframe can be scheduled, and determine the dispatching priority of each UE that can be scheduled;

Selecting one in the described UE never be scheduled of step C as current UE is: the UE that can be scheduled from current subframe, select UE that the priority that not yet is scheduled is the highest as current UE.

Preferably, step C is described selects a part of ascending resource to distribute to current UE to comprise from the uplink scheduling resource pool:

Select a rectangle resource that is no more than the UE ability from the uplink scheduling resource pool, the data volume of the UE of this rectangle resource bearing is greater than the data volume that in this uplink scheduling resource pool, other each rectangle resources can be carried, and this rectangle resource is distributed to described UE.

Preferably, step C is described selects a part of ascending resource to distribute to current UE to comprise from the uplink scheduling resource pool:

Using the scheduling E-PUCH resource in the uplink scheduling resource pool as the first child resource pond, using the resource except the first child resource pond in the uplink scheduling resource pool as the second child resource pond;

Determine respectively the rectangle resource that is no more than described UE ability in described the first child resource pond and the second child resource pond, the data volume of the UE that the above-mentioned rectangle resource of determining in each child resource pond can be carried is greater than the data volume that in this child resource pond, other each rectangle resources can be carried; The data volume of the rectangle resource bearing that is no more than described UE ability of determining in the rectangle resource that is no more than described UE ability of determining in more described the first child resource pond and the second child resource pond, distribute to current UE by wherein carrying a more rectangle resource of data volume; If the rectangle resource that is no more than described UE ability of determining in the first child resource pond is identical with the data volume of the rectangle resource bearing that is no more than described UE ability of determining in the second child resource pond, select at random a rectangle resource to distribute to current UE, perhaps, select to comprise that the less rectangle resource of channel code number of SF=16 distributes to current UE.

Preferably, step C is described selects before a part of ascending resource distributes to current UE, further to comprise from the uplink scheduling resource pool:

Whether arbitrary ascending resource of determining the uplink scheduling resource pool in the subframe that is scheduled has carried the 2nd UE, calculate the correlation between the wireless channel of described current UE and described the 2nd UE, judge whether described correlation is more than or equal to predefined relevance threshold, if from the uplink scheduling resource pool, remove ascending resource corresponding to described the 2nd UE.

Correlation between the wireless channel of the described current UE of described calculating and described the 2nd UE comprises:

Obtain the instantaneous value of channel estimating of up channel of p subframe the 2nd UE or the recursive average of channel estimating, the instantaneous value of the channel estimating that this value is the up-to-date up channel reported of the 2nd UE or the recursive average of channel estimating; In each subframe of the instantaneous value of channel estimating that the p subframe is the up channel that can obtain the 2nd UE or the recursive average of channel estimating before current subframe and the nearest subframe of the current subframe of distance;

Obtain the instantaneous value of the channel estimating of the up channel of current UE in the q subframe or the recursive average of channel estimating, this value is the instantaneous value of the channel estimating of the up-to-date up channel reported of current UE or the recursive average of channel estimating; In each subframe of the instantaneous value of channel estimating that the q subframe is the up channel that can obtain current UE or the recursive average of channel estimating before current subframe and the nearest subframe of the current subframe of distance;

According to instantaneous value or the recursive average of the channel estimating of described current UE and the 2nd UE, according to following formula, calculate wireless channel correlation between current UE and the 2nd UE:

$\mathrm{\ρ}=\frac{\left|\underset{k=1}{\overset{K_a}{\mathrm{\Σ}}}\underset{w=1}{\overset{W}{\mathrm{\Σ}}}{h}_{x,k,w}{h}_{y,k,w}^{*}\right|}{\left|h_x\right|\·\left|h_y\right|};$

In above formula, K _athe number that means the base station reception antenna;

the instantaneous value or the recursive average that mean the up-to-date channel estimating reported of current UE,

instantaneous value or the recursive average of the channel estimating on the k root antenna of expression current UE, W means that the window of channel estimating is long;

the instantaneous value or the recursive average that mean the up-to-date channel estimating reported of the 2nd UE,

the instantaneous value or the recursive average that mean the channel estimating of the 2nd UE on k root antenna; | h _x| and | h _y| mean respectively h _xand h _ymould.

Correlation between the wireless channel of the described current UE of described calculating and described the 2nd UE comprises:

Obtain the down beam shaping DLBF weight vector that the p subframe has the 2nd UE of at least one up channel, this DLBF weight vector is the up-to-date DLBF weight vector reported of the 2nd UE; In each subframe of DLBF weight vector that the p subframe is the up channel that can obtain the 2nd UE before current subframe and the nearest subframe of the current subframe of distance;

Obtain the DLBF weight vector that the q subframe has the current UE of at least one up channel, this DLBF weight vector is the up-to-date DLBF weight vector reported of current UE; In each subframe of DLBF weight vector that the q subframe is the up channel that can obtain current UE before current subframe and the nearest subframe of the current subframe of distance;

According to the DLBF weight vector of described current UE and the 2nd UE, calculate the wireless channel correlation between current UE and the 2nd UE:

$\mathrm{\ρ}=\frac{\left|\underset{i=1}{\overset{K_a}{\mathrm{\Σ}}}{x}_i{y}_i^{*}\right|}{\left|x\right|\·\left|y\right|};$

In above formula, K _athe number that means the base station reception antenna, | x| and | y| means respectively the mould of vector x and vector y; Vector x and vector y mean respectively the DLBF weight vector of current UE and the DLBF weight vector of the 2nd UE, x _ii the component that means vector x, y _ii the component that means vector y.

Preferably, the described multiplexing number that the ascending resource be assigned with is corresponding of step C further comprises after subtracting 1:

Distribute training sequence deviation to current UE.

Preferably, describedly to current UE, distribute training sequence deviation to comprise:

All training sequence deviation groupings in community are obtained to a plurality of training sequence deviation groups, and training sequence deviation and channel code in each training sequence deviation group have predefined mapping relations;

The channel code that definite scheduling E-PUCH of distributing to UE takies, from described a plurality of training sequence deviation groups, selecting one in the training sequence deviation corresponding with this channel code does not have occupied training sequence deviation;

Selected training sequence deviation is distributed to described UE, and described training sequence deviation is labeled as and takies.

Preferably, the mapping relations between pre-configured training sequence deviation and channel code;

Describedly to current UE, distribute training sequence deviation to comprise:

The channel code that definite scheduling E-PUCH of distributing to UE takies, search the training sequence deviation that described channel code is shone upon, and judges that whether described training sequence deviation is occupied, if, according to this UE is dispatched unsuccessfully and processed; Otherwise, described training sequence deviation is distributed to described UE, and described training sequence deviation is labeled as and takies.

Wherein saidly according to this UE being dispatched unsuccessfully process, can be: reselect less ascending resource and distribute to current UE from the uplink scheduling resource pool, and return to the described multiplexing number that the ascending resource be assigned with is corresponding and subtract 1 step; Perhaps directly return to step C.

Preferably, step C is described selects after a part of ascending resource distributes to current UE, further to comprise from the uplink scheduling resource pool:

The channel code number that the joint-detection the ability whether ascending resource that C1, judgement have distributed in the subframe that is scheduled causes the channel code of the spreading factor SF=16 that participates in joint-detection to outnumber base station can be supported, if surpass, from the uplink scheduling resource pool, reselect less ascending resource and distribute to current UE, and return described in step C multiplexing number corresponding to ascending resource be assigned with subtracted to 1 step, or directly return to step C; If do not surpass, return described in step C multiplexing number corresponding to ascending resource be assigned with subtracted to 1 step.

Preferably, step C is described selects before a part of ascending resource distributes to current UE, further to comprise from the uplink scheduling resource pool:

The channel code number of the SF=16 of the ascending resource equivalence distributed in any one time slot that C2, calculating comprise at the subframe uplink scheduling resource pool that is scheduled; Whether judgement equals at the described channel code number of this time slot the channel code number that base stations united detectability can be supported, if, to no longer dispatch any UE at this time slot, if not, calculate the number of channel code of the SF=16 of the participation joint-detection that can also support at this time slot in the subframe that is scheduled, if each time slot at the subframe uplink scheduling resource pool that is scheduled can not be dispatched UE again,, using next subframe as current subframe, return to steps A; Otherwise, describedly from the uplink scheduling resource pool, select a part of ascending resource to distribute to described in current UE a part of ascending resource of distributing to UE need to meet following condition at the channel code number of the SF=16 of each time slot equivalence: the number of channel code that is less than or equal to the SF=16 of the participation joint-detection that the time slot of the calculated subframe that is scheduled can also support; In the ascending resource of meeting above-mentioned condition to the current UE of being scheduled distribution returns to step C later, the described multiplexing number that the ascending resource be assigned with is corresponding is subtracted to 1 step.

Preferably, before described step C1, further comprise:

Judge whether described uplink scheduling resource pool exists other channels outside scheduling E-PUCH resource, idle ascending resource and predefined permission channel at each ascending time slot of the subframe that is scheduled, if, carry out described step C1, otherwise go to the described multiplexing number that the ascending resource be assigned with is corresponding, subtract 1 step.

Preferably, before described step C2, further comprise:

Judge whether described uplink scheduling resource pool exists other channels outside scheduling E-PUCH resource, idle ascending resource and predefined permission channel at each ascending time slot of the subframe that is scheduled, if after carrying out described step C2, then perform step C; Otherwise directly perform step C.

The embodiment of the present invention also proposes the high speed uplink bag access HSUPA dispatching method of the another kind of MU of employing MIMO technology, comprises the steps:

A2, in current subframe, determine the multiplexing uplink scheduling resource pool of user equipment (UE) of the subframe that is scheduled, described uplink scheduling resource pool is comprised of up idling-resource and scheduling E-PUCH resource; Definite UE that can be scheduled and the dispatching priority of described each UE that can be scheduled; E-AGCH available on carrier wave is set;

The UE that in b2, the UE that never is scheduled, selection scheduling priority is the highest is as current UE;

C2, select an available E-AGCH to distribute to current UE;

D2, from the uplink scheduling resource pool, select a part of resource to distribute to UE, as the E-PUCH of UE;

E2, from the E-HICH of UE set, select an E-HICH to distribute to UE;

F2, when being successfully, after UE distributes E-AGCH, E-PUCH and E-HICH, to be arranged to unavailable by the E-AGCH that distributes to this UE; The ascending resource that the scheduling E-PUCH of distributing this UE is taken is arranged to unavailable;

G2, judge whether to also have in available E-AGCH and uplink scheduling resource pool available resource is arranged, if, go to step b2, otherwise, using next subframe as current subframe, and go to step a2.

Further embodiment of this invention proposes a kind of HSUPA scheduler that adopts MU MIMO technology, and described scheduler comprises:

The resource pool module, for determine the multiplexing uplink scheduling resource pool of user equipment (UE) of the subframe that is scheduled in current subframe, described uplink scheduling resource pool at least comprises a kind of in other ascending resources beyond scheduling enhanced dedicated channel physical uplink channel E-PUCH resource, other ascending resources beyond described scheduling E-PUCH resource comprise: up idling-resource, uplink special physical channel UL DPCH resource, non-scheduled E-PUCH resource, semi-persistent scheduling SPS E-PUCH resource, high-speed shared information channel HS-SICH resource, the random access ascending control channel E-RUCCH resource of Physical Random Access Channel PRACH resource and enhancing,

The multiplexing number module, for determining the maximum multiplexing number of every kind of ascending resource of described uplink scheduling resource pool; If total K kind ascending resource in the uplink scheduling resource pool, wherein the maximum multiplexing number of k kind ascending resource is denoted as Q _k, k, K are natural number, and k≤K;

Resource distribution module, select one as current UE for the UE never be scheduled, from described uplink scheduling resource pool, select a part of ascending resource to distribute to current UE as the scheduling E-PUCH of UE, and multiplexing number corresponding to ascending resource be assigned with subtracted to 1.

Preferably, described resource pool module comprises:

The corresponding relation table unit, the mapping table of the application scenarios set in advance for storage and predefine uplink scheduling resource pool;

Query unit, for determining the application scenarios of the subframe that is scheduled, search described mapping table according to described application scenarios, obtains corresponding predefine uplink scheduling resource pool; And using the described predefine uplink scheduling resource pool uplink scheduling resource pool multiplexing as the UE of the subframe that is scheduled.

Preferably, the E-AGCH more than 1 is arranged on the HSUPA carrier wave, described predefined uplink scheduling resource pool by the scheduling E-PUCH resource and as follows any one ascending resource constitute:

Combination a1: idle ascending resource;

Combination a2: non-scheduled E-PUCH resource and SPS E-PUCH resource;

Combination a3: idle ascending resource, non-scheduled E-PUCH resource and SPS E-PUCH resource;

Combination a4: idle ascending resource, non-scheduled E-PUCH resource, SPS E-PUCH resource and UL DPCH resource; Perhaps

Combination a5: idle ascending resource, non-scheduled E-PUCH resource, SPS E-PUCH resource, UL DPCH resource, HS-SICH resource, PRACH resource and E-RUCCH resource.

Preferably, if current subframe is the n subframe, the subframe that is scheduled is the n+d1+2 subframe; D1 means that base station carries out the time delay of HSUPA scheduling, the subframe that this time delay sends for the E-AGCH that gives the UE be scheduled in current sub-frame allocation and the timing difference between current subframe.

Preferably, described multiplexing number module comprises:

Initialization unit, be used for according to determined uplink scheduling resource pool, the multiplexing form of initialization uplink scheduling resource pool, in this form, j is listed as in the corresponding uplink scheduling resource pool of the capable element of i i node in j time slot, j is listed as the value z (j of the element that i is capable, i) mean in the uplink scheduling resource pool that in j time slot, i node can be shared in MU MIMO mode by the individual UE of z (j, i); I means node number, i=0, and 1 ..., 30; J means j time slot of uplink scheduling resource pool, j=1 ..., N; N is the shared time slot sum of uplink scheduling resource pool; t _jtimeslot number for j time slot in the uplink scheduling resource pool.

Preferably, described initialization unit comprises:

The first judgment sub-unit, for judging that the uplink scheduling resource pool is at time slot t _jwhether comprise channel code c, if, enable the first initialization subelement, otherwise, enable the second initialization subelement;

The first initialization subelement, for determining node i corresponding to this channel code c; When if this channel code is the channel code that in ULDPCH, non-scheduled E-PUCH, SPS E-PUCH, HS-SICH, PRACH and E-RUCCH, any one up channel takies, j in above table is listed as to the maximum multiplexing number that the i row element is initialized as the respective channels resource and subtracts 1; If this channel code is the channel code that scheduling E-PUCH takies, j in above table is listed as to the maximum multiplexing number that the i row element is initialized as the scheduling E-PUCH resource; If this channel code is the channel code that up idling-resource takies, j in above table is listed as to the maximum multiplexing number that the i row element is initialized as up idling-resource; Enable the 3rd initialization subelement after being finished;

The second initialization unit, for determining node i corresponding to this channel code c, be listed as the i row element by j in form and be initialized as 0, that is: z (j, i)=0; Determine all father nodes of node i, the corresponding j of any one father node v of node i is listed as to the v row element and is initialized as 0, that is: z (j, v)=0; Enable the 3rd initialization subelement after being finished;

The 3rd initialization subelement, determine time slot t _jinterior 16 nodes corresponding with the channel code of 16 SF=16, for any one node wherein, if the element in the corresponding form of this node is not initialised, but, the element that the father node of this node is corresponding is initialised, and just by this node, corresponding element is initialized as the element corresponding with its father node and has identical numerical value; Enable the 4th initialization unit after being finished;

The 4th initialization unit, for being listed as by j the minimum value that the element not yet be initialised is initialized as the corresponding element of all child nodes of the node that this element is corresponding.

Preferably, this scheduler further comprises: priority block, and for the UE that determines that current subframe can be scheduled, and the dispatching priority of definite each UE that can be scheduled;

Selecting one in the UE that described resource distribution module never is scheduled as current UE is: resource distribution module is according to the dispatching priority of the determined UE of priority block, the UE that can be scheduled from current subframe, select UE that the priority not yet be scheduled is the highest as current UE.

Preferably, described resource distribution module comprises:

The first resource allocation units, for from the uplink scheduling resource pool, selecting a rectangle resource that is no more than the UE ability, the data volume of the UE of this rectangle resource bearing is greater than the data volume that in this uplink scheduling resource pool, other each rectangle resources can be carried, and this rectangle resource is distributed to described UE.

Preferably, described resource distribution module comprises:

The Secondary resource allocation units, for the scheduling E-PUCH resource using the uplink scheduling resource pool as the first child resource pond, using the resource except the first child resource pond in the uplink scheduling resource pool as the second child resource pond; Determine respectively the rectangle resource that is no more than described UE ability in described the first child resource pond and the second child resource pond, the data volume of the UE that the above-mentioned rectangle resource of determining in each child resource pond can be carried is greater than the data volume that in this child resource pond, other each rectangle resources can be carried; The data volume of the rectangle resource bearing that is no more than described UE ability of determining in the rectangle resource that is no more than described UE ability of determining in more described the first child resource pond and the second child resource pond, distribute to current UE by wherein carrying a more rectangle resource of data volume; If the rectangle resource that is no more than described UE ability of determining in the first child resource pond is identical with the data volume of the rectangle resource bearing that is no more than described UE ability of determining in the second child resource pond, select at random a rectangle resource to distribute to current UE, perhaps, select to comprise that the less rectangle resource of channel code number of SF=16 distributes to current UE.

Preferably, described resource distribution module further comprises:

The correlation judging unit, whether the arbitrary ascending resource that is used for the uplink scheduling resource pool of definite subframe that is scheduled has carried the 2nd UE, calculate the correlation between the wireless channel of described current UE and described the 2nd UE, judge whether described correlation is more than or equal to predefined relevance threshold, if from the uplink scheduling resource pool, remove ascending resource corresponding to described the 2nd UE.

Preferably, described correlation judging unit further comprises:

The first correlation computing unit, for the instantaneous value of channel estimating of the up channel that obtains p subframe the 2nd UE or the recursive average of channel estimating, the instantaneous value of the channel estimating that this value is the up-to-date up channel reported of the 2nd UE or the recursive average of channel estimating; In each subframe of the instantaneous value of channel estimating that the p subframe is the up channel that can obtain the 2nd UE or the recursive average of channel estimating before current subframe and the nearest subframe of the current subframe of distance; Obtain the instantaneous value of the channel estimating of the up channel of current UE in the q subframe or the recursive average of channel estimating, this value is the instantaneous value of the channel estimating of the up-to-date up channel reported of current UE or the recursive average of channel estimating; In each subframe of the instantaneous value of channel estimating that the q subframe is the up channel that can obtain current UE or the recursive average of channel estimating before current subframe and the nearest subframe of the current subframe of distance;

According to instantaneous value or the recursive average of the channel estimating of described current UE and the 2nd UE, according to following formula, calculate wireless channel correlation between current UE and the 2nd UE:

$\mathrm{\ρ}=\frac{\left|\underset{k=1}{\overset{K_a}{\mathrm{\Σ}}}\underset{w=1}{\overset{W}{\mathrm{\Σ}}}{h}_{x,k,w}{h}_{y,k,w}^{*}\right|}{\left|h_x\right|\·\left|h_y\right|};$

In above formula, K _athe number that means the base station reception antenna; the instantaneous value or the recursive average that mean the up-to-date channel estimating reported of current UE,

instantaneous value or the recursive average of the channel estimating on the k root antenna of expression current UE, W means that the window of channel estimating is long;

the instantaneous value or the recursive average that mean the up-to-date channel estimating reported of the 2nd UE, the instantaneous value or the recursive average that mean the channel estimating of the 2nd UE on k root antenna; | h _x| and | h _y| mean respectively h _xand h _ymould.

Preferably, described correlation judging unit further comprises:

The second correlation computing unit, have the down beam shaping DLBF weight vector of the 2nd UE of at least one up channel for obtaining the p subframe, this DLBF weight vector is the up-to-date DLBF weight vector reported of the 2nd UE; In each subframe of DLBF weight vector that the p subframe is the up channel that can obtain the 2nd UE before current subframe and the nearest subframe of the current subframe of distance; Obtain the DLBF weight vector that the q subframe has the current UE of at least one up channel, this DLBF weight vector is the up-to-date DLBF weight vector reported of current UE; In each subframe of DLBF weight vector that the q subframe is the up channel that can obtain current UE before current subframe and the nearest subframe of the current subframe of distance;

According to the DLBF weight vector of described current UE and the 2nd UE, calculate the wireless channel correlation between current UE and the 2nd UE:

$\mathrm{\ρ}=\frac{\left|\underset{i=1}{\overset{K_a}{\mathrm{\Σ}}}{x}_i{y}_i^{*}\right|}{\left|x\right|\·\left|y\right|};$

In above formula, K _athe number that means the base station reception antenna, | x| and | y| means respectively the mould of vector x and vector y; Vector x and vector y mean respectively the DLBF weight vector of current UE and the DLBF weight vector of the 2nd UE, x _ii the component that means vector x, y _ii the component that means vector y.

Preferably, described scheduler further comprises:

The training sequence deviation distribution module, for after described resource distribution module is to current UE allocation schedule E-PUCH, distribute training sequence deviation to current UE.

Preferably, described training sequence deviation distribution module comprises:

Grouped element, for all training sequence deviation groupings in community are obtained to a plurality of training sequence deviation groups, training sequence deviation and channel code in each training sequence deviation group have predefined mapping relations;

Idle training sequence deviation selected cell, the channel code taken for definite scheduling E-PUCH of distributing to UE, from described a plurality of training sequence deviation groups, selecting one in the training sequence deviation corresponding with this channel code does not have occupied training sequence deviation;

Allocation units, for selected training sequence deviation is distributed to described UE, and be labeled as described training sequence deviation and take.

Preferably, described training sequence deviation distribution module comprises:

The mapping relations dispensing unit, for the mapping relations between pre-configured training sequence deviation and channel code;

Search and allocation units, the channel code taken for definite scheduling E-PUCH of distributing to UE, search the training sequence deviation that described channel code is shone upon, and judges that whether described training sequence deviation is occupied, if, according to this UE is dispatched unsuccessfully and processed; Otherwise, described training sequence deviation is distributed to described UE, and described training sequence deviation is labeled as and takies.

Preferably, described resource distribution module further comprises:

The first joint-detection ability judging unit, be used at resource distribution module after a part of ascending resource of uplink scheduling resource pool selection is distributed to current UE, the channel code number that the joint-detection the ability whether ascending resource that judgement has distributed in the subframe that is scheduled causes the channel code of the spreading factor SF=16 that participates in joint-detection to outnumber base station can be supported, if surpass, resource distribution module reselects less ascending resource and distributes to current UE from the uplink scheduling resource pool, and multiplexing number corresponding to ascending resource be assigned with subtracted to 1; If do not surpass, resource distribution module subtracts 1 by multiplexing number corresponding to ascending resource be assigned with.

Preferably, described resource distribution module further comprises:

The second joint-detection ability judging unit, before at resource distribution module, from a part of ascending resource of uplink scheduling resource pool selection, distributing to current UE, calculate the channel code number of the SF=16 of the ascending resource equivalence distributed in any one time slot comprised at the subframe uplink scheduling resource pool that is scheduled, whether judgement equals at the described channel code number of this time slot the channel code number that base stations united detectability can be supported, if, to no longer dispatch any UE at this time slot, otherwise, the number of the channel code of the SF=16 of the participation joint-detection that calculating can also be supported at this time slot in the subframe that is scheduled, if each time slot at the subframe uplink scheduling resource pool that is scheduled can not be dispatched UE again, finish the scheduling to current subframe, otherwise, describedly from the uplink scheduling resource pool, select a part of ascending resource to distribute to described in current UE a part of ascending resource of distributing to UE need to meet following condition at the channel code number of the SF=16 of each time slot equivalence: the number of channel code that is less than or equal to the SF=16 of the participation joint-detection that the time slot of the calculated subframe that is scheduled can also support, after meeting the ascending resource of above-mentioned requirements to the current UE of being scheduled distribution, resource distribution module subtracts 1 by multiplexing number corresponding to the described ascending resource be assigned with.

Preferably, described resource distribution module further comprises: the first channel resource judging unit, for before the first joint-detection ability judging unit is carried out described judgement, judge described uplink scheduling resource pool, whether each ascending time slot of the subframe that is scheduled exists other channels outside scheduling E-PUCH resource, idle ascending resource and predefined permission channel, if enable the first joint-detection ability judging unit; Otherwise, do not enable the first joint-detection ability judging unit.

Preferably, described resource distribution module further comprises:

Second channel resource judgment unit, for before the second joint-detection ability judging unit is carried out described judgement, judge whether described uplink scheduling resource pool exists other channels outside scheduling E-PUCH resource, idle ascending resource and predefined permission channel at each ascending time slot of the subframe that is scheduled, if enable the second joint-detection ability judging unit; Otherwise do not enable the second joint-detection ability judging unit.

As can be seen from the above technical solutions, this scheme can realize dispatching UE with shared resource or the up idling-resource of up channel beyond the shared scheduling E-PUCH resource of MU MIMO mode.Here, the up channel beyond the scheduling E-PUCH resource includes but not limited to: UL DPCH, non-scheduled E-PUCH, SPSE-PUCH, HS-SICH, PRACH and E-RUCCH.If later the up channel type of TD-SCDMA system increases, the present invention can expanded application in the up channel increased.That is: this scheme can realize dispatching the ascending resource that UE forms with the multiplexing all ascending time slots of MU MIMO mode, effectively improves uplink throughput and the up peak rate of HSUPA.

The present invention also proposes to adopt default training sequence deviation configuration mode to distribute training sequence deviation to the HSUPA UE of multiplexing same asset.Under this method of salary distribution, do not support special default training sequence deviation configuration mode UE can with the multiplexing identical E-PUCH resource of other UE.This scheme can adopt default training sequence deviation configuration mode to distribute training sequence deviation to the HSUPA UE of multiplexing same asset.Under this method of salary distribution, do not support special default training sequence deviation configuration mode UE can with the multiplexing identical E-PUCH resource of other UE.

The accompanying drawing explanation

Fig. 1 is the flow chart based on MU MIMO scheduling E-PUCH resource in prior art;

The scheduling flow figure of the HSUPA scheduler of the employing MU MIMO technology that Fig. 2 is embodiment of the present invention proposition;

The scheduling flow figure of the HSUPA scheduler that Fig. 3 is the embodiment of the present invention one proposition to the n subframe;

Fig. 4 be shown in Fig. 3 in step 202-4 to the scheduling flow figure of a UE;

Fig. 5 is shown in Fig. 4 in step 202-4-2, determines the flow chart of the E-PUCH that distributes to UE;

Fig. 6 is to the scheduling flow of each UE in the embodiment of the present invention four;

Fig. 7 is to the scheduling flow of each UE in the embodiment of the present invention seven.

Embodiment

For further improving uplink throughput and the up peak rate of HSUPA, the inventor wishes the MUMIMO technology to be applied to the ascending resource outside the scheduling E-PUCH resource, makes HSUPA UE share the ascending resource that all ascending time slots form in the MUMIMO mode.Make a concrete analysis of as follows:

In the prior art, UL DPCH and non-scheduled E-PUCH are dedicated channels, once distribute to a UE, just by this UE, are monopolized.Yet NODEB, by channel estimating, can know the wireless channel and the wireless channel with UE of non-scheduled E-PUCH of the UE with UL DPCH.NODEB fully can be from all HSUPA UE, select the UE very weak with the wireless channel correlation of the UE with non-scheduled E-PUCH with the UE with UL DPCH, these selecteed UE can share UL DPCH and the shared ascending resource of non-scheduled E-PUCH by MU MIMO mode.

In prior art, SPS E-PUCH distributes to UE by NODEB, once NODEB distributes to UE by SPE E-PUCH, this SPS E-PUCH is just monopolized by this UE.Equally, NODEB can determine by channel estimating the wireless channel of the UE with SPE E-PUCH, NODEB can select the UE very weak with the wireless channel correlation of the UE with SPS E-PUCH equally from all HSUPA UE, and these selecteed UE can share the shared ascending resource of SPE E-PUCH in the mode of MU MIMO.

In any subframe (following use n subframe means), the HSUPA scheduler of NODEB all will carry out a HSUPA scheduling.When the HSUPA scheduler determines a UE of scheduling, will distribute E-AGCH and E-PUCH to UE.The E-AGCH that distributes to this UE will send in (n+d1) subframe, and the E-PUCH that distributes to this UE will send in (n+d1+2) subframe.Here, d1 means that NODEB carries out the time delay of HSUPA scheduling.With respect to the HSUPA scheduling of n subframe, the Uplink Shared Channels such as HS-SICH, PRACH and E-RUCCH have respectively following features:

(1), in the n subframe, the HSDPA scheduler of NODEB carries out a high-speed downstream bag access (HSDPA) scheduling.When the HSDPA scheduler determines a UE of scheduling, will distribute High-Speed Shared Control Channel (HS-SCCH) and high-speed shared information channel (HS-SICH) to UE.The HS-SCCH that distributes to this UE will send in the n+d2 subframe, and the HS-SICH that distributes to this UE will send in the n+d2+3 subframe.Here, d2 means that NODEB carries out the time delay of HSDPA scheduling, the subframe that this time delay sends for the HS-SCCH that distributes to the UE be scheduled in current subframe " n " and the timing difference between current subframe.。Generally, d2=d1.Therefore, when n subframe NODEB carries out the HSUPA scheduling, NODEB knows that the HS-SICH of n+d1+2 subframe is idle or belongs to which UE.

(2), in the n subframe, NODEB carries out the scheduling of a uplink synchronous (SYNC-UL) sequence.When NODEB determines the SYNC-UL sequence of a UE of response, will distribute FPACH and PRACH/E-RUCCH to UE.The FPACH that distributes to this UE will send in the n+d3 subframe, and the PRACH/E-RUCCH that distributes to this UE will send in the n+d3+d4 subframe.Here, d3 means that NODEB carries out the time delay of SYNC-UL sequence scheduling, and d4=2 means the timing difference between subframe that subframe that PRACH/E-RUCCH sends and FPACH send.In different scenes, the value of d3 can be different.As d3 > during d1, when n subframe NODEB carries out the HSUPA scheduling, NODEB knows that the PRACH/E-RUCCH of n+d1+2 subframe is idle or belongs to which UE.When d3=d1, if the SYNC-UL of n subframe scheduling completed before n subframe HSUPA scheduling starts, when n subframe NODEB carries out the HSUPA scheduling, the PRACH/E-RUCCH that knows equally the n+d1+2 subframe is idle or belongs to which UE.When d3<d1, when n subframe NODEB carries out the HSUPA scheduling, the PRACH/E-RUCCH that does not know the n+d1+2 subframe is idle or belongs to which UE.

In view of the above-mentioned analysis to PRACH/E-RUCCH, in the time of will realizing resource that the multiplexing PRACH/E-RUCCH of HSUPA UE takies in HSUPA scheduling as NODEB, there is following methods to adopt, but be not limited to following methods.

The value of adjusting d3 makes NODEB when the n subframe is carried out the HSUPA scheduling, and the PRACH/E-RUCCH that knows the n+d1+2 subframe is idle or belongs to which UE.

In sum, as NODEB, when the n subframe is carried out the HSUPA scheduling, know which UE HS-SICH, the PRACH of n+d1+2 subframe and E-RUCCH belong to, this UE is called a UE.So NODEB just can select the one or more UEs very weak with the wireless channel correlation of a UE to share these Uplink Shared Channels ascending resource shared in the n+d1+2 subframe in MU MIMO mode.

Based on above-mentioned analysis, the inventor thinks: HSUPA UE not only can share the scheduling E-PUCH resource in MU MIMO mode, and can share the shared ascending resource of UL DPCH, non-scheduled E-PUCH, SPS E-PUCH, HS-SICH, PRACH and E-RUCCH and idle ascending resource in MU MIMO mode.That is: HSUPA UE can the multiplexing ascending resource consisted of all ascending time slots.

Idle ascending resource is considered as to a kind of special up channel or special resource type.Other up channels and idle ascending resource can form a lot of channel combinations or resource type combination, can only the MUMIMO technological expansion be applied in wherein any one channel combination or resource type combination.Such as, MU MIMO technology can be applied in a kind of in the representative channel combination that formed by other up channels and idle ascending resource as follows or resource type combination:

(1) the first combination: only include idle ascending resource, this combination means only MU MIMO technological expansion to be applied to idle ascending resource.

(2) the second combination: only include non-scheduled E-PUCH and semi-persistent scheduling E-PUCH, this combination means only MU MIMO technological expansion to be applied to non-scheduled E-PUCH and semi-persistent scheduling E-PUCH.

(3) the third combination: only include idle ascending resource, non-scheduled E-PUCH and semi-persistent scheduling E-PUCH, this combination means only MU MIMO technological expansion to be applied to idle ascending resource, non-scheduled E-PUCH and semi-persistent scheduling E-PUCH.

(4) the 4th kinds of combinations: only include idle ascending resource, non-scheduled E-PUCH, semi-persistent scheduling E-PUCH and UL DPCH, this combination means only MU MIMO technological expansion to be applied to idle ascending resource, non-scheduled E-PUCH, semi-persistent scheduling E-PUCH and UL DPCH.

(5) the 5th kinds of combinations: comprise every other up channel and idle ascending resource, this combination means MU MIMO technological expansion is applied in the channel of non-scheduled E-PUCH of all TD-SCDMA systems such as idle ascending resource, non-scheduled E-PUCH, semi-persistent scheduling E-PUCH, UL DPCH, HS-SICH, PRACH and E-RUCCH, the ascending resource that HSUPA UE can multiplexing all ascending time slots be formed.

The embodiment of the present invention will propose a kind of HSUPA scheduler and corresponding dispatching method of the MU of support MIMO technology, and this scheduler and dispatching method can realize that HSUPA UE shares shared ascending resource and the idle ascending resource of above-mentioned all up channels in MU MIMO mode.Simultaneously, this scheduler and dispatching method can also adopt the UE distribution Midamble Shift of the default Midamble Shift method of salary distribution to multiplexing identical E-PUCH resource, for the UE that does not support the special default Midamble Shift method of salary distribution, scheduler of the present invention and dispatching method are supported the multiplexing identical E-PUCH resource of these UE.

Below, introduce the embodiment of the present invention one.

The scheduling process of the HSUPA scheduler of the employing MU MIMO technology that the embodiment of the present invention one proposes as shown in Figure 2, comprises the steps:

Step 201: determine channel combination or resource type combination that HSUPA UE is multiplexing.The ascending resource that each channel that HSUPA UE will comprise with multiplexing this channel combination of the mode of MU MIMO or resource type combination or each resource type take.

The scheduling of step 202:HSUPA scheduler start-up period.In any one subframe (n) subsequently, the HSUPA scheduler carries out a HSUPA scheduling.

In any subframe (n subframe), the scheduling flow of HSUPA scheduler as shown in Figure 3, comprises the steps:

Step 202-1: determine the UE that can be scheduled in current subframe, then determine the dispatching priority of each UE that can be scheduled.According to dispatching priority, order is from high to low queued up all UE that can be scheduled.Come the top UE of queue and there is the highest dispatching priority, come the rearmost UE of queue and there is minimum dispatching priority.

In the 3GPP agreement, stipulate: in same subframe, a HSUPA UE is merely able to have any one in non-scheduled E-PUCH, SPS E-PUCH and scheduling E-PUCH or does not have.Therefore, when NODEB determines that in current subframe (n) a HSUPA UE is when (n+d1+2) subframe has non-scheduled E-PUCH or SPS E-PUCH, NODEB just can not dispatch this UE in current subframe.

After the UE that NODEB will not be scheduled from all HSUPA UE removes, calculate the dispatching priority of each UE and order from high to low sorts all UE according to priority.

The method of calculating each HSUPA UE dispatching priority is a lot, such as: polling method, maximum C/I(carrier/interface ratio) method and PF(equitable proportion) method etc.The detailed introduction of these methods refers to existing document.Because the method for the dispatching priority that calculates each UE is not content of the present invention, repeat no more here.

Step 202-2: determine the E-AGCH that can use in current n subframe.In current subframe, all E-AGCH that configure on the carrier wave be scheduled are available E-AGCH.

Step 202-3: the uplink scheduling resource pool of determining the n+d1+2 subframe; Determine the multiplexing form of uplink scheduling resource pool.This step consists of following two sub-steps.

Step 202-3-1: determine the uplink scheduling resource pool.

At current subframe " n ", the resource in the uplink scheduling resource pool of HSUPA scheduler schedules (n+d1+2) subframe.Therefore, when current n subframe scheduling, need to determine: all ascending resources that comprise at n+d1+2 subframe uplink scheduling resource pool.

The ascending resource taken in the n+d1+2 subframe in n+d1+2 subframe uplink scheduling resource pool each channel or each resource type in the combination of n+d1+2 subframe scheduling E-PUCH resource and determined channel or resource type combination forms.

RNC configures to the E-PUCH resource pool of NODEB and consists of to the SPS E-PUCH of each UE with for the ascending resource of scheduling E-PUCH to the non-scheduled E-PUCH of each UE, configuration configuration.

While in the definite channel combination of step 201, not comprising any channel or resource type, in the n+d1+2 subframe, the uplink scheduling resource pool only consists of the scheduling E-PUCH resource.

Configure to the resource the E-PUCH resource pool of NODEB, the non-scheduled E-PUCH of each UE taken in " n+d1+2 " subframe and foreclose from RNC, the resource that the SPS E-PUCH of each UE is taken in " n+d1+2 " subframe forecloses, and just obtains the E-PUCH resource of " n+d1+2 " subframe scheduling.

In this case, the scheduler that the present invention proposes and dispatching method are a kind of scheduler and dispatching methods of realizing the MU MIMO technology of existing scheduling E-PUCH resource.

Idle ascending resource is considered as to a kind of special up channel or special resource type.Other up channels and idle ascending resource can form a lot of channel combinations or resource type combination.When the MUMIMO technology can be applied to the scheduling E-PUCH resource, be extended in wherein any one channel combination or resource type combination.After determining a kind of channel combination or resource type combination, in the n+d1+2 subframe, the shared resource of each channel that the uplink scheduling resource pool is comprised by scheduling E-PUCH resource and this combination forms, or the various types of resources that comprised by scheduling E-PUCH resource and this combination form.

When this combination only includes idle ascending resource, in the n+d1+2 subframe, the uplink scheduling resource pool consists of scheduling E-PUCH resource and idle ascending resource.

When this combination only includes non-scheduled E-PUCH and SPS E-PUCH, at n+d1+2 subframe RNC, configure to the resource in the E-PUCH resource pool of NODEB and all belong to the uplink scheduling resource pool.Therefore, the E-PUCH resource pool configured to NODEB by RNC at n+d1+2 subframe uplink scheduling resource pool forms.

When this combination comprises idle ascending resource, non-scheduled E-PUCH and SPS E-PUCH, the E-PUCH resource pool and the idle ascending resource that at n+d1+2 subframe uplink scheduling resource pool, by RNC, are configured to NODEB form.

When this combination comprises idle ascending resource, non-scheduled E-PUCH, SPS E-PUCH and UL DPCH, at n+d1+2 subframe uplink scheduling resource pool, by RNC, configure the resource that E-PUCH resource pool to NODEB, idle ascending resource and each UL DPCH take in this subframe and form.

While comprising the up channel outside all scheduling E-PUCH such as up idling-resource, non-scheduled E-PUCH, SPS E-PUCH, UL DPCH, HS-SICH, PRACH and E-RUCCH when this combination, at n+d1+2 subframe uplink scheduling resource pool, by RNC, configure the resource that E-PUCH resource pool to NODEB, idle ascending resource, resource, each HS-SICH, each PRACH and each E-RUCCH that each UL DPCH takies in this subframe take in this subframe and form.That is: the resource consisted of all ascending time slots at n+d1+2 subframe uplink scheduling resource pool forms.

Along with MU MIMO technology being applied to more scheduling E-PUCH up channel in addition, the complexity of HSUPA scheduler when each subframe is dispatched increases, but benefits also to increase.In other words, the increasing of the channel type comprised along with n+d1+2 subframe uplink scheduling resource pool, the complexity of scheduling increases, but benefits also to increase.Therefore, for supporting scheduling more flexibly, when scheduler is dispatched, can in more typical six kinds of constituted modes of above-mentioned uplink scheduling resource pool or in the constituted mode of all possible uplink scheduling resource pool, select a kind of mode to form " n+d1+2 " subframe uplink scheduling resource pool.In other words, select channel type or the resource class of application MUMIMO technology in the resource that scheduler can take at other up channels and idle ascending resource, according to the channel type of selecting or resource class, form " n+d1+2 " subframe uplink scheduling resource pool.

When the ascending resource consisted of all ascending time slots when (n+d1+2) subframe uplink scheduling resource pool forms or by RNC, configuring E-PUCH resource pool to UE and form, NODEB is after determining the uplink scheduling resource pool of (n+d1+2) subframe according to the method described above, and this uplink scheduling resource pool does not just change with the variation of subframe (n).When (n+d1+2) subframe uplink scheduling resource pool consists of other modes, the uplink scheduling resource pool of each subframe may change.Therefore, need to determine this subframe uplink scheduling resource pool in each subframe.

According to above-mentioned processing, in step 202-1, definite channel group is share in the uplink scheduling resource pool of determining " n+d1+2 " subframe that each subframe " n " is used.But, may be in different application scenarioss at different subframe NODEB.Can pre-define plurality of application scenes, and be every kind of scene setting channel combination.When each subframe " n " forms " n+d1+2 " subframe uplink scheduling resource pool, judge the satisfied scene of " n+d1+2 " subframe, then adopt channel definite under this scene to constitute the uplink scheduling resource pool of this subframe.The constructive method of this uplink scheduling resource pool is more flexible.

Such as: according to above analyzing, when NODEB carries out the scheduling of n subframe, the PRACH/E-RUCCH that may know the n+d1+2 subframe is vacant or belongs to which UE, and the PRACH/E-RUCCH that also may not know the n+d1+2 subframe is vacant or belongs to which UE.Therefore, can define two kinds of scenes:

The first scene: when NODEB carries out the scheduling of n subframe, the PRACH/E-RUCCH that knows the n+d1+2 subframe is vacant or while belonging to which UE, the channel combination comprises PRACH/E-RUCCH.Correspondingly, n+d1+2 subframe uplink scheduling resource pool comprises the resource that PRACH/E-RUCCH takies.

The second scene: when NODEB carries out the scheduling of n subframe, the PRACH/E-RUCCH that does not know the n+d1+2 subframe is vacant or while belonging to which UE, in the channel combination, does not comprise PRACH/E-RUCCH.Correspondingly, n+d1+2 subframe uplink scheduling resource pool does not comprise the resource that PRACH/E-RUCCH takies.

Step 202-3-2: the multiplexing form of initialization uplink scheduling resource pool.

The multiplexing form of this uplink scheduling resource pool provides: each node in each ascending time slot at most can be multiplexing in MU MIMO mode by how many UE.

If the definite uplink scheduling resource pool of step 202-3-1 comprises N time slot, formulate the multiplexing form of uplink scheduling resource pool of 31 * N dimension.In this form, j is listed as in the corresponding uplink scheduling resource pool of the capable element of i i node in j time slot, value z (the j of this element, i) mean in the uplink scheduling resource pool that in j time slot, i node can be shared in MU MIMO mode by the individual UE of z (j, i).Here, i means node number, i=0, and 1 ..., 30; J means j time slot of uplink scheduling resource pool, j=1 ..., N.Use t _jthe timeslot number that means j time slot of uplink scheduling resource pool, and t ₁<t ₂<...<t _j<...<t _n.

When scheduler is supported MU MIMO technology, according to the uplink scheduling resource pool obtained in step 202-3-1, the method for the multiplexing form of uplink scheduling resource pool of this 31 * N dimension of initialization is as follows:

(1), for the uplink scheduling resource pool at time slot t _jthe channel code c comprised, determine node i corresponding to this channel code c.The number of channel code and the corresponding relation between node refer to 3GPP agreement TS25.222.

When if this channel code is the channel code that in UL DPCH, non-scheduled E-PUCH, SPS E-PUCH, HS-SICH, PRACH and E-RUCCH, any one up channel takies, j in above table is listed as to the i row element and is initialized as Q-1, that is: z (j, i)=Q-1.If this channel code is up idling-resource while taking, j in above table is listed as to the i row element and is initialized as Q, that is: z (j, i)=Q.Here, Q means the maximum times that the channel code resources of the channel occupancy of the type is re-used.Here, up idling-resource is considered as to a kind of special up channel.For the corresponding node of the element that is initialized as Q-1, this node is used by a up channel, and this node is at most again by Q-1 UE is shared in MU MIMO mode in addition.For the corresponding node of the element that is initialized as Q, this node is not also used by any up channel, and this node is shared in MU MIMO mode by Q UE at most.

In the combination of definite channel or resource type combination, the maximum times Q that the channel code resources that every kind of channel or every kind of resource type take is re-used can arrange separately, also can unify to be arranged to identical Q value.

Such as, to non-scheduled E-PUCH, Q=4 can be set; For HS-SICH, Q=2 can be set.Like this, the numerical value of the corresponding node of resource that the non-scheduled E-UCH of UE1 is shared is arranged to Q-1=4-1=3, that is: the non-scheduled E-PUCH of UE1 supports that other three UE's is multiplexing.The numerical value of the corresponding node of resource that each HS-SICH is shared is arranged to Q-1=2-1=1.Each HS-SICH can only support that another one UE's is multiplexing.

Because the quality requirement of all types of channels is different, so, the independent configuration of maximum multiplexing number Q of the channel of each type can make scheduler more flexibly, the scope of application is wider.Such as, HS-SICH is control channel, if this channel quality of reception can't guarantee, the peak rate of HSDPA and throughput will be greatly affected.Therefore, the maximum multiplexing number of this channel can arrange smallerly, such as: Q=2.But not scheduling E-PUCH support re-transmission, the maximum multiplexing number of this channel can arrange largerly, such as: Q=4.Even the upper data decoding mistake of the non-scheduled E-PUCH of UE, also can obtain correct data block by the re-transmission to this data block.

If this channel code is the scheduling E-PUCH resource, j in above table is listed as to the i row element and is initialized as M, that is: z (j, i)=M.Here, M means the maximum times that each channel code of scheduling E-PUCH resource occupation is re-used.For the corresponding node of the element that is initialized as M, this node is not used by any up channel, and this node can be shared in MU MIMO mode by M UE at most.

In M and the combination of definite channel or combination of resources, the Q value of each channel or each resource type can be identical, also can difference.Preferably, the maximum multiplexing number of the maximum multiplexing number of up idling-resource and scheduling E-PUCH resource is arranged to identical value.

The value of M and Q can be determined according to the restriction to the resource multiplex number of times.

Such as, if all kinds of resources in the uplink scheduling resource pool are all supported to 2 users' MU MIMO technology, can make M=Q=2.

For another example, the scheduling E-PUCH resource in the uplink scheduling resource pool is supported to 4 users' MU MIMO technology, therefore, made M=4.But not excessive for guaranteeing the interference that other up channels are subject to, can make the maximum multiplexing number of other resource types in the uplink scheduling resource pool is Q=2 or Q=3.

(2), for the uplink scheduling resource pool at time slot t _jchannel code c not to be covered, determine node i corresponding to this channel code c, j in form is listed as to the i row element and is initialized as 0, that is: z (j, i)=0, mean that this node does not belong to the uplink scheduling resource pool, and this node is unavailable.When a node is unavailable, any one father node of this node is inevitable unavailable.

Therefore, determine all father nodes of node i, the corresponding j of any one father node v of node i is listed as to the v row element and is initialized as 0, that is: z (j, v)=0.

(3), determine time slot t _jinterior 16 nodes corresponding with the channel code of 16 SF=16, for any one node i wherein, if the corresponding j of this node is listed as the i row element and is not initialised in above-mentioned initialization process, but, the father node of this node is initialised, and just the corresponding j of this node is listed as to the i row element and is initialized as and is listed as the v row element with the corresponding j of its father node v and has identical numerical value.That is: z (j, i)=z (j, v).

(4), after above-mentioned processing, j is listed as to the node i of j time slot in the corresponding uplink scheduling resource pool of i row element, if this node also is not initialised, determine any one child node u of this node i, the corresponding j of this node i is listed as the minimum value that the i row element is initialized as the corresponding element of all child nodes of this node, that is: z (j, i)=M.

The typical value of M is: 2 and 4.Along with the increase of M number, the scheduling complexity of NODEB scheduler increases, and the benefit of MU MIMO technology increases.The typical value of Q is: 2,3 and 4.

For supporting scheduling more flexibly, scheduler can be at M=1, is selected in 2,3,4.When selecting M=1, scheduler is degenerated to the scheduler of not supporting MU MIMO technology.At present, the maximum of M is M=4.But, along with the increase of NODEB number of antennas or the NODEB support to more complicated scheduler, the maximum of M can further improve.

Step 202-4: from priority, the highest UE starts to dispatch one by one UE according to queue sequence.To the scheduling step of a UE as shown in Figure 4, comprise the steps:

Step 202-4-1: when a UE of scheduling, select an E-AGCH to distribute to UE from all available E-AGCH.

Step 202-4-2: select a part of resource to distribute to UE as E-PUCH from the uplink scheduling resource pool.

If the E-PUCH resource of selecting can't be carried the minimum data piece of UE, just finish the scheduling to current UE, start next UE in the dispatching priority queue.To the scheduling of next UE from above-mentioned steps 202-4-1.

In this step, determine the E-PUCH that distributes to UE according to flow process as shown in Figure 5:

Step 202-4-2-1: when a UE of scheduling, at first determine the ascending resource pond that this UE can use.

Step 203-4-2-2: while in the available ascending resource pond of the UE that is scheduled, not comprising any channel code, finish the scheduling to this UE, start to dispatch next UE.To the scheduling of next UE from step 202-4-1.Otherwise, from the available ascending resource pond of UE, select a part of resource to distribute to UE as scheduling E-PUCH.

This UE can with the ascending resource pond in select a rectangle resource that is no more than the UE ability, the data volume of the UE of this rectangle resource bearing is maximum in all rectangle resources that can distribute to UE.This resource is distributed to this UE, as the scheduling E-PUCH of this UE.

From known resource pool, to UE, distribute the detailed method of the E-PUCH resource that meets above-mentioned requirements can continue to use the method in existing document.

The number of time slot of the E-PUCH that UE supports is conditional.The shared number of time slot of E-PUCH of distributing to UE can not surpass the ability of this UE.

In this step, after determining the ascending resource pond that this UE can use, can also take following processing:

By this, available ascending resource pond is divided into two sub-resource pools: sub-resource pool fully in this available ascending resource pond the scheduling E-PUCH resource form; Another child resource pond consists of the available resources of other types.

Such as: RNC is using whole resource distribution NODEB of TS2 as the E-PUCH resource pool, and this resource pool only includes scheduling E-PUCH, does not comprise: non-scheduled E-PUCH and SPS E-PUCH.

RNC has configured the up channels such as UL DPCH at TS1.

When UE can with resource pool comprise: when the part resource of TS2 and the part resource of TS1, in two sub-resource pools, a resource of the part by TS2 forms, and a resource of the part by TS1 forms.

Distribute the rectangle resource that is no more than the UE ability in these two sub-resource pools respectively this UE.The data volume of distributing to the UE that the rectangle resource of UE can carry in each child resource pond is maximum in various rectangle resources in this child resource pond.

If when distributing to the E-PUCH resource of this UE can carry more data in first child resource pond, just using distributing to the E-PUCH resource of this UE in first child resource pond as the scheduling E-PUCH of distributing to this UE.

If when distributing to the E-PUCH resource of this UE can carry more data in second sub-resource pool, just using distributing to the E-PUCH resource of this UE in second sub-resource pool as the scheduling E-PUCH of distributing to this UE.

If it is identical to distribute to the data volume of E-PUCH resource bearing of this UE in two sub-resource pools, select at random a sub-resource pool, will distribute to the E-PUCH resource of this UE in this child resource pond as the scheduling E-PUCH of distributing to this UE.Perhaps determine respectively the channel code number of the SF=16 that the interior rectangle resource of selecting of these two sub-resource pools comprises, the less rectangle resource of channel code number of the SF=16 that selection comprises, distribute to UE using this resource as scheduling E-PUCH.

Below provide an embodiment in the ascending resource pond of determining that UE can use:

When step 202-3 forms the uplink scheduling resource pool, when definite channel combination or resource type combination comprise the channel type beyond idle ascending resource, when comprising in UL DPCH, non-scheduled E-PUCH, SPS E-PUCH, HS-SICH, PRACH and E-RUCCH any one up channel or a plurality of up channel, in the uplink scheduling resource pool, need to determine that whether the shared ascending resource of any one other up channel of comprising in this resource pool is available to the UE be scheduled.Method is as follows:

Any one other up channel comprised for uplink scheduling resource pool in (n+d1+2) subframe, determine that this up channel is vacant or carries the signal of which UE.If this channel is vacant, the resource of this channel occupancy can be used by UE.Otherwise, the correlation between the wireless channel of the UE carried on the wireless channel of the UE that investigation is scheduled and this up channel.If the wireless channel correlation between these two UE a little less than, just think the ascending resource that this UE be scheduled can be used this up channel to take.If the wireless channel correlation between these two UE is stronger, just think the ascending resource that this UE be scheduled can't be used this up channel to take.When resource that UE can't be used a up channel to take, from the uplink scheduling resource pool, by this up channel, shared resource is removed.When the UE be scheduled is exactly the UE carried on this up channel, directly from the uplink scheduling resource pool by this up channel shared resource remove.

Before this UE of scheduling, whether if when the UE successfully dispatched has been arranged, also needing to investigate the shared ascending resource of UE of successfully having been dispatched can be used for the current UE be scheduled.Investigate the correlation of the wireless channel of the wireless channel of each UE successfully dispatched and the current UE of being scheduled.If the wireless channel correlation between these two UE a little less than, just think the ascending resource that UE was used that the current UE be scheduled can be used this successfully to be dispatched.If the wireless channel correlation between these two UE is stronger, just think the ascending resource that UE was used that the current UE be scheduled can't be used this successfully to be dispatched.When if the UE be scheduled current can't be used an ascending resource that UE was used of successfully being dispatched, the ascending resource that UE was used of from the uplink scheduling resource pool, this successfully being dispatched removes.

For calculating the correlation of wireless channel between two UE, need physical layer to obtain the instantaneous value of channel estimating of up channel of p subframe the 2nd UE or the recursive average of channel estimating, the instantaneous value of the channel estimating that this value is the up-to-date up channel reported of the 2nd UE or the recursive average of channel estimating; In each subframe of the instantaneous value of channel estimating that the p subframe is the up channel that can obtain the 2nd UE or the recursive average of channel estimating before current subframe and the nearest subframe of the current subframe of distance; Obtain the instantaneous value of the channel estimating of the up channel of current UE in the q subframe or the recursive average of channel estimating, this value is the instantaneous value of the channel estimating of the up-to-date up channel reported of current UE or the recursive average of channel estimating; In each subframe of the instantaneous value of channel estimating that the q subframe is the up channel that can obtain current UE or the recursive average of channel estimating before current subframe and the nearest subframe of the current subframe of distance.

While calculating the correlation between the wireless channel of two UE at the HSUPA scheduler of n subframe NODEB, use instantaneous value or the recursive average of the channel estimating of up-to-date each UE reported.Between two UE based on channel estimating, wireless channel correlation calculations method is as follows:

$\mathrm{\&rho;}=\frac{\left|\underset{k=1}{\overset{K_a}{\mathrm{\&Sigma;}}}\underset{w=1}{\overset{W}{\mathrm{\&Sigma;}}}{h}_{x,k,w}{h}_{y,k,w}^{*}\right|}{\left|h_x\right|\&CenterDot;\left|h_y\right|};$

In above formula, K _athe number that means the NODEB reception antenna;

the instantaneous value or the recursive average that mean the up-to-date channel estimating reported of current UE, instantaneous value or the recursive average of the channel estimating on the k root antenna of expression current UE, W means that the window of channel estimating is long;

the instantaneous value or the recursive average that mean the up-to-date channel estimating reported of the 2nd UE,

the instantaneous value or the recursive average that mean the channel estimating of the 2nd UE on k root antenna; | h _x| and | h _y| mean respectively h _xand h _ymould.

Arrange threshold value Th1 ∈ (0,1], if during the correlation ρ of the wireless channel between two UE >=Th1, think: the wireless channel strong correlation of two UE; Otherwise, think that the wireless channel between two UE is weak relevant.

When the correlation of the wireless channel that calculates two UE, can also adopt the DLBF(down beam shaping of each UE) weight vector calculates.Therefore, physical layer is obtained the down beam shaping DLBF weight vector that the p subframe has the 2nd UE of at least one up channel, and this DLBF weight vector is the up-to-date DLBF weight vector reported of the 2nd UE; In each subframe of DLBF weight vector that the p subframe is the up channel that can obtain the 2nd UE before current subframe and the nearest subframe of the current subframe of distance; Obtain the DLBF weight vector that the q subframe has the current UE of at least one up channel, this DLBF weight vector is the up-to-date DLBF weight vector reported of current UE; In each subframe of DLBF weight vector that the p subframe is the up channel that can obtain current UE before current subframe and the nearest subframe of the current subframe of distance.

While calculating the correlation between the wireless channel of two UE at the HSUPA scheduler of n subframe NODEB, the HSUPA scheduler uses the DLBF weight vector of up-to-date each UE reported.Wireless channel correlation calculations method between two UE based on the DLBF weight vector is as follows:

$\mathrm{\&rho;}=\frac{\left|\underset{i=1}{\overset{K_a}{\mathrm{\&Sigma;}}}{x}_i{y}_i^{*}\right|}{\left|x\right|\&CenterDot;\left|y\right|};$

In above formula, | x| and | y| means respectively the mould of vector x and vector y; Vector x and vector y mean respectively the DLBF weight vector of current UE and the DLBF weight vector of the 2nd UE.

Arrange threshold value Th2 ∈ (0,1], if during the correlation ρ of the wireless channel between two UE >=Th2, think: the wireless channel strong correlation of two UE; Otherwise, think that the wireless channel between two UE is weak relevant.

According to the method described above, can determine the available ascending resource pond of the UE that is scheduled.

Step 202-4-3: from the E-HICH set of UE, select an E-HICH to distribute to UE.

Step 202-4-4: distribute training sequence deviation to each UE.

The method of salary distribution has two kinds: for the UE that does not support the special default training sequence deviation method of salary distribution, adopt mode 2 to distribute training sequence deviation to this UE.For the UE that supports the special default training sequence deviation method of salary distribution, employing mode 1 is distributed training sequence deviation to UE.

Mode 1: adopt the special default training sequence deviation method of salary distribution.All training sequence deviation in community are divided into to the N group.In every group, the mapping relations of training sequence deviation and OVSF interchannel define according to 3GPP agreement TS25.221.

The channel code that definite node of distributing to the E-PUCH of UE takies, this channel code is the corresponding different training sequence deviation of difference in N group training sequence deviation, select a training sequence deviation of not distributing to other UE or up channel, distribute to this UE.

When the maximum multiplexing number of each channel type is identical, if this maximum multiplexing number is not more than 2, N=2 or N=4; If this maximum multiplexing number is not more than 4, N=4.

When the maximum multiplexing number of each channel type arranges separately, get the maximum in the maximum multiplexing number of each channel type, if this maximum is not more than 2, N=2 or N=4; If this maximum is not more than 4, N=4.

Mode 2: adopt default training sequence deviation configuration mode, the mapping relations under this mode between each training sequence deviation value and OVSF channel code are according to TS25.221 definition in the 3GPP agreement.

According to the shared channel code of the E-PUCH that distributes to this UE, look into the mapping relations between each training sequence deviation and OVSF channel code under default training sequence deviation configuration mode, determine the training sequence deviation that this channel code is corresponding, if this training sequence deviation has been assigned to other UE or up channel, failed to the scheduling of this UE: or re-execute above-mentioned steps 202-4-2 to a less E-PUCH resource of this UE distribution; Perhaps finish the scheduling to this UE, start next UE in the dispatching priority queue.To the scheduling of next UE from above-mentioned steps 202-4-1.

Step 202-4-5: after being successfully UE distribution E-AGCH, E-PUCH, E-HICH and a training sequence deviation, show: this UE is successfully dispatched.The E-AGCH that distributes to this UE is removed from available E-AGCH, and mean: this E-AGCH can not reallocate to other UE; The multiplexing form in ascending resource pond of shared resource updates 31 * N dimension according to the E-PUCH that distributes to UE; Redefine the uplink scheduling resource pool according to the multiplexing form in ascending resource pond upgraded.

Step 202-4-6: judge whether to also have available E-AGCH and uplink scheduling resource pool whether also to comprise at least one channel code, if do not have available E-AGCH or uplink scheduling resource pool not to comprise any channel code, just perform step 202-4-7; If available E-AGCH is arranged, and the uplink scheduling resource pool at least comprises a channel code, just starts next UE in the dispatching priority queue.To the scheduling of next UE from above-mentioned steps 202-4-1.

Below provide a specific embodiment of the multiplexing form of uplink scheduling resource pool that upgrades 31 * N dimension:

For the scheduling E-PUCH of distributing to UE, if distribute to the node of this scheduling E-PUCH, be i, for any one the time slot j that distributes to this scheduling E-PUCH, the value that j in the multiplexing form of uplink scheduling resource pool is listed as to i element subtracts one, that is: z (j, i)=z (j, i)-1.

In upgrading the later multiplexing form in ascending resource pond, all elements is all 0, means not have available E-PUCH resource.In upgrading the later multiplexing form in ascending resource pond, have at least 1 element to be greater than 0, meaning has available E-PUCH resource, can dispatch next UE.In scheduling during next UE, the uplink scheduling resource pool is all in upgrading the later multiplexing form in ascending resource pond is not that 0 the corresponding channel code of element forms.

Step 202-4-7: to each UE successfully dispatched, by distributing to E-AGCH, the E-PUCH of this UE and the information of E-HICH, send to physical layer.

The UE that each is scheduled, the E-AGCH that at first physical layer will distribute to this UE in the n+d1 subframe sends to UE; Then receive in the n+d1+2 subframe E-PUCH that this UE sends; Finally, by the E-HICH that distributes to this UE, the ACK/NACK information of E-PUCH is fed back to this UE in the n+d1+2+d subframe.

The HSUPA scheduler that the present invention proposes and corresponding dispatching method have following useful technique effect:

Can realize dispatching UE and share the shared ascending resource of UL DPCH, non-scheduled E-PUCH, SPSE-PUCH, HS-SICH, PRACH and E-RUCCH and idle ascending resource in MU MIMO mode, effectively improve uplink throughput and the up peak rate of HSUPA.The scheduler that the present invention proposes and dispatching method also adopt the UE distribution training sequence deviation of the default training sequence deviation method of salary distribution to multiplexing identical E-PUCH resource.For the UE that does not support the special default training sequence deviation method of salary distribution, the present invention supports the multiplexing identical E-PUCH resource of these UE and other UE.

The foregoing is only preferred embodiment of the present invention, in order to limit the present invention, within the spirit and principles in the present invention not all, any modification of making, be equal to replacement, improvement etc., within all should being included in the scope of protection of the invention.

Below, introduce embodiments of the invention two～embodiment nine.

Embodiment bis-and embodiment tri-are the supplementing embodiment mono-of setting out from different perspectives.

Embodiment tetra-is special cases of embodiment mono-; Embodiment five and embodiment six are the supplementing embodiment tetra-of setting out from different perspectives;

Embodiment eight is spy's row of embodiment mono-;

Embodiment seven is spy's row of embodiment eight;

Embodiment nine is introductions of scheduler of the present invention.

Below, introduce embodiments of the invention two:

At 1 ascending time slot, NODEB carries out joint-detection to each channel code in this time slot.The complexity of joint-detection increases along with the increase of the number of the channel code of the SF=16 of the equivalence of participating in joint-detection in this time slot.The minimum ability of NODEB is: the joint-detection of supporting the channel code of 16 SF=16 at each ascending time slot.

When support resource is not multiplexing, an ascending time slot has at most the channel code of the SF=16 of 16 equivalences to participate in joint-detection.But, when having resource multiplex, 1 interior channel code number of participating in the SF=16 of joint-detection of time slot may be greater than 16.Therefore whether, when HSUPA scheduler support resource is multiplexing, need to consider to distribute to the E-PUCH resource of UE, cause the corresponding time slot in corresponding subframe to exist: the channel code of participating in the SF=16 of joint-detection outnumbers the joint-detection ability of NODEB.Here, in the same ascending time slot that the joint-detection ability of NODEB is supported by NODEB, the number of the channel code of the SF=16 of the equivalence of participation joint-detection means.The channel that is SF for a spreading factor, the channel code number of the SF=16 of the equivalence of this channel occupancy is: 16/SF.

When the joint-detection of NODEB is limited in one's ability, in embodiment mono-, after distributing the E-PUCH resource to a UE (that is: in step 202-4-2-2, after distributing E-PUCH to UE), need to increase following the processing:

After distributing the E-PUCH resource to this UE, whether scheduler needs judgement: accumulative total is distributed to the E-PUCH resource of each UE, cause the channel code of participating in the SF=16 of joint-detection in some ascending time slots of corresponding subframe " n+d1+2 " to outnumber the joint-detection ability of NODEB.If surpass the ability of NODEB, or distribute a less E-PUCH resource again to this UE, or, according to this UE scheduling failure handling, start to dispatch next UE.

Perhaps, when the joint-detection of NODEB is limited in one's ability, in embodiment mono-, before giving a UE distribution E-PUCH resource (that is: in step 202-4-2-2, before distributing E-PUCH to UE), need to increase following processing:

To each ascending time slot, be accumulated at the resource that in the E-PUCH resource of distributing to each UE in this time slot and this time slot, other up channels take, if the channel code number of the SF=16 of these resource equivalences equals the ability of NODEB, in this time slot, no longer dispatch any UE; If the channel code number of the SF=16 of these resource equivalences is not more than the ability of NODEB, calculate the number of channel code of the SF=16 of the participation joint-detection that this time slot can also support.At follow-up scheduling UE, while to UE, distributing the E-PUCH resource, the E-PUCH resource of distributing to UE can not be greater than at the channel code number of the SF=16 of each time slot equivalence the channel code number that this time slot can also be supported.

The foregoing is only preferred embodiment of the present invention, in order to limit the present invention, within the spirit and principles in the present invention not all, any modification of making, be equal to replacement, improvement etc., within all should being included in the scope of protection of the invention.

Below, introduce embodiments of the invention three:

In some scene, the restriction on the joint-detection ability of NODEB can change into the restriction to channel type.

Such as: in the scene had, only have 1 HS-SICH on a HSUPA carrier wave, this HS-SICH takies the channel code of 1 SF=16.But the up channel of other types at least takies the channel code of plural SF=16, and quantity is more.So just may occur: when each ascending time slot a subframe except the scheduling E-PUCH resource, only include: when idle ascending resource and a HS-SICH, the channel code that can not make to participate in this time slot the SF=16 of joint-detection while in any one ascending time slot, adopting resource multiplex outnumbers the joint-detection ability of NODEB.But, when there is the channel of scheduling E-PUCH resource, idle ascending resource and HS-SICH other types in addition in an ascending time slot, the resource multiplex in this time slot just is bound to surpass the joint-detection ability of NODEB.

In these cases, just can change into the restriction to channel type to the restriction of NODEB joint-detection ability.That is: when any subframe is dispatched, if find that each ascending time slot of this subframe is except the scheduling E-PUCH resource, when only available free ascending resource and preassigned channel type occur, when to UE, distributing E-PUCH, the processing in unnecessary increase embodiment bis-under the constraint of NODEB joint-detection ability.But, when this subframe is dispatched, if while finding that also there is the channel of other types in each ascending time slot of this subframe except scheduling E-PUCH resource, the ascending resource of free time and preassigned channel type, the processing under retraining with regard to NODEB joint-detection ability in needing to increase embodiment bis-before or after this UE distribution E-PUCH.

In sum, when the restriction of the joint-detection ability of NODEB can change into the restriction to channel type, for embodiment mono-, need to increase following the processing:

In step 202, increase the processing of " specifying the channel type allowed ".In the processing of this increase, NODEB specifies the channel type of each permission in advance.When the channel of scheduling E-PUCH resource, the ascending resource of free time and these specified type only appears in each ascending time slot a subframe, the resource multiplex in each ascending time slot of this subframe can not surpass the joint-detection ability of NODEB; Otherwise, can be over the joint-detection ability of NODEB.

Before the step 202-4-2-2 of embodiment mono-, increase a step: " whether judgement there will be in the scheduling of current subframe: the joint-detection ability of the multiplexing NODEB of surpassing of E-PUCH resource ".This step realizes as follows:

When only there is the channel of channel type of scheduling E-PUCH resource, idle ascending resource and appointment in each ascending time slot in " n+d1+2 " subframe, carry out step 203-4-2-2 in embodiment mono-.

During channel outside there is the channel of channel type of scheduling E-PUCH resource, idle ascending resource and appointment in each ascending time slot in " n+d1+2 " subframe, during step 203-4-2-2, increase the processing procedure in embodiment bis-in carrying out embodiment mono-.

The foregoing is only preferred embodiment of the present invention, in order to limit the present invention, within the spirit and principles in the present invention not all, any modification of making, be equal to replacement, improvement etc., within all should being included in the scope of protection of the invention.

Below, introduce embodiments of the invention four:

In the HSUPA application, there is following scene:

Only configure the control channel E-AGCH of 1 HSUPA on HSUPA carrier wave.

The scene that the present embodiment equals 1 for above-mentioned E-AGCH number, provide HSUPA scheduler and dispatching method.

Owing to only having 1 E-AGCH on the HSUPA carrier wave, at the scheduler of each subframe HSUPA, can only on this carrier wave, dispatch 1 UE.Therefore, there do not is the situation of the multiplexing identical scheduling E-PUCH resource of a plurality of UE in any subframe.That is: when the E-AGCH number equals 1, the MU MIMO technology of the technical solution used in the present invention and existing scheduling E-PUCH resource is without any relation.

Number at E-AGCH is 1 o'clock, and the present invention proposes is applied to MU MIMO technological expansion up channel beyond scheduling E-PUCH or the method for up idling-resource, becomes: the method for supporting multiplexing other up channels of HSUPA UE and idle ascending resource.And because the E-AGCH number is 1, only there will be a multiplexing scheduling E-PUCH resource of HSUPA UE resource in addition, that is: beyond the scheduling E-PUCH resource, resource is multiplexing by 1 HSUPA UE at most.In this case, even the maximum multiplexing number of these resources is greater than 2, these resources also can only be multiplexing by 1 UE, that is: the accumulative total multiplexing number of these resources is 2 to the maximum.Below, introducing the E-AGCH number is 1, support ascending resource beyond the multiplexing scheduling E-PUCH resource of HSUPA UE, and the maximum multiplexing number of the resource beyond other any one scheduling E-PUCH resources is 2 or is greater than 2, idle uplink resource multiplexing number of times is 1 or is greater than the method for 1 o'clock.The performing step of the method is as follows:

Step 301: determine channel combination or resource type combination that HSUPA UE can be multiplexing.

The scheduling of step 302:HSUPA scheduler start-up period.In any one subframe (n) subsequently, the HSUPA scheduler carries out a HSUPA scheduling.

In any subframe (n subframe), the scheduling flow bag following steps of HSUPA scheduler:

Step 302-1: determine the uplink scheduling resource pool.

Resource in the uplink scheduling resource pool of current subframe " n " HSUPA scheduler schedules (n+d1+2) subframe.Therefore, when current n subframe scheduling, need to determine: all ascending resources that comprise at n+d1+2 subframe uplink scheduling resource pool.

The ascending resource taken in the n+d1+2 subframe in n+d1+2 subframe uplink scheduling resource pool each channel or each resource type in the combination of n+d1+2 subframe scheduling E-PUCH resource and determined channel or resource type combination forms.

According to above-mentioned processing, in step 301, definite channel group is share in the uplink scheduling resource pool of determining " n+d1+2 " subframe that each subframe " n " is used.But, may be in different application scenarioss at different subframe NODEB.Can pre-define plurality of application scenes, and be every kind of scene setting channel combination.When each subframe " n " forms " n+d1+2 " subframe uplink scheduling resource pool, judge the satisfied scene of " n+d1+2 " subframe, then adopt channel definite under this scene to constitute the uplink scheduling resource pool of this subframe.The constructive method of this uplink scheduling resource pool is more flexible.

Step 302-2: determine the UE that can be scheduled in current subframe, then determine the dispatching priority of each UE that can be scheduled.According to priority, order is from high to low queued up UE.From dispatching priority, the highest UE starts scheduling.To the scheduling step of each UE as shown in Figure 6, comprise the steps:

Step 302-2-1: when a UE of scheduling, at first determine the ascending resource pond that this UE can use.

Step 302-2-2: this UE can with the ascending resource pond in select a rectangle resource that is no more than the UE ability, the data volume of the UE that this rectangle resource can be carried is maximum in all rectangle resources.This resource is distributed to this UE, as the scheduling E-PUCH of this UE.Ascending resource can mean with time slot and node.By the ascending resource that in one or more time slots, same node forms, it is exactly so-called rectangle resource.

Concrete distributes the method for the scheduling E-PUCH that meets above-mentioned condition can continue to use the method in pertinent literature to UE.

Below provide an embodiment in the ascending resource pond of determining that UE can use:

In the uplink scheduling resource pool, if when this resource pool comprises the channel type except scheduling E-PUCH and idle ascending resource, need to determine that whether the shared ascending resource of other up channels of comprising in this resource pool is available to the UE be scheduled.

Any one other up channel comprised for uplink scheduling resource pool in (n+d1+2) subframe, determine that this up channel is idle or carries the signal of which UE.If this channel idle, the resource of this channel occupancy can be used by UE.Otherwise, the correlation between the wireless channel of the UE carried on the wireless channel of the UE that investigation is scheduled and this up channel.If the wireless channel correlation between these two UE a little less than, just think the ascending resource that this UE be scheduled can be used this up channel to take.If the wireless channel correlation between these two UE is stronger, just think the ascending resource that this UE be scheduled can't be used this up channel to take.When resource that UE can't be used a up channel to take, from the uplink scheduling resource pool, by this up channel, shared resource is removed.When the UE be scheduled is exactly the UE carried on this up channel, directly from the uplink scheduling resource pool by this up channel shared resource remove.

The method of the correlation of the wireless channel of two UE of calculating refers to associated description in embodiment mono-.

In the uplink scheduling resource pool, if when this resource pool only is comprised of scheduling E-PUCH resource and idle ascending resource, in step 302-1, definite uplink scheduling resource pool is exactly the available ascending resource pond of this UE.

According to the method described above, can determine the available ascending resource pond of the UE that is scheduled.

Step 302-2-3: from the E-HICH set of UE, select an E-HICH to distribute to UE.

Step 302-2-4: adopt default training sequence deviation configuration mode, to UE, distribute training sequence deviation.

According to the shared channel code of the E-PUCH that distributes to this UE, look into the mapping relations between each training sequence deviation and OVSF channel code under default training sequence deviation configuration mode, determine the training sequence deviation that this channel code is corresponding, if this training sequence deviation has been assigned to other UE or up channel, failed to the scheduling of this UE: or re-execute step 302-2-2, distribute a less E-PUCH resource to UE; Perhaps finish the scheduling to this UE, start next UE in the dispatching priority queue.To the scheduling of next UE from above-mentioned steps 302-2-1.

Step 302-2-5: after being successfully UE distribution E-PUCH, an E-HICH and training sequence deviation, show: this UE is successfully dispatched.Unique E-AGCH is distributed to this UE.

Step 302-2-6: to the UE successfully dispatched, by distributing to E-AGCH, the E-PUCH of this UE and the information of E-HICH, send to physical layer.

The UE that each is scheduled, the E-AGCH that at first physical layer will distribute to this UE in the n+d1 subframe sends to UE; Then receive in the n+d1+2 subframe E-PUCH that this UE sends; Finally, by the E-HICH that distributes to this UE, the ACK/NACK information of E-PUCH is fed back to this UE in the n+d1+2+d subframe.

The foregoing is only preferred embodiment of the present invention, in order to limit the present invention, within the spirit and principles in the present invention not all, any modification of making, be equal to replacement, improvement etc., within all should being included in the scope of protection of the invention.

Below, introduce embodiments of the invention five:

When the joint-detection of NODEB is limited in one's ability, in embodiment tetra-, after distributing the E-PUCH resource to a UE (that is: in step 302-2-2, to UE, distribute E-PUCH after), need to increase following the processing:

After distributing the E-PUCH resource to this UE, whether scheduler needs judgement: distribute to the E-PUCH resource of this UE, cause the channel code of participating in the SF=16 of joint-detection in some ascending time slots of corresponding subframe " n+d1+2 " to outnumber the joint-detection ability of NODEB.If surpass the ability of NODEB, or distribute a less E-PUCH resource again to this UE, or, according to this UE scheduling failure handling, start to dispatch next UE.

Perhaps, when the joint-detection of NODEB is limited in one's ability, in embodiment tetra-, before giving a UE distribution E-PUCH resource, (that is: distribute to UE in step 302-2-2 before E-PUCH), need to increase following processing:

To each ascending time slot, calculate the resource that other up channels take in this time slot, if the channel code number of the SF=16 of these resource equivalences equals the ability of NODEB, in this time slot, no longer dispatch any UE; If the channel code number of the SF=16 of these resource equivalences is less than the ability of NODEB, calculate the number of channel code of the SF=16 of the participation joint-detection that this time slot can also support.At follow-up scheduling UE, while to UE, distributing the E-PUCH resource, the E-PUCH resource of distributing to UE can not be greater than at the channel code number of the SF=16 of each time slot equivalence the channel code number that this time slot can also be supported.

The foregoing is only preferred embodiment of the present invention, in order to limit the present invention, within the spirit and principles in the present invention not all, any modification of making, be equal to replacement, improvement etc., within all should being included in the scope of protection of the invention.

Embodiment six:

When the restriction of the joint-detection ability of NODEB can convert the restriction to channel type to, for embodiment tetra-, need to increase following the processing:

In step 302, increase the processing of " specifying the channel type allowed ".In the processing of this increase, NODEB specifies the channel type of each permission in advance.When the channel of scheduling E-PUCH resource, the ascending resource of free time and these specified type only appears in each ascending time slot a subframe, the resource multiplex in each ascending time slot of this subframe can not surpass the joint-detection ability of NODEB; Otherwise, can be over the joint-detection ability of NODEB.

Before the step 302-1 of embodiment tetra-, increase a step 302-0: " whether judgement there will be in the scheduling of current subframe: the joint-detection ability of the multiplexing NODEB of surpassing of E-PUCH resource ".This step realizes as follows:

When only there is the channel of channel type of scheduling E-PUCH resource, idle ascending resource and appointment in each ascending time slot in " n+d1+2 " subframe, carry out step 302-1～step 302-2 in embodiment tetra-.

During channel outside there is the channel of channel type of scheduling E-PUCH resource, idle ascending resource and appointment in each ascending time slot in " n+d1+2 " subframe, carry out step 302-1～step 302-2 in embodiment tetra-, the processing procedure when execution step 302-2-2 in increase embodiment five.

The foregoing is only preferred embodiment of the present invention, in order to limit the present invention, within the spirit and principles in the present invention not all, any modification of making, be equal to replacement, improvement etc., within all should being included in the scope of protection of the invention.

Below, introduce embodiments of the invention seven:

In the HSUPA application, there is following scene:

Only configure the control channel E-AGCH of one or more HSUPA on (1) HSUPA carrier wave.

(2) the uplink scheduling resource pool only has the E-PUCH resource of scheduling and idle ascending resource to form.

(3) do not support multiplexing identical resource between UE

(4) support the multiplexing idle ascending resource of UE, and the maximum multiplexing number of idle ascending resource is 1 or is greater than 1.When the maximum multiplexing number of idling-resource is 1, mean that channel code that idle ascending resource takies can only support that 1 HSUPA UE's is multiplexing.Do not support the up channel code of multiplexing same free time of two or more UE.

The present embodiment is 1 to provide HSUPA scheduler and dispatching method for the maximum multiplexing number of idling-resource in above-mentioned scene.In above-mentioned scene, due to the resource multiplex of not supporting between UE, the HSUPA scheduler of this scene and dispatching method and existing E-PUCH resource multiplex technology (MU MIMO technology) are irrelevant.This scheduler and dispatching method are the simplest situation in the resource that takies of multiplexing other up channels of HSUPA UE of proposing of the present invention: the ascending resource of multiplexing free time of HSUPA UE.Or rather, be that HSUPA UE is used idle ascending resource.Because the method is not carried out the resource multiplex between UE, and only use idling-resource, idling-resource only is used 1 time, therefore, under the method, not there will be: the E-PUCH that distributes to UE can cause the channel code of the SF=16 that participates in joint-detection to outnumber the problem of the joint-detection ability of NODEB.

The performing step of the method is as follows:

The scheduling of HSUPA scheduler start-up period.In any one subframe (n) subsequently, the HSUPA scheduler carries out a HSUPA scheduling.

In any subframe (n subframe), the scheduling flow of HSUPA scheduler comprises the steps:

Step 501: determine the uplink scheduling resource pool.

Scheduling E-PUCH resource in current subframe " n " HSUPA scheduler schedules (n+d1+2) subframe.In the n+d1+2 subframe, the uplink scheduling resource pool consists of scheduling E-PUCH resource and idle ascending resource.

Step 502: determine the UE that can be scheduled in current subframe, then determine the dispatching priority of each UE that can be scheduled.According to priority, order is from high to low queued up UE.

Step 503: E-AGCH available on this carrier wave is set.

Step 504: from dispatching priority, the highest UE starts scheduling.To the scheduling flow of each UE as shown in Figure 8, comprise the steps:

Step 504-1: from this carrier wave can with E-AGCH select an E-AGCH to distribute to UE.

Step 504-2: select a part of resource to distribute to UE from the uplink scheduling resource pool, as the E-PUCH of UE.

Select a rectangle resource that is no more than the UE ability in the uplink scheduling resource pool, the data volume of the UE that this rectangle resource can be carried is maximum in all rectangle resources.This rectangle resource is distributed to this UE, as the scheduling E-PUCH of this UE.

Concrete distributes the method for the E-PUCH that meets above-mentioned condition can continue to use the method in pertinent literature to UE.

The uplink scheduling resource pool can also be divided into to two sub-resource pools, be dispatched at two sub-resource pools respectively.The method of being dispatched at two sub-resource pools particularly is with embodiment mono-.

Step 504-3: from the E-HICH set of UE, select an E-HICH to distribute to UE.

Step 504-4: after being successfully UE distribution E-AGCH, an E-PUCH and E-HICH, show: this UE is successfully dispatched.The E-AGCH that distributes to this UE is arranged to " unavailable ", makes other UE can not re-use this E-AGCH; The resource taken as the E-PUCH that distributes to this UE is arranged to unavailable, makes other UE can not re-use the resource of distributing to this UE.

Step 504-5: if available E-AGCH is arranged, and in the ascending resource pond, available resource is arranged, just return to next UE in the queue of step 504-1 dispatching priority.Otherwise, finish the scheduling in current subframe, execution step 504-6.

Step 504-6: to each UE successfully dispatched, by distributing to E-AGCH, the E-PUCH of each UE and the information of E-HICH, send to physical layer.

The UE that each is scheduled, the E-AGCH that at first physical layer will distribute to this UE in the n+d1 subframe sends to UE; Then receive in the n+d1+2 subframe E-PUCH that this UE sends; Finally, by the E-HICH that distributes to this UE, the ACK/NACK information of E-PUCH is fed back to this UE in the n+d1+2+d subframe.

The foregoing is only preferred embodiment of the present invention, in order to limit the present invention, within the spirit and principles in the present invention not all, any modification of making, be equal to replacement, improvement etc., within all should being included in the scope of protection of the invention.

Below, introduce embodiments of the invention eight:

In the HSUPA application, there is following scene:

(1) the E-AGCH number is greater than 1;

(2) do not support multiplexing identical E-PUCH resource between UE;

(3) a certain class resource in the resource that the resource that still, UE can multiplexing other up channels takies and idle ascending resource form or multiclass resource or whole resources.Maximum multiplexing number to other any class resources is 2 or is greater than 2.Maximum multiplexing number to idle ascending resource is 1 or is greater than 1.When the maximum multiplexing number of other types resource all is 2, mean that the channel code of these resource occupation all is merely able to by 1 HSUPA UE multiplexing.When the maximum multiplexing number of idle ascending resource is 1, mean that this resource can only be multiplexing by a UE.

The present embodiment for the maximum multiplexing number of other kinds resource in above-mentioned scene be all 2 and the maximum multiplexing number of idle ascending resource be 1 to provide HSUPA scheduler and dispatching method.In above-mentioned scene, owing to not supporting between HSUPA UE to carry out resource multiplex, the HSUPA scheduler of this scene and dispatching method and existing E-PUCH resource multiplex technology (MU MIMO technology) are irrelevant.This scheduler and dispatching method are just realized the resource that multiplexing other up channels of HSUPA UE that the present invention proposes take.Particularly, other up channels comprise: idle all up channels such as ascending resource, non-scheduled E-PUCH, SPS E-PUCH, UL DPCH, HS-SICH, PRACH and E-RUCCH.Above-mentioned other up channels can form multiple channel combination or resource type combination.The scheduler proposed in the present embodiment and dispatching method are selected a kind of in above-mentioned multiple channel combination or resource type combination, for the various resources that realize that HSUPAUE is used scheduling E-PUCH resource and selecteed combination to comprise.Such as, the combination of selecting comprises: when idle ascending resource, non-scheduled E-PUCH and SPS E-PUCH, the scheduler in the present embodiment and dispatching method configure for realizing that HSUPA UE is used by RNC the resource formed to the resource in the E-PUCH resource pool of NODEB and idle ascending resource.

The resource taken for multiplexing other up channels of HSUPA UE, and do not carry out the scene of resource multiplex between HSUPA UE, the scheduler of the present embodiment and the performing step of dispatching method are as follows:

Step 601: determine each up channel that HSUPA UE can be multiplexing (idle ascending resource is considered as to a kind of special up channel).The scheduling of HSUPA scheduler start-up period.In any one subframe (n) subsequently, the HSUPA scheduler carries out a HSUPA scheduling.

In any subframe (n subframe), the scheduling flow bag following steps of HSUPA scheduler:

Step 601-1: determine the uplink scheduling resource pool.

Uplink scheduling resource pool in current subframe " n " HSUPA scheduler schedules (n+d1+2) subframe.In the n+d1+2 subframe, the resource that the uplink scheduling resource pool is taken by " n+d1+2 " subframe scheduling E-PUCH resource and all kinds of up channels that can be re-used forms.

According to above-mentioned processing, in step 601, determine can be multiplexing channel for determining the uplink scheduling resource pool of " n+d1+2 " subframe that each subframe " n " is used.But, may be in different application scenarioss at different subframe NODEB.Can pre-define plurality of application scenes, and be the channel combination that every kind of scene setting can be multiplexing.When each subframe " n " forms " n+d1+2 " subframe uplink scheduling resource pool, judge the satisfied scene of " n+d1+2 " subframe, then adopt channel definite under this scene to constitute the uplink scheduling resource pool of this subframe.The constructive method of this uplink scheduling resource pool is more flexible.

Step 601-2: determine the UE that can be scheduled in current subframe, then determine the dispatching priority of each UE that can be scheduled.According to priority, order is from high to low queued up UE.

Step 601-3: E-AGCH available on this carrier wave is set.

Step 601-4: from dispatching priority, the highest UE starts scheduling.Scheduling step to each UE is as follows:

Step 601-4-1: from this carrier wave can with E-AGCH select an E-AGCH to distribute to this UE.

Step 601-4-2: the E-PUCH resource that definite UE be scheduled can use.

When in step 601, definite up channel comprises up channel in addition of idle ascending resource (idle ascending resource be regarded as a kind of special up channel here), determine as follows the E-PUCH resource that this UE can use in the uplink scheduling resource pool, then carry out next step.While not comprising the up channel beyond idle ascending resource in definite up channel in step 601, think: all resources in the uplink scheduling resource pool are all the available resources of this UE, then, carry out next step.

For any one up channel beyond the ascending resource of the free time that in (n+d1+2) subframe, the uplink scheduling resource pool comprises, determine that this up channel is idle or carries the signal of which UE.If this channel idle, the resource of this channel occupancy can be used by UE.Otherwise, the correlation between the wireless channel of the UE carried on the wireless channel of the UE that investigation is scheduled and this up channel.If the wireless channel correlation between these two UE a little less than, just think the ascending resource that this UE be scheduled can be used this up channel to take.If the wireless channel correlation between these two UE is stronger, just think the ascending resource that this UE be scheduled can't be used this up channel to take.When resource that UE can't be used a up channel to take, from the uplink scheduling resource pool, by this up channel, shared resource is removed.When the UE be scheduled is exactly the UE carried on this up channel, directly from the uplink scheduling resource pool by this up channel shared resource remove.

Step 601-4-3: from this UE can with the E-PUCH resource select a part of resource to distribute to UE, as the E-PUCH of UE.

This UE can with the ascending resource pond in select a rectangle resource that is no more than the UE ability, this resource is distributed to this UE, as the scheduling E-PUCH of this UE.The data volume of the UE of this rectangle resource bearing is maximum in all rectangle resources.

Concrete distributes the method for the E-PUCH that meets above-mentioned condition can continue to use the method in pertinent literature to UE.

Also can by this UE can with the E-PUCH division of resources become two child resources.Described in embodiment mono-.Then, distribute E-PUCH based on two child resources to UE.

Step 601-4-4: from the E-HICH set of UE, select an E-HICH to distribute to UE.

Step 601-4-5: adopt default training sequence deviation configuration mode, to UE, distribute training sequence deviation.

According to the shared channel code of the E-PUCH that distributes to this UE, look into the mapping relations between each training sequence deviation and OVSF channel code under default training sequence deviation configuration mode, determine the training sequence deviation that this channel code is corresponding, if this training sequence deviation has been assigned to other UE or up channel, failed to the scheduling of this UE: or re-execute step 601-4-3, distribute a less E-PUCH resource to UE; Perhaps finish the scheduling to this UE, start next UE in the dispatching priority queue.To the scheduling of next UE from above-mentioned steps 601-4-1.

Step 601-4-6: after being successfully UE distribution E-AGCH, E-PUCH, E-HICH and a training sequence deviation, show: this UE is successfully dispatched.The E-AGCH that distributes to this UE is arranged to " unavailable ", makes other UE can not re-use this E-AGCH; In the uplink scheduling resource pool, the resource that the E-PUCH that distributes to this UE is taken is arranged to unavailable, makes other UE can not re-use the resource of distributing to this UE.Above-mentioned processing shows: do not have resource multiplex between HSUPA UE.

Step 601-4-7: if available E-AGCH is arranged, and in the uplink scheduling resource pool, available resource is arranged, just start next UE in the dispatching priority queue.Otherwise, finish the scheduling in current subframe.To the scheduling of next UE from step 601-4-1.

Step 601-4-8: to each UE successfully dispatched, by distributing to E-AGCH, the E-PUCH of this UE and the information of E-HICH, send to physical layer.

The UE that each is scheduled, the E-AGCH that at first physical layer will distribute to this UE in the n+d1 subframe sends to UE; Then receive in the n+d1+2 subframe E-PUCH that this UE sends; Finally, by the E-HICH that distributes to this UE, the ACK/NACK information of E-PUCH is fed back to this UE in the n+d1+2+d subframe.

The resource can multiplexing other up channels taken due to UE, may cause: the channel code number of participating in the SF=16 of joint-detection at some ascending time slots is greater than the joint-detection ability of NODEB, therefore, when the joint-detection limited ability of NODEB, in above-mentioned steps 601-4-3, after to UE, distributing E-PUCH or before, need the operation described in increase similar embodiment two, embodiment tri-, embodiment five and embodiment six.

The embodiment of the present invention nine proposes a kind of HSUPA scheduler that adopts MU MIMO technology, and described scheduler comprises:

The resource pool module, for determine the multiplexing uplink scheduling resource pool of user equipment (UE) of the subframe that is scheduled in current subframe, described uplink scheduling resource pool at least comprises a kind of in other ascending resources beyond the scheduling E-PUCH resource, and other ascending resources beyond described scheduling E-PUCH resource comprise: up idling-resource, UL DPCH resource, non-scheduled E-PUCH resource, semi-persistent scheduling SPS E-PUCH resource, HS-SICH resource, PRACH resource and E-RUCCH resource;

The multiplexing number module, for determining the maximum multiplexing number of every kind of ascending resource of described uplink scheduling resource pool; If total K kind ascending resource in the uplink scheduling resource pool, wherein the maximum multiplexing number of k kind ascending resource is denoted as Q _k, k, K are natural number, and k≤K;

Resource distribution module, select one as current UE for the UE never be scheduled, from described uplink scheduling resource pool, select a part of ascending resource to distribute to current UE as the scheduling E-PUCH of UE, and multiplexing number corresponding to ascending resource be assigned with subtracted to 1.

Preferably, described resource pool module comprises:

The corresponding relation table unit, the mapping table of the application scenarios set in advance for storage and predefine uplink scheduling resource pool;

Query unit, for determining the application scenarios of the subframe that is scheduled, search described mapping table according to described application scenarios, obtains corresponding predefine uplink scheduling resource pool; And using the described predefine uplink scheduling resource pool uplink scheduling resource pool multiplexing as the UE of the subframe that is scheduled.Preferably, the E-AGCH more than 1 is arranged on the HSUPA carrier wave, described predefined uplink scheduling resource pool by the scheduling E-PUCH resource and as follows any one ascending resource constitute:

Combination a1: idle ascending resource;

Combination a2: non-scheduled E-PUCH resource and SPS E-PUCH resource;

Combination a3: idle ascending resource, non-scheduled E-PUCH resource and SPS E-PUCH resource;

Combination a4: idle ascending resource, non-scheduled E-PUCH resource, SPS E-PUCH resource and UL DPCH resource; Perhaps

Combination a5: idle ascending resource, non-scheduled E-PUCH resource, SPS E-PUCH resource, UL DPCH resource, HS-SICH resource, PRACH resource and E-RUCCH resource.

Wherein, if current subframe is the n subframe, the subframe that is scheduled is the n+d1+2 subframe; D1 means that base station carries out the time delay of HSUPA scheduling, the subframe that this time delay sends for the E-AGCH that gives the UE be scheduled in current sub-frame allocation and the timing difference between current subframe.

Preferably, described multiplexing number module comprises:

Initialization unit, be used for according to determined uplink scheduling resource pool, the multiplexing form of initialization uplink scheduling resource pool, in this form, j is listed as in the corresponding uplink scheduling resource pool of the capable element of i i node in j time slot, j is listed as the value z (j of the element that i is capable, i) mean in the uplink scheduling resource pool that in j time slot, i node can be shared in MU MIMO mode by the individual UE of z (j, i); I means node number, i=0, and 1 ..., 30; J means j time slot of uplink scheduling resource pool, j=1 ..., N; N is the shared time slot sum of uplink scheduling resource pool; t _jtimeslot number for j time slot in the uplink scheduling resource pool.

Preferably, described initialization unit comprises:

The first judgment sub-unit, for judging that the uplink scheduling resource pool is at time slot t _jwhether comprise channel code c, if, enable the first initialization subelement, otherwise, enable the second initialization subelement;

The first initialization subelement, for determining node i corresponding to this channel code c; When if this channel code is the channel code that in ULDPCH, non-scheduled E-PUCH, SPS E-PUCH, HS-SICH, PRACH and E-RUCCH, any one up channel takies, j in above table is listed as to the maximum multiplexing number that the i row element is initialized as respective channels and subtracts 1; If this channel code is the channel code that scheduling E-PUCH takies, j in above table is listed as to the maximum multiplexing number that the i row element is initialized as scheduling E-PUCH; Enable the 3rd initialization subelement after being finished;

The second initialization unit, for determining node i corresponding to this channel code c, be listed as the i row element by j in form and be initialized as 0, that is: z (j, i)=0; Determine all father nodes of node i, the corresponding j of any one father node v of node i is listed as to the v row element and is initialized as 0, that is: z (j, v)=0; Enable the 3rd initialization subelement after being finished;

The 3rd initialization subelement, determine time slot t _jinterior 16 nodes corresponding with the channel code of 16 SF=16, for any one node wherein, if the element in the corresponding form of this node is not initialised, but, the element that the father node of this node is corresponding is initialised, and just by this node, corresponding element is initialized as the element corresponding with its father node and has identical numerical value; Enable the 4th initialization unit after being finished;

The 4th initialization unit, for being listed as by j the minimum value that the element not yet be initialised is initialized as the corresponding element of all child nodes of the node that this element is corresponding.

Preferably, this scheduler further comprises: priority block, and for the UE that determines that current subframe can be scheduled, and the dispatching priority of definite each UE that can be scheduled;

Selecting one in the UE that described resource distribution module never is scheduled as current UE is: resource distribution module is according to the dispatching priority of the determined UE of priority block, the UE that can be scheduled from current subframe, select UE that the priority not yet be scheduled is the highest as current UE.

Described resource distribution module comprises:

The first resource allocation units, for from the uplink scheduling resource pool, selecting a rectangle resource that is no more than the UE ability, the data volume of the UE of this rectangle resource bearing is greater than the data volume that in this uplink scheduling resource pool, other each rectangle resources can be carried, and this rectangle resource is distributed to described UE.

Described resource distribution module comprises:

The Secondary resource allocation units, for the scheduling E-PUCH resource using the uplink scheduling resource pool as the first child resource pond, using the resource except the first child resource pond in the uplink scheduling resource pool as the second child resource pond; Determine respectively the rectangle resource that is no more than described UE ability in described two sub-resource pools, the data volume of the UE that the above-mentioned rectangle resource of determining in each child resource pond can be carried is greater than the data volume that in this child resource pond, other each rectangle resources can be carried; The data volume of more described two rectangle resource bearings, distribute to current UE by wherein carrying a more rectangle resource of data volume; If the data volume of two rectangle resource bearings is identical, select at random a rectangle resource to distribute to current UE, or, select to comprise that the less rectangle resource of channel code number of SF=16 distributes to current UE.

Preferably, described resource distribution module further comprises:

The correlation judging unit, whether the arbitrary ascending resource that is used for the uplink scheduling resource pool of definite subframe that is scheduled has carried the 2nd UE, calculate the correlation between the wireless channel of described current UE and described the 2nd UE, judge whether described correlation is more than or equal to predefined relevance threshold, if from the uplink scheduling resource pool, remove ascending resource corresponding to described the 2nd UE.

Preferably, described correlation judging unit further comprises:

The first correlation computing unit, for the instantaneous value of channel estimating of the up channel that obtains p subframe the 2nd UE or the recursive average of channel estimating, the instantaneous value of the channel estimating that this value is the up-to-date up channel reported of the 2nd UE or the recursive average of channel estimating; In each subframe of the instantaneous value of channel estimating that the p subframe is the up channel that can obtain the 2nd UE or the recursive average of channel estimating before current subframe and the nearest subframe of the current subframe of distance; Obtain the instantaneous value of the channel estimating of the up channel of current UE in the q subframe or the recursive average of channel estimating, this value is the instantaneous value of the channel estimating of the up-to-date up channel reported of current UE or the recursive average of channel estimating; In each subframe of the instantaneous value of channel estimating that the q subframe is the up channel that can obtain current UE or the recursive average of channel estimating before current subframe and the nearest subframe of the current subframe of distance;

According to instantaneous value or the recursive average of the channel estimating of described current UE and the 2nd UE, according to following formula, calculate wireless channel correlation between current UE and the 2nd UE:

$\mathrm{\&rho;}=\frac{\left|\underset{k=1}{\overset{K_a}{\mathrm{\&Sigma;}}}\underset{w=1}{\overset{W}{\mathrm{\&Sigma;}}}{h}_{x,k,w}{h}_{y,k,w}^{*}\right|}{\left|h_x\right|\&CenterDot;\left|h_y\right|};$

In above formula, K _athe number that means the base station reception antenna;

the instantaneous value or the recursive average that mean the up-to-date channel estimating reported of current UE,

instantaneous value or the recursive average of the channel estimating on the k root antenna of expression current UE, W means that the window of channel estimating is long;

the instantaneous value or the recursive average that mean the up-to-date channel estimating reported of the 2nd UE,

the instantaneous value or the recursive average that mean the channel estimating of the 2nd UE on k root antenna; | h _x| and | h _y| mean respectively h _xand h _ymould.

Perhaps, described correlation judging unit further comprises:

The second correlation computing unit, have the down beam shaping DLBF weight vector of the 2nd UE of at least one up channel for obtaining the p subframe, this DLBF weight vector is the up-to-date DLBF weight vector reported of the 2nd UE; In each subframe of DLBF weight vector that the p subframe is the up channel that can obtain the 2nd UE before current subframe and the nearest subframe of the current subframe of distance; Obtain the DLBF weight vector that the q subframe has the current UE of at least one up channel, this DLBF weight vector is the up-to-date DLBF weight vector reported of current UE; In each subframe of DLBF weight vector that the q subframe is the up channel that can obtain current UE before current subframe and the nearest subframe of the current subframe of distance;

According to the DLBF weight vector of described current UE and the 2nd UE, calculate the wireless channel correlation between current UE and the 2nd UE:

$\mathrm{\&rho;}=\frac{\left|\underset{i=1}{\overset{K_a}{\mathrm{\&Sigma;}}}{x}_i{y}_i^{*}\right|}{\left|x\right|\&CenterDot;\left|y\right|};$

In above formula, | x| and | y| means respectively the mould of vector x and vector y; Vector x and vector y mean respectively the DLBF weight vector of current UE and the DLBF weight vector of the 2nd UE.

Preferably, described scheduler further comprises:

The training sequence deviation distribution module, for after described resource distribution module is to current UE allocation schedule E-PUCH, distribute training sequence deviation to current UE.

Described training sequence deviation distribution module comprises:

Grouped element, for all training sequence deviation in community are divided into groups, every group of interior training sequence deviation and channel code has predefined mapping relations;

Idle training sequence deviation selected cell, the channel code taken for definite scheduling E-PUCH of distributing to UE, from described each training sequence deviation grouping, selecting one in the training sequence deviation corresponding with this channel code does not have occupied training sequence deviation;

Allocation units, for selected training sequence deviation is distributed to described UE, and be labeled as described training sequence deviation and take.

Described training sequence deviation distribution module comprises:

The mapping relations dispensing unit, for the mapping relations between pre-configured training sequence deviation and channel code;

Search and allocation units, the channel code taken for definite scheduling E-PUCH of distributing to UE, search the training sequence deviation that described channel code is shone upon, and judges that whether described training sequence deviation is occupied, if, according to this UE is dispatched unsuccessfully and processed; Otherwise, described training sequence deviation is distributed to described UE, and described training sequence deviation is labeled as and takies.

Described resource distribution module further comprises:

The first joint-detection ability judging unit, be used at resource distribution module after a part of ascending resource of uplink scheduling resource pool selection is distributed to current UE, the channel code number that the joint-detection the ability whether ascending resource that judgement has distributed in the subframe that is scheduled causes the channel code of the spreading factor SF=16 that participates in joint-detection to outnumber base station can be supported, if surpass, resource distribution module reselects less ascending resource and distributes to current UE from the uplink scheduling resource pool, and multiplexing number corresponding to ascending resource be assigned with subtracted to 1; If do not surpass, resource distribution module subtracts 1 by multiplexing number corresponding to ascending resource be assigned with.

Described resource distribution module further comprises:

The second joint-detection ability judging unit, before at resource distribution module, from a part of ascending resource of uplink scheduling resource pool selection, distributing to current UE, calculate the channel code number of the SF=16 of the ascending resource equivalence distributed in any one time slot comprised at the subframe uplink scheduling resource pool that is scheduled, whether judgement equals at the described channel code number of this time slot the channel code number that base stations united detectability can be supported, if, to no longer dispatch any UE at this time slot, otherwise, the number of the channel code of the SF=16 of the participation joint-detection that calculating can also be supported at this time slot in the subframe that is scheduled, if each time slot at the subframe uplink scheduling resource pool that is scheduled can not be dispatched UE again, finish the scheduling to current subframe, otherwise, describedly from the uplink scheduling resource pool, select a part of ascending resource to distribute to described in current UE a part of ascending resource of distributing to UE need to meet following condition at the channel code number of the SF=16 of each time slot equivalence: the number of channel code that is less than or equal to the SF=16 of the participation joint-detection that the time slot of the calculated subframe that is scheduled can also support, after meeting the ascending resource of above-mentioned requirements to the current UE of being scheduled distribution, resource distribution module subtracts 1 by the described multiplexing number that the ascending resource be assigned with is corresponding.

Described resource distribution module further comprises: the first channel resource judging unit, for before the first joint-detection ability judging unit is carried out described judgement, judge described uplink scheduling resource pool, whether each ascending time slot of the subframe that is scheduled exists other channels outside scheduling E-PUCH resource, idle ascending resource and predefined permission channel, if enable the first joint-detection ability judging unit; Otherwise, do not enable the first joint-detection ability judging unit.

Described resource distribution module further comprises:

The second channel judging unit, for for before carrying out described judgement at the second joint-detection ability judging unit, judge whether described uplink scheduling resource pool exists other channels outside scheduling E-PUCH resource, idle ascending resource and predefined permission channel at each ascending time slot of the subframe that is scheduled, if enable the second joint-detection ability judging unit; Otherwise do not enable the second joint-detection ability judging unit.

The foregoing is only preferred embodiment of the present invention, in order to limit the present invention, within the spirit and principles in the present invention not all, any modification of making, be equal to replacement, improvement etc., within all should being included in the scope of protection of the invention.

Claims (43)

1. a high speed uplink bag access HSUPA dispatching method that adopts multi-user's multiple-input and multiple-output MU MIMO technology, is characterized in that, comprises the steps:

A, in current subframe, determine the multiplexing uplink scheduling resource pool of user equipment (UE) of the subframe that is scheduled, described uplink scheduling resource pool at least comprises a kind of in other ascending resources beyond scheduling enhanced dedicated channel physical uplink channel E-PUCH resource, other ascending resources beyond described scheduling E-PUCH resource comprise: up idling-resource, uplink special physical channel UL DPCH resource, non-scheduled E-PUCH resource, semi-persistent scheduling SPS E-PUCH resource, high-speed shared information channel HS-SICH resource, the random access ascending control channel E-RUCCH resource of Physical Random Access Channel PRACH resource and enhancing,

B, determine the maximum multiplexing number of every kind of ascending resource in described uplink scheduling resource pool; If total K kind ascending resource in the uplink scheduling resource pool, wherein the maximum multiplexing number of k kind ascending resource is denoted as Q _k, k, K are natural number, and k≤K;

Select one in C, the UE that never is scheduled as current UE, from the uplink scheduling resource pool, select a part of ascending resource to distribute to current UE as the scheduling E-PUCH of UE, and multiplexing number corresponding to ascending resource be assigned with subtracted to 1;

D, judge whether the UE be not scheduled in addition, if return to step C; Otherwise, using next subframe as current subframe, return to steps A.

2. method according to claim 1, is characterized in that, sets in advance the mapping table of application scenarios and predefine uplink scheduling resource pool;

Steps A comprises: determine the application scenarios of the subframe that is scheduled, according to described application scenarios, search described mapping table, obtain corresponding predefine uplink scheduling resource pool; And

Using the described predefine uplink scheduling resource pool uplink scheduling resource pool multiplexing as the UE of the subframe that is scheduled.

3. method according to claim 2, is characterized in that, the E-AGCH more than 1 is arranged on the HSUPA carrier wave, described predefined uplink scheduling resource pool by the scheduling E-PUCH resource and as follows any one ascending resource constitute:

Combination a1: idle ascending resource;

Combination a2: non-scheduled E-PUCH resource and SPS E-PUCH resource;

Combination a3: idle ascending resource, non-scheduled E-PUCH resource and SPS E-PUCH resource;

Combination a4: idle ascending resource, non-scheduled E-PUCH resource, SPS E-PUCH resource and UL DPCH resource; Perhaps

Combination a5: idle ascending resource, non-scheduled E-PUCH resource, SPS E-PUCH resource, UL DPCH resource, HS-SICH resource, PRACH resource and E-RUCCH resource.

4. method according to claim 1, is characterized in that, in the described uplink scheduling resource pool of step B, the maximum multiplexing number unification of every kind of ascending resource is set to identical numerical value Q.

5. method according to claim 1, it is characterized in that, the number that strengthens dedicated channel absolute grant channel E-AGCH on the HSUPA carrier wave is 1, the maximum multiplexing number of scheduling E-PUCH resource is 1, the multiplexing number of the other kinds resource that the uplink scheduling resource pool comprises is 2 or is greater than 2 positive integer, and the multiplexing number of up idling-resource is 1 or is greater than 1 positive integer.

6. method according to claim 1, it is characterized in that, on the HSUPA carrier wave, the number of E-AGCH is a plurality of, the maximum multiplexing number of scheduling E-PUCH resource is 1, the multiplexing number of the other kinds resource that the uplink scheduling resource pool comprises is 2 or is greater than 2 positive integer, and the multiplexing number of up idling-resource is 1 or is greater than 1 positive integer.

7. method according to claim 1, is characterized in that, if current subframe is the n subframe, the subframe that is scheduled is the n+d1+2 subframe; D1 means that base station carries out the time delay of HSUPA scheduling, the subframe that this time delay sends for the E-AGCH that gives the UE be scheduled in current sub-frame allocation and the timing difference between current subframe.

8. method according to claim 1, is characterized in that, step B comprises:

According to determined uplink scheduling resource pool, the multiplexing form of initialization uplink scheduling resource pool, in this form, j is listed as in the corresponding uplink scheduling resource pool of the capable element of i i node in j time slot, j is listed as the value z (j of the element that i is capable, i) mean in the uplink scheduling resource pool that in j time slot, i node can be shared in MU MIMO mode by the individual UE of z (j, i); I means node number, i=0, and 1 ..., 30; J means j time slot of uplink scheduling resource pool, j=1 ..., N; N is the shared time slot sum of uplink scheduling resource pool; t _jtimeslot number for j time slot in the uplink scheduling resource pool.

9. method according to claim 8, is characterized in that, the multiplexing form of described initialization uplink scheduling resource pool comprises:

B1, judgement uplink scheduling resource pool are at time slot t _jwhether comprise channel code c, if, execution step B2, otherwise execution step B3;

B2, determine node i corresponding to this channel code c; When if this channel code is the channel code that in UL DPCH, non-scheduled E-PUCH, SPS E-PUCH, HS-SICH, PRACH and E-RUCCH, any one up channel takies, j in above table is listed as to the maximum multiplexing number that the i row element is initialized as the respective channels resource and subtracts 1; If the channel code that this channel code is the scheduling E-PUCH resource occupation, be listed as by j in above table the maximum multiplexing number that the i row element is initialized as the scheduling E-PUCH resource; If this channel code is the channel code that idle ascending resource takies, j in above table is listed as to the maximum multiplexing number that the i row element is initialized as idle ascending resource; Then perform step B4;

B3, determine node i corresponding to this channel code c, j in form is listed as to the i row element and is initialized as 0, that is: z (j, i)=0; Determine all father nodes of node i, the corresponding j of any one father node v of node i is listed as to the v row element and is initialized as 0, that is: z (j, v)=0; Then perform step B4;

B4, determine time slot t _jinterior 16 nodes corresponding with the channel code of 16 SF=16, for any one node wherein, if the element in the corresponding form of this node is not initialised, but, the element that the father node of this node is corresponding is initialised, and just by this node, corresponding element is initialized as the element corresponding with its father node and has identical numerical value;

B5, for the element not yet be initialised in j row, it is initialized as to the minimum value of the corresponding element of all child nodes of the node that this element is corresponding.

10. method according to claim 1, is characterized in that, before described steps A, further comprises: determine the UE that current subframe can be scheduled, and determine the dispatching priority of each UE that can be scheduled;

Selecting one in the described UE never be scheduled of step C as current UE is: the UE that can be scheduled from current subframe, select UE that the priority that not yet is scheduled is the highest as current UE.

11. method according to claim 1, is characterized in that, step C is described to be selected a part of ascending resource to distribute to current UE to comprise from the uplink scheduling resource pool:

Select a rectangle resource that is no more than the UE ability from the uplink scheduling resource pool, the data volume of the UE of this rectangle resource bearing is greater than the data volume that in this uplink scheduling resource pool, other each rectangle resources can be carried, and this rectangle resource is distributed to described UE.

12. method according to claim 1, is characterized in that, step C is described to be selected a part of ascending resource to distribute to current UE to comprise from the uplink scheduling resource pool:

Using the scheduling E-PUCH resource in the uplink scheduling resource pool as the first child resource pond, using the resource except the first child resource pond in the uplink scheduling resource pool as the second child resource pond;

Determine respectively the rectangle resource that is no more than described UE ability in described the first child resource pond and the second child resource pond, the data volume of the UE that the above-mentioned rectangle resource of determining in each child resource pond can be carried is greater than the data volume that in this child resource pond, other each rectangle resources can be carried; The data volume of the rectangle resource bearing that is no more than described UE ability of determining in the rectangle resource that is no more than described UE ability of determining in more described the first child resource pond and the second child resource pond, distribute to current UE by wherein carrying a more rectangle resource of data volume; If the rectangle resource that is no more than described UE ability of determining in the first child resource pond is identical with the data volume of the rectangle resource bearing that is no more than described UE ability of determining in the second child resource pond, select at random a rectangle resource to distribute to current UE, perhaps, select to comprise that the less rectangle resource of channel code number of SF=16 distributes to current UE.

13. according to the described method of claim 1 to 12 any one, it is characterized in that, step C is described to be selected before a part of ascending resource distributes to current UE, further to comprise from the uplink scheduling resource pool:

Whether arbitrary ascending resource of determining the uplink scheduling resource pool in the subframe that is scheduled has carried the 2nd UE, calculate the correlation between the wireless channel of described current UE and described the 2nd UE, judge whether described correlation is more than or equal to predefined relevance threshold, if from the uplink scheduling resource pool, remove ascending resource corresponding to described the 2nd UE.

14. method according to claim 13, is characterized in that, the correlation between the wireless channel of the described current UE of described calculating and described the 2nd UE comprises:

Obtain the instantaneous value of channel estimating of up channel of p subframe the 2nd UE or the recursive average of channel estimating, the instantaneous value of the channel estimating that this value is the up-to-date up channel reported of the 2nd UE or the recursive average of channel estimating; In each subframe of the instantaneous value of channel estimating that the p subframe is the up channel that can obtain the 2nd UE or the recursive average of channel estimating before current subframe and the nearest subframe of the current subframe of distance;

Obtain the instantaneous value of the channel estimating of the up channel of current UE in the q subframe or the recursive average of channel estimating, this value is the instantaneous value of the channel estimating of the up-to-date up channel reported of current UE or the recursive average of channel estimating; In each subframe of the instantaneous value of channel estimating that the q subframe is the up channel that can obtain current UE or the recursive average of channel estimating before current subframe and the nearest subframe of the current subframe of distance;

According to instantaneous value or the recursive average of the channel estimating of described current UE and the 2nd UE, according to following formula, calculate wireless channel correlation between current UE and the 2nd UE:

$\mathrm{\&rho;}=\frac{\left|\underset{k=1}{\overset{K_a}{\mathrm{\&Sigma;}}}\underset{w=1}{\overset{W}{\mathrm{\&Sigma;}}}{h}_{x,k,w}{h}_{y,k,w}^{*}\right|}{\left|h_x\right|\&CenterDot;\left|h_y\right|};$

In above formula, K _athe number that means the base station reception antenna;

the instantaneous value or the recursive average that mean the up-to-date channel estimating reported of current UE,

instantaneous value or the recursive average of the channel estimating on the k root antenna of expression current UE, W means that the window of channel estimating is long;

the instantaneous value or the recursive average that mean the up-to-date channel estimating reported of the 2nd UE,

the instantaneous value or the recursive average that mean the channel estimating of the 2nd UE on k root antenna; | h _x| and | h _y| mean respectively h _xand h _ymould.

15. method according to claim 13, is characterized in that, the correlation between the wireless channel of the described current UE of described calculating and described the 2nd UE comprises:

Obtain the down beam shaping DLBF weight vector that the p subframe has the 2nd UE of at least one up channel, this DLBF weight vector is the up-to-date DLBF weight vector reported of the 2nd UE; In each subframe of DLBF weight vector that the p subframe is the up channel that can obtain the 2nd UE before current subframe and the nearest subframe of the current subframe of distance;

Obtain the DLBF weight vector that the q subframe has the current UE of at least one up channel, this DLBF weight vector is the up-to-date DLBF weight vector reported of current UE; In each subframe of DLBF weight vector that the q subframe is the up channel that can obtain current UE before current subframe and the nearest subframe of the current subframe of distance;

According to the DLBF weight vector of described current UE and the 2nd UE, calculate the wireless channel correlation between current UE and the 2nd UE:

$\mathrm{\&rho;}=\frac{\left|\underset{i=1}{\overset{K_a}{\mathrm{\&Sigma;}}}{x}_i{y}_i^{*}\right|}{\left|x\right|\&CenterDot;\left|y\right|};$

In above formula, K _athe number that means the base station reception antenna, | x| and | y| means respectively the mould of vector x and vector y; Vector x and vector y mean respectively the DLBF weight vector of current UE and the DLBF weight vector of the 2nd UE, x _ii the component that means vector x, y _ii the component that means vector y.

16. method according to claim 13, is characterized in that, the described multiplexing number that the ascending resource be assigned with is corresponding of step C further comprises after subtracting 1:

Distribute training sequence deviation to current UE.

17. method according to claim 16, is characterized in that, describedly to current UE, distributes training sequence deviation to comprise:

All training sequence deviation groupings in community are obtained to a plurality of training sequence deviation groups, and training sequence deviation and channel code in each training sequence deviation group have predefined mapping relations;

The channel code that definite scheduling E-PUCH of distributing to UE takies, from described a plurality of training sequence deviation groups, selecting one in the training sequence deviation corresponding with this channel code does not have occupied training sequence deviation;

Selected training sequence deviation is distributed to described UE, and described training sequence deviation is labeled as and takies.

18. method according to claim 16, is characterized in that, the mapping relations between pre-configured training sequence deviation and channel code;

Describedly to current UE, distribute training sequence deviation to comprise:

The channel code that definite scheduling E-PUCH of distributing to UE takies, search the training sequence deviation that described channel code is shone upon, and judges that whether described training sequence deviation is occupied, if, according to this UE is dispatched unsuccessfully and processed; Otherwise, described training sequence deviation is distributed to described UE, and described training sequence deviation is labeled as and takies.

19. method according to claim 18, it is characterized in that, described according to this UE is dispatched unsuccessfully and is treated to: as to reselect less ascending resource and distribute to current UE from the uplink scheduling resource pool, and return to the described multiplexing number that the ascending resource be assigned with is corresponding and subtract 1 step; Perhaps directly return to step C.

20. according to the described method of claim 1 to 12 any one, it is characterized in that, step C is described to be selected after a part of ascending resource distributes to current UE, further to comprise from the uplink scheduling resource pool:

The channel code number that the joint-detection the ability whether ascending resource that C1, judgement have distributed in the subframe that is scheduled causes the channel code of the spreading factor SF=16 that participates in joint-detection to outnumber base station can be supported, if surpass, from the uplink scheduling resource pool, reselect less ascending resource and distribute to current UE, and return described in step C multiplexing number corresponding to ascending resource be assigned with subtracted to 1 step, or directly return to step C; If do not surpass, return described in step C multiplexing number corresponding to ascending resource be assigned with subtracted to 1 step.

21. according to the described method of claim 1 to 12 any one, it is characterized in that, step C is described to be selected before a part of ascending resource distributes to current UE, further to comprise from the uplink scheduling resource pool:

The channel code number of the SF=16 of the ascending resource equivalence distributed in any one time slot that C2, calculating comprise at the subframe uplink scheduling resource pool that is scheduled; Whether judgement equals at the described channel code number of this time slot the channel code number that base stations united detectability can be supported, if, to no longer dispatch any UE at this time slot, if not, calculate the number of channel code of the SF=16 of the participation joint-detection that can also support at this time slot in the subframe that is scheduled, if each time slot at the subframe uplink scheduling resource pool that is scheduled can not be dispatched UE again,, using next subframe as current subframe, return to steps A; Otherwise, describedly from the uplink scheduling resource pool, select a part of ascending resource to distribute to described in current UE a part of ascending resource of distributing to UE need to meet following condition at the channel code number of the SF=16 of each time slot equivalence: the number of channel code that is less than or equal to the SF=16 of the participation joint-detection that the time slot of the calculated subframe that is scheduled can also support; In the ascending resource of meeting above-mentioned condition to the current UE of being scheduled distribution returns to step C later, the described multiplexing number that the ascending resource be assigned with is corresponding is subtracted to 1 step.

22. method according to claim 20, is characterized in that, before described step C1, further comprises:

Judge whether described uplink scheduling resource pool exists other channels outside scheduling E-PUCH resource, idle ascending resource and predefined permission channel at each ascending time slot of the subframe that is scheduled, if, carry out described step C1, otherwise go to the described multiplexing number that the ascending resource be assigned with is corresponding, subtract 1 step.

23. method according to claim 21, is characterized in that, before described step C2, further comprises:

Judge whether described uplink scheduling resource pool exists other channels outside scheduling E-PUCH resource, idle ascending resource and predefined permission channel at each ascending time slot of the subframe that is scheduled, if after carrying out described step C2, then perform step C; Otherwise directly perform step C.

24. a high speed uplink bag access HSUPA dispatching method that adopts MU MIMO technology, is characterized in that, comprises the steps:

A2, in current subframe, determine the multiplexing uplink scheduling resource pool of user equipment (UE) of the subframe that is scheduled, described uplink scheduling resource pool is comprised of up idling-resource and scheduling E-PUCH resource; Definite UE that can be scheduled and the dispatching priority of each described UE that can be scheduled; E-AGCH available on carrier wave is set;

The UE that in b2, the UE that never is scheduled, selection scheduling priority is the highest is as current UE;

C2, select an available E-AGCH to distribute to current UE;

D2, from the uplink scheduling resource pool, select a part of resource to distribute to UE, as the E-PUCH of UE;

E2, from the E-HICH of UE set, select an E-HICH to distribute to UE;

F2, when being successfully, after UE distributes E-AGCH, E-PUCH and E-HICH, to be arranged to unavailable by the E-AGCH that distributes to this UE; The ascending resource that the scheduling E-PUCH of distributing this UE is taken is arranged to unavailable;

G2, judge whether to also have in available E-AGCH and uplink scheduling resource pool available resource is arranged, if, go to step b2, otherwise, using next subframe as current subframe, and go to step a2.

25. a high speed uplink bag access HSUPA scheduler that adopts multi-user's multiple-input and multiple-output MU MIMO technology, is characterized in that, described scheduler comprises:

The resource pool module, for determine the multiplexing uplink scheduling resource pool of user equipment (UE) of the subframe that is scheduled in current subframe, described uplink scheduling resource pool at least comprises a kind of in other ascending resources beyond scheduling enhanced dedicated channel physical uplink channel E-PUCH resource, other ascending resources beyond described scheduling E-PUCH resource comprise: up idling-resource, uplink special physical channel UL DPCH resource, non-scheduled E-PUCH resource, semi-persistent scheduling SPS E-PUCH resource, high-speed shared information channel HS-SICH resource, the random access ascending control channel E-RUCCH resource of Physical Random Access Channel PRACH resource and enhancing,

The multiplexing number module, for determining the maximum multiplexing number of every kind of ascending resource of described uplink scheduling resource pool; If total K kind ascending resource in the uplink scheduling resource pool, wherein the maximum multiplexing number of k kind ascending resource is denoted as Q _k, k, K are natural number, and k≤K;

Resource distribution module, select one as current UE for the UE never be scheduled, from described uplink scheduling resource pool, select a part of ascending resource to distribute to current UE as the scheduling E-PUCH of UE, and multiplexing number corresponding to ascending resource be assigned with subtracted to 1.

26. scheduler according to claim 25, is characterized in that, described resource pool module comprises:

The corresponding relation table unit, the mapping table of the application scenarios set in advance for storage and predefine uplink scheduling resource pool;

Query unit, for determining the application scenarios of the subframe that is scheduled, search described mapping table according to described application scenarios, obtains corresponding predefine uplink scheduling resource pool; And using the described predefine uplink scheduling resource pool uplink scheduling resource pool multiplexing as the UE of the subframe that is scheduled.

27. scheduler according to claim 26, is characterized in that, the E-AGCH more than 1 is arranged on the HSUPA carrier wave, described predefined uplink scheduling resource pool by the scheduling E-PUCH resource and as follows any one ascending resource constitute:

Combination a1: idle ascending resource;

Combination a2: non-scheduled E-PUCH resource and SPS E-PUCH resource;

Combination a3: idle ascending resource, non-scheduled E-PUCH resource and SPS E-PUCH resource;

Combination a4: idle ascending resource, non-scheduled E-PUCH resource, SPS E-PUCH resource and UL DPCH resource; Perhaps

Combination a5: idle ascending resource, non-scheduled E-PUCH resource, SPS E-PUCH resource, UL DPCH resource, HS-SICH resource, PRACH resource and E-RUCCH resource.

28. scheduler according to claim 25, is characterized in that, if current subframe is the n subframe, the subframe that is scheduled is the n+d1+2 subframe; D1 means that base station carries out the time delay of HSUPA scheduling, the subframe that this time delay sends for the E-AGCH that gives the UE be scheduled in current sub-frame allocation and the timing difference between current subframe.

29. scheduler according to claim 25, is characterized in that, described multiplexing number module comprises:

Initialization unit, be used for according to determined uplink scheduling resource pool, the multiplexing form of initialization uplink scheduling resource pool, in this form, j is listed as in the corresponding uplink scheduling resource pool of the capable element of i i node in j time slot, j is listed as the value z (j of the element that i is capable, i) mean in the uplink scheduling resource pool that in j time slot, i node can be shared in MU MIMO mode by the individual UE of z (j, i); I means node number, i=0, and 1 ..., 30; J means j time slot of uplink scheduling resource pool, j=1 ..., N; N is the shared time slot sum of uplink scheduling resource pool; t _jtimeslot number for j time slot in the uplink scheduling resource pool.

30. scheduler according to claim 29, is characterized in that, described initialization unit comprises:

The first judgment sub-unit, for judging that the uplink scheduling resource pool is at time slot t _jwhether comprise channel code c, if, enable the first initialization subelement, otherwise, enable the second initialization subelement;

The first initialization subelement, for determining node i corresponding to this channel code c; When if this channel code is the channel code that in ULDPCH, non-scheduled E-PUCH, SPS E-PUCH, HS-SICH, PRACH and E-RUCCH, any one up channel takies, j in above table is listed as to the maximum multiplexing number that the i row element is initialized as the respective channels resource and subtracts 1; If this channel code is the channel code that scheduling E-PUCH takies, j in above table is listed as to the maximum multiplexing number that the i row element is initialized as the scheduling E-PUCH resource; If this channel code is the channel code that up idling-resource takies, j in above table is listed as to the maximum multiplexing number that the i row element is initialized as up idling-resource; Enable the 3rd initialization subelement after being finished;

The second initialization unit, for determining node i corresponding to this channel code c, be listed as the i row element by j in form and be initialized as 0, that is: z (j, i)=0; Determine all father nodes of node i, the corresponding j of any one father node v of node i is listed as to the v row element and is initialized as 0, that is: z (j, v)=0; Enable the 3rd initialization subelement after being finished;

The 3rd initialization subelement, determine time slot t _jinterior 16 nodes corresponding with the channel code of 16 SF=16, for any one node wherein, if the element in the corresponding form of this node is not initialised, but, the element that the father node of this node is corresponding is initialised, and just by this node, corresponding element is initialized as the element corresponding with its father node and has identical numerical value; Enable the 4th initialization unit after being finished;

The 4th initialization unit, for being listed as by j the minimum value that the element not yet be initialised is initialized as the corresponding element of all child nodes of the node that this element is corresponding.

31. scheduler according to claim 25, is characterized in that, this scheduler further comprises: priority block, and for the UE that determines that current subframe can be scheduled, and the dispatching priority of definite each UE that can be scheduled;

Selecting one in the UE that described resource distribution module never is scheduled as current UE is: resource distribution module is according to the dispatching priority of the determined UE of priority block, the UE that can be scheduled from current subframe, select UE that the priority not yet be scheduled is the highest as current UE.

32. scheduler according to claim 25, is characterized in that, described resource distribution module comprises:

The first resource allocation units, for from the uplink scheduling resource pool, selecting a rectangle resource that is no more than the UE ability, the data volume of the UE of this rectangle resource bearing is greater than the data volume that in this uplink scheduling resource pool, other each rectangle resources can be carried, and this rectangle resource is distributed to described UE.

33. scheduler according to claim 25, is characterized in that, described resource distribution module comprises:

The Secondary resource allocation units, for the scheduling E-PUCH resource using the uplink scheduling resource pool as the first child resource pond, using the resource except the first child resource pond in the uplink scheduling resource pool as the second child resource pond; Determine respectively the rectangle resource that is no more than described UE ability in described the first child resource pond and the second child resource pond, the data volume of the UE that the above-mentioned rectangle resource of determining in each child resource pond can be carried is greater than the data volume that in this child resource pond, other each rectangle resources can be carried; The data volume of the rectangle resource bearing that is no more than described UE ability of determining in the rectangle resource that is no more than described UE ability of determining in more described the first child resource pond and the second child resource pond, distribute to current UE by wherein carrying a more rectangle resource of data volume; If the rectangle resource that is no more than described UE ability of determining in the first child resource pond is identical with the data volume of the rectangle resource bearing that is no more than described UE ability of determining in the second child resource pond, select at random a rectangle resource to distribute to current UE, perhaps, select to comprise that the less rectangle resource of channel code number of SF=16 distributes to current UE.

34. according to the described scheduler of claim 25 to 33 any one, it is characterized in that, described resource distribution module further comprises:

The correlation judging unit, whether the arbitrary ascending resource that is used for the uplink scheduling resource pool of definite subframe that is scheduled has carried the 2nd UE, calculate the correlation between the wireless channel of described current UE and described the 2nd UE, judge whether described correlation is more than or equal to predefined relevance threshold, if from the uplink scheduling resource pool, remove ascending resource corresponding to described the 2nd UE.

35. scheduler according to claim 34, is characterized in that, described correlation judging unit further comprises:

The first correlation computing unit, for the instantaneous value of channel estimating of the up channel that obtains p subframe the 2nd UE or the recursive average of channel estimating, the instantaneous value of the channel estimating that this value is the up-to-date up channel reported of the 2nd UE or the recursive average of channel estimating; In each subframe of the instantaneous value of channel estimating that the p subframe is the up channel that can obtain the 2nd UE or the recursive average of channel estimating before current subframe and the nearest subframe of the current subframe of distance; Obtain the instantaneous value of the channel estimating of the up channel of current UE in the q subframe or the recursive average of channel estimating, this value is the instantaneous value of the channel estimating of the up-to-date up channel reported of current UE or the recursive average of channel estimating; In each subframe of the instantaneous value of channel estimating that the q subframe is the up channel that can obtain current UE or the recursive average of channel estimating before current subframe and the nearest subframe of the current subframe of distance;

According to instantaneous value or the recursive average of the channel estimating of described current UE and the 2nd UE, according to following formula, calculate wireless channel correlation between current UE and the 2nd UE:

$\mathrm{\&rho;}=\frac{\left|\underset{k=1}{\overset{K_a}{\mathrm{\&Sigma;}}}\underset{w=1}{\overset{W}{\mathrm{\&Sigma;}}}{h}_{x,k,w}{h}_{y,k,w}^{*}\right|}{\left|h_x\right|\&CenterDot;\left|h_y\right|};$

In above formula, K _athe number that means the base station reception antenna;

the instantaneous value or the recursive average that mean the up-to-date channel estimating reported of current UE,

instantaneous value or the recursive average of the channel estimating on the k root antenna of expression current UE, W means that the window of channel estimating is long;

the instantaneous value or the recursive average that mean the up-to-date channel estimating reported of the 2nd UE, the instantaneous value or the recursive average that mean the channel estimating of the 2nd UE on k root antenna; | h _x| and | h _y| mean respectively h _xand h _ymould.

36. scheduler according to claim 34, is characterized in that, described correlation judging unit further comprises:

The second correlation computing unit, have the down beam shaping DLBF weight vector of the 2nd UE of at least one up channel for obtaining the p subframe, this DLBF weight vector is the up-to-date DLBF weight vector reported of the 2nd UE; In each subframe of DLBF weight vector that the p subframe is the up channel that can obtain the 2nd UE before current subframe and the nearest subframe of the current subframe of distance; Obtain the DLBF weight vector that the q subframe has the current UE of at least one up channel, this DLBF weight vector is the up-to-date DLBF weight vector reported of current UE; In each subframe of DLBF weight vector that the q subframe is the up channel that can obtain current UE before current subframe and the nearest subframe of the current subframe of distance;

According to the DLBF weight vector of described current UE and the 2nd UE, calculate the wireless channel correlation between current UE and the 2nd UE:

$\mathrm{\&rho;}=\frac{\left|\underset{i=1}{\overset{K_a}{\mathrm{\&Sigma;}}}{x}_i{y}_i^{*}\right|}{\left|x\right|\&CenterDot;\left|y\right|};$

In above formula, K _athe number that means the base station reception antenna, | x| and | y| means respectively the mould of vector x and vector y; Vector x and vector y mean respectively the DLBF weight vector of current UE and the DLBF weight vector of the 2nd UE, x _ii the component that means vector x, y _ii the component that means vector y.

37. scheduler according to claim 34, is characterized in that, described scheduler further comprises:

The training sequence deviation distribution module, for after described resource distribution module is to current UE allocation schedule E-PUCH, distribute training sequence deviation to current UE.

38. according to the described scheduler of claim 37, it is characterized in that, described training sequence deviation distribution module comprises:

Grouped element, for all training sequence deviation groupings in community are obtained to a plurality of training sequence deviation groups, training sequence deviation and channel code in each training sequence deviation group have predefined mapping relations;

Idle training sequence deviation selected cell, the channel code taken for definite scheduling E-PUCH of distributing to UE, from described a plurality of training sequence deviation groups, selecting one in the training sequence deviation corresponding with this channel code does not have occupied training sequence deviation;

Allocation units, for selected training sequence deviation is distributed to described UE, and be labeled as described training sequence deviation and take.

39. according to the described scheduler of claim 37, it is characterized in that, described training sequence deviation distribution module comprises:

The mapping relations dispensing unit, for the mapping relations between pre-configured training sequence deviation and channel code;

Search and allocation units, the channel code taken for definite scheduling E-PUCH of distributing to UE, search the training sequence deviation that described channel code is shone upon, and judges that whether described training sequence deviation is occupied, if, according to this UE is dispatched unsuccessfully and processed; Otherwise, described training sequence deviation is distributed to described UE, and described training sequence deviation is labeled as and takies.

40. according to the described scheduler of claim 25 to 33 any one, it is characterized in that, described resource distribution module further comprises:

The first joint-detection ability judging unit, be used at resource distribution module after a part of ascending resource of uplink scheduling resource pool selection is distributed to current UE, the channel code number that the joint-detection the ability whether ascending resource that judgement has distributed in the subframe that is scheduled causes the channel code of the spreading factor SF=16 that participates in joint-detection to outnumber base station can be supported, if surpass, resource distribution module reselects less ascending resource and distributes to current UE from the uplink scheduling resource pool, and multiplexing number corresponding to ascending resource be assigned with subtracted to 1; If do not surpass, resource distribution module subtracts 1 by multiplexing number corresponding to ascending resource be assigned with.

41. according to the described scheduler of claim 25 to 33 any one, it is characterized in that, described resource distribution module further comprises:

The second joint-detection ability judging unit, before at resource distribution module, from a part of ascending resource of uplink scheduling resource pool selection, distributing to current UE, calculate the channel code number of the SF=16 of the ascending resource equivalence distributed in any one time slot comprised at the subframe uplink scheduling resource pool that is scheduled, whether judgement equals at the described channel code number of this time slot the channel code number that base stations united detectability can be supported, if, to no longer dispatch any UE at this time slot, otherwise, the number of the channel code of the SF=16 of the participation joint-detection that calculating can also be supported at this time slot in the subframe that is scheduled, if each time slot at the subframe uplink scheduling resource pool that is scheduled can not be dispatched UE again, finish the scheduling to current subframe, otherwise, describedly from the uplink scheduling resource pool, select a part of ascending resource to distribute to described in current UE a part of ascending resource of distributing to UE need to meet following condition at the channel code number of the SF=16 of each time slot equivalence: the number of channel code that is less than or equal to the SF=16 of the participation joint-detection that the time slot of the calculated subframe that is scheduled can also support, after meeting the ascending resource of above-mentioned condition to the current UE of being scheduled distribution, resource distribution module subtracts 1 by multiplexing number corresponding to the described ascending resource be assigned with.

42. according to the described scheduler of claim 40, it is characterized in that, described resource distribution module further comprises: the first channel resource judging unit, for before the first joint-detection ability judging unit is carried out described judgement, judge described uplink scheduling resource pool, whether each ascending time slot of the subframe that is scheduled exists other channels outside scheduling E-PUCH resource, idle ascending resource and predefined permission channel, if enable the first joint-detection ability judging unit; Otherwise, do not enable the first joint-detection ability judging unit.

43. according to the described scheduler of claim 41, it is characterized in that, described resource distribution module further comprises:

Second channel resource judgment unit, for before the second joint-detection ability judging unit is carried out described judgement, judge whether described uplink scheduling resource pool exists other channels outside scheduling E-PUCH resource, idle ascending resource and predefined permission channel at each ascending time slot of the subframe that is scheduled, if enable the second joint-detection ability judging unit; Otherwise do not enable the second joint-detection ability judging unit.

Images