CN102215588A - 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 the 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 relates 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, in high speed uplink bag access (HSUPA), introduced multi-user (MU) multiple-input and multiple-output (MIMO) technology.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.Based on the configuration mode of special default training sequence deviation, distribute different training sequence deviation for these UE.Concrete grammar is as follows:

In the HSUPA that adopts MU MIMO technology, with K in the sub-district _mIndividual training sequence deviation is divided into the M group, shares identical scheduling E-PUCH resource in order to support M HSUPA UE in MU MIMO mode.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∈ 4,6,8,10,12,14, and during 16}, M=2 or 4.K _mHave with the value combination of M: 1+7 * 2=15 kind.

For every kind of K _mValue combination with M, in the M group training sequence deviation, m ∈ { 0,1, ..., each training sequence deviation that comprises in the M-1} group training sequence deviation 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.This mode is represented with the form of chart in the 3GPP agreement.

Work as K _UEWhen≤M HSUPA UE shares identical scheduling E-PUCH resource, need to give each UE to distribute different training sequence deviation.For K _UE" k " individual UE among the individual UE can organize at M and select m in the training sequence deviation _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 that group comprises in the training sequence deviation and the mapping relations between the OVSF channel code determine to distribute to the training sequence deviation of 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.NODEB (base station) is at the group number m that determines to distribute to the scheduling E-PUCH resource of " k " individual UE and distribute to the training sequence deviation place of this UE _kAfter, just will distribute to the information and the group number m of the scheduling E-PUCH resource of this UE _kSend to " k " individual UE by scheduling E-AGCH (strengthening the dedicated channel absolute grant channel).This UE monitors scheduling E-AGCH, and can determine to distribute to its shared OVSF channel code of scheduling E-PUCH according to the information of the E-PUCH resource of carrying on the scheduling E-AGCH.This UE is according to the group number m that carries on this OVSF channel code and the scheduling E-AGCH _kLook into m _kOrganize the mapping relations between interior training sequence deviation and the OVSF channel code, can determine to distribute to its training sequence deviation.UE sends E-DCH (enhancing dedicated channel) data block to NODEB by training sequence deviation and the E-PUCH resource of distributing to it.NODEB after receiving the E-DCH data block that UE sends, if NODEB to this data block correct decoding, NODEB just generates ACK (affirmation) information; Otherwise NODEB just generates NACK (non-affirmation) information.NODEB determines a signature sequence on the E-HICH (strengthening the dedicated channel hybrid automatic repeat request indication channel) according to distributing to the E-PUCH resource information of UE and group number m.When NODEB generated ACK information, NODEB just fed back to UE with the antitone sequence of this signature sequence by E-HICH; When NODEB generated nack message, NODEB just fed back to UE with the former sequence of this signature sequence by E-HICH.When UE detects the antitone sequence that the sequence of NODEB by E-HICH feedback is corresponding sequence/former sequence, just determine that the NODEB feedack is an 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.

Based on the flow process of MU MIMO technology scheduling E-PUCH resource as shown in Figure 1, comprise the steps: in the prior art

Step 101: base station (NODEB) after the group number m at the training sequence deviation place of determining to distribute to the scheduling E-PUCH resource of UE and distribute to UE, the 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 determines to distribute to its shared OVSF channel code of scheduling E-PUCH according to the information of the scheduling E-PUCH resource of carrying on the scheduling E-AGCH.UE inquires about the mapping relations between the training sequence deviation and OVSF channel code in the m group according to this OVSF channel code and group number m, determines to distribute to its training sequence deviation.

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 that receives from UE, if NODEB to this data block correct decoding, NODEB just generates and confirms (ACK) information; Otherwise NODEB just generates non-affirmation (NACK) information.

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

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

According to prior art, MU MIMO technology only is applied to the scheduling E-PUCH resource among the above-mentioned HSUPA.That is: a plurality of HSUPA UE can be with the resource in the shared uplink scheduling resource pool of MU MIMO mode.Because the uplink scheduling resource pool only accounts for a part in the ascending resource that all ascending time slots constitute, therefore, MU MIMO technology is all very limited for the raising of the raising of uplink throughput among the HSUPA and up peak rate among the HSUPA at present.

According to prior art, in the ascending resource that all ascending time slots constitute, 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-scheduling E-PUCH of distributing to each UE.In a single day these ascending resources distribute to certain UE, just can not be used for other UE.

According to prior art, in the ascending resource that all ascending time slots constitute, semi-persistent scheduling (SPS) the E-PUCH resource of distributing to each UE can not adopt MU MIMO technology equally.In a single day NODEB distributes to certain UE with 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 that all ascending time slots constitute, the resource that high-speed shared information channel (HS-SICH), Physical Random Access Channel (PRACH) and the ascending control channel of the access at random Uplink Shared Channels such as (E-RUCCH) that strengthens take can not adopt MU MIMO technology equally.

When having idle ascending resource (ascending resource that is not used) beyond RNC disposes to the ascending resource pond of NODEB, this idle ascending resource is not used MU MIMO technology equally.Such as: RNC is used to support the UL DPCH of 4 SF=8 in the channel code resource of 4 SF=8 of TS1 reservation.Only dispose 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 resource 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 (TD-SCDMA) system adopted the Typical Disposition of 2:4, in two ascending time slots, the uplink scheduling resource pool took an ascending time slot usually, and the resource of another ascending time slot is used to be allocated as follows up channel; When the TD-SCDMA system adopted the Typical Disposition of 3:3, the uplink scheduling resource pool took two ascending time slots usually in three ascending time slots, and the resource of another ascending time slot is used to be allocated as follows up channel:

(1)UL?DPCH

(2) non-scheduling E-PUCH

(3)SPS?E-PUCH

(4)HS-SICH

(5)PRACH

(6)E-RUCCH

If be used to distribute the resource and the idle ascending resource of the ascending time slot of 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 (when adopting the 2:4 configuration) or whole three ascending time slots (when adopting 3:3 to dispose) by 1 time slot (when adopting the 2:4 configuration) or 2 time slots (when adopting the configuration of 3:3).One that increases is adopted the ascending time slot of MU MIMO technology can effectively promote uplink throughput and up peak rate among the HSUPA.Therefore, the present invention proposes: MU MIMO technological expansion is applied to other up channels and idle ascending resource except that scheduling E-PUCH, makes the ascending resource that HSUPA UE can multiplexing all ascending time slots formations.

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

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 determines to distribute to its training sequence deviation.It does not support the group number that will distribute to its training sequence deviation place by E-AGCH to be notified to it.Therefore, prior art only distributes training sequence deviation to have defective based on the special default training sequence deviation method of salary distribution to UE: 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 default training sequence deviation method of salary distribution to distribute training sequence deviation for the UE of multiplexing identical E-PUCH resource.Can make the E-PUCH resource of multiplexing other UE of UE that do not support the special default training sequence deviation method of salary distribution like this.

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 and idle ascending resource except that the scheduling E-PUCH 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 constitute a lot of channel combinations, the HSUPA scheduler and the dispatching method of employing provided by the invention MU MIMO technology can be applied to MU MIMO technological expansion the resource of the various channel occupancies that comprise in all any one channels combinations that are made of other up channels and idle ascending resource.

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

A, in current subframe, determine the to be scheduled multiplexing uplink scheduling resource pool of user equipment (UE) of subframe, described uplink scheduling resource pool comprises a kind of in other ascending resources beyond the scheduling enhanced dedicated channel physical uplink channel E-PUCH resource at least, and other ascending resources beyond the described scheduling E-PUCH resource comprise: up idling-resource, uplink special physical channel UL DPCH resource, non-scheduling E-PUCH resource, semi-persistent scheduling SPS E-PUCH resource, high-speed shared information channel HS-SICH resource, the ascending control channel of the access at random 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 the described uplink scheduling resource pool; If total K kind ascending resource in the uplink scheduling resource pool, wherein the maximum multiplexing number note of k kind ascending resource is made Q _k, k, K are natural number, and k≤K;

Select one among 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, and the multiplexing number of the ascending resource correspondence that is assigned with is subtracted 1 as the scheduling E-PUCH of UE;

D, judge whether the UE that is not scheduled in addition, if return step C; Otherwise next subframe as current subframe, is returned steps A.

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

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

With described predefine uplink scheduling resource pool as the multiplexing uplink scheduling resource pool of 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 is constituted by scheduling E-PUCH resource and following any one ascending resource:

Combination a1: idle ascending resource;

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

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

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

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

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

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 comprises in the uplink scheduling resource pool is 2 or greater than 2 positive integer, and the multiplexing number of up idling-resource is 1 or greater than 1 positive integer.

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

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

Preferably, step B comprises:

According to determined uplink scheduling resource pool, the multiplexing form of initialization uplink scheduling resource pool, j is listed as in the corresponding uplink scheduling resource pool of the capable element of i i node in j the time slot in this form, j is listed as the value z (j of the capable element of i, i) in the expression uplink scheduling resource pool in j time slot i node can by z (j, i) individual UE is shared in MU MIMO mode; I represents node number, i=0, and 1 ..., 30; J represents 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 in step B2, otherwise execution in step B4;

B2, determine the node i of this channel code c correspondence; When if this channel code is the channel code that any one up channel takies among UL DPCH, non-scheduling E-PUCH, SPS E-PUCH, HS-SICH, PRACH and the E-RUCCH, j in the above table is listed as the maximum multiplexing number that the i row element is initialized as the respective channels resource subtracts 1; If this channel code is the channel code of scheduling E-PUCH resource occupation, j in the above table is listed as 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 the above table is listed as the maximum multiplexing number that the i row element is initialized as idle ascending resource; Execution in step B4 then;

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

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 pairing form of this node is not initialised, but, the element of the father node correspondence of this node is initialised, and just the element of this node correspondence is initialized as with the corresponding element of its father node to have identical numerical value;

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

Preferably, before the 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;

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

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

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 can the data carried by data amount greater than other each rectangle resources in this uplink scheduling resource pool, gives described UE with this rectangle resource allocation.

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

With the scheduling E-PUCH resource in the uplink scheduling resource pool as the first child resource pond, with the resource except that the first child resource pond in the uplink scheduling resource pool as the second child resource pond;

Determine to be no more than the rectangle resource of described UE ability respectively 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 can the data carried by data amount greater than other each rectangle resources in this child resource pond; The data volume of more described two rectangle resource bearings is given current UE with wherein carrying a more rectangle resource allocation of data volume; If the data volume of two rectangle resource bearings is identical, then select a rectangle resource allocation to give current UE at random, perhaps, current UE is given in the less rectangle resource allocation of selecting to comprise SF=16 of channel code number.

Preferably, step C is described to select a part of ascending resource to distribute to before the current UE from the uplink scheduling resource pool, further comprises:

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

Correlation between the wireless channel of 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, this value is the instantaneous value of channel estimating of the up-to-date up channel that reports of the 2nd UE or the recursive average of channel estimating; The p subframe in each subframe of the recursive average of the instantaneous value of channel estimating of the up channel that can obtain the 2nd UE or 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 that reports of current UE or the recursive average of channel estimating; The q subframe in each subframe of the recursive average of the instantaneous value of channel estimating of the up channel that can obtain current UE or channel estimating before current subframe and the nearest subframe of the current subframe of distance;

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

$\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 the following formula, K _aThe number of expression base station reception antenna;

The instantaneous value or the recursive average of the up-to-date channel estimating that reports of expression current UE,

The instantaneous value or the recursive average of the channel estimating on the k root antenna of expression current UE, W represents that the window of channel estimating is long; Instantaneous value or the recursive average of representing the up-to-date channel estimating that reports of the 2nd UE, Instantaneous value or the recursive average of representing the channel estimating of the 2nd UE on k root antenna; | h _x| and | h _y| represent h respectively _xAnd h _yMould.

Correlation between the wireless channel of 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 that reports of the 2nd UE; The p subframe in each subframe of DLBF weight vector of 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 that reports of current UE; The q subframe in each subframe of DLBF weight vector of 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 the following formula, | x| and | y| represents the mould of vector x and vector y respectively; Vector x and vector y represent the DLBF weight vector of current UE and the DLBF weight vector of the 2nd UE respectively.

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

Distribute training sequence deviation to current UE.

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

With all training sequence deviation groupings in the sub-district, every group of interior training sequence deviation and channel code has predefined mapping relations;

Determine to distribute to the channel code that the scheduling E-PUCH of UE takies, 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;

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

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

Describedly distribute training sequence deviation to comprise to current UE:

Determine to distribute to the channel code that the scheduling E-PUCH of UE takies, search the training sequence deviation of described channel code mapping, judge whether described training sequence deviation is occupied, if, then according to this UE scheduling failure is handled; Otherwise, described training sequence deviation is distributed to described UE, and described training sequence deviation is labeled as takies.

Wherein said according to this UE scheduling failure is handled can for: from the uplink scheduling resource pool, reselect less ascending resource and distribute to current UE, and return described multiplexing number and subtract 1 step the ascending resource correspondence that is assigned with; Perhaps directly return step C.

Preferably, step C is described to select a part of ascending resource to distribute to after the current UE from the uplink scheduling resource pool, further comprises:

C1, judge the ascending resource that has distributed in the subframe that is scheduled whether cause the channel code of the spreading factor SF=16 that participates in joint-detection outnumbered the base station the joint-detection ability the channel code number that can support, if surpass, then from the uplink scheduling resource pool, reselect less ascending resource and distribute to current UE, and the multiplexing number that returns described in the step C ascending resource correspondence that will be assigned with subtracts 1 step, perhaps directly returns step C; If do not surpass, the multiplexing number that then returns described in the step C ascending resource correspondence that will be assigned with subtracts 1 step.

Preferably, step C is described to select a part of ascending resource to distribute to before the current UE from the uplink scheduling resource pool, further comprises:

The channel code number of the SF=16 of the ascending resource equivalence that C2, calculating have distributed in any one time slot that the subframe uplink scheduling resource pool that is scheduled comprises; Judgement the described channel code number of this time slot whether equal base stations united detectability the channel code number that can support, if, to no longer dispatch any UE at this time slot, if not, then 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 all can not dispatch UE again at each time slot of the subframe uplink scheduling resource pool that is scheduled, then with next subframe as current subframe, return steps A; Otherwise, describedly from the uplink scheduling resource pool, select a part of ascending resource to distribute to a part of ascending resource of distributing to UE described in the current UE need to satisfy following condition: 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 subframe of being calculated that is scheduled can also support at the channel code number of the SF=16 of each time slot equivalence; Described multiplexing number with the ascending resource correspondence that is assigned with is subtracted 1 step distributing the ascending resource that satisfies above-mentioned requirements to return later among the step C for the current UE of being scheduled.

Preferably, before the described step C1, further comprise:

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

Preferably, before the described step C2, further comprise:

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

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

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

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

C2, available E-AGCH of selection distribute to current UE;

D2, from the uplink scheduling resource pool, select a part of resource allocation to give 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 successfully being after UE distributes E-AGCH, E-PUCH and E-HICH, to be arranged to the E-AGCH that distributes to this UE unavailable; Be arranged to the ascending resource that the scheduling E-PUCH of distributing this UE takies unavailable;

G2, judge whether to also have in available E-AGCH and the uplink scheduling resource pool available resource is arranged, if, go to step b2, otherwise, next subframe as current subframe, and is gone 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, be used at current subframe determine the to be scheduled multiplexing uplink scheduling resource pool of user equipment (UE) of subframe, described uplink scheduling resource pool comprises a kind of in other ascending resources beyond the scheduling enhanced dedicated channel physical uplink channel E-PUCH resource at least, and other ascending resources beyond the described scheduling E-PUCH resource comprise: up idling-resource, uplink special physical channel UL DPCH resource, non-scheduling E-PUCH resource, semi-persistent scheduling SPS E-PUCH resource, high-speed shared information channel HS-SICH resource, the ascending control channel of the access at random E-RUCCH resource of Physical Random Access Channel PRACH resource and enhancing;

The multiplexing number module is used 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 note of k kind ascending resource is made Q _k, k, K are natural number, and k≤K;

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

Preferably, described resource pool module comprises:

The corresponding relation table unit is used to store the application scenarios that sets in advance and the mapping table of predefine uplink scheduling resource pool;

Query unit, the application scenarios of the subframe that is used to determine to be scheduled is searched described mapping table according to described application scenarios, obtains corresponding predefine uplink scheduling resource pool; And with described predefine uplink scheduling resource pool as the multiplexing uplink scheduling resource pool of 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 is constituted by scheduling E-PUCH resource and following any one ascending resource:

Combination a1: idle ascending resource;

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

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

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

Combination a5: idle ascending resource, non-scheduling 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 represents that the base station carries out the time delay of HSUPA scheduling, subframe that this time delay sends for the E-AGCH that gives the UE that is scheduled in current sub-frame allocation and the timing difference between the 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, j is listed as in the corresponding uplink scheduling resource pool of the capable element of i i node in j the time slot in this form, j is listed as the value z (j of the capable element of i, i) in the expression uplink scheduling resource pool in j time slot i node can by z (j, i) individual UE is shared in MU MIMO mode; I represents node number, i=0, and 1 ..., 30; J represents 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:

First judgment sub-unit is used to judge 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 is used for determining the node i of this channel code c correspondence; When if this channel code is the channel code that any one up channel takies among ULDPCH, non-scheduling E-PUCH, SPS E-PUCH, HS-SICH, PRACH and the E-RUCCH, j in the above table is listed as the maximum multiplexing number that the i row element is initialized as the respective channels resource subtracts 1; If this channel code is the channel code that scheduling E-PUCH takies, j in the above table is listed as 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 the above table is listed as the maximum multiplexing number that the i row element is initialized as up idling-resource; Enable the 3rd initialization subelement after being finished;

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

The 3rd initialization subelement is determined 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 pairing form of this node is not initialised, but, the element of the father node correspondence of this node is initialised, and just the element of this node correspondence is initialized as with the corresponding element of its father node to have identical numerical value; Enable the 4th initialization unit after being finished;

The 4th initialization unit is used for the element that j row are not initialised as yet is initialized as the minimum value of the pairing element of all child nodes of the node of this element correspondence.

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

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

Preferably, described resource distribution module comprises:

First resource allocation unit, be used for selecting 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 can the data carried by data amount greater than other each rectangle resources in this uplink scheduling resource pool, gives described UE with this rectangle resource allocation.

Preferably, described resource distribution module comprises:

Second resource allocation unit is used for scheduling E-PUCH resource with the uplink scheduling resource pool as the first child resource pond, with the resource except that the first child resource pond in the uplink scheduling resource pool as the second child resource pond; Determine to be no more than the rectangle resource of described UE ability respectively 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 can the data carried by data amount greater than other each rectangle resources in this child resource pond; The data volume of more described two rectangle resource bearings is given current UE with wherein carrying a more rectangle resource allocation of data volume; If the data volume of two rectangle resource bearings is identical, then select a rectangle resource allocation to give current UE at random, perhaps, current UE is given in the less rectangle resource allocation of selecting to comprise SF=16 of channel code number.

Preferably, described resource distribution module further comprises:

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

Preferably, described correlation judging unit further comprises:

The first correlation calculations unit, be used to obtain the instantaneous value of channel estimating of up channel of p subframe the 2nd UE or the recursive average of channel estimating, this value is the instantaneous value of channel estimating of the up-to-date up channel that reports of the 2nd UE or the recursive average of channel estimating; The p subframe in each subframe of the recursive average of the instantaneous value of channel estimating of the up channel that can obtain the 2nd UE or 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 that reports of current UE or the recursive average of channel estimating; The q subframe in each subframe of the recursive average of the instantaneous value of channel estimating of the up channel that can obtain current UE or channel estimating before current subframe and the nearest subframe of the current subframe of distance;

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

$\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 the following formula, K _aThe number of expression base station reception antenna;

The instantaneous value or the recursive average of the up-to-date channel estimating that reports of expression current UE,

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

Instantaneous value or the recursive average of representing the up-to-date channel estimating that reports of the 2nd UE,

Instantaneous value or the recursive average of representing the channel estimating of the 2nd UE on k root antenna; | h _x| and | h _y| represent h respectively _xAnd h _yMould.

Preferably, described correlation judging unit further comprises:

The second correlation calculations unit is used to obtain 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 that reports of the 2nd UE; The p subframe in each subframe of DLBF weight vector of 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 that reports of current UE; The q subframe in each subframe of DLBF weight vector of 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 the following formula, | x| and | y| represents the mould of vector x and vector y respectively; Vector x and vector y represent the DLBF weight vector of current UE and the DLBF weight vector of the 2nd UE respectively.

Preferably, described scheduler further comprises:

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

Preferably, described training sequence deviation distribution module comprises:

Grouped element is used for all training sequence deviation groupings in the sub-district, and every group of interior training sequence deviation and channel code has predefined mapping relations;

Idle training sequence deviation selected cell is used to determine to distribute to the channel code that the scheduling E-PUCH of UE takies, and 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 are used for selected training sequence deviation is distributed to described UE, and described training sequence deviation is labeled as takies.

Preferably, described training sequence deviation distribution module comprises:

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

Search and allocation units, be used to determine to distribute to the channel code that the scheduling E-PUCH of UE takies, search the training sequence deviation of described channel code mapping, judge whether described training sequence deviation is occupied, if, then according to this UE scheduling failure is handled; Otherwise, described training sequence deviation is distributed to described UE, and described training sequence deviation is labeled as 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 ascending resource that judgement has distributed in the subframe that is scheduled whether cause the channel code of the spreading factor SF=16 that participates in joint-detection outnumbered the base station the joint-detection ability the channel code number that can support, if surpass, then resource distribution module is reselected less ascending resource and is distributed to current UE from the uplink scheduling resource pool, and the multiplexing number of the ascending resource correspondence that is assigned with is subtracted 1; If do not surpass, then resource distribution module subtracts 1 with the multiplexing number of the ascending resource correspondence that is assigned with.

Preferably, described resource distribution module further comprises:

The second joint-detection ability judging unit, be used for before resource distribution module is distributed to current UE from a part of ascending resource of uplink scheduling resource pool selection, calculating the channel code number of the SF=16 of the ascending resource equivalence that in any one time slot that the subframe uplink scheduling resource pool that is scheduled comprises, has distributed; Judgement the described channel code number of this time slot whether equal base stations united detectability the channel code number that can support, 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 all can not dispatch UE again at each time slot of the subframe uplink scheduling resource pool that is scheduled, then finish scheduling to current subframe, otherwise, describedly from the uplink scheduling resource pool, select a part of ascending resource to distribute to a part of ascending resource of distributing to UE described in the current UE need to satisfy following condition: 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 subframe of being calculated that is scheduled can also support at the channel code number of the SF=16 of each time slot equivalence; After satisfying the ascending resource of above-mentioned requirements for the current UE of being scheduled distribution, resource distribution module subtracts 1 with the multiplexing number of the described ascending resource correspondence that is assigned with.

Preferably, described resource distribution module further comprises: the first channel resource judging unit, be used 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 the predefined permission channel, if then 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, be used 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 the predefined permission channel at each ascending time slot of the subframe that is scheduled, if then 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-scheduling E-PUCH, SPSE-PUCH, HS-SICH, PRACH and E-RUCCH.If later on the up channel type of TD-SCDMA system increases, then the present invention can expanded application in the up channel that increases.That is: this scheme can realize dispatching UE with the ascending resource that multiplexing all ascending time slots of MU MIMO mode constitute, and 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 for the HSUPAUE 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 for 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.

Description of drawings

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

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

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

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

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

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

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

Embodiment

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

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

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

In any subframe (following usefulness n subframe is represented), the HSUPA scheduler of NODEB all will carry out a HSUPA scheduling.When UE of HSUPA scheduler decision 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 represents that NODEB carries out the time delay of HSUPA scheduling.With respect to the HSUPA scheduling of n subframe, Uplink Shared Channels such as HS-SICH, PRACH and E-RUCCH have following characteristics respectively:

(1) in the n subframe, the HSDPA scheduler of NODEB carries out a high-speed downstream bag and inserts (HSDPA) scheduling.When UE of HSDPA scheduler decision 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 represents that NODEB carries out the time delay of HSDPA scheduling, subframe that this time delay sends for the HS-SCCH that distributes to the UE that is scheduled in current subframe " n " and the timing difference between the current subframe.。Generally, d2=d1.Therefore, when n subframe NODEB carried out the HSUPA scheduling, NODEB knew 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 the NODEB decision responds the SYNC-UL sequence of a UE, 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 represents that NODEB carries out the time delay of SYNC-UL sequence scheduling, and d4=2 represents the timing difference between the subframe that subframe that PRACH/E-RUCCH sends and FPACH send.In different scenes, the value of d3 can be different.When d3＞d1, when n subframe NODEB carried out the HSUPA scheduling, NODEB knew 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 was finished before n subframe HSUPA scheduling beginning, when n subframe NODEB carried out the HSUPA scheduling, the PRACH/E-RUCCH that knows the n+d1+2 subframe equally was idle or belongs to which UE.When d3＜d1, when n subframe NODEB carried out the HSUPA scheduling, the PRACH/E-RUCCH that does not know the n+d1+2 subframe was idle or belongs to which UE.

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

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, when NODEB carries out HSUPA when scheduling in the n subframe, know which UE HS-SICH, the PRACH of n+d1+2 subframe and E-RUCCH belong to, and this UE is called a UE.So NODEB just can select to share these Uplink Shared Channels at the shared ascending resource of n+d1+2 subframe with the very weak one or more UE of the wireless channel correlation of a UE 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 shared ascending resource of UL DPCH, non-scheduling 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 that is made of all ascending time slots.

The ascending resource of free time is considered as a kind of special up channel or special resource type.Other up channels and idle ascending resource can constitute a lot of channel combinations or resource type combination, can only the MUMIMO technological expansion be applied in wherein any one channel combination or the resource type combination.Such as, MU MIMO technology can be applied among a kind of in following representative channel combination that constitutes by other up channels and idle ascending resource or the resource type combination:

(1) first kind of combination: include only idle ascending resource, this combination expression only is applied to MU MIMO technological expansion idle ascending resource.

(2) second kinds of combinations: include only non-scheduling E-PUCH and semi-persistent scheduling E-PUCH, this combination expression only is applied to non-scheduling E-PUCH and semi-persistent scheduling E-PUCH with MU MIMO technological expansion.

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

(4) the 4th kinds of combinations: include only idle ascending resource, non-scheduling E-PUCH, semi-persistent scheduling E-PUCH and UL DPCH, this combination expression only is applied to MU MIMO technological expansion idle ascending resource, non-scheduling 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 expression is applied to MU MIMO technological expansion in the channel of non-scheduling E-PUCH of idle all TD-SCDMA systems such as ascending resource, non-scheduling 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 constituted.

The embodiment of the 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 can also adopt the default Midamble Shift method of salary distribution to distribute Midamble Shift for the UE of multiplexing identical E-PUCH resource with dispatching method, for the UE that does not support the special default Midamble Shift method of salary distribution, scheduler of the present invention is supported the multiplexing identical E-PUCH resource of these UE with dispatching method.

Below, introduce the embodiment of the invention one.

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

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 in will making up with multiplexing this channel combination of the mode of MU MIMO or resource type 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 comprises the steps: as shown in Figure 3

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

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

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

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 sees also existing document.Because calculating the method for the dispatching priority of each UE is not content of the present invention, repeats no more here.

Step 202-2: determine the E-AGCH that can use in current n subframe.In current subframe, all E-AGCH that dispose on the carrier wave that is 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 is made 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.

N+d1+2 subframe uplink scheduling resource pool by combination of n+d1+2 subframe scheduling E-PUCH resource and determined channel or resource type combination in each channel or each resource type constitute at the ascending resource that the n+d1+2 subframe takies.

RNC disposes to the E-PUCH resource pool of NODEB and gives the SPS E-PUCH of each UE for non-scheduling E-PUCH, the configuration of each UE by configuration and the ascending resource that is used for scheduling E-PUCH constitutes.

When not comprising any channel or resource type in the channel combination that step 201 is determined, in the n+d1+2 subframe, the uplink scheduling resource pool only is made of the scheduling E-PUCH resource.

Dispose to the E-PUCH resource pool of NODEB the non-scheduling E-PUCH of each UE being foreclosed in the resource that " n+d1+2 " subframe takies from RNC, the SPS E-PUCH of each UE is foreclosed in the resource that " n+d1+2 " subframe takies, just obtain the E-PUCH resource of " n+d1+2 " subframe scheduling.

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

The ascending resource of free time is considered as a kind of special up channel or special resource type.Other up channels and idle ascending resource can constitute 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 the resource type combination.After determining a kind of channel combination or resource type combination, in the n+d1+2 subframe, the uplink scheduling resource pool is made of the shared resource of each channel that comprises in scheduling E-PUCH resource and this combination, perhaps is made of the various types of resources that comprise in scheduling E-PUCH resource and this combination.

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

When this combination includes only non-scheduling E-PUCH and SPS E-PUCH, then dispose to the resource in the E-PUCH resource pool of NODEB and all belong to the uplink scheduling resource pool at n+d1+2 subframe RNC.Therefore, constitute by the E-PUCH resource pool that RNC disposes to NODEB at n+d1+2 subframe uplink scheduling resource pool.

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

When this combination comprises idle ascending resource, non-scheduling E-PUCH, SPS E-PUCH and UL DPCH, then n+d1+2 subframe uplink scheduling resource pool by RNC dispose E-PUCH resource pool to NODEB, idle ascending resource and each UL DPCH constitutes in the resource that this subframe takies.

When comprising the up channel outside all scheduling E-PUCH such as up idling-resource, non-scheduling E-PUCH, SPS E-PUCH, UL DPCH, HS-SICH, PRACH and E-RUCCH when this combination, then dispose 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 by RNC and constitute in the resource that this subframe takies at n+d1+2 subframe uplink scheduling resource pool.That is: form by the resource that all ascending time slots constitute at n+d1+2 subframe uplink scheduling resource pool.

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 that comprises 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 select a kind of mode to constitute " n+d1+2 " subframe uplink scheduling resource pool 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.In other words, scheduler can be selected channel type or the resource class of using the MUMIMO technology in resource that other up channels take and idle ascending resource, constitute " n+d1+2 " subframe uplink scheduling resource pool according to channel type of selecting or resource class.

When (n+d1+2) subframe uplink scheduling resource pool is made up of the ascending resource that all ascending time slots constituted or by RNC, dispose when forming to the E-PUCH resource pool of UE, 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 was made of other modes, the uplink scheduling resource pool of each subframe all may change.Therefore, all need to determine this subframe uplink scheduling resource pool in each subframe.

According to above-mentioned processing, the channel group of determining in step 202-1 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-defined plurality of application scenes, and be every kind of scene setting channel combination.When each subframe " n " constitutes " n+d1+2 " subframe uplink scheduling resource pool, judge the scene that " n+d1+2 " subframe satisfies, adopt the channel of determining under this scene to constitute the uplink scheduling resource pool of this subframe then.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, may not know that also the PRACH/E-RUCCH of n+d1+2 subframe is vacant or belongs to which UE.Therefore, can define two kinds of scenes:

First kind of scene: when NODEB carried out the scheduling of n subframe, the PRACH/E-RUCCH that knows the n+d1+2 subframe was vacant or when belonging to which UE, comprises PRACH/E-RUCCH in the channel combination.Correspondingly, n+d1+2 subframe uplink scheduling resource pool comprises the resource that PRACH/E-RUCCH takies.

Second kind of scene: when NODEB carried out the scheduling of n subframe, the PRACH/E-RUCCH that does not know the n+d1+2 subframe was vacant or when belonging to which UE, does not comprise PRACH/E-RUCCH in the channel combination.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 uplink scheduling resource pool that step 202-3-1 determines comprises N time slot, formulate the multiplexing form of uplink scheduling resource pool of 31 * N dimension.J is listed as in the corresponding uplink scheduling resource pool of the capable element of i i node in j the time slot in this form, and (j, node can (j, i) individual UE be shared in MU MIMO mode by z i) to represent in the uplink scheduling resource pool in j the time slot i for the value z of this element.Here, i represents node number, i=0, and 1 ..., 30; J represents j time slot of uplink scheduling resource pool, j=1 ..., N.Use t _jThe timeslot number of j time slot of expression uplink scheduling resource pool, and t ₁＜t ₂＜...＜t _j＜...＜t _N

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

(1), for the uplink scheduling resource pool at time slot t _jThe channel code c that comprises determines the node i of this channel code c correspondence.The number of channel code and the corresponding relation between the node see also 3GPP agreement TS25.222.

When if this channel code is the channel code that any one up channel takies among UL DPCH, non-scheduling E-PUCH, SPS E-PUCH, HS-SICH, PRACH and the E-RUCCH, j in the above table is listed as the i row element is initialized as Q-1, that is: z (j, i)=Q-1.If this channel code is up idling-resource when taking, j in the above table is listed as the i row element is initialized as Q, that is: z (j, i)=Q.Here, Q represents the maximum times that the channel code resource of the channel occupancy of the type is re-used.Here, up idling-resource is considered as a kind of special up channel.For the pairing 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 pairing 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 channel combination of determining or resource type combination, the maximum times Q that the channel code resource that every kind of channel or every kind of resource type take is re-used can be provided with separately, also can unify to be arranged to identical Q value.

Such as, to non-scheduling E-PUCH, Q=4 can be set; For HS-SICH, Q=2 can be set.Like this, the numerical value of the pairing node of resource that the non-scheduling E-UCH of UE 1 is shared is arranged to Q-1=4-1=3, that is: the non-scheduling E-PUCH of UE 1 supports that other three UE's is multiplexing.The numerical value of the pairing 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 it is different that all types of quality of channel require, so the independent configuration of maximum multiplexing number Q of the channel of each type can make that scheduler is more flexible, the scope of application is wider.Such as, HS-SICH is a control channel, if this channel quality of reception can't guarantee that then the peak rate of HSDPA and throughput will be subjected to very big influence.Therefore, the maximum multiplexing number of this channel can be provided with smallerly, such as: Q=2.But not scheduling E-PUCH support re-transmission, the maximum multiplexing number of this channel can be provided with more greatly, such as: Q=4.Even data decoding mistake on the non-scheduling 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 the above table is listed as the i row element is initialized as M, that is: z (j, i)=M.Here, M represents the maximum times that each channel code of scheduling E-PUCH resource occupation is re-used.For the pairing 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.

The Q value of each channel or each resource type can be identical in M and channel combination of determining or the combination of resources, 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 according to the restriction of resource multiplex number of times is determined.

Such as, if all kinds of resources in the uplink scheduling resource pool are all supported 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 4 users' MU MIMO technology therefore, to make M=4.But not excessive for guaranteeing the interference that other up channels are subjected 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 determines j in the form to be listed as the node i of this channel code c correspondence the i row element to be initialized as 0, that is: (j i)=0, represents that this node does not belong to the uplink scheduling resource pool to z, and this node is unavailable.When a node was unavailable, any one father node of this node was inevitable unavailable.

Therefore, determine all father nodes of node i, the pairing j of any one father node v of node i be listed as the v row element be 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 pairing 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 pairing j of this node is listed as the i row element and is initialized as and is listed as the v row element with the pairing j of its father node v and has identical numerical value.That is: z (j, i)=z (j, v).

(4), through after the above-mentioned processing, j is listed as the node i of j time slot in the pairing 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 pairing j of this node i is listed as the minimum value that the i row element is initialized as the pairing 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.

Be to support scheduling more flexibly, scheduler can be at M=1, selects 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: begin to dispatch UE one by one according to queue sequence from the highest UE of priority.To the scheduling step of a UE as shown in Figure 4, comprise the steps:

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

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

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

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

Step 202-4-2-1: when UE of scheduling, at first determine this UE uplink resources available pond.

Step 203-4-2-2: when not comprising any channel code in the available ascending resource pond of the UE that is scheduled, finish scheduling, begin to dispatch next UE to this 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.

Select a rectangle resource that is no more than the UE ability in this UE uplink resources available pond, the data volume of the UE of this rectangle resource bearing can be distributed in the rectangle resource of UE maximum at all.Give this UE with this resource allocation, as the scheduling E-PUCH of this UE.

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

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 this UE uplink resources available pond, can also take following processing:

This uplink resources available pond is divided into two sub-resource pools: a sub-resource pool is made of scheduling E-PUCH resource in this available ascending resource pond fully; Another child resource pond is made of the available resources of other types.

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

RNC has disposed 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, the part resource by TS2 constitutes, and the part resource by TS1 constitutes.

Distribute the rectangle resource that is no more than the UE ability in these two sub-resource pools, for 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 the various rectangle resources in this child resource pond.

If when in first child resource pond, distributing to the E-PUCH resource of this UE and can carry more data, just 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 in second sub-resource pool, distributing to the E-PUCH resource of this UE and can carry more data, just 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 a sub-resource pool at random, 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 the channel code number of the SF=16 that the interior rectangle resource of selecting of these two sub-resource pools comprises respectively, the less rectangle resource of channel code number of the SF=16 that selection comprises is distributed to UE with this resource as scheduling E-PUCH.

Below provide an embodiment determining UE uplink resources available pond:

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

For any one other up channel that comprises in the uplink scheduling resource pool in (n+d1+2) subframe, determine that this up channel is vacant or the signal of which UE of carrying.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 that is 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 that is scheduled can use this up channel to take.If the wireless channel correlation between these two UE is stronger, just think the ascending resource that this UE that is scheduled can't use this up channel to take.When UE can't use the resource that a up channel takies, resource from the uplink scheduling resource pool that this up channel is shared was removed.When the UE that is scheduled was exactly the UE that carries on this up channel, directly the resource that this up channel is shared was removed from the uplink scheduling resource pool.

Before this UE of scheduling, whether if when the UE that is successfully dispatched has been arranged, also needing to investigate the shared ascending resource of successfully having been dispatched of UE can be used for the current UE that is scheduled.Investigate the correlation of the wireless channel of the wireless channel of each UE that is 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 employed ascending resource of UE that the current UE that is scheduled can use this successfully to be dispatched.If the wireless channel correlation between these two UE is stronger, just think the employed ascending resource of UE that the current UE that is scheduled can't use this successfully to be dispatched.If the current UE that is scheduled can't use one during by the employed ascending resource of the UE that successfully dispatched, the employed ascending resource of will this quilt from the uplink scheduling resource pool successfully dispatching of UE 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, this value is the instantaneous value of channel estimating of the up-to-date up channel that reports of the 2nd UE or the recursive average of channel estimating; The p subframe in each subframe of the recursive average of the instantaneous value of channel estimating of the up channel that can obtain the 2nd UE or 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 that reports of current UE or the recursive average of channel estimating; The q subframe in each subframe of the recursive average of the instantaneous value of channel estimating of the up channel that can obtain current UE or channel estimating before current subframe and the nearest subframe of the current subframe of distance.

When calculating the correlation between the wireless channel of two UE at the HSUPA scheduler of n subframe NODEB, use the instantaneous value or the recursive average of the channel estimating of up-to-date each UE that reports.As follows based on wireless channel correlation calculations method between two UE of channel estimating:

$\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 the following formula, K _aThe number of expression NODEB reception antenna;

The instantaneous value or the recursive average of the up-to-date channel estimating that reports of expression current UE,

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

Instantaneous value or the recursive average of representing the up-to-date channel estimating that reports of the 2nd UE,

Instantaneous value or the recursive average of representing the channel estimating of the 2nd UE on k root antenna; | h _x| and | h _y| represent h respectively _xAnd h _yMould.

Be provided with 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 DLBF (down beam shaping) weight vector of each UE to calculate.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 that reports of the 2nd UE; The p subframe in each subframe of DLBF weight vector of 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 that reports of current UE; The p subframe in each subframe of DLBF weight vector of the up channel that can obtain current UE before current subframe and the nearest subframe of the current subframe of distance.

When 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 that reports.As follows based on the wireless channel correlation calculations method between two UE of DLBF weight vector:

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

In the following formula, | x| and | y| represents the mould of vector x and vector y respectively; Vector x and vector y represent the DLBF weight vector of current UE and the DLBF weight vector of the 2nd UE respectively.

Be provided with 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 to be scheduled available ascending resource pond of UE.

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 for each UE.

The method of salary distribution has two kinds: adopt mode 2 to distribute training sequence deviation for this UE for the UE that does not support the special default training sequence deviation method of salary distribution.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 the sub-district are divided into the N group.The mapping relations of training sequence deviation and OVSF interchannel are according to 3GPP agreement TS 25.221 definition in every group.

Determine to distribute to the channel code that the node of the E-PUCH of UE takies, this channel code corresponding different training sequence deviation respectively in N group training sequence deviation are selected 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 should be not more than 2 by the maximum multiplexing number, N=2 or N=4; If should be not more than 4, N=4 by the maximum multiplexing number.

When the maximum multiplexing number of each channel type is provided with 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 the OVSF channel code are according to 25.221 definition of TS 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 the default training sequence deviation configuration mode, determine the training sequence deviation of this channel code correspondence, if this training sequence deviation has been assigned to other UE or up channel, then the scheduling of this UE is failed: perhaps re-execute above-mentioned steps 202-4-2 and distribute a less E-PUCH resource for this UE; Perhaps finish scheduling, next UE in the formation of beginning dispatching priority to this UE.To the scheduling of next UE from above-mentioned steps 202-4-1.

Step 202-4-5: after successfully being 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 expression: this E-AGCH can not reallocate to other UE; The multiplexing form in ascending resource pond according to the shared resource updates 31 * N dimension of the E-PUCH that distributes to UE; Redefine the uplink scheduling resource pool according to the multiplexing form in ascending resource pond that upgrades.

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, with regard to execution in step 202-4-7; If available E-AGCH is arranged, and the uplink scheduling resource pool comprises a channel code at least, just begins next UE in the dispatching priority formation.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, be i if distribute to the node of this scheduling E-PUCH, 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 i element subtracts one, that is: z (j, i)=z (j, i)-1.

All elements all is 0 in upgrading the later multiplexing form in ascending resource pond, and then expression does not have available E-PUCH resource.Have 1 element at least greater than 0 in upgrading the later multiplexing form in ascending resource pond, then expression has available E-PUCH resource, can dispatch next UE.In scheduling during next UE, the uplink scheduling resource pool is not that 0 the pairing channel code of element constitutes by upgrading in the later multiplexing form in ascending resource pond all.

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

To each UE that is scheduled, physical layer at first sends to UE at the E-AGCH that the n+d1 subframe will be distributed to this UE; Receive the E-PUCH that this UE sends in the n+d1+2 subframe then; At last, give this UE by the E-HICH that distributes to this UE with the ACK/NACK feedback information of E-PUCH in the n+d1+2+d subframe.

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

Can realize dispatching UE and share shared ascending resource of UL DPCH, non-scheduling E-PUCH, SPSE-PUCH, HS-SICH, PRACH and E-RUCCH and idle ascending resource, effectively improve uplink throughput and the up peak rate of HSUPA in MU MIMO mode.The scheduler that the present invention proposes also adopts the default training sequence deviation method of salary distribution to distribute training sequence deviation for the UE of multiplexing identical E-PUCH resource with dispatching method.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 above only is preferred embodiment of the present invention, and is in order to restriction the present invention, within the spirit and principles in the present invention not all, any modification of being made, is equal to replacement, improvement etc., all should be included within the scope of protection of the invention.

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

Embodiment two and embodiment three are the replenishing embodiment one of setting out from different perspectives.

Embodiment four is special cases of embodiment one; Embodiment five and embodiment six are the replenishing embodiment four of setting out from different perspectives;

Embodiment eight is spy's row of embodiment one;

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 was not multiplexing, an ascending time slot had the channel code of the SF=16 of 16 equivalences to participate in joint-detection at most.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, the joint-detection ability of NODEB is represented by the number of the channel code of the SF=16 of the equivalence of participating in joint-detection in the same ascending time slot of NODEB support.For the channel that a spreading factor is SF, 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 one, after distributing the E-PUCH resource for a UE (that is: in step 202-4-2-2, after UE distribution E-PUCH), need to increase following processing:

After distributing the E-PUCH resource for 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, distribute a less E-PUCH resource perhaps for again this UE, perhaps, begin to dispatch next UE according to this UE scheduling failure is handled.

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

To each ascending time slot, be accumulated at the resource that other up channels take in the E-PUCH resource of distributing to each UE in this time slot and this time slot, if the channel code number of the SF=16 of these resource equivalences equals the ability of NODEB, then 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, when distributing the E-PUCH resource to UE, the channel code number that the E-PUCH resource of distributing to UE can not can also be supported greater than this time slot at the channel code number of the SF=16 of each time slot equivalence.

The above only is preferred embodiment of the present invention, and is in order to restriction the present invention, within the spirit and principles in the present invention not all, any modification of being made, is equal to replacement, improvement etc., all should be included within 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 that has, have only 1 HS-SICH on the HSUPA carrier wave, this HS-SICH takies the channel code of 1 SF=16.But the up channel of other types takies the channel code of plural SF=16 at least, and quantity is more.So just may occur: when at each ascending time slot of a subframe except that the scheduling E-PUCH resource, include only: when idle ascending resource and a HS-SICH, can not make the channel code of participating in the SF=16 of joint-detection in this time slot outnumber the joint-detection ability of NODEB when in any one ascending time slot, adopting resource multiplex.But when there was 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 was bound to surpass the joint-detection ability of NODEB.

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

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

In step 202, increase the processing of " specifying the channel type that allows ".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 appearred 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 above the joint-detection ability of NODEB.

Before the step 202-4-2-2 of embodiment one, increase a step: " judging in the scheduling of current subframe, whether can occur: 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 scheduling E-PUCH resource, the ascending resource of free time and channel appointed type in each ascending time slot in " n+d1+2 " subframe, carry out step 203-4-2-2 among the embodiment one.

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

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

Below, introduce embodiments of the invention four:

In HSUPA uses, there is following scene:

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

Present embodiment provides HSUPA scheduler and dispatching method at the scene that above-mentioned E-AGCH number equals 1.

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

Number at E-AGCH is 1 o'clock, and the present invention proposes is applied to MU MIMO technological expansion the up channel beyond the 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, a multiplexing scheduling E-PUCH resource of HSUPA UE resource in addition only can occur, that is: resource is multiplexing by 1 HSUPA UE at most beyond the scheduling E-PUCH resource.In this case, though the maximum multiplexing number of these resources 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, supporting ascending resource beyond the multiplexing scheduling E-PUCH resource of HSUPA UE, and be 2 or greater than 2 to the maximum multiplexing number of the resource beyond other any one scheduling E-PUCH resources, is 1 or greater than 1 o'clock method to idle uplink resource multiplexing number of times.The performing step of this method is as follows:

Step 301: determine channel combination or resource type combination that HSUPAUE 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.

N+d1+2 subframe uplink scheduling resource pool by combination of n+d1+2 subframe scheduling E-PUCH resource and determined channel or resource type combination in each channel or each resource type constitute at the ascending resource that the n+d1+2 subframe takies.

According to above-mentioned processing, the channel group of determining in step 301 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-defined plurality of application scenes, and be every kind of scene setting channel combination.When each subframe " n " constitutes " n+d1+2 " subframe uplink scheduling resource pool, judge the scene that " n+d1+2 " subframe satisfies, adopt the channel of determining under this scene to constitute the uplink scheduling resource pool of this subframe then.The constructive method of this uplink scheduling resource pool is more flexible.

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

Step 302-2-1: when UE of scheduling, at first determine this UE uplink resources available pond.

Step 302-2-2: select a rectangle resource that is no more than the UE ability in this UE uplink resources available pond, the data volume of the UE that this rectangle resource can be carried is maximum in all rectangle resources.Give this UE with this resource allocation, as the scheduling E-PUCH of this UE.Ascending resource can be represented with time slot and node.The ascending resource of being made up of same node in one or more time slots is exactly so-called rectangle resource.

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

Below provide an embodiment determining UE uplink resources available pond:

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

For any one other up channel that comprises in the uplink scheduling resource pool in (n+d1+2) subframe, determine that this up channel is idle or the signal of which UE of carrying.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 that is 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 that is scheduled can use this up channel to take.If the wireless channel correlation between these two UE is stronger, just think the ascending resource that this UE that is scheduled can't use this up channel to take.When UE can't use the resource that a up channel takies, resource from the uplink scheduling resource pool that this up channel is shared was removed.When the UE that is scheduled was exactly the UE that carries on this up channel, directly the resource that this up channel is shared was removed from the uplink scheduling resource pool.

The method of the correlation of the wireless channel of two UE of calculating sees also associated description among the embodiment one.

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

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

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, distribute training sequence deviation to UE.

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 the default training sequence deviation configuration mode, determine the training sequence deviation of this channel code correspondence, if this training sequence deviation has been assigned to other UE or up channel, then the scheduling of this UE is failed: perhaps re-execute step 302-2-2, distribute a less E-PUCH resource to UE; Perhaps finish scheduling, next UE in the formation of beginning dispatching priority to this UE.To the scheduling of next UE from above-mentioned steps 302-2-1.

Step 302-2-5: after successfully being 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: the UE to successfully being dispatched sends to physical layer with distributing to E-AGCH, the E-PUCH of this UE and the information of E-HICH.

To each UE that is scheduled, physical layer at first sends to UE at the E-AGCH that the n+d1 subframe will be distributed to this UE; Receive the E-PUCH that this UE sends in the n+d1+2 subframe then; At last, give this UE by the E-HICH that distributes to this UE with the ACK/NACK feedback information of E-PUCH in the n+d1+2+d subframe.

The above only is preferred embodiment of the present invention, and is in order to restriction the present invention, within the spirit and principles in the present invention not all, any modification of being made, is equal to replacement, improvement etc., all should be included within 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 four, after distributing the E-PUCH resource for a UE (that is: in step 302-2-2 distribute E-PUCH to UE after), need to increase following processing:

After distributing the E-PUCH resource for 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, distribute a less E-PUCH resource perhaps for again this UE, perhaps, begin to dispatch next UE according to this UE scheduling failure is handled.

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

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, then in this time slot, no longer dispatch any UE; If the channel code number of the SF=16 of these resource equivalences, calculates the number of channel code of the SF=16 of the participation joint-detection that this time slot can also support less than the ability of NODEB.At follow-up scheduling UE, when distributing the E-PUCH resource to UE, the channel code number that the E-PUCH resource of distributing to UE can not can also be supported greater than this time slot at the channel code number of the SF=16 of each time slot equivalence.

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

Embodiment six:

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

In step 302, increase the processing of " specifying the channel type that allows ".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 appearred 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 above the joint-detection ability of NODEB.

Before the step 302-1 of embodiment four, increase a step 302-0: " judging in the scheduling of current subframe, whether can occur: 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 scheduling E-PUCH resource, the ascending resource of free time and channel appointed type in each ascending time slot in " n+d1+2 " subframe, carry out step 302-1～step 302-2 among the embodiment four.

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

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

Below, introduce embodiments of the invention seven:

In HSUPA uses, there is following scene:

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

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

(3) do not support multiplexing identical resource between the UE

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

Present embodiment is 1 to provide HSUPA scheduler and dispatching method at the maximum multiplexing number of idling-resource in the above-mentioned scene.In above-mentioned scene, owing to the resource multiplex of not supporting between the 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 uses idle ascending resource.Because this method is not carried out the resource multiplex between the UE, and only use idling-resource, idling-resource only is used 1 time, therefore, can not occur under this method: 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 this 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 is made of scheduling E-PUCH resource and idle ascending resource.

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

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

Step 504: begin scheduling from the highest UE of dispatching priority.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: from the uplink scheduling resource pool, select a part of resource allocation to give UE, 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.Give this UE with this rectangle resource allocation, as the scheduling E-PUCH of this UE.

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

The uplink scheduling resource pool can also be divided into two sub-resource pools, dispatch at two sub-resource pools respectively.The method of dispatching at two sub-resource pools is with embodiment one particularly.

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

Step 504-4: after successfully being 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 that takies 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 next UE in the formation of step 504-1 dispatching priority.Otherwise, finish scheduling, execution in step 504-6 in current subframe.

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

To each UE that is scheduled, physical layer at first sends to UE at the E-AGCH that the n+d1 subframe will be distributed to this UE; Receive the E-PUCH that this UE sends in the n+d1+2 subframe then; At last, give this UE by the E-HICH that distributes to this UE with the ACK/NACK feedback information of E-PUCH in the n+d1+2+d subframe.

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

Below, introduce embodiments of the invention eight:

In HSUPA uses, there is following scene:

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

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

(3) still, a certain class resource in the resource that constitutes of the resource that can multiplexing other up channels takies of UE and idle ascending resource or multiclass resource or all resource.To the maximum multiplexing number of other any class resources is 2 or greater than 2.To the maximum multiplexing number of idle ascending resource is 1 or greater than 1.When the maximum multiplexing number of other types resource all is 2, represent 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, represent that this resource can only be multiplexing by a UE.

Present embodiment at the maximum multiplexing number of other kinds resource in the above-mentioned scene all be 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 do not support to carry out between the HSUPA UE 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-scheduling E-PUCH, SPS E-PUCH, UL DPCH, HS-SICH, PRACH and E-RUCCH.Above-mentioned other up channels can constitute multiple channel combination or resource type combination.Scheduler that proposes in the present embodiment and dispatching method are selected a kind of in above-mentioned multiple channel combination or resource type combination, are used to the various resources that realize that HSUPAUE uses scheduling E-PUCH resource and selecteed combination to comprise.Such as, the combination of selecting comprises: when idle ascending resource, non-scheduling E-PUCH and SPS E-PUCH, scheduler in the present embodiment and dispatching method are used to realize that HSUPA UE uses by RNC disposes the resource that constitutes to the resource in the E-PUCH resource pool of NODEB and idle ascending resource.

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

Step 601: determine each up channel that HSUPA UE can be multiplexing (ascending resource of free time is considered as 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 uplink scheduling resource pool is made of the resource that " n+d1+2 " subframe scheduling E-PUCH resource and all kinds of up channels that can be re-used take.

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

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

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

Step 601-4: begin scheduling from the highest UE of dispatching priority.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 the UE that determines to be scheduled can use.

When comprising in addition up channel of idle ascending resource (idle ascending resource is regarded as a kind of special up channel here) in the up channel of determining in the step 601, in the uplink scheduling resource pool, determine the E-PUCH resource that this UE can use as follows, carry out next step then.When the up channel beyond the ascending resource that does not comprise the free time in the up channel of determining in the step 601, think: all resources in the uplink scheduling resource pool all are 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 comprises in the uplink scheduling resource pool in (n+d1+2) subframe, determine that this up channel is idle or the signal of which UE of carrying.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 that is 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 that is scheduled can use this up channel to take.If the wireless channel correlation between these two UE is stronger, just think the ascending resource that this UE that is scheduled can't use this up channel to take.When UE can't use the resource that a up channel takies, resource from the uplink scheduling resource pool that this up channel is shared was removed.When the UE that is scheduled was exactly the UE that carries on this up channel, directly the resource that this up channel is shared was removed from the uplink scheduling resource pool.

Step 601-4-3: from the E-PUCH resource that this UE can use, select a part of resource allocation to give UE, as the E-PUCH of UE.

In this UE uplink resources available pond, select a rectangle resource that is no more than the UE ability, give this UE with this resource allocation, 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 distribute the method for the E-PUCH that satisfies above-mentioned condition can continue to use method in the pertinent literature to UE.

Also can with this UE can with the E-PUCH division of resources become two child resources.Described in embodiment one.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, distribute training sequence deviation to UE.

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 the default training sequence deviation configuration mode, determine the training sequence deviation of this channel code correspondence, if this training sequence deviation has been assigned to other UE or up channel, then the scheduling of this UE is failed: perhaps re-execute step 601-4-3, distribute a less E-PUCH resource to UE; Perhaps finish scheduling, next UE in the formation of beginning dispatching priority to this UE.To the scheduling of next UE from above-mentioned steps 601-4-1.

Step 601-4-6: after successfully being 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 the HSUPAUE.

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

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

To each UE that is scheduled, physical layer at first sends to UE at the E-AGCH that the n+d1 subframe will be distributed to this UE; Receive the E-PUCH that this UE sends in the n+d1+2 subframe then; At last, give this UE by the E-HICH that distributes to this UE with the ACK/NACK feedback information of E-PUCH in the n+d1+2+d subframe.

Because the resource that UE can multiplexing other up channels takies, may cause: the channel code number of SF=16 of participating in 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 distributing E-PUCH to UE or before, need the operation described in increase similar embodiment two, embodiment three, embodiment five and the embodiment six.

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

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

The multiplexing number module is used 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 note of k kind ascending resource is made Q _k, k, K are natural number, and k≤K;

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

Preferably, described resource pool module comprises:

The corresponding relation table unit is used to store the application scenarios that sets in advance and the mapping table of predefine uplink scheduling resource pool;

Query unit, the application scenarios of the subframe that is used to determine to be scheduled is searched described mapping table according to described application scenarios, obtains corresponding predefine uplink scheduling resource pool; And with described predefine uplink scheduling resource pool as the multiplexing uplink scheduling resource pool of 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 is constituted by scheduling E-PUCH resource and following any one ascending resource:

Combination a1: idle ascending resource;

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

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

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

Combination a5: idle ascending resource, non-scheduling 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 represents that the base station carries out the time delay of HSUPA scheduling, subframe that this time delay sends for the E-AGCH that gives the UE that is scheduled in current sub-frame allocation and the timing difference between the 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, j is listed as in the corresponding uplink scheduling resource pool of the capable element of i i node in j the time slot in this form, j is listed as the value z (j of the capable element of i, i) in the expression uplink scheduling resource pool in j time slot i node can by z (j, i) individual UE is shared in MU MIMO mode; I represents node number, i=0, and 1 ..., 30; J represents 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:

First judgment sub-unit is used to judge 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 is used for determining the node i of this channel code c correspondence; When if this channel code is the channel code that any one up channel takies among ULDPCH, non-scheduling E-PUCH, SPS E-PUCH, HS-SICH, PRACH and the E-RUCCH, j in the above table is listed as the maximum multiplexing number that the i row element is initialized as respective channels subtracts 1; If this channel code is the channel code that scheduling E-PUCH takies, j in the above table is listed as the maximum multiplexing number that the i row element is initialized as scheduling E-PUCH; Enable the 3rd initialization subelement after being finished;

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

The 3rd initialization subelement is determined 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 pairing form of this node is not initialised, but, the element of the father node correspondence of this node is initialised, and just the element of this node correspondence is initialized as with the corresponding element of its father node to have identical numerical value; Enable the 4th initialization unit after being finished;

The 4th initialization unit is used for the element that j row are not initialised as yet is initialized as the minimum value of the pairing element of all child nodes of the node of this element correspondence.

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

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

Described resource distribution module comprises:

First resource allocation unit, be used for selecting 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 can the data carried by data amount greater than other each rectangle resources in this uplink scheduling resource pool, gives described UE with this rectangle resource allocation.

Described resource distribution module comprises:

Second resource allocation unit is used for scheduling E-PUCH resource with the uplink scheduling resource pool as the first child resource pond, with the resource except that the first child resource pond in the uplink scheduling resource pool as the second child resource pond; Determine to be no more than the rectangle resource of described UE ability respectively 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 can the data carried by data amount greater than other each rectangle resources in this child resource pond; The data volume of more described two rectangle resource bearings is given current UE with wherein carrying a more rectangle resource allocation of data volume; If the data volume of two rectangle resource bearings is identical, then select a rectangle resource allocation to give current UE at random, perhaps, current UE is given in the less rectangle resource allocation of selecting to comprise SF=16 of channel code number.

Preferably, described resource distribution module further comprises:

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

Preferably, described correlation judging unit further comprises:

The first correlation calculations unit, be used to obtain the instantaneous value of channel estimating of up channel of p subframe the 2nd UE or the recursive average of channel estimating, this value is the instantaneous value of channel estimating of the up-to-date up channel that reports of the 2nd UE or the recursive average of channel estimating; The p subframe in each subframe of the recursive average of the instantaneous value of channel estimating of the up channel that can obtain the 2nd UE or 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 that reports of current UE or the recursive average of channel estimating; The q subframe in each subframe of the recursive average of the instantaneous value of channel estimating of the up channel that can obtain current UE or channel estimating before current subframe and the nearest subframe of the current subframe of distance;

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

$\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 the following formula, K _aThe number of expression base station reception antenna;

The instantaneous value or the recursive average of the up-to-date channel estimating that reports of expression current UE,

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

Instantaneous value or the recursive average of representing the up-to-date channel estimating that reports of the 2nd UE, Instantaneous value or the recursive average of representing the channel estimating of the 2nd UE on k root antenna; | h _x| and | h _y| represent h respectively _xAnd h _yMould.

Perhaps, described correlation judging unit further comprises:

The second correlation calculations unit is used to obtain 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 that reports of the 2nd UE; The p subframe in each subframe of DLBF weight vector of 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 that reports of current UE; The q subframe in each subframe of DLBF weight vector of 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 the following formula, | x| and | y| represents the mould of vector x and vector y respectively; Vector x and vector y represent the DLBF weight vector of current UE and the DLBF weight vector of the 2nd UE respectively.

Preferably, described scheduler further comprises:

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

Described training sequence deviation distribution module comprises:

Grouped element is used for all training sequence deviation groupings in the sub-district, and every group of interior training sequence deviation and channel code has predefined mapping relations;

Idle training sequence deviation selected cell is used to determine to distribute to the channel code that the scheduling E-PUCH of UE takies, and 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 are used for selected training sequence deviation is distributed to described UE, and described training sequence deviation is labeled as takies.

Described training sequence deviation distribution module comprises:

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

Search and allocation units, be used to determine to distribute to the channel code that the scheduling E-PUCH of UE takies, search the training sequence deviation of described channel code mapping, judge whether described training sequence deviation is occupied, if, then according to this UE scheduling failure is handled; Otherwise, described training sequence deviation is distributed to described UE, and described training sequence deviation is labeled as 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 ascending resource that judgement has distributed in the subframe that is scheduled whether cause the channel code of the spreading factor SF=16 that participates in joint-detection outnumbered the base station the joint-detection ability the channel code number that can support, if surpass, then resource distribution module is reselected less ascending resource and is distributed to current UE from the uplink scheduling resource pool, and the multiplexing number of the ascending resource correspondence that is assigned with is subtracted 1; If do not surpass, then resource distribution module subtracts 1 with the multiplexing number of the ascending resource correspondence that is assigned with.

Described resource distribution module further comprises:

The second joint-detection ability judging unit, be used for before resource distribution module is distributed to current UE from a part of ascending resource of uplink scheduling resource pool selection, calculating the channel code number of the SF=16 of the ascending resource equivalence that in any one time slot that the subframe uplink scheduling resource pool that is scheduled comprises, has distributed; Judgement the described channel code number of this time slot whether equal base stations united detectability the channel code number that can support, 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 all can not dispatch UE again at each time slot of the subframe uplink scheduling resource pool that is scheduled, then finish scheduling to current subframe, otherwise, describedly from the uplink scheduling resource pool, select a part of ascending resource to distribute to a part of ascending resource of distributing to UE described in the current UE need to satisfy following condition: 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 subframe of being calculated that is scheduled can also support at the channel code number of the SF=16 of each time slot equivalence; After distributing for the current UE of being scheduled to satisfy the ascending resource of above-mentioned requirements, resource distribution module subtracts 1 with described multiplexing number with the ascending resource correspondence that is assigned with.

Described resource distribution module further comprises: the first channel resource judging unit, be used 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 the predefined permission channel, if then 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, be used for being used 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 the predefined permission channel at each ascending time slot of the subframe that is scheduled, if then enable the second joint-detection ability judging unit; Otherwise do not enable the second joint-detection ability judging unit.

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

Claims (43)

1. one kind is adopted the high speed uplink bag of multi-user's multiple-input and multiple-output MU MIMO technology to insert the HSUPA dispatching method, it is characterized in that, comprises the steps:

A, in current subframe, determine the to be scheduled multiplexing uplink scheduling resource pool of user equipment (UE) of subframe, described uplink scheduling resource pool comprises a kind of in other ascending resources beyond the scheduling enhanced dedicated channel physical uplink channel E-PUCH resource at least, and other ascending resources beyond the described scheduling E-PUCH resource comprise: up idling-resource, uplink special physical channel UL DPCH resource, non-scheduling E-PUCH resource, semi-persistent scheduling SPS E-PUCH resource, high-speed shared information channel HS-SICH resource, the ascending control channel of the access at random 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 the described uplink scheduling resource pool; If total K kind ascending resource in the uplink scheduling resource pool, wherein the maximum multiplexing number note of k kind ascending resource is made Q _k, k, K are natural number, and k≤K;

Select one among 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, and the multiplexing number of the ascending resource correspondence that is assigned with is subtracted 1 as the scheduling E-PUCH of UE;

D, judge whether the UE that is not scheduled in addition, if return step C; Otherwise next subframe as current subframe, is returned 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: the application scenarios of the subframe of determining to be scheduled, search described mapping table according to described application scenarios, and obtain corresponding predefine uplink scheduling resource pool; And

With described predefine uplink scheduling resource pool as the multiplexing uplink scheduling resource pool of 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, and described predefined uplink scheduling resource pool is constituted by scheduling E-PUCH resource and following any one ascending resource:

Combination a1: idle ascending resource;

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

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

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

Combination a5: idle ascending resource, non-scheduling 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, the maximum multiplexing number unification of every kind of ascending resource is set to identical numerical value Q in the described uplink scheduling resource pool of step B.

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 comprises in the uplink scheduling resource pool is 2 or greater than 2 positive integer, and the multiplexing number of up idling-resource is 1 or greater than 1 positive integer.

6. method according to claim 1, it is characterized in that, the number of E-AGCH is a plurality of on the HSUPA carrier wave, the maximum multiplexing number of scheduling E-PUCH resource is 1, the multiplexing number of the other kinds resource that comprises in the uplink scheduling resource pool is 2 or greater than 2 positive integer, and the multiplexing number of up idling-resource is 1 or 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 represents that the base station carries out the time delay of HSUPA scheduling, subframe that this time delay sends for the E-AGCH that gives the UE that is scheduled in current sub-frame allocation and the timing difference between the 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, j is listed as in the corresponding uplink scheduling resource pool of the capable element of i i node in j the time slot in this form, j is listed as the value z (j of the capable element of i, i) in the expression uplink scheduling resource pool in j time slot i node can by z (j, i) individual UE is shared in MU MIMO mode; I represents node number, i=0, and 1 ..., 30; J represents 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 in step B2, otherwise execution in step B4;

B2, determine the node i of this channel code c correspondence; When if this channel code is the channel code that any one up channel takies among UL DPCH, non-scheduling E-PUCH, SPS E-PUCH, HS-SICH, PRACH and the E-RUCCH, j in the above table is listed as the maximum multiplexing number that the i row element is initialized as the respective channels resource subtracts 1; If this channel code is the channel code of scheduling E-PUCH resource occupation, j in the above table is listed as 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 the above table is listed as the maximum multiplexing number that the i row element is initialized as idle ascending resource; Execution in step B4 then;

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

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 pairing form of this node is not initialised, but, the element of the father node correspondence of this node is initialised, and just the element of this node correspondence is initialized as with the corresponding element of its father node to have identical numerical value;

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

10. method according to claim 1 is characterized in that, before the 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;

Select one to be among the described UE that never is scheduled of step C: from the UE that current subframe can be scheduled, to select the highest UE of the priority that is not scheduled as yet as current UE 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 from the uplink scheduling resource pool to comprise:

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 can the data carried by data amount greater than other each rectangle resources in this uplink scheduling resource pool, gives described UE with this rectangle resource allocation.

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 from the uplink scheduling resource pool to comprise:

With the scheduling E-PUCH resource in the uplink scheduling resource pool as the first child resource pond, with the resource except that the first child resource pond in the uplink scheduling resource pool as the second child resource pond;

Determine to be no more than the rectangle resource of described UE ability respectively 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 can the data carried by data amount greater than other each rectangle resources in this child resource pond; The data volume of more described two rectangle resource bearings is given current UE with wherein carrying a more rectangle resource allocation of data volume; If the data volume of two rectangle resource bearings is identical, then select a rectangle resource allocation to give current UE at random, perhaps, current UE is given in the less rectangle resource allocation of selecting to comprise SF=16 of channel code number.

13., it is characterized in that step C is described to select a part of ascending resource to distribute to before the current UE, further comprises according to each described method of claim 1 to 12 from the uplink scheduling resource pool:

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

14. method according to claim 13 is characterized in that, the correlation between the wireless channel of 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, this value is the instantaneous value of channel estimating of the up-to-date up channel that reports of the 2nd UE or the recursive average of channel estimating; The p subframe in each subframe of the recursive average of the instantaneous value of channel estimating of the up channel that can obtain the 2nd UE or 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 that reports of current UE or the recursive average of channel estimating; The q subframe in each subframe of the recursive average of the instantaneous value of channel estimating of the up channel that can obtain current UE or channel estimating before current subframe and the nearest subframe of the current subframe of distance;

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

$\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 the following formula, K _aThe number of expression base station reception antenna;

The instantaneous value or the recursive average of the up-to-date channel estimating that reports of expression current UE,

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

Instantaneous value or the recursive average of representing the up-to-date channel estimating that reports of the 2nd UE,

Instantaneous value or the recursive average of representing the channel estimating of the 2nd UE on k root antenna; | h _xWith | h _y| represent h respectively _xAnd h _yMould.

15. method according to claim 13 is characterized in that, the correlation between the wireless channel of 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 that reports of the 2nd UE; The p subframe in each subframe of DLBF weight vector of 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 that reports of current UE; The q subframe in each subframe of DLBF weight vector of 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 the following formula, | x| and | y| represents the mould of vector x and vector y respectively; Vector x and vector y represent the DLBF weight vector of current UE and the DLBF weight vector of the 2nd UE respectively.

16. method according to claim 13 is characterized in that, the described multiplexing number with the ascending resource correspondence that is assigned with 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 distributes training sequence deviation to comprise to current UE:

With all training sequence deviation groupings in the sub-district, every group of interior training sequence deviation and channel code has predefined mapping relations;

Determine to distribute to the channel code that the scheduling E-PUCH of UE takies, 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;

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

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

Describedly distribute training sequence deviation to comprise to current UE:

Determine to distribute to the channel code that the scheduling E-PUCH of UE takies, search the training sequence deviation of described channel code mapping, judge whether described training sequence deviation is occupied, if, then according to this UE scheduling failure is handled; Otherwise, described training sequence deviation is distributed to described UE, and described training sequence deviation is labeled as takies.

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

20., it is characterized in that step C is described to select a part of ascending resource to distribute to after the current UE, further comprises according to each described method of claim 1 to 12 from the uplink scheduling resource pool:

C1, judge the ascending resource that has distributed in the subframe that is scheduled whether cause the channel code of the spreading factor SF=16 that participates in joint-detection outnumbered the base station the joint-detection ability the channel code number that can support, if surpass, then from the uplink scheduling resource pool, reselect less ascending resource and distribute to current UE, and the multiplexing number that returns described in the step C ascending resource correspondence that will be assigned with subtracts 1 step, perhaps directly returns step C; If do not surpass, the multiplexing number that then returns described in the step C ascending resource correspondence that will be assigned with subtracts 1 step.

21., it is characterized in that step C is described to select a part of ascending resource to distribute to before the current UE, further comprises according to each described method of claim 1 to 12 from the uplink scheduling resource pool:

The channel code number of the SF=16 of the ascending resource equivalence that C2, calculating have distributed in any one time slot that the subframe uplink scheduling resource pool that is scheduled comprises; Judgement the described channel code number of this time slot whether equal base stations united detectability the channel code number that can support, if, to no longer dispatch any UE at this time slot, if not, then 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 all can not dispatch UE again at each time slot of the subframe uplink scheduling resource pool that is scheduled, then with next subframe as current subframe, return steps A; Otherwise, describedly from the uplink scheduling resource pool, select a part of ascending resource to distribute to a part of ascending resource of distributing to UE described in the current UE need to satisfy following condition: 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 subframe of being calculated that is scheduled can also support at the channel code number of the SF=16 of each time slot equivalence; Described multiplexing number with the ascending resource correspondence that is assigned with is subtracted 1 step distributing the ascending resource that satisfies above-mentioned requirements to return later among the step C for the current UE of being scheduled.

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

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

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

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

24. one kind is adopted the high speed uplink bag of MU MIMO technology to insert the HSUPA dispatching method, it is characterized in that, comprises the steps:

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

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

C2, available E-AGCH of selection distribute to current UE;

D2, from the uplink scheduling resource pool, select a part of resource allocation to give 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 successfully being after UE distributes E-AGCH, E-PUCH and E-HICH, to be arranged to the E-AGCH that distributes to this UE unavailable; Be arranged to the ascending resource that the scheduling E-PUCH of distributing this UE takies unavailable;

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

25. one kind is adopted the high speed uplink bag of multi-user's multiple-input and multiple-output MU MIMO technology to insert the HSUPA scheduler, it is characterized in that described scheduler comprises:

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

The multiplexing number module is used 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 note of k kind ascending resource is made Q _k, k, K are natural number, and k≤K;

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

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

The corresponding relation table unit is used to store the application scenarios that sets in advance and the mapping table of predefine uplink scheduling resource pool;

Query unit, the application scenarios of the subframe that is used to determine to be scheduled is searched described mapping table according to described application scenarios, obtains corresponding predefine uplink scheduling resource pool; And with described predefine uplink scheduling resource pool as the multiplexing uplink scheduling resource pool of 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 is constituted by scheduling E-PUCH resource and following any one ascending resource:

Combination a1: idle ascending resource;

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

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

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

Combination a5: idle ascending resource, non-scheduling 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 represents that the base station carries out the time delay of HSUPA scheduling, subframe that this time delay sends for the E-AGCH that gives the UE that is scheduled in current sub-frame allocation and the timing difference between the 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, j is listed as in the corresponding uplink scheduling resource pool of the capable element of i i node in j the time slot in this form, j is listed as the value z (j of the capable element of i, i) in the expression uplink scheduling resource pool in j time slot i node can by z (j, i) individual UE is shared in MU MIMO mode; I represents node number, i=0, and 1 ..., 30; J represents 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:

First judgment sub-unit is used to judge 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 is used for determining the node i of this channel code c correspondence; When if this channel code is the channel code that any one up channel takies among ULDPCH, non-scheduling E-PUCH, SPS E-PUCH, HS-SICH, PRACH and the E-RUCCH, j in the above table is listed as the maximum multiplexing number that the i row element is initialized as the respective channels resource subtracts 1; If this channel code is the channel code that scheduling E-PUCH takies, j in the above table is listed as 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 the above table is listed as the maximum multiplexing number that the i row element is initialized as up idling-resource; Enable the 3rd initialization subelement after being finished;

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

The 3rd initialization subelement is determined 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 pairing form of this node is not initialised, but, the element of the father node correspondence of this node is initialised, and just the element of this node correspondence is initialized as with the corresponding element of its father node to have identical numerical value; Enable the 4th initialization unit after being finished;

The 4th initialization unit is used for the element that j row are not initialised as yet is initialized as the minimum value of the pairing element of all child nodes of the node of this element correspondence.

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

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

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

First resource allocation unit, be used for selecting 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 can the data carried by data amount greater than other each rectangle resources in this uplink scheduling resource pool, gives described UE with this rectangle resource allocation.

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

Second resource allocation unit is used for scheduling E-PUCH resource with the uplink scheduling resource pool as the first child resource pond, with the resource except that the first child resource pond in the uplink scheduling resource pool as the second child resource pond; Determine to be no more than the rectangle resource of described UE ability respectively 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 can the data carried by data amount greater than other each rectangle resources in this child resource pond; The data volume of more described two rectangle resource bearings is given current UE with wherein carrying a more rectangle resource allocation of data volume; If the data volume of two rectangle resource bearings is identical, then select a rectangle resource allocation to give current UE at random, perhaps, current UE is given in the less rectangle resource allocation of selecting to comprise SF=16 of channel code number.

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

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

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

The first correlation calculations unit, be used to obtain the instantaneous value of channel estimating of up channel of p subframe the 2nd UE or the recursive average of channel estimating, this value is the instantaneous value of channel estimating of the up-to-date up channel that reports of the 2nd UE or the recursive average of channel estimating; The p subframe in each subframe of the recursive average of the instantaneous value of channel estimating of the up channel that can obtain the 2nd UE or 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 that reports of current UE or the recursive average of channel estimating; The q subframe in each subframe of the recursive average of the instantaneous value of channel estimating of the up channel that can obtain current UE or channel estimating before current subframe and the nearest subframe of the current subframe of distance;

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

$\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 the following formula, K _aThe number of expression base station reception antenna; The instantaneous value or the recursive average of the up-to-date channel estimating that reports of expression current UE, The instantaneous value or the recursive average of the channel estimating on the k root antenna of expression current UE, W represents that the window of channel estimating is long;

Instantaneous value or the recursive average of representing the up-to-date channel estimating that reports of the 2nd UE,

Instantaneous value or the recursive average of representing the channel estimating of the 2nd UE on k root antenna; | h _x| and | h _y| represent h respectively _xAnd h _yMould.

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

The second correlation calculations unit is used to obtain 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 that reports of the 2nd UE; The p subframe in each subframe of DLBF weight vector of 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 that reports of current UE; The q subframe in each subframe of DLBF weight vector of 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 the following formula, | x| and | y| represents the mould of vector x and vector y respectively; Vector x and vector y represent the DLBF weight vector of current UE and the DLBF weight vector of the 2nd UE respectively.

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

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

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

Grouped element is used for all training sequence deviation groupings in the sub-district, and every group of interior training sequence deviation and channel code has predefined mapping relations;

Idle training sequence deviation selected cell is used to determine to distribute to the channel code that the scheduling E-PUCH of UE takies, and 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 are used for selected training sequence deviation is distributed to described UE, and described training sequence deviation is labeled as takies.

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

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

Search and allocation units, be used to determine to distribute to the channel code that the scheduling E-PUCH of UE takies, search the training sequence deviation of described channel code mapping, judge whether described training sequence deviation is occupied, if, then according to this UE scheduling failure is handled; Otherwise, described training sequence deviation is distributed to described UE, and described training sequence deviation is labeled as takies.

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

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 ascending resource that judgement has distributed in the subframe that is scheduled whether cause the channel code of the spreading factor SF=16 that participates in joint-detection outnumbered the base station the joint-detection ability the channel code number that can support, if surpass, then resource distribution module is reselected less ascending resource and is distributed to current UE from the uplink scheduling resource pool, and the multiplexing number of the ascending resource correspondence that is assigned with is subtracted 1; If do not surpass, then resource distribution module subtracts 1 with the multiplexing number of the ascending resource correspondence that is assigned with.

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

The second joint-detection ability judging unit, be used for before resource distribution module is distributed to current UE from a part of ascending resource of uplink scheduling resource pool selection, calculating the channel code number of the SF=16 of the ascending resource equivalence that in any one time slot that the subframe uplink scheduling resource pool that is scheduled comprises, has distributed; Judgement the described channel code number of this time slot whether equal base stations united detectability the channel code number that can support, 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 all can not dispatch UE again at each time slot of the subframe uplink scheduling resource pool that is scheduled, then finish scheduling to current subframe, otherwise, describedly from the uplink scheduling resource pool, select a part of ascending resource to distribute to a part of ascending resource of distributing to UE described in the current UE need to satisfy following condition: 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 subframe of being calculated that is scheduled can also support at the channel code number of the SF=16 of each time slot equivalence; After satisfying the ascending resource of above-mentioned requirements for the current UE of being scheduled distribution, resource distribution module subtracts 1 with the multiplexing number of the described ascending resource correspondence that is 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, be used 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 the predefined permission channel, if then enable the first joint-detection ability judging unit; Otherwise, do not enable the first joint-detection ability judging unit.

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

Second channel resource judgment unit, be used 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 the predefined permission channel at each ascending time slot of the subframe that is scheduled, if then enable the second joint-detection ability judging unit; Otherwise do not enable the second joint-detection ability judging unit.

Images