CN102238731A - High speed downlink packet access (HSDPA) scheduler and scheduling method based on multi-user multiple input multiple output (MU MIMO) technology - Google Patents

Abstract

The invention provides a high speed downlink packet access (HSDPA) scheduling method and an HSDPA scheduler based on a multi-user multiple input multiple output (MU MIMO) technology. HSDPA user equipment (UE) can multiplex and schedule any downlink resource except high speed physical downlink shared channel (HS-PDSCH) resources in an MU MIMO way so as to effectively increase the downlink throughput and downlink peak rate of HSDPA. A default midamble shift allocation way is supported, so that the UE not supporting special default midamble shift allocation ways can multiplex the resources of the other UE.

Description

Adopt the HSDPA scheduler and the dispatching method of MU MIMO technology

Technical field

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

Background technology

At present, in high-speed downstream bag access (HSDPA), introduced multi-user (MU) multiple-input and multiple-output (MIMO) technology.That is: at down direction, a plurality of HSDPA subscriber equipmenies (UE) can be shared identical scheduling high-speed Physical Downlink Shared Channel (HS-PDSCH) resource.For these UE that shares identical scheduling HS-PDSCH resource, distribute different training sequence deviation for these UE based on the configuration mode of special default training sequence deviation (Midamble Shift).These different training sequence deviation are used for distinguishing the wireless channel of these UE.

Particularly, in the HSDPA that adopts MU MIMO technology, with K in the sub-district _mIndividual training sequence deviation is divided into the M group and shares identical scheduling HS-PDSCH resource in order to support M HSDPA 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,4.K _mHave with the value combination of M: the 1+7*2=15 kind.

For every kind of K _mValue combination with M, m ∈ { 0 in the M group training sequence deviation, 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 HS-PDSCH resource, need to give each UE to distribute different training sequence deviation.For k 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 HS-PDSCH 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.After assigning, 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.

HS-PDSCH scheduling of resource flow process of the prior art comprises the steps: as shown in Figure 1

Step 101: base station (NODEB) is at the group number m that determines to distribute to the scheduling HS-PDSCH resource of k 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 HS-PDSCH resource of this UE _k(HS-SCCH) sends to k UE by the scheduling high-speed shared control channel.

Step 102: described k UE monitors scheduling HS-SCCH, and can determine to distribute to its shared OVSF channel code of scheduling HS-PDSCH according to the information of the HS-PDSCH resource of carrying on the scheduling HS-SCCH.This UE is according to the group number m that carries on this OVSF channel code and the scheduling HS-SCCH _k, inquire about m _kOrganize the mapping relations between interior training sequence deviation and the OVSF channel code, can determine to distribute to its training sequence deviation.

Scheduling HS-PDSCH resource and the training sequence deviation of step 103:NODEB by distributing to this UE sends to this UE with high speed descending sharing channel (HS-DSCH) data block of this UE.

Step 104: this UE receives NODEB by the training sequence deviation of distributing to it with scheduling HS-PDSCH resource and sends to its HS-DSCH data block.

Step 105: this UE after receiving the HS-DSCH data block that NODEB sends, if this UE to this data block correct decoding, this UE just generates and confirms (ACK) information; Otherwise this UE just generates non-affirmation (NACK) information.Simultaneously, this UE will determine channel quality indication (CQI) information of HS-PDSCH according to the signal to noise ratio (snr) of the scheduling HS-PDSCH that receives.

Step 106: this UE is by giving NODEB with the high-speed shared information channel (HS-SICH) of scheduling HS-SCCH pairing with the CQI feedback information of the ACK/NACK information of this HS-DSCH data block and up-to-date HS-PDSCH.

Step 107:NODEB can obtain the ACK/NACK information of this UE feedback and the CQI information of HS-PDSCH by the HS-SICH of decoding with scheduling HS-SCCH pairing.When NODEB receives ACK information, NODEB will no longer retransmit this data block.When NODEB receives nack message, if this HS-DSCH data block does not reach maximum number of retransmissions, NODEB will retransmit this data block; Otherwise NODEB will no longer retransmit this data block.Carry out HSDPA when scheduling at NODEB, NODEB will be according to the CQI information of the up-to-date HS-PDSCH of this UE feedback, for this UE distributes suitable scheduling HS-PDSCH resource in order to transmit the HS-DSCH data block of this UE.

MU MIMO technology only is applied to dispatch the HS-PDSCH resource among the above-mentioned HSUPA.That is: a plurality of HSUPA UE can share the resource of dispatching in the physical down shared resource pond in MU MIMO mode.Because scheduling physical down shared resource pond only accounts for a part in the downlink resource that all descending time slots constitute, therefore, MU MIMO technology is all very limited for the raising of the raising of downlink throughput capacity among the HSDPA and descending peak rate among the HSDPA at present.

In the downlink resource that all descending time slots constitute, the shared resource of downward special physical channel (DL DPCH) of distributing to each UE can not adopt MU MIMO technology.In case a part of downlink resource is distributed to certain UE as DL DPCH, this resource just can not be used for other UE.

In the downlink resource that all descending time slots constitute, the semi-static HS-PDSCH 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 downlink resource as semi-static HS-PDSCH, this resource just can not be used for other UE.Unless NODEB discharges the semi-static HS-PDSCH resource of UE, distributes to the semi-static HS-PDSCH resource of UE and can be regained by NODEB.NODEB only after the semi-static HS-PDSCH resource of a UE is distributed in withdrawal, could give other UE with this resource allocation.

In the downlink resource that all descending time slots constitute, the resource that other down channels take can not adopt MU MIMO technology equally.Such as: the resource that HS-SCCH, enhancing dedicated channel absolute grant channel (E-AGCH), enhancing dedicated channel hybrid automatic repeat request indication channel (E-HICH), physical access channel (FPACH), multimedia broadcast multicast indicating channel (MICH), Secondary Common Control Physical Channel (SCCPCH) and Primary Common Control Physical Channel DSCH Downlink Shared Channels such as (PCCPCH) take just can not adopt MU MIMO technology.

In the downlink resource of free time, can not adopt MU MIMO technology equally.When having idle downlink resource (downlink resource that is not used) beyond RNC disposes to the descending shared resource pond of NODEB, this idle downlink resource is not used MU MIMO technology equally.Such as: RNC is used to support the DL DPCH of 4 SF=8 in the channel code resource of 4 SF=8 of TS6 reservation.Only dispose 1 DL 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 downlink resource.This idle downlink resource does not adopt MU MIMO technology equally.

If adopt MU MIMO technology in resource that other down channels beyond scheduling HS-PDSCH are shared and the idle downlink resource, just can further improve downlink throughput capacity and the descending peak rate of HSDPA.

Simultaneously, prior art only is supported in the special default training sequence deviation method of salary distribution and adopts MU MIMO technology among the HSDPA.For the HSDPA UE that does not support the special default training sequence deviation method of salary distribution, it can only determine to distribute to its training sequence deviation according to the channel code that the scheduling HS-PDSCH that distributes to it takies by the configuration mode of default training sequence deviation, and does not support the group number that will distribute to its training sequence deviation place by HS-SCCH 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 HS-PDSCH resource that the UE that do not support the special default training sequence deviation method of salary distribution can't multiplexing other UE.

Summary of the invention

The embodiment of the invention provides a kind of high-speed downstream bag of the multi-user's of employing multiple-input and multiple-output MU MIMO technology to insert the HSDPA dispatching method, comprises the steps:

A, at current subframe n, according to schedule constraints condition, determine the user equipment (UE) that can not be scheduled at current subframe n from a last subframe; After the described UE removal that can not be scheduled, determine the descending shared resource pond of n+d1+1 subframe, described descending shared resource pond comprises a kind of second class channel resource at least, and the second class channel is not for knowing the channel at the signaling bearer state of n+d1+1 subframe at current subframe n; D1 represents that the base station carries out the time delay of HSDPA scheduling;

B, determine the maximum multiplexing number of every kind of downlink resource in the described descending shared resource pond; Set total K kind downlink resource in the capable shared resource pond, wherein the maximum multiplexing number note of k kind downlink 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 described descending shared resource pond, select the non-vanishing resource of a part of multiplexing number to distribute to current UE, and the multiplexing number of the channel code of the resource correspondence that is assigned with is subtracted 1 as the scheduling high-speed Physical Downlink Shared Channel HS-PDSCH of UE;

D, judge in the described resource of distributing to current UE whether comprise the second class channel resource, if, the schedule constraints condition that the sign and the described second class channel resource information of current UE is saved as next subframe then;

E, judge whether that all UE all have been scheduled or do not have the multiplexing number of each channel code in available HS-SCCH or the described descending shared resource pond to be zero, if next subframe as current subframe, is returned steps A; Otherwise, return step C.

Preferably, set in advance the mapping table in the descending shared resource of application scenarios and predefine pond;

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 the corresponding descending shared resource of predefine pond; And

All kinds of resources that the descending shared resource of described predefine pond is comprised are as the multiplexing descending shared resource pond of the UE of the subframe that is scheduled.

Preferably, the described second class channel comprises enhancing dedicated channel absolute grant channel E-AGCH, strengthens dedicated channel mixed automatic retransmission request indicating channel E-HICH, high-speed shared control channel HS-SCCH and/or physical access channel FPACH.

Preferably, the down channel resources of the theaomni-directional transmission that comprises in the described descending shared resource pond is one of following down channel resources or its combination in any: Primary Common Control Physical Channel PCCPCH, Secondary Common Control Physical Channel SCCPCH and MBMS indicating channel MICH.

Preferably, step B comprises:

According to determined descending shared resource pond, the multiplexing form in the descending shared resource of initialization pond, j is listed as in the corresponding descending shared resource of the capable element of the i pond channel code of i SF=16 in j the time slot in this form, value z (the j of this element, i) in the expression descending shared resource pond in j time slot i channel code can by z (j, i) individual UE is shared in MU MIMO mode; Here, i represents the number of the channel code of SF=16, i=1, and 2 ..., 16; J represents j the time slot in descending shared resource pond, j=1 ..., K _TS, use K _TSRepresent the time slot sum that descending shared resource pond comprises, use t _jThe timeslot number of representing j the time slot in descending shared resource pond, and

Preferably, the multiplexing form in the descending shared resource of described initialization pond comprises:

B1, the descending shared resource of judgement pond are at current time slots t _jWhether comprise channel code i, if, execution in step B2, otherwise execution in step B3; When beginning to carry out, current time slots t _jFirst time slot for descending shared resource pond;

The HS-PDSCH resource is shared if this channel code of B2 i is scheduled, with j in the above table be listed as i row element z (j, i) be initialized as z (j, i)=M, wherein M represents to dispatch the maximum multiplexing number of HS-PDSCH resource;

Take if this channel code is idle downlink resource, j in the above table is listed as the maximum multiplexing number that the i row element is initialized as idle downlink resource;

Down channel if this channel code is scheduled beyond HS-PDSCH resource and the descending idling-resource is shared, j in the above table is listed as i row element z (j, i) be initialized as z (j, i)=Q-1, wherein Q represents to take the maximum multiplexing number of the down channel of this channel code i; Execution in step B4 then;

B3, j in the form be listed as the i row element be initialized as 0, that is: z (j, i)=0; Execution in step B4 then;

B4, judgement are at current time slots t _jThe channel code that whether also has no initializtion is if then change the channel code number and return step B1, otherwise judge whether the time slot of no initializtion in addition, if then next time slot is returned step B1 as current time slots, otherwise, finish the processing of the multiplexing form in initialization descending shared resource pond.

Preferably, steps A is described at current subframe n, according to the schedule constraints condition from a last subframe, determines to comprise at the user equipment (UE) that current subframe n can not be scheduled:

According to schedule constraints condition from a last subframe, be informed in the resource that all HS-SCCH that the HS-PDSCH that distributes to a UE before the current subframe n taken " n+d1+1 " subframe take, then this UE can not be scheduled in current subframe.

Preferably, before the described steps A, further comprise: the dispatching priority of determining current each UE of subframe;

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

Preferably, step C is described selects a part of resource allocation to comprise to current UE from descending shared resource pond:

From available descending shared resource pond, select not exceed the rectangle resource allocation of the maximum of this UE ability and give this UE; 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 descending shared resource pond;

When the rectangle resource of selecting according to the method described above can the data carried by data amount during greater than the data volume of UE, from available downlink resource pond, select a rectangle resource that is no more than the UE ability, this rectangle resource is to carry minimum rectangle resource in the rectangle resource of total data amount of UE, gives UE with this rectangle resource allocation.

Preferably, step C is described selects a part of resource allocation to comprise to current UE from descending shared resource pond:

With the scheduling HS-PDSCH resource in the descending shared resource pond as the first child resource pond, with the resource except that the first child resource pond in the descending shared resource pond as the second child resource pond;

Determine to be no more than the rectangle resource of the maximum 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;

When the rectangle resource of selecting according to the method described above can the data carried by data amount during greater than the data volume of UE, the total data amount of selecting to carry UE from above-mentioned two sub-resource pools is no more than the rectangle resource of the minimum of UE ability again, gives UE with this rectangle resource allocation.

Preferably, step C is described to select a part of resource allocation to give before the current UE from descending shared resource pond, further comprises:

Judge in the described descending shared resource pond whether the shared resource of each down channel beyond scheduling HS-PDSCH resource and the descending idling-resource is available for current UE, and disabled downlink resource is removed.

Preferably, describedly judge in the described descending shared resource pond whether the shared resource of each down channel beyond scheduling HS-PDSCH resource and the descending idling-resource is available for current UE, and disabled downlink resource removed comprise as one of judging or its combination in any:

Idle downlink resource can be used current UE;

The shared resource of down channel of not carrying other UE signals in the n+d1+1 subframe can be used current UE;

The shared resource of down channel that omnidirectional sends can be used current UE;

The shared resource of the second class channel can be used current UE;

And

For the down channel that has carried the 2nd UE in the n+d1+1 subframe, 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 the shared resource of this down channel is unavailable, otherwise is available; The down channel of described carrying the 2nd UE is included in the HS-PDSCH that current subframe has been distributed to the UE that is successfully dispatched.

Preferably, step C is described to select the non-vanishing resource of a part of multiplexing number to distribute to before the current UE as the scheduling HS-PDSCH of UE from descending shared resource pond, further comprises:

From all available HS-SCCH, select a HS-SCCH to distribute to current UE;

Step C is described to select the non-vanishing resource of a part of multiplexing number to distribute to after the current UE as the scheduling HS-PDSCH of UE from descending shared resource pond, further comprises:

To distribute to current UE with the HS-SICH of described HS-SCCH pairing.

Preferably, the described step of selecting a HS-SCCH to distribute to current UE from all available HS-SCCH comprises:

C1, with the available HS-SCCH of current all available HS-SCCH as this UE;

C2, from the HS-SCCH that this UE can use optional HS-SCCH, judge whether this HS-SCCH multiplexing by the HS-PDSCH of other UE, if not, then this HS-SCCH is distributed to this UE; If then determine each UE of multiplexing this HS-SCCH, and carry out C3;

The correlation of the wireless channel of each UE of C3, the wireless channel that calculates described current UE and multiplexing this HS-SCCH;

Whether the wireless channel correlation of the UE of C4, the wireless channel of judging described current UE and each multiplexing this HS-SCCH is less than the relevance threshold that sets in advance, if then this HS-SCCH is distributed to current UE; Otherwise, described HS-SCCH is removed from the HS-SCCH that current UE can be used, and execution in step C5;

C5, judge whether the HS-SCCH that this UE in addition can use, if, go to step C2, otherwise, finish scheduling to current UE, re-execute step C.

Preferably, step C is described to select the non-vanishing resource of a part of multiplexing number to distribute to after the current UE as the scheduling HS-PDSCH of UE from descending shared resource pond, further comprises: distribute training sequence deviation to current UE; 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;

Select one group from described respectively organize the training sequence deviation, the interior training sequence deviation corresponding with included each channel code of the HS-PDSCH that distributes to this UE of this group is not assigned to other UE or other down channels;

Give UE with this set of dispense, and will organize the corresponding training sequence deviation of each channel code that interior and the HS-PDSCH that distributes to this UE comprise and be marked as and take.

Preferably, step C is described to select the non-vanishing resource of a part of multiplexing number to distribute to after the current UE as the scheduling HS-PDSCH of UE from descending shared resource pond, further comprises: distribute training sequence deviation to current UE; Describedly distribute training sequence deviation to comprise: the mapping relations between pre-configured training sequence deviation and the channel code to current UE; Determine to distribute to each channel code that the scheduling HS-PDSCH of UE takies, search each training sequence deviation of described each channel code mapping, judge whether there is occupied training sequence deviation in described each training sequence deviation, if, then according to this UE scheduling failure is handled; Otherwise, described each training sequence deviation is distributed to described UE, and described each training sequence deviation is labeled as takies.

Preferably, whether the described judgement of step D comprises the second class channel resource in the described resource of distributing to current UE, if then the schedule constraints condition that the sign and the described second class channel resource information of current UE is saved as next subframe comprises:

If the described second class channel resource comprises E-AGCH and/or E-HICH, the sign and the multiplexing E-AGCH and/or the E-HICH resource information of current UE of current UE are transferred to high speed uplink packet HSUPA scheduler, be used to retrain the scheduling process of next subframe HSUPA scheduler.

Preferably, whether the described judgement of step D comprises the second class channel resource in the described resource of distributing to current UE, if then the schedule constraints condition that the sign and the described second class channel resource information of current UE is saved as next subframe comprises:

If the described second class channel resource comprises HS-SCCH, the sign and the multiplexing HS-SCCH resource information of current UE of current UE saved as the schedule constraints condition that the HSDPA scheduler carries out next subframe scheduling.

Preferably, whether the described judgement of step D comprises the second class channel resource in the described resource of distributing to current UE, if then the schedule constraints condition that the sign and the described second class channel resource information of current UE is saved as next subframe comprises:

If the described second class channel resource comprises FPACH, the sign and the multiplexing FPACH resource information of current UE of current UE saved as the schedule constraints condition that the SYNC-UL scheduler carries out next subframe scheduling.

The high-speed downstream bag that the embodiment of the invention also proposes a kind of multi-user's of employing multiple-input and multiple-output MU MIMO technology inserts the HSDPA scheduler, comprising:

The resource pool module is used at current subframe n, according to the schedule constraints condition from a last subframe, determines the user equipment (UE) that can not be scheduled at current subframe n; After the described UE removal that can not be scheduled, determine the descending shared resource pond of n+d1+1 subframe, described descending shared resource pond comprises a kind of second class channel resource at least, and the second class channel is not for knowing the channel at the signaling bearer state of n+d1+1 subframe at current subframe n; D1 represents that the base station carries out the time delay of HSDPA scheduling;

The multiplexing number module, the maximum multiplexing number of the every kind of downlink resource in described descending shared resource pond that is used for determining that the resource pool module is determined; Set total K kind downlink resource in the capable shared resource pond, wherein the maximum multiplexing number note of k kind downlink 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 descending shared resource pond, select the non-vanishing resource of a part of multiplexing number to distribute to current UE, and the multiplexing number of the channel code of the resource correspondence that is assigned with is subtracted 1 as the scheduling high-speed Physical Downlink Shared Channel HS-PDSCH of UE;

The constraints module is used for judging whether the resource of distributing to current UE at resource distribution module comprises the second class channel resource, if, the schedule constraints condition that the sign and the described second class channel resource information of current UE is saved as next subframe then; And

Judge module judges whether that all UE all have been scheduled or do not have the multiplexing number of each channel code in available HS-SCCH or the described descending shared resource pond to be zero, if next subframe as current subframe, is enabled the resource pool module; Otherwise, enable resource distribution module.

Preferably, described resource pool module comprises:

The corresponding relation table unit is used to store the mapping table that sets in advance application scenarios and the descending shared resource of predefine pond;

Query unit, the application scenarios of the subframe of determining to be scheduled is searched described mapping table according to described application scenarios, obtains the corresponding descending shared resource of predefine pond; All kinds of resources that the descending shared resource of described predefine pond is comprised are as the multiplexing descending shared resource pond of the UE of the subframe that is scheduled.

Preferably, the described second class channel comprises enhancing dedicated channel absolute grant channel E-AGCH, strengthens dedicated channel mixed automatic retransmission request indicating channel E-HICH, high-speed shared control channel HS-SCCH and/or physical access channel FPACH.

Preferably, the down channel resources of the theaomni-directional transmission that comprises in the described descending shared resource pond is one of following down channel resources or its combination in any: Primary Common Control Physical Channel PCCPCH, Secondary Common Control Physical Channel SCCPCH and MBMS indicating channel MICH.

Preferably, described multiplexing number module comprises:

Initialization unit, be used for according to determined descending shared resource pond, the multiplexing form in the descending shared resource of initialization pond, j is listed as in the corresponding descending shared resource of the capable element of the i pond channel code of i SF=16 in j the time slot in this form, value z (the j of this element, i) in the expression descending shared resource pond in j time slot i channel code can by z (j, i) individual UE is shared in MU MIMO mode; Here, i represents the number of the channel code of SF=16, i=1, and 2 ..., 16; J represents j the time slot in descending shared resource pond, j=1 ..., K _TS, use K _TSRepresent the time slot sum that descending shared resource pond comprises, use t _jThe timeslot number of representing j the time slot in descending shared resource pond, and

Preferably, described initialization unit further comprises:

First judging unit judges that descending shared resource pond is at current time slots t _jWhether comprise channel code i, if enable first initialization unit, otherwise enable second initialization unit; When beginning to carry out, current time slots t _jFirst time slot for descending shared resource pond;

First initialization unit, the HS-PDSCH resource is shared if this channel code i is scheduled, with j in the above table be listed as i row element z (j, i) be initialized as z (j, i)=M, wherein M represents to dispatch the maximum multiplexing number of HS-PDSCH resource;

Take if this channel code is idle downlink resource, j in the above table is listed as the maximum multiplexing number that the i row element is initialized as idle downlink resource;

Down channel if this channel code is scheduled beyond HS-PDSCH resource and the descending idling-resource is shared, j in the above table is listed as i row element z (j, i) be initialized as z (j, i)=Q-1, wherein Q represents to take the maximum multiplexing number of the down channel of this channel code i; Be finished the back to second judging unit output index signal;

Second initialization unit is used for that form j is listed as the i row element and is initialized as 0, that is: z (j, i)=0; Be finished the back to second judging unit output index signal;

Second judging unit is used for after the index signal of receiving from first initialization unit or second initialization unit, judges at current time slots t _jThe channel code that whether also has no initializtion is if then change the channel code number and enable first judging unit; Otherwise, judge whether the time slot that is not initialised in addition, if then change current time slots t _jValue and enable first judging unit, finish index signal otherwise externally export initialization.

Preferably, this scheduler further comprises: priority block is used for determining the dispatching priority of current each UE of subframe;

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, selects the highest UE of the priority that is not scheduled as yet as current UE.

Preferably, described resource distribution module comprises:

First resource allocation unit is selected not exceed the rectangle resource allocation of the maximum of this UE ability and is given this UE from available descending shared resource pond; 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 descending shared resource pond;

When the rectangle resource of selecting according to the method described above can the data carried by data amount during greater than the data volume of UE, from available downlink resource pond, select a rectangle resource that is no more than the UE ability, this rectangle resource is to carry minimum rectangle resource in the rectangle resource of total data amount of UE, gives UE with this rectangle resource allocation.

Preferably, described resource distribution module comprises:

Second resource allocation unit is used for scheduling HS-PDSCH resource with descending shared resource pond as the first child resource pond, with the resource except that the first child resource pond in the descending shared resource pond as the second child resource pond; Determine to be no more than the rectangle resource of the maximum 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;

When the rectangle resource of selecting according to the method described above can the data carried by data amount during greater than the data volume of UE, the total data amount of selecting to carry UE from above-mentioned two sub-resource pools is no more than the rectangle resource of the minimum of UE ability again, gives UE with this rectangle resource allocation.

Preferably, resource distribution module further comprises:

The availability judging unit, be used for selecting a part of resource allocation to before the current UE from descending shared resource pond at resource distribution module, judge whether the shared resource of each down channel in the described descending shared resource pond is available for current UE, and disabled downlink resource is removed.

Preferably, described availability judging unit comprises one of following subelement or its combination in any:

The first availability judgment sub-unit judges that the downlink resource of free time can be used current UE;

The second availability judgment sub-unit, the shared resource of down channel that judgement is not carried other UE signals in the n+d1+1 subframe can be used current UE;

The 3rd availability judgment sub-unit judges that the shared resource of down channel of omnidirectional's transmission can be used current UE;

The 4th availability judgment sub-unit judges that the shared resource of the second class channel can use current UE;

And

The 5th availability judgment sub-unit, for the down channel that has carried the 2nd UE in the n+d1+1 subframe, 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 the shared resource of this down channel is unavailable, otherwise is available; The down channel of described carrying the 2nd UE is included in the HS-PDSCH that current subframe has been distributed to the UE that is successfully dispatched.

Preferably, described scheduler further comprises:

The HS-SCCH distribution module, be used for selecting from descending shared resource pond from all available HS-SCCH, to select a HS-SCCH to distribute to current UE before the non-vanishing resource of a part of multiplexing number distributes to current UE as the scheduling HS-PDSCH of UE at described resource distribution module;

The HS-SICH distribution module, be used for selecting from descending shared resource pond will distribute to current UE with the HS-SICH of described HS-SCCH pairing after the non-vanishing resource of a part of multiplexing number distributes to current UE as the scheduling HS-PDSCH of UE at described resource distribution module.

Preferably, described HS-SCCH distribution module comprises:

UE can with HS-SCCH the unit is set, with the available HS-SCCH of current all available HS-SCCH as this UE;

The one HS-SCCH allocation units, optional HS-SCCH judges whether this HS-SCCH is multiplexing by the HS-PDSCH of other UE from the HS-SCCH that this UE can use, if not, then this HS-SCCH is distributed to this UE; If then determine each UE of multiplexing this HS-SCCH, and enable the 2nd HS-SCCH allocation units;

The 2nd HS-SCCH allocation units are used to calculate the correlation of wireless channel of each UE of the wireless channel of described current UE and multiplexing this HS-SCCH; Whether the wireless channel correlation of UE of judging the wireless channel of described current UE and each multiplexing this HS-SCCH is less than the relevance threshold that sets in advance, if then this HS-SCCH is distributed to current UE; Otherwise, described HS-SCCH is removed from the HS-SCCH that current UE can be used, and enables HS-SCCH availability judging unit;

HS-SCCH availability judging unit is used to judge whether to also have available HS-SCCH, if enable HS-SCCH allocation units once more; Otherwise the notice resource distribution module finishes the scheduling to current UE.

Preferably, this scheduler further comprises:

The first training sequence deviation distribution module, with all training sequence deviation groupings in the sub-district, every group of interior training sequence deviation and channel code has predefined mapping relations; Select one group from described respectively organize the training sequence deviation, the interior training sequence deviation corresponding with included each channel code of the HS-PDSCH that distributes to this UE of this group is not assigned to other UE or other down channels; Give UE with this set of dispense, and will organize the corresponding training sequence deviation of each channel code that interior and the HS-PDSCH that distributes to this UE comprise and be marked as and take.

Preferably, this scheduler further comprises:

The second training sequence deviation distribution module is used for the mapping relations between pre-configured training sequence deviation and the channel code; Determine to distribute to each channel code that the scheduling HS-PDSCH of UE takies, search each training sequence deviation of described each channel code mapping, judge whether there is occupied training sequence deviation in described each training sequence deviation, if, then according to this UE scheduling failure is handled; Otherwise, described each training sequence deviation is distributed to described UE, and described each training sequence deviation is labeled as takies.

Preferably, described constraints module comprises:

The first constraints unit, when the described second class channel resource comprises E-AGCH and/or E-HICH, the sign and the multiplexing E-AGCH and/or the E-HICH resource information of current UE of current UE are transferred to high speed uplink packet HSUPA scheduler, be used to retrain the scheduling process of next subframe HSUPA scheduler.

Preferably, described constraints module comprises:

The second constraints unit when the described second class channel resource comprises HS-SCCH, saves as the schedule constraints condition that the HSDPA scheduler carries out next subframe scheduling with the sign and the multiplexing HS-SCCH resource information of current UE of current UE.

Preferably, described constraints module comprises:

The 3rd constraints unit when the described second class channel resource comprises FPACH, saves as the schedule constraints condition that the SYNC-UL scheduler carries out next subframe scheduling with the sign and the multiplexing FPACH resource information of current UE of current UE.

As can be seen from the above technical solutions, when current subframe is dispatched, consider the constraint of last subframe scheduling result to current subframe, and current scheduling result to the subframe that is scheduled can become the schedule constraints condition of next subframe, thereby make the signaling bearer status channel resource of those current subframes of not knowing to be scheduled, also can use the HSDPA scheduling scheme of MU MIMO technology.

Description of drawings

Fig. 1 is a HS-PDSCH scheduling of resource flow chart of the prior art;

The scheduling flow figure that Fig. 2 proposes for the embodiment of the invention at current subframe " n " HSDPA scheduler;

Fig. 3 is to the scheduling flow figure of a UE in the embodiment of the invention.

Embodiment

When time-division S-CDMA (TD-SCDMA) system adopts the Typical Disposition of 2:4, in 5 descending time slots, the descending shared resource pond that is made of scheduling HS-PDSCH resource takies 3.5 or 4 descending time slots usually, and the resource of other descending time slots is used to distribute the down channel of other types; When the TD-SCDMA system adopted the Typical Disposition of 3:3, descending shared resource pond took 2.5 or 3 descending time slots usually in 4 descending time slots, and the resource of other descending time slots is used to distribute the down channel of other types.The down channel of described other types includes but not limited to:

(1) downward special physical channel (DL DPCH)

(2) semi-static HS-PDSCH

(3) High-Speed Shared Control Channel (HS-SCCH)

(4) strengthen dedicated channel absolute grant channel (E-AGCH)

(5) strengthen dedicated channel hybrid automatic repeat request indication channel (E-HICH)

(6) quick Acquisition Indicator Channel (FPACH)

(7) Primary Common Control Physical Channel (PCCPCH)

(8) Secondary Common Control Physical Channel (SCCPCH)

(9) MBMS informing indication channel (MICH)

(10) Kong Xian downlink resource (this resource can be considered as a kind of special down channel)

If be used to distribute the downlink resource of above-mentioned down channel, in other words, can adopt MU MIMO technology if be used for the downlink resource of other down channels beyond the allocation schedule HS-PDSCH, just can will adopt the descending time slot expansion for interface quantity of MU MIMO technology to whole descending time slots.Such as: when adopting the 2:4 configuration, can expand to whole 5 descending time slots; When adopting the 3:3 configuration, can expand to whole 4 descending time slots.Like this, can effectively promote downlink throughput capacity and descending peak rate among the HSDPA.

For further improving downlink throughput capacity and the descending peak rate of HSDPA, the present invention proposes: in HSDPA, MU MIMO technology is applied to dispatch all kinds of down channels or all kinds of downlink resource outside the HS-PDSCH, makes HSDPAUE share the downlink resource that whole descending time slots constitute in MU MIMO mode.

Concrete analysis to all kinds of down channels outside the scheduling HS-PDSCH is as follows:

DL DPCH is a dedicated channel, in case distribute to a UE, is just monopolized by this UE.NODEB can know the wireless channel of the UE with DL DPCH by channel estimating.NODEB can select from all HSDPAUE and the very weak UE of wireless channel correlation with UE of DL DPCH fully, and these selecteed UE can share the shared downlink resource of DL DPCH in MU MIMO mode.

Semi-static HS-PDSCH distributes to UE by NODEB, in case NODEB distributes to UE with semi-static HS-PDSCH, this semi-static HS-PDSCH is just monopolized by this UE.Equally, NODEB can determine to have the wireless channel of the UE of semi-static HS-PDSCH by channel estimating, NODEB can select from all HSDPA UE and the very weak UE of wireless channel correlation with UE of semi-static HS-PDSCH equally, and these selecteed UE can share the shared ascending resource of semi-static HS-PDSCH in the mode of MU MIMO.

HS-SCCH is a DSCH Downlink Shared Channel.In any subframe " n ", the HSDPA scheduler of NODEB all will carry out a HSDPA scheduling.When UE of HSDPA scheduler decision scheduling, will distribute HS-SCCH and HS-PDSCH to UE.The HS-SCCH that distributes to this UE will send in the n+d1 subframe, and the HS-PDSCH that distributes to this UE will send in the n+d1+1 subframe.Here, d1 represents that NODEB carries out the time delay of HSDPA scheduling.Generally, d1=1.Therefore, in " n " subframe, the HSDPA scheduler of NODEB will distribute the resource in the descending shared resource pond of " n+d1+1 " subframe to each UE that is scheduled.In any subframe " n ", when the HSDPA scheduler of NODEB was dispatched, NODEB only knew which UE the HS-SCCH of " n+d1 " subframe belongs to, and does not know which UE the HS-SCCH of " n+d1+1 " subframe belongs to.When NODEB carries out the HSDPA scheduling in " n+1 " subframe, know just which UE the HS-SCCH of " n+d1+1 " subframe belongs to.

With respect to the HSDPA scheduling of n subframe, DSCH Downlink Shared Channels such as E-AGCH, E-HICH and FPACH have following characteristics respectively:

(1) in any subframe " n ", the HSUPA scheduler of NODEB carries out a HSUPA scheduling.When UE of HSUPA scheduler decision scheduling, will distribute E-AGCH and E-HICH to UE.The E-AGCH that distributes to this UE will send in the n+d2 subframe, and the E-HICH that distributes to this UE will send in the n+d2+2+d3 subframe.Here, d2 represents that NODEB carries out the time delay of HSUPA scheduling.D3 represents to strengthen the timing difference between the subframe that subframe that dedicated channel physical uplink channel (E-PUCH) sends and E-HICH send, and this timing difference is by parameter n _E-HICHDetermine.Generally, d2=d1, d3=0,1,2,3.Therefore, when n subframe NODEB carried out the HSDPA scheduling, NODEB knew which UE the E-HICH of " n+d1+1 " subframe belongs to, but does not know which UE the E-AGCH of " n+d1+1 " subframe belongs to.When NODEB carries out the HSUPA scheduling in " n+1 " subframe, know just which UE the E-AGCH of n+d1+1 subframe belongs to.But, if the disposal ability of NODEB is very strong, satisfy: d2=0, during d3=0, when NODEB carries out the scheduling of " n " subframe, just may not know which UE the E-HICH of " n+d1+1 " subframe belongs to.

(2) in any subframe " n ", NODEB carries out the scheduling of a SYNC-UL sequence.When the NODEB decision responds the SYNC-UL sequence of a UE, will distribute FPACH to UE.The FPACH that distributes to this UE will send in the n+d4 subframe.If d4＞=2, then when n subframe NODEB carried out the HSDPA scheduling, NODEB knew which UE the FPACH of n+d1+1 subframe belongs to.Generally, the possible value of d4 is: 1,2,3 and 4.

In sum, when NODEB carries out HSDPA when scheduling in the n subframe, distribute the HS-PDSCH resource of " n+d1+1 " subframe to UE.NODEB may know which UE E-HICH of " n+d1+1 " subframe and FPACH belong to, and does not know which UE HS-SCCH of " n+d1+1 " subframe and E-AGCH belong to.So, belong to which UE if NODEB knows E-HICH of " n+d1+1 " subframe and FPACH, NODEB just can select appropriate H SDPA UE with MU MIMO mode sharing E-HICH and FPACH at the shared downlink resource of n+d1+1 subframe.

Based on above-mentioned analysis, the inventor proposes: HSDPAUE not only can share scheduling HS-PDSCH resource in MU MIMO mode, and can be with the downlink resource of the every other type beyond the shared scheduling of the MU MIMO mode HS-PSDCH resource.The downlink resource of these types includes but not limited to: resource that DL DPCH, semi-static HS-PDSCH, E-HICH, FPACH, HS-SCCH, E-AGCH, MICH, SCCPCH and PCCPCH are shared and idle downlink resource.

Certainly, for consideration, can not adopt MU MIMO technology in respective channel to some in other down channels or some channel quality of reception yet.Such as, can in the down channel that omnidirectional sends in the sub-district such as PCCPCH, MICH and SCCPCH, not adopt MU MIMO technology.

At this situation, the inventor proposes, and other downlink resources beyond all scheduling HS-PDSCH resources can be constituted multiple combination according to actual needs, and every kind of combination can be made of a class resource wherein, or the multiclass resource constitutes or all resource constitute.MU MIMO technological expansion can be applied in wherein any one combination.Such as: MU MIMO technology only can be extended in the idle downlink resource; Perhaps the MUMIMO technology only is extended to: in semi-persistent scheduling HS-PDSCH resource and the downlink resource of free time.

The embodiment of the invention will propose to support the HSDPA scheduler and the corresponding dispatching method of MU MIMO technology, and this scheduler and dispatching method can make the HSDPA scheduler can be with all kinds of downlink resources beyond the multiplexing scheduling of the MU MIMO mode HS-PDSCH resource.

When dispatching, distribute the scheduling HS-PDSCH resource of " n+d1+1 " subframe in any subframe " n " at the HSDPA scheduler.All kinds of down channels in " n+d1+1 " sub-frame configuration can be divided into following type:

(1) first kind channel: the HSDPA scheduler knows that when the n subframe is dispatched each down channel that belongs to the first kind in " n+d1+1 " subframe is idle or the signal of which UE of carrying.In other words, as long as scheduler knows that when the n subframe is dispatched a down channel in " n+d1+1 " subframe is idle or the signal of which UE of carrying, this down channel just belongs to the first kind.Generally, such channel includes but not limited to: semi-persistent scheduling HS-PSDCH, DL DPCH and idle downlink resource.

(2) second class channels: the HSDPA scheduler does not know that when the n subframe is dispatched at each down channel that " n+d1+1 " subframe belongs to second class be idle or the signal of which UE of carrying.In other words, as long as scheduler does not know that when the n subframe is dispatched a down channel in " n+d1+1 " subframe is idle or the signal of which UE of carrying, this down channel just belongs to second class.Generally, such channel includes but not limited to: E-AGCH and HS-SCCH.FPACH may belong to first kind channel in the scheduling of some subframe, belong to the second class channel in the scheduling of other subframe.According to above-mentioned HSUPA dispatching method, E-AGCH belongs to the second class channel certainly.But when adopting other HSUPA dispatching method, the E-AGCH channel also may become first kind channel.

(3) the 3rd class channels: the channel that omnidirectional sends includes but not limited to: PCCPCH, SCCPCH and MICH.If assurance to the quality of reception of these down channels, is not generally adopted MU MIMO technology on such channel.But, also can on these channels, adopt the MUMIMO technology in some specific application scenario.

The inventor also proposes, and adopts the default training sequence deviation method of salary distribution can support the multiplexing identical scheduling HS-PDSCH resource of a plurality of UE equally.Such as, in the default training sequence deviation method of salary distribution of descending 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 TS5 are distributed to UE1, with channel code in the TS5 number is 3-4, spreading factor is that channel code and the M2 of SF=16 distributes to UE2, and these two UE equally can multiplexing identical resource: the channel code that comprises two SF=16 that UE2 uses in the channel code of the SF=1 of UE1.

Scheduler and dispatching method that the embodiment of the invention proposes not only can be realized HSDPA UE with the multiplexing scheduling of MUMIMO mode HS-PDSCH resource, and can realize that HSDPA UE is with the shared resource of the multiplexing other kinds down channel of MU MIMO mode.That is: can make HSDPA UE with multiplexing all downlink resources of MU MIMO mode.Certainly, also can use this scheduler and dispatching method only to realize that HSDPA UE is with the multiplexing channel resource of dispatching each type that comprises in HS-PSCH resource and the combination of selected channel type of MU MIMO mode.

In the scheduling scheme that the embodiment of the invention proposes, the scheduling between each subframe may not be separate, and in this case, current subframe is dispatched the scheduling result that obtains will be as the constraints that next subframe is dispatched.For example:

(1), when current subframe is dispatched, if distribute to the HS-PDSCH of UE multiplexing the resource of E-AGCH, and when current subframe is dispatched, when this E-AGCH belongs to the second class channel, then the scheduling result of current subframe will offer the HSUPA scheduler as the constraints of next subframe, be used to retrain the scheduling process of this HSUPA scheduler.

(2), when current subframe is dispatched, if distribute to the HS-PDSCH of UE multiplexing the resource of HS-SCCH, and when current subframe is dispatched, when this HS-SCCH belongs to the second class channel, the scheduling result of the current subframe HSDPA scheduler that will offer as the constraints of next subframe then is used to retrain the scheduling process of this HSDPA scheduler.

The dispatching method flow process that the embodiment of the invention proposes comprises the steps:

Steps A: determine the combination of the HS-PDSCH channel type in addition that HSDPA UE can be multiplexing.

HSDPA UE can the multiplexing non-resource that HS-PDSCH down channel in addition takies of dispatching.Described resource can be represented with the resource that the down channel type combination takies.Wherein, idle downlink resource can be regarded as the resource that a kind of special down channel takies.In the embodiment of the invention, the downlink resource that HSDPA UE can be multiplexing comprises the resource of one second class channel occupancy at least.

The scheduling of step B:HSDPA scheduler start-up period.In any one subframe " n " subsequently, the HSDPA scheduler carries out a HSDPA scheduling.

At current subframe " n ", the scheduling flow of HSDPA scheduler comprises the steps: as shown in Figure 2

Step 201:, determine the dispatching priority of each the HSDPA UE of subframe (n subframe) in current scheduling if when current subframe is later first subframe of scheduler start-up period scheduling.According to dispatching priority order from high to low all UE 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.

If when current subframe " n " was not later first subframe of scheduler start-up period scheduling, the HSDPA scheduler was dispatched in the following manner:

According to schedule constraints condition, determine the UE that the subframe in current scheduling can not be scheduled from a last subframe.After these UE that can not be scheduled are removed, calculate the dispatching priority of other each HSDPA UE.According to dispatching priority order from high to low all UE 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.

The UE that can not be scheduled in the subframe of described definite current scheduling is: according to the schedule constraints condition from a last subframe, be informed in the resource that each HS-SCCH that the HS-PDSCH that distributes to a UE before the current subframe taken " n+d1+1 " subframe takies, then this UE can not be scheduled in current subframe.

The method that the scheduler of NODEB calculates each HSUPA UE dispatching priority is a lot, such as: polling method, max carrier to interference (C/I) method and equitable proportion (PF) 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: determine the HS-SCCH that can use in current subframe.In current subframe, all HS-SCCH that dispose on the carrier wave that is scheduled are available HS-SCCH.

Step 203: the descending shared resource pond of determining the n+d1+1 subframe in the n subframe.

Scheduling HS-PDSCH resource in current subframe (n subframe) HSDPA scheduler schedules " n+d1+1 " subframe.Therefore, need to determine: all downlink resources that comprise in the descending shared resource of n+d1+1 subframe pond.

The descending shared resource of " n+d1+1 " subframe pond comprises that all kinds of down channels that comprise in " n+d1+1 " subframe scheduling HS-PDSCH resource and the determined channel type combination of steps A are in the shared resource of " n+d1+1 " subframe.

According to above-mentioned processing, the channel type combination of determining in steps A is used for the descending shared resource pond of " n+d1+1 " subframe of definite each subframe " n " use.But, may be in different application scenarioss at different subframe NODEB.Can pre-defined plurality of application scenes, and be every kind of corresponding channel type combination of scene setting.When each subframe " n " constitutes the descending shared resource of " n+d1+1 " subframe pond, judge the scene that " n+d1+1 " subframe satisfies, adopt the channel type of determining under this scene to constitute the descending shared resource pond of this subframe then.The constructive method in this descending shared resource pond is more flexible.

Step 204: the multiplexing form in the descending shared resource of initialization pond.

If the descending shared resource pond that step 203 is determined comprises K _TSIndividual time slot is formulated a 16 * K _TSThe multiplexing form in descending shared resource pond of dimension.J is listed as in the corresponding descending shared resource of the capable element of the i pond channel code of i SF=16 in j the time slot in this form, value z (the j of this element, i) in the expression descending shared resource pond in j time slot i channel code can (j, i) individual UE be shared in MU MIMO mode by z.Here, i represents the number of the channel code of SF=16, i=1, and 2 ..., 16; J represents j the time slot in descending shared resource pond, j=1 ..., K _TSUse t _jThe timeslot number of j time slot of expression scheduling E-PUCH resource pool, and $t_1<t_2<......<t_j<......<t_{K_{\mathrm{TS}}}.$

According to the descending shared resource pond that obtains in the step 203, this 16 * K of initialization _TSThe multiplexing form in descending shared resource pond of dimension.Initial method is as follows:

For descending shared resource pond at time slot t _jThe channel code c that comprises when the channel if this channel code is scheduled beyond the HS-PDSCH is shared, is listed as the i row element with j in the above table and is initialized as Q-1, that is: z (j, i)=Q-1.This channel code is initialized as Q-1 to be represented: this channel code is used by a down channel, and this channel code is merely able to again by Q-1 UE is shared in MU MIMO mode in addition.Here, Q represents to take the maximum times that the shared resource of down channel of this channel code is re-used.Every kind of channel for comprising in the channel type combination can be provided with the number of times that the shared resource of this channel is re-used at most separately.Certainly, also the maximum multiplexing number of each channel of comprising in the channel type combination can be arranged to identical value.

For descending shared resource pond at time slot t _jThe channel code c that comprises if this channel code is shared for scheduling HS-PDSCH resource, then is listed as j in the above table i row element and is initialized as M, that is: z (j, i)=M.Here, M represents the maximum times that each channel code is re-used in this scheduling HS-PDSCH resource.

For descending shared resource pond at time slot t _jThe channel code c that comprises when if this channel code is taken by descending idling-resource, is listed as the i row element with j in the above table and is initialized as P, that is: z (j, i)=P.This channel code is initialized as P to be represented: this channel code can be again by P UE is shared in MU MIMO mode in addition.P is the maximum multiplexing number of idle downlink resource.Preferably, P=M.

The maximum multiplexing number Q of each channel can be identical in the combination of M and channel type, also can be different.That is: the maximum multiplexing number of the shared resource of the maximum times that is re-used of scheduling HS-PDSCH resource and the channel of a non-scheduling HS-PDSCH can be different, also can be identical.

For the descending shared resource of " n+d1+1 " subframe pond at time slot t _jChannel code c not to be covered is listed as the i row element with j in the form and is initialized as 0, that is: (j i)=0, represents that this channel code does not belong to descending shared resource pond to z, and this channel code is unavailable.

The value of above-mentioned parameter M, P and Q also can be set to different values according to subframe different.

Step 205: begin to dispatch UE one by one according to queue sequence from the highest UE of priority.

To the scheduling flow of a UE as shown in Figure 3, comprise the steps:

Step 301: when UE of scheduling, from all available HS-SCCH, select a HS-SCCH to distribute to UE.If can't just finish scheduling successfully for UE distributes a HS-SCCH, begin to dispatch next UE to this UE.To the scheduling of next UE from step 301.

This step specifically comprises following substep:

Step 301-1: make that all available HS-SCCH are the HS-SCCH that this UE can use.Optional HS-SCCH judges whether this HS-SCCH is multiplexing by the HS-PDSCH of other UE from the HS-SCCH that this UE can use, if, execution in step 301-2 then, otherwise, this HS-SCCH is distributed to the UE that is scheduled, and end step 301, go to step 302.

Step 301-2: determine the HS-PDSCH of which UE of n+d1+1 subframe multiplexing the shared channel code of this HS-SCCH.

Step 301-3: the correlation of wireless channel of calculating each UE of the wireless channel of the UE that is scheduled in current subframe and multiplexing this HS-SCCH.

Step 301-4: whether the wireless channel correlation of UE of judging the wireless channel of the UE that current subframe is scheduled and each multiplexing this HS-SCCH less than the relevance threshold that sets in advance, if, execution in step 301-5 then, otherwise, execution in step 301-6.

Step 301-5: this HS-SCCH is distributed to the UE that current subframe is scheduled, and end step 301, go to step 302.

Step 301-6: with this HS-SCCH from this UE can with HS-SCCH remove, judge whether the HS-SCCH that this UE in addition can use, if not, just finish scheduling to this UE, begin to dispatch next UE.To the scheduling of next UE from step 301.If, from the HS-SCCH that this UE can use, select a HS-SCCH, judge whether this HS-SCCH is multiplexing by the HS-PDSCH of other UE, if, execution in step 301-2 then, otherwise, this HS-SCCH is distributed to the UE that is scheduled, go to step 302.

Step 302: from descending shared resource pond, select a part of downlink resource to distribute to UE as scheduling HS-PDSCH.If the downlink resource of selecting can't carry the minimum data piece of UE, just finish scheduling, next UE in the formation of beginning dispatching priority to UE.To the scheduling of next UE from step 301.

This step determines to distribute to the HS-PDSCH of UE according to following substep.

Step 302-1: when UE of scheduling, at first need to determine: the descending shared resource pond that this UE can use.The method of determining the descending shared resource pond that UE can use is as follows:

Determine in the descending shared resource of " n+d1+1 " subframe pond whether the shared resource of any one other down channel can be that this UE uses beyond scheduling HS-PDSCH and the idle downlink resource.

When this channel is a channel that omnidirectional sends when promptly belonging to the channel of the 3rd class, directly think: the resource of this channel occupancy can be used this UE.

For the second class channel, think that directly the resource of this channel occupancy can be used by UE.

For the first kind channel in the descending shared resource pond in " n+d1+1 " subframe, if this channel is left unused in " n+d1+1 " subframe, the resource of this channel occupancy can be used by UE.Otherwise, determine on this down channel the signal of which UE of carrying.Correlation between the wireless channel of the UE that is carried on the wireless channel of the UE that investigation is scheduled and this down channel.If the wireless channel correlation between these two UE less than the relevance threshold that sets in advance, then think between these two UE the wireless channel correlation a little less than, the downlink resource that this UE that is scheduled can use this down channel to take.If the wireless channel correlation between these two UE, thinks then that the wireless channel correlation between these two UE is stronger more than or equal to the relevance threshold that sets in advance, the downlink resource that this UE that is scheduled can't use this down channel to take.If when the current UE that is scheduled can't use the resource that a down channel takies, resource from descending shared resource pond that this down channel is shared was removed.When the UE that is scheduled was exactly the UE that carries on this down channel, directly the resource that this down channel is shared was removed from descending shared resource pond.

Whether if when before this UE the UE that is successfully dispatched being arranged, needing to investigate the shared downlink 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 downlink 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 downlink 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 downlink resource of the UE that successfully dispatched, the employed downlink resource of will this quilt from descending shared resource pond successfully dispatching of UE removes.

For calculating the correlation of wireless channel between two UE, need physical layer any subframe " p " with this subframe in the instantaneous value of channel estimating of any one up channel or the recursive average of channel estimating report the HSDPA scheduler.The HSDPA scheduler is known the signal of which UE of carrying on any one up channel of p subframe.Therefore, the HSDPA scheduler is known: the instantaneous value or the recursive average of channel estimating that has the UE of at least one up channel in the p subframe.When calculating the correlation between the wireless channel of two UE at the HSDPA 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.See also pertinent literature based on wireless channel correlation calculations method between two UE of channel estimating.Because this method is not a content of the present invention, repeats no more here.

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.When adopting this method to calculate between two UE wireless channels correlation, need the DLBF weight vector of any one up channel that physical layer calculates in this subframe in any subframe (p) to report the HSUPA scheduler.Scheduler is known the signal of which UE of carrying on any one up channel of p subframe.Therefore, scheduler is known: the DLBF weight vector that has the UE of at least one up channel in the p subframe.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.See also pertinent literature based on the wireless channel correlation calculations method between two UE of DLBF weight vector.Because this method is not a content of the present invention, repeats no more here.

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

Step 302-2: when not comprising any channel code in the available descending shared 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 301.Otherwise, from the available descending shared resource pond of UE, select a part of resource to distribute to UE as HS-PDSCH.

From available descending shared resource pond, select not exceed the rectangle resource allocation of the maximum of this UE ability and give this UE.UE has requirement to the number of time slot of the HS-PDSCH that distributes to it, and this number of time slot can not surpass the maximum number of time slot that this UE can support.

If this rectangle resource can the data carried by data amount greater than the actual amount of data of this UE, this UE is given in the rectangle resource allocation of then selecting not exceed this UE Capability Requirement from available descending shared resource pond, the rectangle resource of minimum in the rectangle resource that this rectangle resource is all total datas that can carry this UE.If the channel code of the SF=16 that the channel code number of the SF=16 that rectangle resource comprises comprises less than another rectangle resource, then this rectangle resource is less than another rectangle resource.

In this step, can also take following processing to distribute the HS-PDSCH resource to UE:

The descending shared resource pond that this is available is divided into two sub-resource pools: a sub-resource pool is made of scheduling HS-PDSCH resource in this available resources pond fully; Another child resource pond is made of the resource of other types.

Distribute the HS-PDSCH resource of the maximum that is no more than the UE ability in these two sub-resource pools, for respectively this UE.

If when in first child resource pond, distributing to the HS-PDSCH resource of this UE and can carry more data, just distributing to the HS-PDSCH resource of this UE in first child resource pond as the HS-PDSCH that distributes to this UE.

If when in second sub-resource pool, distributing to the HS-PDSCH resource of this UE and can carry more data, just distributing to the HS-PDSCH resource of this UE in second sub-resource pool as the HS-PDSCH that distributes to this UE.

If it is identical to distribute to the data volume of HS-PDSCH resource bearing of this UE in two sub-resource pools, select a sub-resource pool at random, will distribute to the HS-PDSCH resource of this UE in this child resource pond as the HS-PDSCH that distributes to this UE.

If the rectangle resource of Xuan Zeing can the data carried by data amount during greater than the actual amount of data of UE according to the method described above, just in these two sub-resource pools, select to be no more than the UE ability and can carry the rectangle resource of minimum of the total data of UE, minimum rectangle resource in the rectangle resource that this rectangle resource is all total datas that can carry this UE.This rectangle resource is distributed to this UE as HS-PDSCH.

Step 303: will distribute to this UE with the HS-SICH of the HS-SCCH pairing of distributing to UE, as the scheduling HS-SICH of this UE.

Step 304: distribute training sequence deviation to UE.The method of salary distribution has following two kinds, adopts 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.

Select one group of training sequence deviation in N group training sequence deviation, the training sequence deviation of distributing to each shared channel code correspondence of the HS-PDSCH of this UE in this group training sequence deviation is not assigned to other channels or other UE.Should organize training sequence deviation and distribute to this UE, and the training sequence deviation that will distribute to this UE identifies, and to become be to take.

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.

Each channel code shared according to the HS-PDSCH 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 each training sequence deviation of each channel code correspondence, if the existing training sequence deviation that is assigned to other UE or other down channels in these training sequence deviation is then failed to the scheduling of this UE; Perhaps re-execute step 302-2, distribute a less HS-PDSCH 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 301.

Step 305: the HS-SCCH that will distribute to this UE removes from available HS-SCCH; The channel code resource updates 16 * K shared according to the HS-PDSCH that distributes to UE _TSThe multiplexing form in descending shared resource pond of dimension; Redefine descending shared resource pond according to the multiplexing form in descending shared resource pond that upgrades.

After finishing above-mentioned processing, if do not have available HS-SCCH or descending shared resource pond not to comprise that any channel code or all UE are dispatched, with regard to execution in step 306.After finishing above-mentioned processing, if available HS-SCCH is arranged, and descending shared resource pond comprises the channel code of 1 SF=16 at least, and the UE that is not scheduled in addition, just begins next UE in the dispatching priority formation.To the scheduling of next UE from above-mentioned steps 301.

Upgrade 16 * K _TSThe method of the multiplexing form in descending shared resource pond of dimension is as follows:

For the HS-PDSCH that distributes to UE, if this HS-PDSCH comprises the channel code i of j time slot in the descending shared resource pond, the value that then j in the form 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 descending shared resource pond, and then expression does not have available HS-PDSCH resource.Have 1 element at least greater than 0 in upgrading the later multiplexing form in descending shared resource pond, then expression has available HS-PDSCH resource, can dispatch next UE.In scheduling during next UE, descending shared resource pond is not that 0 the pairing channel code of element constitutes by upgrading in the later multiplexing form in descending shared resource pond all.

Step 306: each UE to successfully being dispatched sends to physical layer with distributing to HS-SCCH, the HS-PDSCH of this UE and the information of HS-SICH.

To each UE that is scheduled, physical layer at first sends to UE at the HS-SCCH that the n+d1 subframe will be distributed to this UE; In the n+d1+1 subframe HS-PDSCH is sent to UE then; At last, receive UE in the n+d1+3 subframe and send to the ACK/NACK information of HS-DSCH data block of NODEB and the CQI information of HS-PDSCH by HS-SICH.

Step 307: judge UE that current subframe is scheduled whether multiplexing the resource of the second class channel occupancy, if, the schedule constraints condition that sign and the second multiplexing class channel resource information of described UE is saved as next subframe then.

For example,

The a certain dedicated downlink channel that in the channel type combination of determining, comprises HSUPA, such as: E-AGCH or E-HICH, and the down channel of this kind HSUPA special use when current subframe is dispatched (such as: E-AGCH or E-HICH) when belonging to the second class channel, in the UE that current subframe is scheduled, determine to distribute to the HS-PDSCH of each UE whether multiplexing the resource that takies of this kind dedicated downlink channel (such as E-AGCH or E-HICH).The resource that this kind down channel takies if the HS-PDSCH of the UE that has is multiplexing, then the message transmission of each UE of the resource that multiplexing this kind down channel is taken and this kind down channel that each UE takies is given next subframe HSUPA scheduler, is used to retrain the scheduling process of next subframe HSUPA scheduler.

Such as, the HS-PDSCH that distributes to " n+d1+1 " subframe of UE 1 comprises all channel code of TS5.Two E-AGCH have just in time been disposed at TS5.And when the n subframe was dispatched the HS-PDSCH resource of distributing " n+d1+1 " subframe, which UE scheduler two E-AGCH of " n+d1+1 " subframe belong to was not also known at the HSDPA scheduler.At this time, these two E-AGCH just belong to the second class channel.In this case, the message transmission that just UE of UE 1 sign and the HS-PDSCH that distributes to this UE has been taken E-AGCH1 and E-AGCH2 is given the HSUPA scheduler.

But, when the HSDPA scheduler when the n subframe is dispatched the HS-PDSCH resource of distributing " n+d1+1 " subframe, if scheduler is known two E-AGCH of " n+d1+1 " subframe and is belonged to which UE, this E-AGCH is not the second class channel just, does not just need to transmit any constraint information to the HSUPA scheduler of next subframe.

In the channel type combination of determining, comprise HS-SCCH, and when this HS-SCCH belongs to the second class channel when current subframe is dispatched, in the UE that current subframe is scheduled, determine to distribute to the HS-PDSCH of each UE whether multiplexing the resource that takies of HS-SCCH.If have the HS-PDSCH of UE multiplexing the resource that takies of HS-SCCH, then the UE of the resource that multiplexing HS-SCCH is taken and HS-SCCH resource information that this UE takies are transferred to next subframe HSDPA scheduler, are used to retrain the scheduling process of next subframe HSDPA scheduler.

In the channel type combination of determining, comprise FPACH, and when this FPACH belongs to the second class channel in the scheduling of current subframe, in the UE that current subframe is scheduled, determine to distribute to the HS-PDSCH of each UE whether multiplexing the resource that takies of FPACH.The UE of the resource that multiplexing FPACH is taken and the FPACH resource information that this UE takies are transferred to next subframe SYNC-UL scheduler, are used to retrain the scheduling process of next subframe SYNC-UL scheduler.

For the HSUPA scheduler, when this scheduler carried out the scheduling of current subframe, if not from the constraints of previous subframe HSDPA scheduler and HSUPA scheduler, then current HSUPA scheduler is unaffected to be dispatched as usual.If when this scheduler carries out the scheduling of current subframe, have from the constraints of previous subframe HSDPA scheduler or from the constraints of previous subframe HSUPA scheduler, then current subframe HSUPA scheduler need be made following modification in the process of scheduling as usual:

The HSUPA scheduler needs basis from the constraints of the HSDPA scheduler of previous subframe or the constraints of HSUPA scheduler, carries out following processing:

At first, need to judge according to the constraints from previous subframe at current subframe " n " HSUPA scheduler: whether the resource that " n+d1 " subframe E-AGCH takies is multiplexing by the HS-PDSCH of the UE that is scheduled before current subframe institute.

If the resource that " n+d1 " subframe E-AGCH takies is not multiplexing by the HS-PDSCH of the UE that is scheduled before current subframe institute, the scheduling of current subframe HSUPA scheduler is with unaffected.Otherwise current subframe HSUPA scheduler will increase respective handling:

When the HSUPA scheduler was dispatched, this scheduler need be determined the UE that can be scheduled in current subframe.When this scheduler was dispatched as usual, for the HSUPA scheduler, the UE that has non-scheduling E-PUCH and semi-static E-PUCH in " n+d1+2 " subframe can not be scheduled in current subframe.

When the HSUPA scheduler according to concluding from the constraints of previous subframe: the resource that " n+d1 " subframe E-AGCH takies is by HS-PDSCH when multiplexing, the HSUPA scheduler also need be determined the UE that can not be scheduled according to following criterion after the UE that determines according to the method described above to be scheduled:

For each E-AGCH of " n+d1 " subframe, determine the HS-PDSCH of which UE among the UE of HSDPA scheduler schedules before current subframe multiplexing this E-AGCH resource.Taken the resource that all E-AGCH of " n+d1 " subframe take if distribute to the HS-PDSCH of a UE, then this UE can not be in current subframe by the HSUPA scheduler schedules.

When the HSUPA scheduler distributed E-AGCH for the UE that is scheduled, when dispatching as usual, when beginning to dispatch, all E-AGCH of RNC configuration were available E-AGCH on this carrier wave.When distributing E-AGCH, only need from available E-AGCH, select an E-AGCH to get final product to UE.After an E-AGCH being distributed to a UE and this UE and successfully being dispatched by the HSUPA scheduler, the HSUPA scheduler can be arranged to the E-AGCH that distributes to this UE unavailable, makes other UE not use the E-AGCH that distribute to this UE.

When the HSUPA scheduler according to concluding from the constraints of a last subframe, the resource that " n+d1 " subframe E-AGCH takies, is needed to distribute E-AGCH to UE as follows when multiplexing when distributing E-AGCH to UE by the HS-PDSCH of some UE:

Determine whether the shared resource of each E-AGCH of n+d1 subframe has distributed to some UE, as the HS-PDSCH of these UE.If determine each UE of multiplexing this E-AGCH.

When beginning to dispatch, all E-AGCH on this carrier wave are arranged to " available ".When distributing E-AGCH for a UE, from available E-AGCH, select an E-AGCH.If this E-AGCH is not multiplexing by the HS-PDSCH of any UE, then this E-AGCH is distributed to the UE that is scheduled.Otherwise, investigate the correlation of wireless channel of each UE of the wireless channel of the UE that is scheduled in current subframe and multiplexing this E-AGCH.If the wireless channel correlation of the wireless channel of the UE that current subframe is scheduled and the UE of each multiplexing this E-AGCH all a little less than, then this E-AGCH can be distributed to the UE that current subframe is scheduled.Otherwise, reselect an available E-AGCH.According to above-mentioned criterion, determine whether that the E-AGCH that this can be reselected distributes to UE.

If according to above-mentioned criterion, the E-AGCH that a quilt is reselected can be distributed to this UE, just this E-AGCH is distributed to this UE.If neither one E-AGCH can distribute to this UE, just finish scheduling to this UE, begin to dispatch next UE.

The HSUPA scheduler also needs to judge according to the constraints from previous subframe " n-1 ": whether the resource that " n+d1+1 " subframe E-AGCH takies is multiplexing by the HS-PDSCH of some UE before current subframe institute.

If the resource that " n+d1+1 " subframe E-AGCH takies is by the HS-PDSCH of some UE before the current subframe institute when multiplexing, current subframe HSUPA scheduler needs this information is sent to the scheduling process that next subframe HSUPA scheduler is used to retrain next subframe HSUPA scheduler as the constraints of current subframe.

Other scheduling processes of HSUPA scheduler are not subjected to the influence from the constraints of a last subframe HSDPA scheduler or HSUPA scheduler.Because HSUPA scheduling process and step are not research contents of the present invention, only list affected aspect here.

For the SYNC-UL scheduler, when this scheduler carried out the scheduling of current subframe, if not from the constraints of previous subframe HSDPA scheduler, then the SYNC-UL scheduler was unaffected in the scheduling of current subframe, as usual scheduling.If when this scheduler carries out the scheduling of current subframe, the constraints from previous subframe HSDPA scheduler is arranged, then current subframe SYNC-UL scheduler has following two selections:

(1) scheduling as usual: may cause under this selection: UE can't receive the FPACH that distributes to it.

(2) need in the process of scheduling as usual, make following modification:

The SYNC-UL scheduler is dispatched in current subframe, when distributing FPACH for each UE that sends the SYNC-UL sequence, if by constraints from previous subframe, during resource that FPACH to be allocated takies that the HS-PDSCH that sends out UE existing is multiplexing, preferably, select a UE all weak, this FPACH is distributed to this UE with the wireless channel correlation of each UE of multiplexing FPACH.If can not find a UE, the correlation of the wireless channel of the wireless channel of this UE and each UE of multiplexing this FPACH all a little less than, can this FPACH is idle.

Because the scheduling process of SYNC-UL scheduler is not a content of the present invention,, only lists affected aspect of SYNC-UL scheduler and possible processing method here.

The embodiment of the invention also proposes a kind of HSDPA scheduler of the MU of employing MIMO technology, comprising:

The resource pool module is used at current subframe n, according to the schedule constraints condition from a last subframe, determines the user equipment (UE) that can not be scheduled at current subframe n; After the described UE removal that can not be scheduled, determine the descending shared resource pond of n+d1+1 subframe, described descending shared resource pond comprises a kind of second class channel resource at least, and the second class channel is not for knowing the channel at the signaling bearer state of n+d1+1 subframe at current subframe n; D1 represents that the base station carries out the time delay of HSDPA scheduling;

The multiplexing number module, the maximum multiplexing number of the every kind of downlink resource in described descending shared resource pond that is used for determining that the resource pool module is determined; Set total K kind downlink resource in the capable shared resource pond, wherein the maximum multiplexing number note of k kind downlink 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 descending shared resource pond, select the non-vanishing resource of a part of multiplexing number to distribute to current UE, and the multiplexing number of the channel code of the resource correspondence that is assigned with is subtracted 1 as the scheduling high-speed Physical Downlink Shared Channel HS-PDSCH of UE;

The constraints module is used for judging whether the resource of distributing to current UE at resource distribution module comprises the second class channel resource, if, the schedule constraints condition that the sign and the described second class channel resource information of current UE is saved as next subframe then; And

Judge module judges whether that all UE all have been scheduled or do not have the multiplexing number of each channel code in available HS-SCCH or the described descending shared resource pond to be zero, if next subframe as current subframe, is enabled the resource pool module; Otherwise, enable resource distribution module.

Preferably, described resource pool module comprises:

The corresponding relation table unit is used to store the mapping table that sets in advance application scenarios and the descending shared resource of predefine pond;

Query unit, the application scenarios of the subframe of determining to be scheduled is searched described mapping table according to described application scenarios, obtains the corresponding descending shared resource of predefine pond; All kinds of resources that the descending shared resource of described predefine pond is comprised are as the multiplexing descending shared resource pond of the UE of the subframe that is scheduled.

Preferably, the described second class channel comprises enhancing dedicated channel absolute grant channel E-AGCH, strengthens dedicated channel mixed automatic retransmission request indicating channel E-HICH, high-speed shared control channel HS-SCCH and/or physical access channel FPACH.Preferably, the down channel resources of the theaomni-directional transmission that comprises in the described descending shared resource pond is one of following down channel resources or its combination in any: Primary Common Control Physical Channel PCCPCH, Secondary Common Control Physical Channel SCCPCH and MBMS indicating channel MICH.

Preferably, described multiplexing number module comprises:

Initialization unit, be used for according to determined descending shared resource pond, the multiplexing form in the descending shared resource of initialization pond, j is listed as in the corresponding descending shared resource of the capable element of the i pond channel code of i SF=16 in j the time slot in this form, value z (the j of this element, i) in the expression descending shared resource pond in j time slot i channel code can by z (j, i) individual UE is shared in MU MIMO mode; Here, i represents the number of the channel code of SF=16, i=1, and 2 ..., 16; J represents j the time slot in descending shared resource pond, j=1 ..., K _TS, use K _TSRepresent the time slot sum that descending shared resource pond comprises, use t _jThe timeslot number of representing j the time slot in descending shared resource pond, and

Preferably, described initialization unit further comprises:

First judging unit judges that descending shared resource pond is at current time slots t _jWhether comprise channel code i, if enable first initialization unit, otherwise enable second initialization unit; When beginning to carry out, current time slots t _jFirst time slot for descending shared resource pond;

First initialization unit, the HS-PDSCH resource is shared if this channel code i is scheduled, with j in the above table be listed as i row element z (j, i) be initialized as z (j, i)=M, wherein M represents to dispatch the maximum multiplexing number of HS-PDSCH resource;

Take if this channel code is idle downlink resource, j in the above table is listed as the maximum multiplexing number that the i row element is initialized as idle downlink resource;

Down channel if this channel code is scheduled beyond HS-PDSCH resource and the descending idling-resource is shared, j in the above table is listed as i row element z (j, i) be initialized as z (j, i)=Q-1, wherein Q represents to take the maximum multiplexing number of the down channel of this channel code i; Be finished the back to second judging unit output index signal;

Second initialization unit is used for that form j is listed as the i row element and is initialized as 0, that is: z (j, i)=0; Be finished the back to second judging unit output index signal;

Second judging unit is used for after the index signal of receiving from first initialization unit or second initialization unit, judges at current time slots t _jThe channel code that whether also has no initializtion is if then change the channel code number and enable first judging unit; Otherwise, judge whether the time slot that is not initialised in addition, if then change current time slots t _jValue and enable first judging unit, finish index signal otherwise externally export initialization.

Preferably, this scheduler further comprises: priority block is used for determining the dispatching priority of current each UE of subframe;

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, selects the highest UE of the priority that is not scheduled as yet as current UE.

Preferably, described resource distribution module comprises:

First resource allocation unit is selected not exceed the rectangle resource allocation of the maximum of this UE ability and is given this UE from available descending shared resource pond; 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 descending shared resource pond;

When the rectangle resource of selecting according to the method described above can the data carried by data amount during greater than the data volume of UE, from available downlink resource pond, select a rectangle resource that is no more than the UE ability, this rectangle resource is to carry minimum rectangle resource in the rectangle resource of total data amount of UE, gives UE with this rectangle resource allocation.

Preferably, described resource distribution module comprises:

Second resource allocation unit is used for scheduling HS-PDSCH resource with descending shared resource pond as the first child resource pond, with the resource except that the first child resource pond in the descending shared resource pond as the second child resource pond; Determine to be no more than the rectangle resource of the maximum 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;

When the rectangle resource of selecting according to the method described above can the data carried by data amount during greater than the data volume of UE, the total data amount of selecting to carry UE from above-mentioned two sub-resource pools is no more than the rectangle resource of the minimum of UE ability again, gives UE with this rectangle resource allocation.

Preferably, resource distribution module further comprises:

The availability judging unit, be used for selecting a part of resource allocation to before the current UE from descending shared resource pond at resource distribution module, judge whether the shared resource of each down channel in the described descending shared resource pond is available for current UE, and disabled downlink resource is removed.

Preferably, described availability judging unit comprises one of following subelement or its combination in any:

The first availability judgment sub-unit judges that the downlink resource of free time can be used current UE;

The second availability judgment sub-unit, the shared resource of down channel that judgement is not carried other UE signals in the n+d1+1 subframe can be used current UE;

The 3rd availability judgment sub-unit judges that the shared resource of down channel of omnidirectional's transmission can be used current UE;

The 4th availability judgment sub-unit judges that the shared resource of the second class channel can use current UE;

And

The 5th availability judgment sub-unit, for the down channel that has carried the 2nd UE in the n+d1+1 subframe, 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 the shared resource of this down channel is unavailable, otherwise is available; The down channel of described carrying the 2nd UE is included in the HS-PDSCH that current subframe has been distributed to the UE that is successfully dispatched.

Preferably, described scheduler further comprises:

The HS-SCCH distribution module, be used for selecting from descending shared resource pond from all available HS-SCCH, to select a HS-SCCH to distribute to current UE before the non-vanishing resource of a part of multiplexing number distributes to current UE as the scheduling HS-PDSCH of UE at described resource distribution module;

The HS-SICH distribution module, be used for selecting from descending shared resource pond will distribute to current UE with the HS-SICH of described HS-SCCH pairing after the non-vanishing resource of a part of multiplexing number distributes to current UE as the scheduling HS-PDSCH of UE at described resource distribution module.

Preferably, described HS-SCCH distribution module comprises:

UE can with HS-SCCH the unit is set, with the available HS-SCCH of current all available HS-SCCH as this UE;

The one HS-SCCH allocation units, optional HS-SCCH judges whether this HS-SCCH is multiplexing by the HS-PDSCH of other UE from the HS-SCCH that this UE can use, if not, then this HS-SCCH is distributed to this UE; If then determine each UE of multiplexing this HS-SCCH, and enable the 2nd HS-SCCH allocation units;

The 2nd HS-SCCH allocation units are used to calculate the correlation of wireless channel of each UE of the wireless channel of described current UE and multiplexing this HS-SCCH; Whether the wireless channel correlation of UE of judging the wireless channel of described current UE and each multiplexing this HS-SCCH is less than the relevance threshold that sets in advance, if then this HS-SCCH is distributed to current UE; Otherwise, described HS-SCCH is removed from the HS-SCCH that current UE can be used, and enables HS-SCCH availability judging unit;

HS-SCCH availability judging unit is used to judge whether to also have available HS-SCCH, if enable HS-SCCH allocation units once more; Otherwise the notice resource distribution module finishes the scheduling to current UE.

Preferably, this scheduler further comprises:

The first training sequence deviation distribution module, with all training sequence deviation groupings in the sub-district, every group of interior training sequence deviation and channel code has predefined mapping relations; Select one group from described respectively organize the training sequence deviation, the interior training sequence deviation corresponding with included each channel code of the HS-PDSCH that distributes to this UE of this group is not assigned to other UE or other down channels; Give UE with this set of dispense, and will organize the corresponding training sequence deviation of each channel code that interior and the HS-PDSCH that distributes to this UE comprise and be marked as and take.

Preferably, this scheduler further comprises:

The second training sequence deviation distribution module is used for the mapping relations between pre-configured training sequence deviation and the channel code; Determine to distribute to each channel code that the scheduling HS-PDSCH of UE takies, search each training sequence deviation of described each channel code mapping, judge whether there is occupied training sequence deviation in described each training sequence deviation, if, then according to this UE scheduling failure is handled; Otherwise, described each training sequence deviation is distributed to described UE, and described each training sequence deviation is labeled as takies.

Preferably, described constraints module comprises:

The first constraints unit, when the described second class channel resource comprises E-AGCH and/or E-HICH, the sign and the multiplexing E-AGCH and/or the E-HICH resource information of current UE of current UE are transferred to high speed uplink packet HSUPA scheduler, be used to retrain the scheduling process of next subframe HSUPA scheduler.

Preferably, described constraints module comprises:

The second constraints unit when the described second class channel resource comprises HS-SCCH, saves as the schedule constraints condition that the HSDPA scheduler carries out next subframe scheduling with the sign and the multiplexing HS-SCCH resource information of current UE of current UE.

Preferably, described constraints module comprises:

The 3rd constraints unit when the described second class channel resource comprises FPACH, saves as the schedule constraints condition that the SYNC-UL scheduler carries out next subframe scheduling with the sign and the multiplexing FPACH resource information of current UE of current 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.

Claims (37)

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

A, at current subframe n, according to schedule constraints condition, determine the user equipment (UE) that can not be scheduled at current subframe n from a last subframe; After the described UE removal that can not be scheduled, determine the descending shared resource pond of n+d1+1 subframe, described descending shared resource pond comprises a kind of second class channel resource at least, and the second class channel is not for knowing the channel at the signaling bearer state of n+d1+1 subframe at current subframe n; D1 represents that the base station carries out the time delay of HSDPA scheduling;

B, determine the maximum multiplexing number of every kind of downlink resource in the described descending shared resource pond; Set total K kind downlink resource in the capable shared resource pond, wherein the maximum multiplexing number note of k kind downlink 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 described descending shared resource pond, select the non-vanishing resource of a part of multiplexing number to distribute to current UE, and the multiplexing number of the channel code of the resource correspondence that is assigned with is subtracted 1 as the scheduling high-speed Physical Downlink Shared Channel HS-PDSCH of UE;

D, judge in the described resource of distributing to current UE whether comprise the second class channel resource, if, the schedule constraints condition that the sign and the described second class channel resource information of current UE is saved as next subframe then;

E, judge whether that all UE all have been scheduled or do not have the multiplexing number of each channel code in available HS-SCCH or the described descending shared resource pond to be zero, if next subframe as current subframe, is returned steps A; Otherwise, return step C.

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

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 the corresponding descending shared resource of predefine pond; And

All kinds of resources that the descending shared resource of described predefine pond is comprised are as the multiplexing descending shared resource pond of the UE of the subframe that is scheduled.

3. method according to claim 1, it is characterized in that the described second class channel comprises enhancing dedicated channel absolute grant channel E-AGCH, strengthens dedicated channel mixed automatic retransmission request indicating channel E-HICH, high-speed shared control channel HS-SCCH and/or physical access channel FPACH.

4. method according to claim 1, it is characterized in that the down channel resources of the theaomni-directional transmission that comprises in the described descending shared resource pond is one of following down channel resources or its combination in any: Primary Common Control Physical Channel PCCPCH, Secondary Common Control Physical Channel SCCPCH and MBMS indicating channel MICH.

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

According to determined descending shared resource pond, the multiplexing form in the descending shared resource of initialization pond, j is listed as in the corresponding descending shared resource of the capable element of the i pond channel code of i SF=16 in j the time slot in this form, value z (the j of this element, i) in the expression descending shared resource pond in j time slot i channel code can by z (j, i) individual UE is shared in MU MIMO mode; Here, i represents the number of the channel code of SF=16, i=1, and 2 ..., 16; J represents j the time slot in descending shared resource pond, j=1 ..., K _TS, use K _TSRepresent the time slot sum that descending shared resource pond comprises, use t _jThe timeslot number of representing j the time slot in descending shared resource pond, and

6. method according to claim 5 is characterized in that, the multiplexing form in the descending shared resource of described initialization pond comprises:

B1, the descending shared resource of judgement pond are at current time slots t _jWhether comprise channel code i, if, execution in step B2, otherwise execution in step B3; When beginning to carry out, current time slots t _jFirst time slot for descending shared resource pond;

The HS-PDSCH resource is shared if this channel code of B2 i is scheduled, with j in the above table be listed as i row element z (j, i) be initialized as z (j, i)=M, wherein M represents to dispatch the maximum multiplexing number of HS-PDSCH resource;

Take if this channel code is idle downlink resource, j in the above table is listed as the maximum multiplexing number that the i row element is initialized as idle downlink resource;

Down channel if this channel code is scheduled beyond HS-PDSCH resource and the descending idling-resource is shared, j in the above table is listed as i row element z (j, i) be initialized as z (j, i)=Q-1, wherein Q represents to take the maximum multiplexing number of the down channel of this channel code i; Execution in step B4 then;

B3, j in the form be listed as the i row element be initialized as 0, that is: z (j, i)=0; Execution in step B4 then;

B4, judgement are at current time slots t _jThe channel code that whether also has no initializtion is if then change the channel code number and return step B1, otherwise judge whether the time slot of no initializtion in addition, if then next time slot is returned step B1 as current time slots, otherwise, finish the processing of the multiplexing form in initialization descending shared resource pond.

7. method according to claim 1 is characterized in that, steps A is described at current subframe n, according to the schedule constraints condition from a last subframe, determines to comprise at the user equipment (UE) that current subframe n can not be scheduled:

According to schedule constraints condition from a last subframe, be informed in the resource that all HS-SCCH that the HS-PDSCH that distributes to a UE before the current subframe n taken " n+d1+1 " subframe take, then this UE can not be scheduled in current subframe.

8. method according to claim 1 is characterized in that, before the described steps A, further comprises: the dispatching priority of determining current each UE of subframe;

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

9. method according to claim 1 is characterized in that, step C is described to select a part of resource allocation to comprise to current UE from descending shared resource pond:

From available descending shared resource pond, select not exceed the rectangle resource allocation of the maximum of this UE ability and give this UE; 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 descending shared resource pond;

When the rectangle resource of selecting according to the method described above can the data carried by data amount during greater than the data volume of UE, from available downlink resource pond, select a rectangle resource that is no more than the UE ability, this rectangle resource is to carry minimum rectangle resource in the rectangle resource of total data amount of UE, gives UE with this rectangle resource allocation.

10. method according to claim 1 is characterized in that, step C is described to select a part of resource allocation to comprise to current UE from descending shared resource pond:

With the scheduling HS-PDSCH resource in the descending shared resource pond as the first child resource pond, with the resource except that the first child resource pond in the descending shared resource pond as the second child resource pond;

Determine to be no more than the rectangle resource of the maximum 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;

When the rectangle resource of selecting according to the method described above can the data carried by data amount during greater than the data volume of UE, the total data amount of selecting to carry UE from above-mentioned two sub-resource pools is no more than the rectangle resource of the minimum of UE ability again, gives UE with this rectangle resource allocation.

11., it is characterized in that step C is described to select a part of resource allocation to give before the current UE, further comprises according to each described method of claim 1 to 10 from descending shared resource pond:

Judge in the described descending shared resource pond whether the shared resource of each down channel beyond scheduling HS-PDSCH resource and the descending idling-resource is available for current UE, and disabled downlink resource is removed.

12. method according to claim 11, it is characterized in that, describedly judge in the described descending shared resource pond whether the shared resource of each down channel beyond scheduling HS-PDSCH resource and the descending idling-resource is available for current UE, and disabled downlink resource removed comprise as one of judging or its combination in any:

Idle downlink resource can be used current UE;

The shared resource of down channel of not carrying other UE signals in the n+d1+1 subframe can be used current UE;

The shared resource of down channel that omnidirectional sends can be used current UE;

The shared resource of the second class channel can be used current UE;

And

For the down channel that has carried the 2nd UE in the n+d1+1 subframe, 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 the shared resource of this down channel is unavailable, otherwise is available; The down channel of described carrying the 2nd UE is included in the HS-PDSCH that current subframe has been distributed to the UE that is successfully dispatched.

13., it is characterized in that step C is described to select the non-vanishing resource of a part of multiplexing number to distribute to before the current UE as the scheduling HS-PDSCH of UE, further comprises according to each described method of claim 1 to 10 from descending shared resource pond:

From all available HS-SCCH, select a HS-SCCH to distribute to current UE;

Step C is described to select the non-vanishing resource of a part of multiplexing number to distribute to after the current UE as the scheduling HS-PDSCH of UE from descending shared resource pond, further comprises:

To distribute to current UE with the HS-SICH of described HS-SCCH pairing.

14. method according to claim 13 is characterized in that, the described step of selecting a HS-SCCH to distribute to current UE from all available HS-SCCH comprises:

C1, with the available HS-SCCH of current all available HS-SCCH as this UE;

C2, from the HS-SCCH that this UE can use optional HS-SCCH, judge whether this HS-SCCH multiplexing by the HS-PDSCH of other UE, if not, then this HS-SCCH is distributed to this UE; If then determine each UE of multiplexing this HS-SCCH, and carry out C3;

The correlation of the wireless channel of each UE of C3, the wireless channel that calculates described current UE and multiplexing this HS-SCCH;

Whether the wireless channel correlation of the UE of C4, the wireless channel of judging described current UE and each multiplexing this HS-SCCH is less than the relevance threshold that sets in advance, if then this HS-SCCH is distributed to current UE; Otherwise, described HS-SCCH is removed from the HS-SCCH that current UE can be used, and execution in step C5;

C5, judge whether the HS-SCCH that this UE in addition can use, if, go to step C2, otherwise, finish scheduling to current UE, re-execute step C.

15. according to each described method of claim 1 to 10, it is characterized in that, step C is described to select the non-vanishing resource of a part of multiplexing number to distribute to after the current UE as the scheduling HS-PDSCH of UE from descending shared resource pond, further comprises: distribute training sequence deviation to current UE; 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;

Select one group from described respectively organize the training sequence deviation, the interior training sequence deviation corresponding with included each channel code of the HS-PDSCH that distributes to this UE of this group is not assigned to other UE or other down channels;

Give UE with this set of dispense, and will organize the corresponding training sequence deviation of each channel code that interior and the HS-PDSCH that distributes to this UE comprise and be marked as and take.

16. according to each described method of claim 1 to 10, it is characterized in that, step C is described to select the non-vanishing resource of a part of multiplexing number to distribute to after the current UE as the scheduling HS-PDSCH of UE from descending shared resource pond, further comprises: distribute training sequence deviation to current UE; Describedly distribute training sequence deviation to comprise: the mapping relations between pre-configured training sequence deviation and the channel code to current UE; Determine to distribute to each channel code that the scheduling HS-PDSCH of UE takies, search each training sequence deviation of described each channel code mapping, judge whether there is occupied training sequence deviation in described each training sequence deviation, if, then according to this UE scheduling failure is handled; Otherwise, described each training sequence deviation is distributed to described UE, and described each training sequence deviation is labeled as takies.

17. according to each described method of claim 1 to 10, it is characterized in that, whether the described judgement of step D comprises the second class channel resource in the described resource of distributing to current UE, if then the schedule constraints condition that the sign and the described second class channel resource information of current UE is saved as next subframe comprises:

If the described second class channel resource comprises E-AGCH and/or E-HICH, the sign and the multiplexing E-AGCH and/or the E-HICH resource information of current UE of current UE are transferred to high speed uplink packet HSUPA scheduler, be used to retrain the scheduling process of next subframe HSUPA scheduler.

18. according to each described method of claim 1 to 10, it is characterized in that, whether the described judgement of step D comprises the second class channel resource in the described resource of distributing to current UE, if then the schedule constraints condition that the sign and the described second class channel resource information of current UE is saved as next subframe comprises:

If the described second class channel resource comprises HS-SCCH, the sign and the multiplexing HS-SCCH resource information of current UE of current UE saved as the schedule constraints condition that the HSDPA scheduler carries out next subframe scheduling.

19. according to each described method of claim 1 to 10, it is characterized in that, whether the described judgement of step D comprises the second class channel resource in the described resource of distributing to current UE, if then the schedule constraints condition that the sign and the described second class channel resource information of current UE is saved as next subframe comprises:

If the described second class channel resource comprises FPACH, the sign and the multiplexing FPACH resource information of current UE of current UE saved as the schedule constraints condition that the SYNC-UL scheduler carries out next subframe scheduling.

20. one kind is adopted the high-speed downstream bag of multi-user's multiple-input and multiple-output MU MIMO technology to insert the HSDPA scheduler, it is characterized in that, comprising:

The resource pool module is used at current subframe n, according to the schedule constraints condition from a last subframe, determines the user equipment (UE) that can not be scheduled at current subframe n; After the described UE removal that can not be scheduled, determine the descending shared resource pond of n+d1+1 subframe, described descending shared resource pond comprises a kind of second class channel resource at least, and the second class channel is not for knowing the channel at the signaling bearer state of n+d1+1 subframe at current subframe n; D1 represents that the base station carries out the time delay of HSDPA scheduling;

The multiplexing number module, the maximum multiplexing number of the every kind of downlink resource in described descending shared resource pond that is used for determining that the resource pool module is determined; Set total K kind downlink resource in the capable shared resource pond, wherein the maximum multiplexing number note of k kind downlink 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 descending shared resource pond, select the non-vanishing resource of a part of multiplexing number to distribute to current UE, and the multiplexing number of the channel code of the resource correspondence that is assigned with is subtracted 1 as the scheduling high-speed Physical Downlink Shared Channel HS-PDSCH of UE;

The constraints module is used for judging whether the resource of distributing to current UE at resource distribution module comprises the second class channel resource, if, the schedule constraints condition that the sign and the described second class channel resource information of current UE is saved as next subframe then; And

Judge module judges whether that all UE all have been scheduled or do not have the multiplexing number of each channel code in available HS-SCCH or the described descending shared resource pond to be zero, if next subframe as current subframe, is enabled the resource pool module; Otherwise, enable resource distribution module.

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

The corresponding relation table unit is used to store the mapping table that sets in advance application scenarios and the descending shared resource of predefine pond;

Query unit, the application scenarios of the subframe of determining to be scheduled is searched described mapping table according to described application scenarios, obtains the corresponding descending shared resource of predefine pond; All kinds of resources that the descending shared resource of described predefine pond is comprised are as the multiplexing descending shared resource pond of the UE of the subframe that is scheduled.

22. scheduler according to claim 20, it is characterized in that the described second class channel comprises enhancing dedicated channel absolute grant channel E-AGCH, strengthens dedicated channel mixed automatic retransmission request indicating channel E-HICH, high-speed shared control channel HS-SCCH and/or physical access channel FPACH.

23. scheduler according to claim 20, it is characterized in that the down channel resources of the theaomni-directional transmission that comprises in the described descending shared resource pond is one of following down channel resources or its combination in any: Primary Common Control Physical Channel PCCPCH, Secondary Common Control Physical Channel SCCPCH and MBMS indicating channel MICH.

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

Initialization unit, be used for according to determined descending shared resource pond, the multiplexing form in the descending shared resource of initialization pond, j is listed as in the corresponding descending shared resource of the capable element of the i pond channel code of i SF=16 in j the time slot in this form, value z (the j of this element, i) in the expression descending shared resource pond in j time slot i channel code can by z (j, i) individual UE is shared in MU MIMO mode; Here, i represents the number of the channel code of SF=16, i=1, and 2 ..., 16; J represents j the time slot in descending shared resource pond, j=1 ..., K _TS, use K _TSRepresent the time slot sum that descending shared resource pond comprises, use t _jThe timeslot number of representing j the time slot in descending shared resource pond, and

25. scheduler according to claim 24 is characterized in that, described initialization unit further comprises:

First judging unit judges that descending shared resource pond is at current time slots t _jWhether comprise channel code i, if enable first initialization unit, otherwise enable second initialization unit; When beginning to carry out, current time slots t _jFirst time slot for descending shared resource pond;

First initialization unit, the HS-PDSCH resource is shared if this channel code i is scheduled, with j in the above table be listed as i row element z (j, i) be initialized as z (j, i)=M, wherein M represents to dispatch the maximum multiplexing number of HS-PDSCH resource;

Take if this channel code is idle downlink resource, j in the above table is listed as the maximum multiplexing number that the i row element is initialized as idle downlink resource;

Down channel if this channel code is scheduled beyond HS-PDSCH resource and the descending idling-resource is shared, j in the above table is listed as i row element z (j, i) be initialized as z (j, i)=Q-1, wherein Q represents to take the maximum multiplexing number of the down channel of this channel code i; Be finished the back to second judging unit output index signal;

Second initialization unit is used for that form j is listed as the i row element and is initialized as 0, that is: z (j, i)=0; Be finished the back to second judging unit output index signal;

Second judging unit is used for after the index signal of receiving from first initialization unit or second initialization unit, judges at current time slots t _jThe channel code that whether also has no initializtion is if then change the channel code number and enable first judging unit; Otherwise, judge whether the time slot that is not initialised in addition, if then change current time slots t _jValue and enable first judging unit, finish index signal otherwise externally export initialization.

26. scheduler according to claim 20 is characterized in that, this scheduler further comprises: priority block is used for determining the dispatching priority of current each UE of subframe;

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, selects the highest UE of the priority that is not scheduled as yet as current UE.

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

First resource allocation unit is selected not exceed the rectangle resource allocation of the maximum of this UE ability and is given this UE from available descending shared resource pond; 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 descending shared resource pond;

When the rectangle resource of selecting according to the method described above can the data carried by data amount during greater than the data volume of UE, from available downlink resource pond, select a rectangle resource that is no more than the UE ability, this rectangle resource is to carry minimum rectangle resource in the rectangle resource of total data amount of UE, gives UE with this rectangle resource allocation.

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

Second resource allocation unit is used for scheduling HS-PDSCH resource with descending shared resource pond as the first child resource pond, with the resource except that the first child resource pond in the descending shared resource pond as the second child resource pond; Determine to be no more than the rectangle resource of the maximum 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;

When the rectangle resource of selecting according to the method described above can the data carried by data amount during greater than the data volume of UE, the total data amount of selecting to carry UE from above-mentioned two sub-resource pools is no more than the rectangle resource of the minimum of UE ability again, gives UE with this rectangle resource allocation.

29., it is characterized in that resource distribution module further comprises according to each described scheduler of claim 20 to 28:

The availability judging unit, be used for selecting a part of resource allocation to before the current UE from descending shared resource pond at resource distribution module, judge whether the shared resource of each down channel in the described descending shared resource pond is available for current UE, and disabled downlink resource is removed.

30. method according to claim 29 is characterized in that, described availability judging unit comprises one of following subelement or its combination in any:

The first availability judgment sub-unit judges that the downlink resource of free time can be used current UE;

The second availability judgment sub-unit, the shared resource of down channel that judgement is not carried other UE signals in the n+d1+1 subframe can be used current UE;

The 3rd availability judgment sub-unit judges that the shared resource of down channel of omnidirectional's transmission can be used current UE;

The 4th availability judgment sub-unit judges that the shared resource of the second class channel can use current UE;

And

The 5th availability judgment sub-unit, for the down channel that has carried the 2nd UE in the n+d1+1 subframe, 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 the shared resource of this down channel is unavailable, otherwise is available; The down channel of described carrying the 2nd UE is included in the HS-PDSCH that current subframe has been distributed to the UE that is successfully dispatched.

31., it is characterized in that described scheduler further comprises according to each described scheduler of claim 20 to 28:

The HS-SCCH distribution module, be used for selecting from descending shared resource pond from all available HS-SCCH, to select a HS-SCCH to distribute to current UE before the non-vanishing resource of a part of multiplexing number distributes to current UE as the scheduling HS-PDSCH of UE at described resource distribution module;

The HS-SICH distribution module, be used for selecting from descending shared resource pond will distribute to current UE with the HS-SICH of described HS-SCCH pairing after the non-vanishing resource of a part of multiplexing number distributes to current UE as the scheduling HS-PDSCH of UE at described resource distribution module.

32. scheduler according to claim 31 is characterized in that, described HS-SCCH distribution module comprises:

UE can with HS-SCCH the unit is set, with the available HS-SCCH of current all available HS-SCCH as this UE;

The one HS-SCCH allocation units, optional HS-SCCH judges whether this HS-SCCH is multiplexing by the HS-PDSCH of other UE from the HS-SCCH that this UE can use, if not, then this HS-SCCH is distributed to this UE; If then determine each UE of multiplexing this HS-SCCH, and enable the 2nd HS-SCCH allocation units;

The 2nd HS-SCCH allocation units are used to calculate the correlation of wireless channel of each UE of the wireless channel of described current UE and multiplexing this HS-SCCH; Whether the wireless channel correlation of UE of judging the wireless channel of described current UE and each multiplexing this HS-SCCH is less than the relevance threshold that sets in advance, if then this HS-SCCH is distributed to current UE; Otherwise, described HS-SCCH is removed from the HS-SCCH that current UE can be used, and enables HS-SCCH availability judging unit;

HS-SCCH availability judging unit is used to judge whether to also have available HS-SCCH, if enable HS-SCCH allocation units once more; Otherwise the notice resource distribution module finishes the scheduling to current UE.

33., it is characterized in that this scheduler further comprises according to each described scheduler of claim 20 to 28:

The first training sequence deviation distribution module, with all training sequence deviation groupings in the sub-district, every group of interior training sequence deviation and channel code has predefined mapping relations; Select one group from described respectively organize the training sequence deviation, the interior training sequence deviation corresponding with included each channel code of the HS-PDSCH that distributes to this UE of this group is not assigned to other UE or other down channels; Give UE with this set of dispense, and will organize the corresponding training sequence deviation of each channel code that interior and the HS-PDSCH that distributes to this UE comprise and be marked as and take.

34., it is characterized in that this scheduler further comprises according to each described scheduler of claim 20 to 28:

The second training sequence deviation distribution module is used for the mapping relations between pre-configured training sequence deviation and the channel code; Determine to distribute to each channel code that the scheduling HS-PDSCH of UE takies, search each training sequence deviation of described each channel code mapping, judge whether there is occupied training sequence deviation in described each training sequence deviation, if, then according to this UE scheduling failure is handled; Otherwise, described each training sequence deviation is distributed to described UE, and described each training sequence deviation is labeled as takies.

35., it is characterized in that described constraints module comprises according to each described scheduler of claim 20 to 28:

The first constraints unit, when the described second class channel resource comprises E-AGCH and/or E-HICH, the sign and the multiplexing E-AGCH and/or the E-HICH resource information of current UE of current UE are transferred to high speed uplink packet HSUPA scheduler, be used to retrain the scheduling process of next subframe HSUPA scheduler.

36., it is characterized in that described constraints module comprises according to each described scheduler of claim 20 to 28:

The second constraints unit when the described second class channel resource comprises HS-SCCH, saves as the schedule constraints condition that the HSDPA scheduler carries out next subframe scheduling with the sign and the multiplexing HS-SCCH resource information of current UE of current UE.

37., it is characterized in that described constraints module comprises according to each described scheduler of claim 20 to 28:

The 3rd constraints unit when the described second class channel resource comprises FPACH, saves as the schedule constraints condition that the SYNC-UL scheduler carries out next subframe scheduling with the sign and the multiplexing FPACH resource information of current UE of current UE.

Images