CN102256357B - Dispatching method and dispatcher for multiplexing HSDPA (High Speed Downlink Packet Access) resources - Google Patents

Dispatching method and dispatcher for multiplexing HSDPA (High Speed Downlink Packet Access) resources Download PDF

Info

Publication number
CN102256357B
CN102256357B CN2010101867415A CN201010186741A CN102256357B CN 102256357 B CN102256357 B CN 102256357B CN 2010101867415 A CN2010101867415 A CN 2010101867415A CN 201010186741 A CN201010186741 A CN 201010186741A CN 102256357 B CN102256357 B CN 102256357B
Authority
CN
China
Prior art keywords
resource
time slot
channel
current
pond
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related
Application number
CN2010101867415A
Other languages
Chinese (zh)
Other versions
CN102256357A (en
Inventor
魏立梅
赵渊
沈东栋
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
TD Tech Ltd
Original Assignee
TD Tech Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by TD Tech Ltd filed Critical TD Tech Ltd
Priority to CN2010101867415A priority Critical patent/CN102256357B/en
Publication of CN102256357A publication Critical patent/CN102256357A/en
Application granted granted Critical
Publication of CN102256357B publication Critical patent/CN102256357B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The invention provides a dispatching method for multiplexing HSDPA (High Speed Downlink Packet Access) resources in the default training sequence migration distribution mode. The dispatching method comprises the following steps of: dividing a downlink shared resource pool into two resource subpools according to the class of time slots, wherein the first resource subpool comprises time slots belonging to the first class of time slots and comprises one channel code with SF=1 and training sequence migration m(1) in each time slot; the second resource subpool comprises the second class of times slots and the third class of time slots: in each time slot belonging to the second class of time slots, the second resource subpool comprises channel codes with SF=16 corresponding to m(2), ......, m(K); and in each time slot belonging to the third class of time slots, the second resource subpool comprises channel codes with SF=16 corresponding to non m(1) idle training sequence migration included by the downlink shared resource pool in the time slot, wherein K is the quantity of training sequence migrations of the cell; SF is the spreading factor; the first class of time slots are time slots of which the training sequence migration m(1) is idle, the second class of time slots are time slots of which all training sequence migrations are idle, and the third class of times slots are time slots of which only part of training sequence migrations are idle; and dispatching the UE according the two resource subpools.

Description

A kind of dispatching method of HSDPA resource multiplex and scheduler
Technical field
The present invention relates to the mobile communication technology field, particularly high-speed downstream bag (HSDPA) access technology, relate in particular to dispatching method and the scheduler of HSDPA resource multiplex under a kind of default training sequence deviation method of salary distribution.
Background technology
In another part patent application document (application number 201010149373.7) that the inventor proposes, propose: whole resources or part resource in the resource that HSDPA UE can multiplexing other down channels except the HS-PDSCH channel takies.Here, descending idling-resource can be considered as to a kind of special down channel.In this application file, also mention: the HSDPA scheduler is once dispatched in each subframe " n ", when this subframe is dispatched, distributes the scheduling HS-PDSCH resource of " n+d1+1 " subframe.Here, d1 means the time delay that the HSDPA scheduler of NODEB is dispatched, and this time delay means that the HSDPA scheduler of NODEB distributes to the timing difference between the subframe " n " that subframe that the HS-SCCH of scheduling UE sends and scheduler dispatch when the n subframe is dispatched.This article is also mentioned: all kinds of down channels in " n+d1+1 " sub-frame configuration can be divided into Types Below:
(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 carries the signal of which UE.In other words, be idle or carry the signal of which UE as long as scheduler is known a down channel in " n+d1+1 " subframe when the n subframe is dispatched, this down channel just belongs to first kind channel.Generally, such channel includes but not limited to: semi-persistent scheduling HS-PSCH, DLDPCH and idle downlink resource.
(2) Equations of The Second Kind channel: the HSDPA scheduler does not know to be idle or to carry the signal of which UE at each down channel that " n+d1+1 " subframe belongs to Equations of The Second Kind when the n subframe is dispatched.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 carries the signal of which UE, this down channel just belongs to the Equations of The Second Kind channel.Such channel may include but not limited to: E-AGCH, HS-SCCH and FPACH.These may belong to the channel of Equations of The Second Kind, may in the scheduling of some subframe, belong to first kind channel, in the scheduling of other subframe, belong to the Equations of The Second Kind channel.
(3) the 3rd class channels: at the channel that community omnidirectional sends, such channel includes but not limited to: PCCPCH, SCCPCH and MICH.
This article proposes: all down channels beyond scheduling HS-PDSCH can form a variety of channel combinations, can comprise any amount of first kind channel, any amount of Equations of The Second Kind channel and any amount of the 3rd class channel in every kind of channel combination.
Can make HSDPA UE in multiplexing scheduling HS-PDSCH resource, only the channel of multiplexing first kind channel and/or the 3rd class channel composition combines the resource taken.Simultaneously, can adopt special default training sequence deviation (Midamble Shift) configuration mode and default training sequence deviation configuration mode to distribute training sequence deviation to the UE be scheduled.
Because there are distinct application scenarios in special default training sequence deviation configuration mode and default training sequence deviation configuration mode: special default training sequence deviation configuration mode is only in the situation that revise the 3GPP agreement and just can be supported, and can only be supported in the future the UE of higher 3GPP protocol version to support; And the training sequence deviation configuration mode that the UE that default training sequence deviation configuration mode is current any version will support.Simultaneously, down channel is merely able to adopt the channel code of SF=1 and SF=16 in the TD-SCDMA system, and the technical scheme that above-mentioned application documents propose does not take into full account this constraints.Therefore, the technical scheme of above-mentioned application documents proposition still requires further improvement.
Summary of the invention
The invention provides dispatching method and the scheduler of HSDPA resource multiplex under a kind of default training sequence deviation method of salary distribution, can, under the prerequisite of not revising the 3GPP agreement, supporting the resource multiplex between HSDPA UE, realize the significantly lifting of HSDPA peak rate and throughput.
Under a kind of default training sequence deviation method of salary distribution that the embodiment of the present invention proposes, the dispatching method of HSDPA resource multiplex, comprise the steps:
A, at current subframe n, determine the multiplexing descending shared resource pond of user equipment (UE) of the subframe that is scheduled, described descending shared resource pond comprises that various channels that the channel combination of the scheduling HS-PDSCH resource of " n+d1+1 " subframe and appointment comprises are in the shared resource of n+d1+1 subframe; Channel combination at least one channel in belonging to first kind channel of described appointment forms; Described first kind channel is the channel in current subframe n known signal carrying situation; D1 means that base station carries out the time delay of HSDPA scheduling;
The classification of each time slot in B, judgement descending shared resource pond, according to the classification of time slot, two sub-resource pools are resolved into in above-mentioned descending shared resource pond, first child resource pond consists of each time slot that belongs to first kind time slot, and this resource pool comprises the channel code of 1 SF=1 in each time slot
Figure BSA00000134515000031
With training sequence deviation m (1)Second sub-resource pool consists of Equations of The Second Kind time slot and the 3rd class time slot.Within belonging to each time slot of Equations of The Second Kind time slot, this second sub-resource pool by with m (2)..., m (K)The channel code of corresponding each SF=16 forms; In each time slot that belongs to the 3rd class time slot, the non-m that this second sub-resource pool comprised at this time slot by descending shared resource pond (1)The channel code of idle corresponding each SF=16 of training sequence deviation form; Wherein K is the number of the training sequence deviation of community; SF is spreading factor; m (k)Mean k training sequence deviation; First kind time slot is training sequence deviation m (1)Be the time slot left unused, the Equations of The Second Kind time slot is that all training sequence deviation are all the time slots left unused, and the 3rd class time slot is that to only have the part training sequence deviation be the time slot left unused;
In C, the UE that never is scheduled, select one as current UE, distribute to current UE from all available HS-SCCH, selecting a HS-SCCH;
D, from two sub-resource pools, selecting the available resource of part, selected available resources are distributed to current UE and are continued execution step E; If non-selected to available resource finish the scheduling to current UE, return to step C;
E, 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;
F, as the HS-PDSCH that distributes this UE during from first child resource pond, will
Figure BSA00000134515000032
And m (1)Distribute to UE; As the HS-PDSCH that distributes to this UE, during from second sub-resource pool, the corresponding training sequence deviation of each channel code that this HS-PDSCH comprises is distributed to UE;
G, judge whether that all UE all have been scheduled or have not had and there is no available resource in available HS-SCCH or described two sub-resource pools, if, using next subframe as current subframe, return to steps A, otherwise, step C returned to.
Preferably, described first kind channel comprises: semi-persistent scheduling HS-PSDCH, DL DPCH, idle downlink resource, FPACH, E-HICH and E-AGCH.
Preferably, steps A comprises:
A1, determine scheduling HS-PDSCH resource in the n+d1+1 subframe, this resource is for configuring from RNC to the HS-PDSCH resource pool of NODEB, the shared resource of n+d1+1 subframe semi-persistent scheduling HS-PDSCH being removed to the resource obtained;
A2, determine that various channels that the channel combination of appointment comprises are in the shared resource of n+d1+1 subframe;
A3, the resource that steps A 1 and steps A 2 determined merge the descending shared resource pond that obtains described n+d1+1 subframe.
4, method according to claim 3, is characterized in that, sets in advance the mapping table of application scenarios and the combination of predefined channel type;
Before steps A 1, comprise: determine the application scenarios of place, descending shared resource pond subframe, search described mapping table according to described application scenarios, obtain corresponding predefined channel type combination; The channel combination that this predefined channel type combination is exactly described appointment.
Preferably, when the described selected available resources of step D can't be carried the minimum data piece of UE, finish the scheduling to current UE, and return to step C.
Preferably, step D comprises:
The number of D1, the needed channel code of calculating current UE;
D2, determine the time slot that in first child resource pond, current UE can be used, if available time slot is arranged, in the first child resource pond, select the first resource piece;
D3, determine the resource that current UE can be used in second sub-resource pool, if available resource is arranged, in the second child resource pond, select the Secondary resource piece;
D4, from first resource piece and Secondary resource piece, select a resource block assignments to current UE as its HS-PDSCH.
Preferably, step D1 comprises:
According to the channel quality indicator (CQI) of the up-to-date HS-PDSCH of current UE, obtain the HS-DSCH data volume A that the channel code of 1 SF=16 can be carried;
According to the HS-DSCH data total amount B of current UE, calculate the number be used to the channel code of the needed SF=16 of all HS-DSCH data that carries this UE
Figure BSA00000134515000051
Figure BSA00000134515000052
Expression is on x, rounding, and selection is not less than the integer of the minimum of x.
Preferably, step D2 described determine current UE in first child resource pond can with time slot comprise:
To any one time slot in first child resource pond, if this time slot exists first kind channel and these channels not to leave unused in " n+d1+1 " subframe, determine each down channel UE corresponding to carrying signal;
Whether the wireless channel that judges current UE is identical with the wireless channel of described each down channel UE that carrying signal is corresponding, if in first child resource pond, this time slot is unavailable to current UE; Otherwise in first child resource pond, this time slot can be used current UE.
Preferably, step D2 described determine current UE in first child resource pond can with time slot comprise:
To any one time slot in first child resource pond, if this time slot exists first kind channel and these channels not to leave unused in " n+d1+1 " subframe, determine each down channel UE corresponding to carrying signal;
The relative coefficient of the wireless channel of the UE that the wireless channel of calculating current UE is corresponding with each down channel carrying signal, judge whether described relative coefficient is more than or equal to the relevance threshold set in advance, if in first child resource pond, this time slot is unavailable to current UE; Otherwise in first child resource pond, this time slot can be used current UE.
Preferably, step D2 described determine current UE in first child resource pond can with time slot comprise:
To any one time slot in first child resource pond, judge whether the wireless channel of the UE that this time slot has successfully been dispatched is identical with the wireless channel of current UE, if in first child resource pond, this time slot is unavailable to current UE; Otherwise in first child resource pond, this time slot can be used current UE;
Perhaps,
Any one time slot to first child resource pond, calculate the relative coefficient of the wireless channel of the wireless channel of current UE and the UE that this time slot has successfully been dispatched, judge whether described relative coefficient is more than or equal to the relevance threshold set in advance, if in first child resource pond, this time slot is unavailable to current UE; Otherwise in first child resource pond, this time slot can be used current UE.
Preferably, the described first resource piece of selecting in the first child resource pond of step D2 comprises:
According to the channel code number X of the needed SF=16 of current UE, calculate the needed number of time slot of UE
Figure BSA00000134515000061
In the time slot that can use current UE, select Y time slot: Y=min{T in first child resource pond, Z, U}, wherein, the time slot sum that Z can use for this UE in first resource pool; U is the maximum number of time slot of the current UE HS-PDSCH that can support; Min{T, Z, U} mean to get the minimum value in T, Z and U.
Preferably, step D3 described determine current UE in second sub-resource pool can with resource comprise:
To any one time slot in first child resource pond, judge whether the wireless channel of the UE that this time slot has successfully been dispatched is identical with the wireless channel of current UE, if in second sub-resource pool, the resource in this time slot is unavailable to current UE; Otherwise in second sub-resource pool, the interior resource of this time slot can be used current UE;
Perhaps,
Any one time slot to first child resource pond, calculate the relative coefficient of the wireless channel of the wireless channel of current UE and the UE that this time slot has successfully been dispatched, judge whether described relative coefficient is more than or equal to the relevance threshold set in advance, if in second sub-resource pool, the resource in this time slot is unavailable to current UE; Otherwise in second sub-resource pool, the interior resource of this time slot can be used current UE.
Preferably, the described Secondary resource piece of selecting in the second child resource pond of step D3 comprises:
Channel code number according to the needed SF=16 of current UE, in second resource pool current UE can with resource in select a rectangle resource that is no more than the UE ability, this rectangle resource is that the channel code number of the SF=16 that comprises is not less than minimum rectangle in all rectangles of X, using this rectangle resource as the Secondary resource piece; If in second resource pool current UE can with resource in the rectangle resource of the UE ability that is no more than selected the channel code number of the included SF=16 of maximum rectangle resource all be less than X, the rectangle resource that this is maximum is as the Secondary resource piece.
Preferably, step D4 comprises:
If only select a Resource Block, by this resource block assignments to current UE;
When if these two Resource Block all can't carry the total data amount of current UE, select resource block assignments that the number of channel code of the SF=16 comprise is maximum to current UE;
If while in these two Resource Block, only having a Resource Block can carry the total data amount of current UE, by this resource block assignments to current UE;
When if these two Resource Block can carry the total data amount of UE, the resource block assignments of the minimum number of the channel code of the SF=16 that selection comprises is to current UE.
Preferably, the value of the number K of described training sequence deviation is 2,4,6,8,10,12,14 or 16.
Preferably, the combination of the channel of described appointment includes only idle downlink resource.
Preferably, the number of described HS-SCCH is 2.
The embodiment of the present invention also proposes the scheduler of HSDPA resource multiplex under a kind of default training sequence deviation method of salary distribution, comprising:
The resource pool module, be used at current subframe n, determine the multiplexing descending shared resource pond of user equipment (UE) of the subframe that is scheduled, described descending shared resource pond comprises that various channels that the channel combination of the scheduling HS-PDSCH resource of " n+d1+1 " subframe and appointment comprises are in the shared resource of n+d1+1 subframe; Channel combination at least one channel in belonging to first kind channel of described appointment forms; Described first kind channel is the channel in current subframe n known signal carrying situation; D1 means that base station carries out the time delay of HSDPA scheduling;
Child resource pond decomposing module, for judging the classification of each time slot of descending shared resource pond that described resource pool module is determined, according to the classification of time slot, two sub-resource pools are resolved into in above-mentioned descending shared resource pond, first child resource pond consists of each time slot that belongs to first kind time slot, and this resource pool comprises the channel code of 1 SF=1 in each time slot
Figure BSA00000134515000071
With training sequence deviation m (1)Second sub-resource pool consists of Equations of The Second Kind time slot and the 3rd class time slot.Within belonging to each time slot of Equations of The Second Kind time slot, this second sub-resource pool by with m (2)..., m (K)The channel code of corresponding each SF=16 forms; In each time slot that belongs to the 3rd class time slot, the non-m that this second sub-resource pool comprised at this time slot by descending shared resource pond (1)The channel code of idle corresponding each SF=16 of training sequence deviation form; Wherein K is the number of the training sequence deviation of community; SF is spreading factor; m (k)Mean k training sequence deviation; First kind time slot is training sequence deviation m (1)Be the time slot left unused, the Equations of The Second Kind time slot is that all training sequence deviation are all the time slots left unused, and the 3rd class time slot is that to only have the part training sequence deviation be the time slot left unused;
The HS-SCCH distribution module, select one as current UE for the UE never be scheduled, and distributes to current UE from all available HS-SCCH, selecting a HS-SCCH;
The HS-PDSCH resource distribution module, for from described two sub-resource pools, selecting the available resource of part, distribute to current UE using selected available resources as HS-PDSCH;
The HS-SICH distribution module, for distributing to this UE with the HS-SICH of the HS-SCCH pairing of distributing to UE, as the scheduling HS-SICH of this UE;
The training sequence deviation distribution module, for the HS-PDSCH when distributing this UE during from first child resource pond, by the channel code of SF=1
Figure BSA00000134515000081
With training sequence deviation m (1)Distribute to UE; As the HS-PDSCH that distributes to this UE, during from second sub-resource pool, the corresponding training sequence deviation of each channel code that this HS-PDSCH comprises is distributed to UE.
Preferably, described first kind channel comprises: semi-persistent scheduling HS-PSDCH, DL DPCH, idle downlink resource, FPACH, E-HICH and E-AGCH.
Preferably, the resource pool module comprises:
The first resource determining unit, for determining scheduling HS-PDSCH resource in the n+d1+1 subframe, this resource is for configuring from RNC to the HS-PDSCH resource pool of NODEB, the shared resource of n+d1+1 subframe semi-persistent scheduling HS-PDSCH being removed to the resource obtained;
The Secondary resource determining unit, the various channels that comprise for the channel combination of determining appointment are in the shared resource of n+d1+1 subframe.
Preferably, described resource pool module further comprises:
The corresponding relation table unit, the mapping table of the application scenarios set in advance for storage and the combination of predefined channel type; And
Query unit, for determining the application scenarios of place, descending shared resource pond subframe, search described mapping table according to described application scenarios, obtains corresponding predefined channel type combination; The channel combination that described predefined channel type combination is exactly described appointment.
Preferably, described HS-PDSCH resource distribution module comprises:
Channel code number computing unit, be used to calculating the number of the needed channel code of current UE;
First resource piece allocation units, for the time slot of determining that in first child resource pond, current UE can be used, if available time slot is arranged, select the first resource piece in the first child resource pond;
Secondary resource piece allocation units, for the resource of determining that in second sub-resource pool, current UE can be used, if available resource is arranged, select the Secondary resource piece in the second child resource pond;
Selected cell, for from described first resource piece and Secondary resource piece, select a resource block assignments to current UE as its HS-PDSCH.
Preferably, described first resource piece allocation units comprise:
UE determines subelement, for any one time slot to first child resource pond, if this time slot exists first kind channel and these channels not to leave unused in " n+d1+1 " subframe, determines each down channel UE corresponding to carrying signal;
The same wireless channel judgment sub-unit, whether identical with the wireless channel of described each down channel UE that carrying signal is corresponding be used to the wireless channel that judges current UE, if in first child resource pond, this time slot is unavailable to current UE; Otherwise in first child resource pond, this time slot can be used current UE.
Preferably, described first resource piece allocation units comprise:
UE determines subelement, to any one time slot in first child resource pond, if this time slot exists first kind channel and these channels not to leave unused in " n+d1+1 " subframe, determines each down channel UE corresponding to carrying signal;
Wireless channel correlation judgment sub-unit, relative coefficient for the wireless channel that calculates the UE that the wireless channel of current UE is corresponding with each down channel carrying signal, judge whether described relative coefficient is more than or equal to the relevance threshold set in advance, if in first child resource pond, this time slot is unavailable to current UE; Otherwise in first child resource pond, this time slot can be used current UE.
Preferably, described first resource piece allocation units comprise: modulated degree UE wireless channel judgment sub-unit,
Any one time slot for to first child resource pond, judge whether the wireless channel of the UE that this time slot has successfully been dispatched is identical with the wireless channel of current UE, if in first child resource pond, this time slot is unavailable to current UE; Otherwise in first child resource pond, this time slot can be used current UE;
Perhaps,
For any one time slot to first child resource pond, calculate the relative coefficient of the wireless channel of the wireless channel of current UE and the UE that this time slot has successfully been dispatched, judge whether described relative coefficient is more than or equal to the relevance threshold set in advance, if in first child resource pond, this time slot is unavailable to current UE; Otherwise in first child resource pond, this time slot can be used current UE.
Preferably, described first resource piece allocation units comprise:
The number of time slot computation subunit, calculate the needed number of time slot of UE for the channel code number X according to the needed SF=16 of current UE
Figure BSA00000134515000101
Figure BSA00000134515000102
Expression is to rounding on x;
The Slot selection subelement, select Y time slot: Y=min{T for the time slot that can use current UE in first child resource pond, Z, and U}, wherein, the time slot sum that Z can use for this UE in first resource pool; U is the maximum number of time slot of the current UE HS-PDSCH that can support; Min{T, Z, U} mean to get the minimum value in T, Z and U.
Preferably, described Secondary resource piece allocation units comprise: modulated degree UE wireless channel judgment sub-unit,
For to any one time slot in first child resource pond, judge whether the wireless channel of the UE that this time slot successfully has been dispatched is identical with the wireless channel of current UE, if the interior resource of second interior this time slot of sub-resource pool is unavailable to current UE; Otherwise in second sub-resource pool, the interior resource of this time slot can be used current UE;
Perhaps,
For any one time slot to first child resource pond, calculate the relative coefficient of the wireless channel of the wireless channel of current UE and the UE that this time slot has successfully been dispatched, judge whether described relative coefficient is more than or equal to the relevance threshold set in advance, if in second sub-resource pool, the resource in this time slot is unavailable to current UE; Otherwise in second sub-resource pool, the interior resource of this time slot can be used current UE.
Preferably, described selected cell is used for:
If only select a Resource Block, by this resource block assignments to current UE;
When if two Resource Block that choose all can't carry the total data amount of current UE, select resource block assignments that the number of channel code of the SF=16 comprise is maximum to current UE;
If while in two Resource Block that choose, only having a Resource Block can carry the total data amount of current UE, by this resource block assignments to current UE;
When if two Resource Block that choose can carry the total data amount of UE, the resource block assignments of the minimum number of the channel code of the SF=16 that selection comprises is to current UE.
Preferably, the value of the number K of described training sequence deviation is 2,4,6,8,10,12,14 or 16.
Preferably, the combination of the channel of described appointment includes only idle downlink resource.
Preferably, the number of described HS-SCCH is 2.
As can be seen from the above technical solutions, according to the classification of time slot, two sub-resource pools are resolved into in descending shared resource pond, first child resource pond consists of each time slot that belongs to first kind time slot, and this resource pool comprises the channel code of 1 SF=1 in each time slot
Figure BSA00000134515000111
With training sequence deviation m (1)Second sub-resource pool consists of Equations of The Second Kind time slot and the 3rd class time slot: within belonging to each time slot of Equations of The Second Kind time slot, this second sub-resource pool by with m (2)..., m (K)The channel code of corresponding each SF=16 forms; In each time slot that belongs to the 3rd class time slot, the non-m that this second sub-resource pool comprised at this time slot by descending shared resource pond (1)The channel code of the corresponding SF=16 of idle training sequence deviation form; Wherein K is the number of the training sequence deviation of community; SF is spreading factor; First kind time slot is training sequence deviation m (1)The time slot left unused, the time slot left unused when the Equations of The Second Kind time slot is all training sequence deviation; The 3rd class time slot is time slot idle while only having the part training sequence deviation; According to these two sub-resource pools, UE is dispatched.The present invention is based on the TD-SCDMA system and is merely able to adopt in the channel code situation of SF=1 and SF=16 descending, when adopting the best mode that carries out the HS-PDSCH resource multiplex under default training sequence deviation configuration mode at descending each time slot.
The accompanying drawing explanation
Fig. 1: the mapping relations during K=8 between training sequence deviation and OVSF channel code;
Fig. 2: the mapping relations during K=16 between training sequence deviation and OVSF channel code;
Fig. 3 is the HSDPA scheduling flow figure of the embodiment of the present invention one;
Fig. 4 is the scheduling flow figure of the HSDPA scheduler of the embodiment of the present invention one proposition in any subframe " n ";
Fig. 5 is in the HSDPA scheduling process of the embodiment of the present invention one, to the scheduling flow figure of a UE.
Embodiment
The present invention program is the improvement project for patent application document (application number 201010149373.7), in the multiplexing scheduling of HSDPA UE HS-PDSCH resource, the only resource that takies of the multiplexing channel combination formed by first kind channel and/or the 3rd class channel and scheduler and the dispatching method that only adopts default training sequence deviation configuration mode to propose in multiplexing.
The present invention will be that all probable values propose two embodiment for the number K=8 of training sequence deviation in community and the number of training sequence deviation.
Embodiment mono-: when the number K=8 of the training sequence deviation of community, scheduler and dispatching method that the embodiment of the present invention one proposes have following feature:
(1) adopt default training sequence deviation configuration mode
When (2) supporting the multiplexing scheduling of HSDPA UE HS-PSCH resource, can support the resource of the multiplexing all kinds of channel occupancies that any one channel combination comprises in the channel combination that first kind channel and the 3rd class channel form of HSDPA UE.
(3) adopt optimized resource multiplex mode: can be by the channel code of 1 SF=1 at each descending time slot
Figure BSA00000134515000121
With first training sequence deviation m (1)Configuration is to 1 UE the time, by remaining 7 training sequence deviation " m in this time slot (2)..., m (8)" and the channel code of 14 SF=16s corresponding with these training sequence deviation
Figure BSA00000134515000122
Distribute to other UE.Here, m (i), i=1,2 ... .., 8 mean i training sequence deviation;
Figure BSA00000134515000123
Mean that spreading factor is j channel code in the channel code of SF, SF=1,16, j=1,2 ..., SF.
Embodiment bis-: when the number K of the training sequence deviation of community can be for all probable values, the scheduler that the embodiment of the present invention two proposes and dispatching method were for being achieved as follows function:
(1) adopt default training sequence deviation configuration mode
When (2) supporting the multiplexing scheduling of HSDPA UE HS-PSCH resource, can support the resource of the multiplexing all kinds of channel occupancies that any one channel combination comprises in the channel combination that first kind channel and the 3rd class channel form of HSDPA UE.
(3) value of the number K of training sequence deviation is all probable values, and these comprise: 2,4,6,8,10,12,14 and 16 etc.
(4) adopt optimized resource multiplex mode: can be by the channel code of 1 SF=1 at each descending time slot
Figure BSA00000134515000131
With first training sequence deviation m (1)Configuration is to 1 UE the time, by remaining K-1 training sequence deviation " m in this time slot (2)..., m (K)" and the channel code of the SF=16 corresponding with these training sequence deviation distribute to other UE.Here, m (i), i=1,2 ... .., K mean i training sequence deviation;
Figure BSA00000134515000132
Mean that spreading factor is j channel code in the channel code of SF, SF=1,16, j=1,2 ..., SF.
For further illustrating the present invention, introduce the 3rd embodiment and the 4th embodiment.Certainly, content and method of the present invention never is limited to following variant embodiment.
Embodiment tri-: be the special case during multiplexing idle downlink resource only in embodiment bis-.
Embodiment tetra-: be that in embodiment tri-, the HS-SCCH number is the spy row of 2 o'clock.
Embodiment five: be the channel combination of appointment in embodiment bis-special case when comprising descending idling-resource and belonging to the several channel of the first kind.
1 embodiment mono-
At present, the training sequence deviation number K of community is K=8 by default configuration.Therefore, at first for this configuration, introduce HSDPA resource multiplex mode of the present invention and this resource multiplex mode dispatching device and dispatching method.
At the training sequence deviation number K of community, by default configuration, be K=8 and adopt in default training sequence deviation configuration mode Shi, community the mapping relations between OVSF channel code and training sequence deviation as shown in Figure 1.In Fig. 1, m (i), i=1,2 ... .., 8 mean i training sequence deviation;
Figure BSA00000134515000133
Mean that spreading factor is j channel code in the channel code of SF, SF=1,2,4,8,16, j=1,2 ..., SF;
Figure BSA00000134515000134
In symbol " * " mean that this channel code is supplemental channel code.Whether at this paper, do not distinguish channel code is supplemental channel code.
Due in the TD-SCDMA system, the descending channel code that is merely able to adopt SF=1 and SF=16, therefore, the HS-PDSCH that can distribute to UE when K=8 has following feature:
(1) by the channel code of SF=1
Figure BSA00000134515000135
As HS-PDSCH, distribute to UE, correspondingly, the training sequence deviation of distributing to UE is: m (1)
(2) will
Figure BSA00000134515000136
Etc. one or more UE that distribute in channel code, as the HS-PDSCH of UE, correspondingly, the corresponding training sequence deviation of the channel code of distributing to UE is distributed to UE.
(3) each training sequence deviation m (1), m (2)..., m (8)The channel code of corresponding two SF=16, as shown in rightmost row in Fig. 1.In two channel code by the same training sequence deviation of correspondence, distribute to a UE for one, the one other channel code just can not be distributed to other UE, or this channel code is distributed to same UE, or throws aside.Otherwise, there will be two UE to use different channel code but to use identical training sequence deviation, cause the downstream signal of two UE to obscure together, can't distinguish.Such as, m (2)Simultaneously corresponding two channel code
Figure BSA00000134515000141
With
Figure BSA00000134515000142
When will be wherein 1 distribute to UE1, another or distribute to UE1 or throw aside.
When adopting above-mentioned default training sequence deviation configuration mode, any one descending time slot on any one carrier wave, if realize the resource multiplex between HSDPA UE at this time slot, the resource multiplex flow process that the embodiment of the present invention one proposes as shown in Figure 2, comprises the steps:
(1) step 201: by the channel code of 1 SF=1 of this time slot
Figure BSA00000134515000143
With training sequence deviation m (1)Distribute to a UE.
(2) step 202: by remaining 7 the training sequence deviation " m of this time slot (2)..., m (8)" and the channel code of 14 SF=16s corresponding with these training sequence deviation
Figure BSA00000134515000144
Distribute to other UE except a UE.
In any one descending time slot be scheduled on any one carrier wave be scheduled in above-mentioned flow process ,Zai community, between each HSDPA UE, distribute the channel code of 1 SF=1
Figure BSA00000134515000145
Channel code with 14 SF=16
Figure BSA00000134515000146
Under above-mentioned resource multiplex mode, the resource sum that can distribute to each UE in this time slot of this carrier wave is: the channel code of the channel code of 1 SF=1 and 14 SF=16.The channel code of 1 SF=1 is equivalent to the channel code resources of 16 SF=16, and therefore, the assignable channel code of this time slot is under this mode: the channel code of 30 SF=16.
If do not adopt above-mentioned resource multiplex mode, can also adopt the following resource multiplex mode that any substitutes at each time slot.Following two kinds of alternative resource multiplex modes are resource multiplex modes that currently available technology adopts.Compared with prior art, under the resource multiplex mode of above-mentioned each time slot, spectrum efficiency has improved 14/16=7/8 doubly than prior art.
(1) by the channel code of 1 SF=1 of this time slot
Figure BSA00000134515000151
With training sequence deviation m (1)Distribute to 1 UE, other 7 training sequence deviation " m (2)..., m (8)" and the channel code of 14 SF=16s corresponding with these training sequence deviation
Figure BSA00000134515000152
Throw aside.Under this mode, on being scheduled carrier wave, this in this time slot, distributes the channel code resources of 1 SF=1 between each HSDPA UE.Under this mode, the resource sum that can distribute to each UE is the corresponding resource of channel code of 16 SF=16.And, under this mode, only support to dispatch a UE at this time slot.
(2) by 8 training sequence deviation " m of this time slot (1), m (2)..., m (8)" and the channel code of 16 SF=16s corresponding with these training sequence deviation
Figure BSA00000134515000153
Distribute to UE.Due to the channel code with 1 SF=1
Figure BSA00000134515000154
Corresponding training sequence deviation m (1)Be used to distributing channel mode So the channel code of SF=1 can't be used.Under this mode, on being scheduled carrier wave, this in this time slot, distributes the channel code of 16 SF=16 between each HSDPA UE
Figure BSA00000134515000156
Under this mode, the resource sum of distributing to each UE is the channel code resources of 16 SF=16.
Under the resource multiplex mode of each above-mentioned time slot, the carrier wave that is scheduled in the time of should forming K=8 in the following manner is at the scheduling HS-PDSCH of each subframe " n " resource pool.
(1) the channel combination that the first kind channel that appointment HSDPA UE can be multiplexing and/or the 3rd class channel form.
(2) at each subframe " n ", the HS-PDSCH resource pool of this subframe scheduling various channels in the channel combination of scheduling HS-PDSCH resource and described appointment in " n+d1+1 " subframe form in the shared resource of " n+d1+1 " subframe.
(3) each descending time slot described scheduling HS-PDSCH resource pool comprised is divided into three classes:
● first kind time slot: if in a time slot training sequence deviation m (1)Leave unused, this time slot belongs to first kind time slot." training sequence deviation in a time slot (such as: m (1)) leave unused " refer to: this training sequence deviation in this time slot (such as: m (1)) corresponding channel code belongs to scheduling HS-PDSCH resource and idle downlink resource, is not assigned to other down channels; Perhaps, although distribute to some down channels, this down channel " n+d1+1 " subframe shared with this training sequence deviation (such as m (1)) corresponding channel code leaves unused.If the channel code of an interior SF=1 of time slot or the channel code of all SF=16 all belong to scheduling HS-PDSCH resource or idle downlink resource, this time slot must be first kind time slot.
The Equations of The Second Kind time slot: if all training sequence deviation are all left unused in a time slot, this time slot belongs to the Equations of The Second Kind time slot.If the channel code of an interior SF=1 of time slot or the channel code of all SF=16 all belong to scheduling HS-PDSCH resource or idle downlink resource, this time slot necessarily belongs to the Equations of The Second Kind time slot.The time slot that belongs to the Equations of The Second Kind time slot necessarily belongs to first kind time slot.
The 3rd class time slot: any one belongs in the time slot of the 3rd class, only has the part training sequence deviation to leave unused.If only have the channel code of part SF=16 to belong to scheduling HS-PDSCH resource or the downlink resource of free time or the idle shared resource of down channel in a time slot, this time slot necessarily belongs to the 3rd class time slot.In each time slot that scheduling HS-PDSCH resource pool comprises, all time slots that do not belong to the Equations of The Second Kind time slot all belong to the 3rd class time slot.
(4) above-mentioned scheduling HS-PDSCH resource pool can resolve into following two sub-resource pools:
First child resource pond: this resource pool consists of each time slot that belongs to first kind time slot, and this resource pool comprises the channel code of 1 SF=1 in each time slot With training sequence deviation m (1).This resource pool only supports to distribute the channel code of SF=1 to UE
Second sub-resource pool: this resource pool consists of Equations of The Second Kind time slot and the 3rd class time slot.Within belonging to each time slot of Equations of The Second Kind time slot, this resource pool is by the channel code of 14 SF=16
Figure BSA00000134515000163
With 7 training sequence deviation m (2)..., m (8)Form.In each time slot that belongs to the 3rd class time slot, this resource pool is by non-m (1)The channel code of each idle corresponding SF=16 of training sequence deviation form, also namely in the channel combination of scheduling HS-PDSCH resource, idle downlink resource and appointment the slack resources in the resource of various channel occupancies form.
Under above-mentioned resource multiplex mode, scheduling HS-PDSCH resource pool can be divided into two sub-resource pools.Scheduler and dispatching method that the present invention proposes are dispatched based on these two sub-resource pools.
Below illustrate the formation in above-mentioned scheduling HS-PSCH resource pool and child resource pond.
The Typical Disposition of 3:3 is adopted in community, and TS4-TS6 is descending time slot.In each subframe, scheduling HS-PDSCH resource pool consists of the resource of the various channel occupancies that the channel combination of dispatching HS-PDSCH resource and appointment comprises.The whole resources that comprise TS4 and TS5 in each subframe scheduling HS-PDSCH resource.In the channel combination of appointment, include only idle downlink resource.In each subframe, idle downlink resource comprises: 8 channel code of TS6 Other channel code of TS6 are for distributing following down channel.
(1) TS6
Figure BSA00000134515000172
For allocation of downlink dedicated physical channels (DL DPCH);
(2) TS6
Figure BSA00000134515000173
For distributing High-Speed Shared Control Channel (HS-SCCH);
(3) TS6
Figure BSA00000134515000174
For distributing, strengthen dedicated channel hybrid automatic repeat request indication channel (E-HICH);
(4) TS6
Figure BSA00000134515000175
For distributing, strengthen dedicated channel absolute grant channel (E-AGCH).
Due to TS6's
Figure BSA00000134515000176
For distributing above-mentioned down channel, therefore, the training sequence deviation m corresponding with these channel code (1)..., m (4)Do not leave unused.At TS6, with other 8 channel code that belong to idle downlink resource
Figure BSA00000134515000177
4 corresponding training sequence deviation m (5)..., m (8)Leave unused.
In sum, in each subframe, scheduling HS-PDSCH resource pool is by whole resources of TS4 and TS5 and 8 channel code of TS6
Figure BSA00000134515000178
Form.With table 1, mean this scheduling HS-PDSCH resource pool.In table 1, every row represent 1 time slot; Each row of every row represents the channel code of 2 SF=16.
In above-mentioned scheduling HS-PDSCH resource pool, TS4 and TS5 not only belong to first kind time slot but also belong to the Equations of The Second Kind time slot; TS6 belongs to the 3rd class time slot.
Figure BSA00000134515000179
Table 1: scheduling HS-PDSCH resource pool
According to the constituted mode of above-mentioned HSDPA resource multiplex mode and two sub-resource pools, two sub-resource pools can be resolved in the pond of scheduling resource shown in table 1, as shown in table 2 and table 3.Wherein, table 2 illustrates first child resource pond and consists of first kind time slot TS4 and TS5, and this child resource pond of each time slot in TS4 and TS5 is by the channel code of 1 SF=1
Figure BSA00000134515000181
With training sequence deviation m (1)Form.Second sub-resource pool consists of TS4, TS5 and TS6.Table 3 is illustrated in second resource pool, and in each time slot in Equations of The Second Kind time slot TS4 and TS5, this child resource pond is by the channel code of 14 SF=16
Figure BSA00000134515000182
With 7 training sequence deviation " m (2)..., m (8)Form; In the 3rd class time slot TS6,8 channel code of this child resource pond TS6 in above-mentioned scheduling HS-PDSCH resource pool
Figure BSA00000134515000183
With 4 the training sequence deviation " ms corresponding with these channel code (5)..., m (8)Form.
But, if TS6 Or m (1)Be not assigned to DL DPCH, in this resource pool, TS4, TS5 and TS6 belong to first kind time slot; TS4 and TS5 belong to the Equations of The Second Kind time slot; TS6 belongs to the 3rd class time slot.First child resource pond consists of TS4, TS5 and TS6, as shown in table 4.Correspondingly, second sub-resource pool is as shown in table 5.
Figure BSA00000134515000185
Table 2: first child resource pond
Figure BSA00000134515000186
Table 3: second sub-resource pool
Table 4: first child resource pond
Figure BSA00000134515000191
Table 5: second sub-resource pool
Be scheduled each UE on carrier wave with the resource in multiplexing first child resource pond of time division way, with the resource in time-division and code minute multiplexing second the sub-resource pool of mode.
When distributing the resource in first child resource pond for a UE, can only be by several time slot allocation to UE.Because each time slot includes only a channel code
Figure BSA00000134515000192
Therefore, in first child resource pond, during to the UE Resources allocation, only need to determine that the number of time slot that distribute to UE gets final product.
On the UE be scheduled on each child resource pond and another child resource pond, take between the UE of same asset and form the resource multiplex relation.Such as: TS4 in first child resource pond has been distributed to UE1, dispatched now UE2, wish is distributed to UE2 by 14 channel code of TS4 in second sub-resource pool.Between UE1 and UE2, form the resource multiplex relation.
According to the difference of UE to the downstream signal detectability, can adopt different processing modes:
When UE is very strong to the detectability of downstream signal, even other UE and its multiplexing identical resource are arranged, when UE also can correctly detect the downstream signal of oneself, the wireless channel needed only between two UE was not identical, and two UE just can multiplexing identical resource.Such as: the wireless channel of UE1 and UE2 is different, directly 14 code channels of TS4 is distributed to UE2 just passable.NODEB carries out channel estimating according to the reception signal of the up channel of each UE, obtains the channel estimating of each UE on each antenna of NODEB side.According to the channel estimating of each UE, can obtain the down beam shaping vector of UE.Judge between two UE whether identical method includes but not limited to following two kinds to wireless channel:
(1) if the channel estimating of two UE on each antenna incomplete same think: the wireless channel between two UE is not identical.
(2) if the down beam shaping vector of two UE is not identical, think: the wireless channel between two UE is not identical.
When UE very weak to the detectability of downstream signal, if other UE and its multiplexing identical resource are arranged, when UE is difficult to by the downstream signal of the correct detection of self-ability oneself, NODEB is when realizing resource multiplex, and the correlation between the wireless channel of two UE of the multiplexing same asset of needs assurance is very weak.When the wireless channel correlation between two UE is very strong, just do not allow the multiplexing identical resource of these two UE.Such as, when the wireless channel correlation of the wireless channel of UE2 and UE1 is strong, just the channel code resources of 14 SF=16 of TS4 is not distributed to UE2, the resource of other time slots can be distributed to UE2.When a little less than the wireless channel correlation of the wireless channel of UE2 and UE1, just the resource of TS4 can be distributed to UE2.Judge that the strong and weak method of wireless channel correlation between two UE is on the books at another part patent application document (application number 201010149373.7) of the inventor, this part content is not the emphasis that the present invention is concerned about, repeats no more here.
When the above has introduced K=8, adopt under default the training sequence deviation method of salary distribution and resource multiplex situation, scheduling HS-PDSCH resource pool can resolve into two sub-resource pools under best resource multiplex mode.Can at these two sub-resource pools, dispatch respectively.Make the resource of each HSDPA UE in can multiplexing these two sub-resource pools.
Below provide the HSDPA scheduling flow of the embodiment of the present invention one, as shown in Figure 3, comprise the steps:
Step 301: determine the combination of the HS-PDSCH channel type in addition that HSDPA UE can be multiplexing.This channel type combination can only consist of first kind channel and/or the 3rd class channel.The channel type that UE can be multiplexing is only enumerated in described channel type combination, but does not relate to concrete multiplexing which channel.
Step 302: determine whether to consider the multiplexing ability of UE support resource in resource multiplex.
If do not consider the ability that the UE support resource is multiplexing, just equal acquiescence: even the downlink resource of a UE is multiplexing by other UE, UE has enough abilities correctly to detect downstream signal.In this case, when two UE carry out resource multiplex, as long as the wireless channel of two UE is not identical.
If consider the multiplexing ability of UE support resource, just equal to think: UE does not have enough abilities correctly to detect downstream signal when the downlink resource of a UE is multiplexing by other UE.In this case, when two UE carry out resource multiplex, just need to investigate correlation between the wireless channel of this two UE whether enough a little less than.When the correlation between the wireless channel of two UE is enough weak, these two multiplexing identical resources of UE ability; Otherwise, can not multiplexing identical resource between these two UE.
The scheduling of step 303:HSDPA scheduler start-up period.In any one subframe " n " subsequently, the HSDPA scheduler carries out a HSDPA scheduling.
In any subframe " n ", the scheduling step of HSDPA scheduler as shown in Figure 4, comprises the steps:
Step 303-1: the dispatching priority of determining each HSDPA UE of " n " subframe.According to dispatching priority order from high to low, all UE are queued 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 method that the scheduler of NODEB calculates each HSUPA UE dispatching priority is a lot, such as: polling method, maximum C/I (carrier/interface ratio) method and PF (equitable proportion) method etc.The detailed introduction of these methods refers to existing document.Because the method for the dispatching priority that calculates each UE is not content of the present invention, repeat no more here.
Step 303-2: determine the HS-SCCH that can use in current subframe.In current subframe, all HS-SCCH that configure on the carrier wave be scheduled are available HS-SCCH.
Step 303-3: determine scheduling HS-PDSCH resource pool.
Scheduling HS-PDSCH resource in n subframe HSDPA scheduler schedules " n+d1+1 " subframe.Step 303-3 specifically comprises following sub-step:
Step 303-3-1: at first determine the resource at n+d1+1 subframe scheduling HS-PDSCH.
The HS-PDSCH resource pool that RNC configures to UE consists of to the semi-static HS-PDSCH of each UE and scheduling HS-PDSCH resource configuration." n+d1+1 " subframe scheduling HS-PDSCH resource equals to configure from RNC the resource that forecloses and obtain to the resource the HS-PDSCH resource pool of UE, the semi-static HS-PDSCH of each UE in " n+d1+1 " subframe taken.
Step 303-3-2: because this scheduler can be realized the shared resource of various channels that multiplexing any one channel combination in all channel combinations that first kind channel and/or the 3rd class channel form of HSUPA UE comprises, therefore, in the present invention, " n+d1+1 " subframe scheduling HS-PDSCH resource pool comprises that all kinds of channels that in the scheduling HS-PDSCH resource of " n+d1+1 " subframe and step 301, determined channel combination comprises are in the shared resource of " n+d1+1 " subframe.
If in certain class channel that this channel combination comprises, some channels leave unused in the resource that " n+d1+1 " subframe takies, the training sequence deviation corresponding with this resource left unused.Otherwise this training sequence deviation is not left unused.
According to above-mentioned processing, the channel group of determining in step 301 is share in the scheduling HS-PDSCH resource pool of determining " n+d1+1 " subframe that each subframe " n " is used.But in different subframes, NODEB may be in different application scenarioss, and the occupation condition of different application scene channel can be different, and the resource of therefore dispatching in the HS-PDSCH resource pool also can be different.A kind of preferably processing mode is to pre-define plurality of application scenes, and be every kind of channel combination that scene setting is corresponding.When each subframe " n " formed " n+d1+1 " subframe scheduling HS-PDSCH resource pool, the scene that judgement " n+d1+1 " subframe meets, then adopted the channel combination of determining under this scene." n+d1+1 " subframe scheduling HS-PDSCH resource pool comprises that all kinds of channels that the scheduling HS-PDSCH resource of " n+d1+1 " subframe and the combination of determined channel comprise are in the shared resource of " n+d1+1 " subframe.
If the some channels in certain class channel that determined channel combination comprises leave unused in the shared resource of " n+d1+1 " subframe, the training sequence deviation corresponding with this resource left unused.Otherwise this training sequence deviation is not left unused.
Step 303-4: the classification of each time slot in judgement scheduling HS-PDSCH resource pool, resolve into two sub-resource pools according to the classification of time slot by above-mentioned scheduling HS-PDSCH resource pool.
Each descending time slot that above-mentioned scheduling HS-PDSCH resource pool is comprised is divided into three classes:
First kind time slot: any one belongs to the interior training sequence deviation m of time slot of the first kind (1)Leave unused.
The Equations of The Second Kind time slot: any one belongs to all training sequence deviation in the time slot of Equations of The Second Kind and all leaves unused.
The 3rd class time slot: any one belongs in the time slot of the 3rd class only has the part training sequence deviation to leave unused.In other words, all in scheduling HS-PDSCH resource pool is not that the time slot of Equations of The Second Kind time slot all belongs to the 3rd class time slot.
According to the multiplexing best mode of each time interval resource, above-mentioned scheduling HS-PDSCH resource pool is resolved into to following two sub-resource pools:
First child resource pond: this resource pool consists of each time slot that belongs to first kind time slot, and this resource pool includes only the channel code of 1 SF=1 in each time slot
Figure BSA00000134515000231
This resource pool only supports to distribute the channel code of SF=1 to UE.
Second sub-resource pool: this resource pool consists of Equations of The Second Kind time slot and the 3rd class time slot.Within belonging to each time slot of Equations of The Second Kind time slot, this resource pool is by the channel code of 14 SF=16
Figure BSA00000134515000232
Form.In each time slot that belongs to the 3rd class time slot, the non-m that this resource pool is comprised in this time slot by above-mentioned scheduling HS-PDSCH resource pool (1)The channel code of each idle corresponding SF=16 of training sequence deviation form.
Preferably, each descending time slot that may comprise at scheduling HS-PDSCH resource pool, by m (1)Corresponding channel code is distributed to the down channel beyond scheduling HS-PDSCH.
Step 303-5: start to dispatch one by one UE according to queue sequence from the highest UE of priority.
To the scheduling flow of a UE as shown in Figure 5, comprise the steps:
Step 501: when a UE of scheduling, distribute to UE from selecting a HS-SCCH all available HS-SCCH.
Step 502: distribute to UE as HS-PDSCH from selecting suitable resource two sub-resource pools.If the HS-PDSCH resource of selecting can't be carried the minimum data piece of UE, just finish the scheduling to current UE, start next UE in the dispatching priority formation.To the scheduling of next UE from above-mentioned steps 501.
This step is determined the HS-PDSCH that distributes to UE according to following sub-step:
Step 502-1: the number that calculates the needed channel code of UE that is scheduled.
According to the CQI of the up-to-date HS-PDSCH of the UE that is scheduled, NODEB can know the HS-DSCH data volume A that the channel code of 1 SF=16 can be carried.According to the HS-DSCH data total amount B of this UE, NODEB calculates the number be used to the channel code of the needed SF=16 of all HS-DSCH data that carries this UE
Step 502-2: when a UE of scheduling, at first need the time slot of determining that in first child resource pond, this UE can use.Then, in this child resource pond, select suitable resource as alternative HS-PDSCH.
To any one time slot in first child resource pond, if, while in this time slot, having other down channels beyond scheduling HS-PDSCH resource and descending idling-resource, need to determine whether this time slot can be used for this UE according to following method:
If this time slot exists first kind channel and these channels not to leave unused in " n+d1+1 " subframe, determine the signal of which UE of carrying on each down channel.
In the time according to step 302 is definite, need in resource multiplex, not investigating the ability of UE, whether the wireless channel of the UE carried on the wireless channel of the UE that investigation is scheduled and above-mentioned each down channel is identical.If identical, in this first child resource pond, this time slot can not be used by UE; If different, in this first child resource pond, this time slot can be used by UE.
When according to step 302, determining while need in resource multiplex, investigate the ability of UE, the correlation between the wireless channel of the UE carried on the wireless channel of the UE that investigation is scheduled and above-mentioned each down channel whether a little less than.If the correlation between the wireless channel of the UE carried on UE and one of them down channel not a little less than, just think that this time slot can not be used for UE.
In addition, if when the UE be scheduled was exactly the UE carried on some first kind down channels, this time slot can not be used for UE.
If before this UE, when this time slot has the UE successfully dispatched, when according to step 302, determining while need in resource multiplex, not investigate the ability of UE, whether identically investigate at the wireless channel of the wireless channel of each UE successfully dispatched of this time slot and this UE.If the wireless channel of the UE that one of them is successfully dispatched is identical with the wireless channel of this UE, in this first child resource pond, this time slot can not be used for UE.Here, describedly by the UE that successfully dispatched, referred to: if there is a UE successfully to be dispatched, when the HS-PDSCH that distributes to this UE comprised some descending time slots, this UE was exactly the UE that in this descending time slot, quilt is successfully dispatched.
If before this UE when this time slot has the UE successfully dispatched, when according to step 302, determining while need in resource multiplex, investigate the ability of UE, investigate the correlation of the wireless channel of the wireless channel of each UE successfully dispatched and the current UE of being scheduled.If the correlation between the wireless channel of the wireless channel of UE and the UE that one of them is successfully dispatched not a little less than, just think that this time slot can not be used for UE.
Through above-mentioned processing, this time slot can not be used for UE if can not determine, this time slot can be used for UE.
According to the method described above, can determine each time slot that in first child resource pond, this UE can use, then, calculate the needed number of time slot of UE according to the channel code number X of the needed SF=16 of this UE
Figure BSA00000134515000251
Here,
Figure BSA00000134515000252
Expression on x, rounding, that is: selects to be greater than the smallest positive integral of x.
The HS-PDSCH number of time slot that each UE can support is restricted.Some UE can support the HS-PDSCH of U=2 time slot; Some UE can support the HS-PDSCH of U=5 time slot.Therefore, the number of time slot of selecting in available time slot in first child resource pond can not surpass the maximum number of time slot of HS-PDSCH that UE can support.The maximum number of time slot of the HS-PDSCH that U can support for this UE.
Therefore, in the time slot that need to can use this UE, select Y time slot in first child resource pond.Y=min{T, Z, U}, wherein, the time slot sum that Z can use for this UE in first resource pool; Min{T, Z, U} mean to get the minimum value in T, Z and U.Alternative HS-PDSCH using the resource of Y time slot in first child resource pond as UE.
If in the first child resource pond not this UE can use time slot the time, go to the execution step 502-3.
Step 502-3: determine the resource that in second sub-resource pool, this UE can use.Then, in this child resource pond, select suitable resource as alternative HS-PDSCH.
Because the UE that uses same asset in the UE in second sub-resource pool and first child resource pond forms the resource multiplex relation, if when before this UE, in first resource pool, the UE successfully dispatched being arranged, whether the resource of need investigating in each shared descending time slot of the UE that successfully dispatched can be used for the current UE be scheduled.
In the time according to step 302 is definite, need in resource multiplex, not investigating the ability of UE, whether the wireless channel of investigating the wireless channel of the UE be scheduled and the UE that quilt is successfully dispatched in first resource pool is identical.If identical, the resource in each descending time slot that the UE that this quilt is successfully dispatched in second sub-resource pool takies can not be used for UE.If not identical, the resource in each time slot that the UE that this quilt is successfully dispatched in second sub-resource pool takies can be used for UE.
When according to step 302, determining while need in resource multiplex, investigate the ability of UE, investigate between the wireless channel of the wireless channel of the UE be scheduled and the UE that quilt is successfully dispatched in first child resource pond correlation whether a little less than.If the wireless channel correlation between these two UE not a little less than, just think that the resource in each descending time slot that this quilt is successfully dispatched in second sub-resource pool UE takies can not be used for UE.If a little less than the wireless channel correlation between these two UE, just think that the resource in each descending time slot that this quilt is successfully dispatched in second sub-resource pool UE takies can be used for UE.
Such as the wireless channel of: the wireless channel of the current UE be scheduled and a UE who is successfully dispatched is identical or correlation is very strong, from being somebody's turn to do each descending time slot that UE was used of successfully being dispatched in second sub-resource pool, remove.For another example: before the current UE be scheduled, two UE that successfully dispatched are arranged in first resource pool.First UE only takies TS3, and second UE takies TS4 and TS5.If the wireless channel of the UE be scheduled current when only or correlation identical with the wireless channel of first UE is very strong, removes TS3 in second sub-resource pool, all resources in TS3 all can not be used for the current UE be scheduled; In second sub-resource pool, the resource of TS4 and TS5 can be that the current UE be scheduled is used.If the wireless channel of the UE be scheduled current when just or correlation identical with the wireless channel of second UE is very strong, all removes TS4 and TS5 in second sub-resource pool, all resources in TS4 and TS5 all can not be used for the current UE be scheduled; In second sub-resource pool, the interior resource of TS3 can be that the UE be scheduled is used.
After determining the resource that in second resource pool, this UE can use according to the method described above, channel code number according to the needed SF=16 of this UE, in second resource pool this UE can with resource in to select a rectangle resource that is no more than the UE ability, this rectangle resource be minimum rectangle during the channel code number of the SF=16 that comprises is not less than all rectangles of X.Using this rectangle as alternative HS-PDSCH.So-called rectangle resource, refer to that this resource occupies identical and continuous channel code at each time slot taken.
If when the channel code number that the maximum rectangle resource of the UE ability that is no more than of selecting in the available resources to this UE in second resource pool comprises all is less than X, directly should maximum rectangle resource as alternative HS-PDSCH.
If this second resource pool do not comprise the channel code that any this UE can use, perform step 502-4.
Step 502-4: the HS-PDSCH that determines UE.
When through above-mentioned processing, having to an alternative HS-PDSCH, this HS-PDSCH is distributed to UE.
When through above-mentioned processing, obtaining two alternative HS-PDSCH, if when these two alternative HS-PDSCH can't carry the total data amount of UE, select the maximum HS-PDSCH of number of the channel code of the SF=16 comprised to distribute to UE.
When through above-mentioned processing, obtaining two alternative HS-PDSCH, if when these two alternative HS-PDSCH can carry the total data amount of UE, select the HS-PDSCH of minimum number of the channel code of the SF=16 comprised to distribute to UE.
When through above-mentioned processing, obtaining two alternative HS-PDSCH, if, while only having an alternative HS-PDSCH can carry the total data amount of UE, select this HS-PDSCH to distribute to UE.
Scheduling to this UE in following situation is failed:
When through above-mentioned processing, not obtaining any alternative HS-PDSCH, the scheduling failure to this UE, directly start to dispatch next UE.
If when distributing to the HS-PDSCH of UE and can not carry the minimum data piece of UE, to the scheduling failure of this UE.Start to dispatch a next UE.
To the scheduling of next UE from above-mentioned steps 501.
Step 503: 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 504: distribute training sequence deviation to UE.
As the HS-PDSCH that distributes this UE during from first child resource pond, will
Figure BSA00000134515000271
And m (1)Distribute to UE; As the HS-PDSCH that distributes to this UE, during from second sub-resource pool, the corresponding training sequence deviation of each channel code that this HS-PDSCH comprises is distributed to UE.
Step 505: will distribute to the HS-SCCH of this UE from removing available HS-SCCH, and upgrade two sub-resource pools.
After according to above-mentioned steps, being successfully UE distribution HS-SCCH, HS-PDSCH, HS-SICH and the training sequence deviation be scheduled, show: this UE is successfully dispatched.
Upgrade as follows two sub-resource pools, the HS-PDSCH resource of distributing to UE is removed in corresponding child resource pond: as the HS-PDSCH that distributes to UE during from first child resource pond, each time slot that the HS-PDSCH that distributes to this UE is taken is from removing the time slot that first child resource pond comprises; As the HS-PDSCH that distributes to UE during from second sub-resource pool, each channel code that the HS-PDSCH that distributes to this UE is taken is from removing in the channel code that second sub-resource pool comprises.
After completing above-mentioned processing, if do not have available HS-SCCH just to perform step 506.If after completing above-mentioned processing, first child resource pond does not comprise when any time slot and second sub-resource pool do not comprise any channel code, just performs step 506.
After completing above-mentioned processing, if available HS-SCCH is arranged, and have at least in a sub-resource pool while comprising available resource in two sub-resource pools, just start next UE in the dispatching priority formation.To the scheduling of next UE from above-mentioned steps 501.To the scheduling of next UE two sub-resource pools based on above-mentioned renewal.
Step 506: each UE to successfully being dispatched sends to physical layer by distributing to HS-SCCH, the HS-PDSCH of this UE and the information of HS-SICH.
To each UE be scheduled, at first physical layer sends to UE at the HS-SCCH that the n+d1 subframe will be distributed to this UE; Then in the n+d1+1 subframe, HS-PDSCH is sent to UE; Finally, in the n+d1+3 subframe, receive UE and by HS-SICH, send to the ACK/NACK information of HS-DSCH data block of NODEB and the CQI information of HS-PDSCH.
Embodiment bis-
When the training sequence deviation number K of community can get any possible values, and while adopting default training sequence deviation configuration mode, the mapping relations in each K Zhi Xia community between OVSF channel code and training sequence deviation are defined with the form that is similar to Fig. 1 in embodiment mono-in the 3GPP agreement.At present, K can be in 2,4,6,8,10,12,14 and 16 arbitrarily during value, and still, the present embodiment is not limited to K value in above-mentioned value.If the span of K is expanded later, the present embodiment can directly apply to the K value of expansion.Mapping relations during K=16 between OVSF channel code and training sequence deviation as shown in Figure 2.In Fig. 2, m (i), i=1,2 ... .., 16 mean i training sequence deviation;
Figure BSA00000134515000281
Mean that spreading factor is j channel code in the channel code of SF, SF=1,2,4,8,16, j=1,2 ..., SF.
No matter why K is worth, under each different K value, with the channel code of SF=1 Corresponding training sequence deviation is all m (1).Just under different K values, by m (1)After removing, remaining training sequence deviation number is K-1, and this remaining training sequence deviation number is difference along with the difference of K value.And in remaining training sequence deviation, the channel code of SF=16 corresponding to each training sequence deviation is under different K and not all identical.
But no matter why K is worth, and at the TD-SCDMA system descending, all is merely able to adopt the channel code of SF=1 and SF=16.Therefore, no matter why K is worth, and the HS-PDSCH that can distribute to UE has following characteristic feature:
(1) by the channel code of SF=1
Figure BSA00000134515000291
As HS-PDSCH, distribute to UE, correspondingly, the training sequence deviation of distributing to UE is: m (1)
(2) will
Figure BSA00000134515000292
Etc. one or more UE that distribute in channel code, as the HS-PDSCH of UE, correspondingly, the training sequence deviation that the channel code of distributing to UE is corresponding is distributed to UE.
(3) at m (1), m (2)..., m (K)In the channel code of the corresponding one or more SF=16 of each training sequence deviation.As shown in rightmost row in Fig. 2, the channel code of corresponding 1 SF=16 of each training sequence deviation when K=16.But, in Fig. 1, the channel code of corresponding 2 SF=16 of each training sequence deviation during K=8.When K was worth for other, the channel code number of the SF=16 that each training sequence deviation is corresponding may be also other values.
When adopting default training sequence deviation configuration mode, no matter why K is worth, and for any one descending time slot, if realize the resource multiplex between HSDPA UE at this time slot, this resource multiplex mode is as follows:
(1) by the channel code of 1 SF=1 of this time slot
Figure BSA00000134515000293
With training sequence deviation m (1)Distribute to a UE.
(2) by the remaining K-1 of this a time slot training sequence deviation m (2)..., m (K)With the channel code of all SF=16s corresponding with these training sequence deviation, distribute to other UE except a UE.
In any one time slot be scheduled on any one carrier wave be scheduled in above-mentioned resource multiplex mode ,Zai community, between each HSDPA UE, distribute the channel code of 1 SF=1
Figure BSA00000134515000294
With with m (2)..., m (K)The channel code of corresponding each SF=16.Under above-mentioned resource multiplex mode, the resource sum that can distribute to each UE on any one carrier wave be scheduled in any one time slot be scheduled is: the channel code of 1 SF=1 and and m (2)..., m (K)The channel code of corresponding each SF=16.Under this mode, the channel code number of the SF=16 of the equivalence that each time slot can distribute is greater than 16.
Above-mentioned resource multiplex mode is resource multiplex mode best in the TD-SCDMA system.If do not adopt above-mentioned resource multiplex mode, can only adopt following two kinds of resource multiplex modes at each time slot.But following two kinds of resource multiplex modes resource that above-mentioned best resource mode can distribute that all is far from is large.
(1) by the channel code of 1 SF=1 of this time slot
Figure BSA00000134515000301
With training sequence deviation m (1)Distribute to a UE, other K-1 training sequence deviation " m (2)..., m (K)" and the channel code of each SF=16 corresponding with these training sequence deviation throw aside.Under this mode, on being scheduled carrier wave, this in this time slot, distributes the channel code resources of 1 SF=1 between each HSDPAUE.Under this mode, the resource sum of distributing to each UE is the corresponding resource of channel code of 16 SF=16.And under this mode, each time slot only supports to dispatch 1 UE.
(2) by K training sequence deviation " m of this time slot (1), m (2)..., m (K)" and the channel code of 16 SF=16s corresponding with these training sequence deviation
Figure BSA00000134515000302
Distribute to UE.Due to the channel code with 1 SF=1
Figure BSA00000134515000303
Corresponding training sequence deviation m (1)The channel code of SF=1 is used to distribute the channel code of corresponding SF=16, so can't be used.Under this mode, between each HSDPA UE on this is scheduled carrier wave, distribute the channel code of 16 SF=16
Figure BSA00000134515000304
Under this mode, the resource sum of distributing to each UE is the channel code resources of 16 SF=16.
Under the best resource multiplex mode of each time slot, under different K values, forming the carrier wave that is scheduled is identical in the method for the scheduling HS-PSCH of each subframe " n " resource pool.
(1) the channel combination that the first kind channel that appointment HSDPA UE can be multiplexing and/or the 3rd class channel form.
(2) at each subframe " n ", the HS-PDSCH resource pool of this subframe scheduling consists of in the shared resource of " n+d1+1 " subframe the various channels that the combination of the channel of this subframe scheduling HS-PDSCH resource and appointment comprises.If in a certain class channel that the combination of the channel of appointment comprises, some channels leave unused in the shared resource of " n+d1+1 " subframe, the corresponding training sequence deviation of the shared resource of this channel is left unused; Otherwise the corresponding training sequence deviation of the shared resource of this channel is not just left unused.
(3) each descending time slot above-mentioned scheduling HS-PDSCH resource pool comprised is divided into three classes:
First kind time slot: any one belongs to the interior training sequence deviation m of time slot of the first kind (1)Leave unused." training sequence deviation in a time slot (such as: m (1)) leave unused " refer to: this training sequence deviation in this time slot (such as: m (1)) corresponding channel code belongs to scheduling HS-PDSCH resource and idle downlink resource, is not assigned to other down channels; Perhaps, although distribute to some down channels, this down channel " n+d1+1 " subframe shared with this training sequence deviation (such as m (1)) corresponding channel code leaves unused.If when the channel code of the SF=1 in time slot or the channel code of all SF=16 all belonged to the slack resources in the shared resource of scheduling HS-PDSCH resource or idle downlink resource or down channel, this time slot must be first kind time slot.
The Equations of The Second Kind time slot: any one belongs to all training sequence deviation in the time slot of Equations of The Second Kind and all leaves unused.The time slot that belongs to Equations of The Second Kind necessarily belongs to first kind time slot.If when the channel code of the SF=1 in time slot or the channel code of all SF=16 all belonged to the slack resources in the shared resource of scheduling HS-PDSCH resource or idle downlink resource or down channel, this time slot must be the Equations of The Second Kind time slot.
The 3rd class time slot: any one belongs in the time slot of the 3rd class only has the part training sequence deviation to leave unused.All in scheduling HS-PDSCH resource pool is not that the time slot of Equations of The Second Kind time slot all belongs to the 3rd class time slot.
(4) under above-mentioned resource multiplex mode, scheduling HS-PDSCH resource pool can resolve into two sub-resource pools:
First child resource pond: this resource pool consists of each time slot that belongs to first kind time slot, and this resource pool comprises the channel code of 1 SF=1 in each time slot
Figure BSA00000134515000311
With training sequence deviation m (1).This resource pool only supports to distribute the channel code of SF=1 to UE.
Second sub-resource pool: this resource pool consists of Equations of The Second Kind time slot and the 3rd class time slot.Within belonging to each time slot of Equations of The Second Kind time slot, this resource pool by with m (2)..., m (K)The channel code of corresponding each SF=16 forms.In each time slot that belongs to the 3rd class time slot, the non-m that this resource pool is comprised in this time slot by above-mentioned scheduling HS-PDSCH resource pool (1)The channel code of each idle corresponding SF=16 of training sequence deviation form.
The best resource multiplex mode is scheduler when in the embodiment of the present invention two, the K value can be for arbitrary value and the core of dispatching method in above-mentioned each time slot.Under this multiplex mode, scheduling HS-PDSCH resource pool can be divided into two sub-resource pools.Scheduler and dispatching method that the present invention proposes will be dispatched based on these two sub-resource pools.
Below provide the HSDPA scheduling flow of the embodiment of the present invention two, comprise the steps:
Step 601: determine the combination of the HS-PDSCH channel type in addition that HSDPA UE can be multiplexing.This channel type combination can only consist of first kind channel and/or the 3rd class channel.The channel type that UE can be multiplexing is only enumerated in described channel type combination, but does not relate to concrete multiplexing which channel.
Step 602: determine whether to consider the multiplexing ability of UE support resource in resource multiplex.
If do not consider the ability that the UE support resource is multiplexing, just equal acquiescence: even the downlink resource of a UE is multiplexing by other UE, UE has enough abilities correctly to detect downstream signal.In this case, when two UE carry out resource multiplex, as long as the wireless channel of two UE is not identical.
If consider the multiplexing ability of UE support resource, just equal to think: UE does not have enough abilities correctly to detect downstream signal when the downlink resource of a UE is multiplexing by other UE.In this case, when two UE carry out resource multiplex, just need to investigate correlation between the wireless channel of this two UE whether enough a little less than.When the correlation between the wireless channel of two UE is enough weak, these two multiplexing identical resources of UE ability; Otherwise, can not multiplexing identical resource between these two UE.
The scheduling of step 603:HSDPA scheduler start-up period.In any one subframe " n " subsequently, the HSDPA scheduler carries out a HSDPA scheduling.
In any subframe " n ", the scheduling step of HSDPA scheduler comprises:
Step 603-1: the dispatching priority of determining each HSDPA UE of " n " subframe.According to dispatching priority order from high to low, all UE are queued 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 method that the scheduler of NODEB calculates each HSUPA UE dispatching priority is a lot, such as: polling method, maximum C/I (carrier/interface ratio) method and PF (equitable proportion) method etc.The detailed introduction of these methods refers to existing document.Because the method for the dispatching priority that calculates each UE is not content of the present invention, repeat no more here.
Step 603-2: determine the HS-SCCH that can use in current subframe.In current subframe, all HS-SCCH that configure on the carrier wave be scheduled are available HS-SCCH.
Step 603-3: determine scheduling HS-PDSCH resource pool.
Resource in the scheduling HS-PDSCH resource pool of n subframe HSDPA scheduler schedules " n+d1+1 " subframe.Step 603-3 specifically comprises following sub-step:
Step 603-3-1: at first determine the resource at n+d1+1 subframe scheduling HS-PDSCH.
The HS-PDSCH resource pool that RNC configures to UE consists of to the semi-static HS-PDSCH of each UE and scheduling HS-PDSCH resource configuration." n+d1+1 " subframe scheduling HS-PDSCH resource equals to configure from RNC the resource that forecloses and obtain to the resource the HS-PDSCH resource pool of UE, the semi-static HS-PDSCH of each UE in " n+d1+1 " subframe taken.
Step 603-3-2: because this scheduler can be realized the shared resource of various channels that multiplexing any one channel combination in all channel combinations that first kind channel and/or the 3rd class channel form of HSUPA UE comprises, therefore, in the present invention, " n+d1+1 " subframe scheduling HS-PDSCH resource pool comprises that all kinds of channels that in the scheduling HS-PDSCH resource of " n+d1+1 " subframe and step 601, determined channel combination comprises are in the shared resource of " n+d1+1 " subframe.If the some channels in certain class channel that in step 601, determined channel combination comprises leave unused in the shared resource of " n+d1+1 " subframe, the corresponding training sequence deviation of this resource is left unused; Otherwise this training sequence deviation is not just left unused.
According to above-mentioned processing, the channel group of determining in step 601 is share in the scheduling HS-PDSCH resource pool of determining " n+d1+1 " subframe that each subframe " n " is used.But in different subframes, NODEB may be in different application scenarioss, and the occupation condition of different application scene channel can be different, and the resource of therefore dispatching in the HS-PDSCH resource pool also can be different.A kind of preferably processing mode is to pre-define plurality of application scenes, and be every kind of channel combination that scene setting is corresponding.When each subframe " n " formed " n+d1+1 " subframe scheduling HS-PDSCH resource pool, the scene that judgement " n+d1+1 " subframe meets, then adopted the channel combination of determining under this scene.The constructive method of this scheduling HS-PDSCH resource pool is more flexible.Adopting this more flexibly during method, if in certain class channel that the combination of determined channel comprises, some channels leave unused in the resource that " n+d1+1 " subframe takies, the corresponding training sequence deviation of this resource is left unused; Otherwise the corresponding training sequence deviation of this resource is not just left unused.
Step 603-4: the classification of each time slot in judgement scheduling HS-PDSCH resource pool, resolve into two sub-resource pools according to the classification of time slot by above-mentioned scheduling HS-PDSCH resource pool.
Each descending time slot that above-mentioned scheduling HS-PDSCH resource pool is comprised is divided into three classes:
First kind time slot: any one belongs to the interior training sequence deviation m of time slot of the first kind (1)Leave unused.
The Equations of The Second Kind time slot: any one all training sequence deviation that belong in the time slot of Equations of The Second Kind is all left unused.The time slot that belongs to Equations of The Second Kind must be the time slot that belongs to the first kind.
The 3rd class time slot: any one belongs in the time slot of the 3rd class only has the part training sequence deviation to leave unused.All in scheduling HS-PDSCH resource pool is not that the time slot of Equations of The Second Kind time slot all belongs to the 3rd class time slot.
The best mode multiplexing according to each time interval resource resolves into following two sub-resource pools by above-mentioned scheduling HS-PDSCH resource pool:
First child resource pond: this resource pool consists of each time slot that belongs to first kind time slot, and this resource pool comprises the channel code of 1 SF=1 in each time slot
Figure BSA00000134515000341
With training sequence deviation m (1).This resource pool only supports to distribute the channel code of SF=1 to UE.
Second sub-resource pool: this resource pool consists of Equations of The Second Kind time slot and the 3rd class time slot.Within belonging to each time slot of Equations of The Second Kind time slot, this resource pool by with m (2)..., m (K)The channel code of corresponding each SF=16 forms.In each time slot that belongs to the 3rd class time slot, the non-m that this resource pool is comprised in this time slot by above-mentioned scheduling HS-PDSCH resource pool (1)The channel code of each idle corresponding each SF=16 of training sequence deviation form.
Preferably, each descending time slot that may comprise at scheduling HS-PDSCH resource pool, by m (1)Corresponding channel code is distributed to the down channel beyond scheduling HS-PDSCH.
Step 603-5: start to dispatch one by one UE according to queue sequence from the highest UE of priority.
Scheduling flow to a UE is described with embodiment mono-, does not repeat them here.
Can find out, embodiment mono-can regard the special case of embodiment bis-when K=8 as.K=8 is the number of training sequence deviation in the community of giving tacit consent in current TD-SCDMA system,
Embodiment tri-is the special cases while including only descending idling-resource during the channel of appointment in embodiment bis-combines, and while in embodiment bis-, including only descending idling-resource in the combination of the channel of appointment, corresponding scheduler and dispatching method can further be simplified.The present embodiment three will propose corresponding scheduler and dispatching method.While in the channel combination, including only descending idling-resource, in multiplexing scheduling HS-PDSCH resource, only support the downlink resource of multiplexing free time of HSDPA UE between support HSDPA UE.
The HSDPA scheduling flow of the embodiment of the present invention three comprises the steps:
Step 801: determine whether to consider the multiplexing ability of UE support resource in resource multiplex.
If do not consider the ability that the UE support resource is multiplexing, just equal acquiescence: even the downlink resource of a UE is multiplexing by other UE, UE has enough abilities correctly to detect downstream signal.In this case, when two UE carry out resource multiplex, as long as the wireless channel of two UE is not identical.
If consider the multiplexing ability of UE support resource, just equal to think: UE does not have enough abilities correctly to detect downstream signal when the downlink resource of a UE is multiplexing by other UE.In this case, when two UE carry out resource multiplex, just need to investigate correlation between the wireless channel of this two UE whether enough a little less than.When the correlation between the wireless channel of two UE is enough weak, these two multiplexing identical resources of UE ability; Otherwise, can not multiplexing identical resource between these two UE.
The scheduling of step 802:HSDPA scheduler start-up period.In any one subframe " n " subsequently, the HSDPA scheduler carries out a HSDPA scheduling.
In any subframe " n ", the scheduling step of HSDPA scheduler comprises:
Step 802-1: the dispatching priority of determining each HSDPA UE of " n " subframe.According to dispatching priority order from high to low, all UE are queued 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 method that the scheduler of NODEB calculates each HSUPA UE dispatching priority is a lot, such as: polling method, maximum C/I (carrier/interface ratio) method and PF (equitable proportion) method etc.The detailed introduction of these methods refers to existing document.Because the method for the dispatching priority that calculates each UE is not content of the present invention, repeat no more here.
Step 802-2: determine the HS-SCCH that can use in current subframe.In current subframe, all HS-SCCH that configure on the carrier wave be scheduled are available HS-SCCH.
Step 802-3: the scheduling HS-PDSCH resource pool of determining current n subframe.This resource pool comprises " n+d1+1 " subframe scheduling HS-PDSCH resource and the descending idling-resource of " n+d1+1 " subframe.
Step 802-4: the classification of each time slot in judgement scheduling HS-PDSCH resource pool, resolve into two sub-resource pools according to the classification of time slot by above-mentioned scheduling HS-PDSCH resource pool.
Each descending time slot that above-mentioned scheduling HS-PDSCH resource pool is comprised is divided into three classes:
First kind time slot: any one belongs to the interior training sequence deviation m of time slot of the first kind (1)Leave unused.
The Equations of The Second Kind time slot: any one all training sequence deviation that belong in the time slot of Equations of The Second Kind is all left unused.
The 3rd class time slot: any one belongs in the time slot of the 3rd class only has the part training sequence deviation to leave unused.All in scheduling HS-PDSCH resource pool is not that the time slot of Equations of The Second Kind time slot all belongs to the 3rd class time slot.
The best mode multiplexing according to each time interval resource resolves into following two sub-resource pools by above-mentioned scheduling HS-PDSCH resource pool:
First child resource pond: this resource pool consists of each time slot that belongs to first kind time slot, and this resource pool comprises the channel code of 1 SF=1 in each time slot
Figure BSA00000134515000361
With training sequence deviation m (1).This resource pool only supports to distribute the channel code of SF=1 to UE.
Second sub-resource pool: this resource pool consists of Equations of The Second Kind time slot and the 3rd class time slot.Within belonging to each time slot of Equations of The Second Kind time slot, this resource pool by with m (2)..., m (K)The channel code of corresponding each SF=16 forms.In each time slot that belongs to the 3rd class time slot, the non-m that this resource pool is comprised in this time slot by above-mentioned scheduling HS-PDSCH resource pool (1)The channel code of each idle corresponding each SF=16 of training sequence deviation form.
Preferably, each descending time slot that may comprise at scheduling HS-PDSCH resource pool, by m (1)Corresponding channel code is distributed to the down channel beyond scheduling HS-PDSCH.
Step 802-5: start to dispatch one by one UE according to queue sequence from the highest UE of priority.
Embodiment tetra-proposes corresponding scheduler and dispatching method for following scene:
(1) the HS-SCCH number is 2
(2) multiplexing descending idling-resource only
(3) the HS-PDSCH resource pool that configures to NODEB of RNC consists of several complete time slots, and this resource pool only consists of scheduling HS-PDSCH resource.Perhaps, although configuring to the HS-PDSCH resource pool of NODEB, RNC formed by scheduling HS-PDSCH resource and SPS (semi-persistent scheduling) HS-PDSCH resource,, scheduling HS-PSCH resource fixedly takies several complete time slots.
The present embodiment comprises the steps: for the dispatching method that above-mentioned typical application scenarios provides
Step 1001: determine whether to consider the multiplexing ability of UE support resource in resource multiplex.
If do not consider the ability that the UE support resource is multiplexing, just equal acquiescence: even the downlink resource of a UE is multiplexing by other UE, UE has enough abilities correctly to detect downstream signal.In this case, when two UE carry out resource multiplex, as long as the wireless channel of two UE is not identical.
If consider the multiplexing ability of UE support resource, just equal to think: UE does not have enough abilities correctly to detect downstream signal when the downlink resource of a UE is multiplexing by other UE.In this case, when two UE carry out resource multiplex, just need to investigate correlation between the wireless channel of this two UE whether enough a little less than.When the correlation between the wireless channel of two UE is enough weak, these two multiplexing identical resources of UE ability; Otherwise, can not multiplexing identical resource between these two UE.
The scheduling of step 1002:HSDPA scheduler start-up period.In any one subframe " n " subsequently, the HSDPA scheduler carries out a HSDPA scheduling.
In any subframe " n ", the scheduling step of HSDPA scheduler comprises:
Step 1002-1: the dispatching priority of determining each HSDPA UE of " n " subframe.According to dispatching priority order from high to low, all UE are queued 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 method that the scheduler of NODEB calculates each HSUPA UE dispatching priority is a lot, such as: polling method, maximum C/I (carrier/interface ratio) method and PF (equitable proportion) method etc.The detailed introduction of these methods refers to existing document.Because the method for the dispatching priority that calculates each UE is not content of the present invention, repeat no more here.
Step 1002-2: determine the HS-SCCH that can use in current subframe.In current subframe, all HS-SCCH that configure on the carrier wave be scheduled are available HS-SCCH.
Step 1002-3: the scheduling HS-PDSCH resource pool of determining current n subframe.This resource pool comprises " n+d1+1 " subframe scheduling HS-PDSCH resource and the descending idling-resource of " n+d1+1 " subframe.According to shifting to an earlier date of the present embodiment, " n+d1+1 " subframe scheduling HS-PDSCH resource consists of several complete time slots of RNC fixed configurations.
Step 1002-4: the classification of each time slot in judgement scheduling HS-PDSCH resource pool, resolve into two sub-resource pools according to the classification of time slot by above-mentioned scheduling HS-PDSCH resource pool.
Each descending time slot that above-mentioned scheduling HS-PDSCH resource pool is comprised is divided into three classes:
First kind time slot: any one belongs to the interior training sequence deviation m of time slot of the first kind (1)Leave unused.
The Equations of The Second Kind time slot: any one all training sequence deviation that belong in the time slot of Equations of The Second Kind is all left unused.
The 3rd class time slot: any one belongs in the time slot of the 3rd class only has the part training sequence deviation to leave unused.All in scheduling HS-PDSCH resource pool is not that the time slot of Equations of The Second Kind time slot all belongs to the 3rd class time slot.
The best mode multiplexing according to each time interval resource resolves into following two sub-resource pools by above-mentioned scheduling HS-PDSCH resource pool:
First child resource pond: this resource pool consists of each time slot that belongs to first kind time slot, and this resource pool comprises the channel code of 1 SF=1 in each time slot
Figure BSA00000134515000381
With training sequence deviation m (1).This resource pool only supports to distribute the channel code of SF=1 to UE.
Second sub-resource pool: this resource pool consists of Equations of The Second Kind time slot and the 3rd class time slot.Within belonging to each time slot of Equations of The Second Kind time slot, this resource pool by with m (2)..., m (K)The channel code of corresponding each SF=16 forms.In each time slot that belongs to the 3rd class time slot, the non-m that this resource pool is comprised in this time slot by above-mentioned scheduling HS-PDSCH resource pool (1)The channel code of each idle corresponding each SF=16 of training sequence deviation form.
Preferably, each descending time slot that may comprise at scheduling HS-PDSCH resource pool, by m (1)Corresponding channel code is distributed to the down channel beyond scheduling HS-PDSCH.
Step 1002-5: start to dispatch one by one UE according to queue sequence from the highest UE of priority.
Scheduling flow to a UE comprises the steps:
Step 1002-5-1: when a UE of scheduling, distribute to UE from selecting a HS-SCCH all available HS-SCCH.
Step 1002-5-2: calculate the needed channel code resources of UE that is scheduled.
According to the CQI of the up-to-date HS-PDSCH of the UE that is scheduled, NODEB can know the HS-DSCH data volume A that the channel code of 1 SF=16 can be held.According to the HS-DSCH data total amount B of this UE, NODEB calculates the number be used to the channel code of the needed SF=16 of all HS-DSCH data that carries this UE
Figure BSA00000134515000382
Before the UE be scheduled, during the UE that successfully do not dispatched, the channel code number comprised of selecting to be no more than the UE ability in two sub-resource pools is not less than the rectangle of the minimum of X, and this rectangle is distributed to UE as HS-PDSCH.
If the channel code number that the rectangle of the maximum that the UE ability selects in two sub-resource pools in the situation that be no more than comprises all is less than X, will select this maximum rectangle, this rectangle is distributed to UE.
If the HS-PDSCH that distributes to UE can't carry the data block of UE minimum,, to the scheduling failure of this UE, start to dispatch next UE.To the scheduling of next UE from step 1002-5-1.
Before the UE be scheduled, when a UE who is successfully dispatched is arranged, according to the method in embodiment mono-, determine the available resources of the current UE that this is scheduled in two sub-resource pools.Then, in the resource that this UE can use in two sub-resource pools, select a part of resource to distribute to this UE.Distribute the method for HS-PDSCH the same for this UE.
Step 1002-5-3: 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 1002-5-4: distribute training sequence deviation to UE.
As the HS-PDSCH that distributes this UE during from first child resource pond, will
Figure BSA00000134515000391
And m (1)Distribute to UE; As the HS-PDSCH that distributes to this UE, during from second sub-resource pool, the corresponding training sequence deviation of each channel code that this HS-PDSCH comprises is distributed to UE.
Step 1002-5-5: after according to above-mentioned steps, being successfully UE distribution HS-SCCH, HS-PDSCH, HS-SICH and the training sequence deviation be scheduled, show: this UE is successfully dispatched.To distribute to the HS-SCCH of this UE from available HS-SCCH, removing.Upgrade two sub-resource pools, the HS-PDSCH resource of distributing to UE is removed in corresponding child resource pond: as the HS-PDSCH that distributes to UE during from first child resource pond, each time slot that the HS-PDSCH that distributes to this UE is taken is from removing the time slot that first child resource pond comprises; As the HS-PDSCH that distributes to UE during from second sub-resource pool, each channel code that the HS-PDSCH that distributes to this UE is taken is from removing in the channel code that second sub-resource pool comprises.
After completing above-mentioned processing, if do not have available HS-SCCH just to perform step 1002-5-6.If after completing above-mentioned processing, first child resource pond does not comprise when any time slot and second sub-resource pool do not comprise any channel code, just performs step 1002-5-6.
After completing above-mentioned processing, if available HS-SCCH is arranged, and have at least in a sub-resource pool while comprising available resource in two sub-resource pools, just start next UE in the dispatching priority formation.To the scheduling of next UE from above-mentioned steps 1002-5-1.To the scheduling of next UE two sub-resource pools based on above-mentioned renewal.
Step 1002-5-6: each UE to successfully being dispatched sends to physical layer by distributing to HS-SCCH, the HS-PDSCH of this UE and the information of HS-SICH.
To each UE be scheduled, at first physical layer sends to UE at the HS-SCCH that the n+d1 subframe will be distributed to this UE; Then in the n+d1+1 subframe, HS-PDSCH is sent to UE; Finally, in the n+d1+3 subframe, receive UE and by HS-SICH, send to the ACK/NACK information of HS-DSCH data block of NODEB and the CQI information of HS-PDSCH.
Embodiment five
When the combination of the channel of appointment comprised descending idling-resource and belongs to the several channel of the first kind in embodiment bis-, corresponding scheduler and dispatching method can further be simplified.Embodiment five will propose corresponding scheduler and dispatching method.
When the channel combination comprises descending idling-resource and belongs to the several channel of the first kind, supporting between HSDPA UE in multiplexing scheduling HS-PDSCH resource, only supporting the resource that the several first kind down channel of the downlink resource of multiplexing free time of HSDPA UE and appointment takies.
The HSDPA scheduling flow of the embodiment of the present invention five comprises the steps:
Step 1201: determine the combination of the HS-PDSCH channel type in addition that HSDPA UE can be multiplexing.In this combination, include only the down channel of descending idling-resource and the several first kind, and do not comprise the down channel of other types.
Step 1202: determine whether to consider the multiplexing ability of UE support resource in resource multiplex.
If do not consider the ability that the UE support resource is multiplexing, just equal acquiescence: even the downlink resource of a UE is multiplexing by other UE, UE has enough abilities correctly to detect downstream signal.In this case, when two UE carry out resource multiplex, as long as the wireless channel of two UE is not identical.
If consider the multiplexing ability of UE support resource, just equal to think: UE does not have enough abilities correctly to detect downstream signal when the downlink resource of a UE is multiplexing by other UE.In this case, when two UE carry out resource multiplex, just need to investigate correlation between the wireless channel of this two UE whether enough a little less than.When the correlation between the wireless channel of two UE is enough weak, these two multiplexing identical resources of UE ability; Otherwise, can not multiplexing identical resource between these two UE.
The scheduling of step 1203:HSDPA scheduler start-up period.In any one subframe " n " subsequently, the HSDPA scheduler carries out a HSDPA scheduling.
In any subframe " n ", the scheduling step of HSDPA scheduler comprises:
Step 1203-1: the dispatching priority of determining each HSDPA UE of " n " subframe.According to dispatching priority order from high to low, all UE are queued 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 method that the scheduler of NODEB calculates each HSUPA UE dispatching priority is a lot, such as: polling method, maximum C/I (carrier/interface ratio) method and PF (equitable proportion) method etc.The detailed introduction of these methods refers to existing document.Because the method for the dispatching priority that calculates each UE is not content of the present invention, repeat no more here.
Step 1203-2: determine the HS-SCCH that can use in current subframe.In current subframe, all HS-SCCH that configure on the carrier wave be scheduled are available HS-SCCH.
Step 1203-3: the resource in the scheduling HS-PDSCH resource pool of n subframe HSDPA scheduler schedules " n+d1+1 " subframe." n+d1+1 " subframe scheduling HS-PDSCH resource pool comprises that the down channel of the several first kind of " n+d1+1 " subframe scheduling HS-PDSCH resource, the descending idling-resource of " n+d1+1 " subframe and appointment is in the shared resource of " n+d1+1 " subframe in the present embodiment.While being idle, the corresponding training sequence deviation of this resource is left unused when a shared resource of down channel.Such as: the channel combination of appointment comprises E-HICH.At the upper signal without any UE of " n+d1+1 " subframe E-HICH, at this moment the resource that takies of this E-HICH is left unused.The corresponding training sequence deviation of resource that takies of this E-HICH is left unused.
Step 1203-4: the classification of each time slot in judgement scheduling HS-PDSCH resource pool, resolve into two sub-resource pools according to the classification of time slot by above-mentioned scheduling HS-PDSCH resource pool.
Each descending time slot that above-mentioned scheduling HS-PDSCH resource pool is comprised is divided into three classes:
First kind time slot: any one belongs to the interior training sequence deviation m of time slot of the first kind (1)Leave unused.
The Equations of The Second Kind time slot: any one all training sequence deviation that belong in the time slot of Equations of The Second Kind is all left unused.
The 3rd class time slot: any one belongs in the time slot of the 3rd class only has the part training sequence deviation all to leave unused.All in scheduling HS-PDSCH resource pool is not that the time slot of Equations of The Second Kind time slot all belongs to the 3rd class time slot.
The best mode multiplexing according to each time interval resource resolves into following two sub-resource pools by above-mentioned scheduling HS-PDSCH resource pool:
First child resource pond: this resource pool consists of each time slot that belongs to first kind time slot, and this resource pool comprises the channel code of 1 SF=1 in each time slot With training sequence deviation m (1).This resource pool only supports to distribute the channel code of SF=1 to UE.
Second sub-resource pool: this resource pool consists of Equations of The Second Kind time slot and the 3rd class time slot.Within belonging to each time slot of Equations of The Second Kind time slot, this resource pool by with m (2)..., m (K)The channel code of corresponding each SF=16 forms.In each time slot that belongs to the 3rd class time slot, the non-m that this resource pool is comprised in this time slot by above-mentioned scheduling HS-PDSCH resource pool (1)The channel code of each idle corresponding each SF=16 of training sequence deviation form.
Preferably, each descending time slot that may comprise at scheduling HS-PDSCH resource pool, by m (1)Corresponding channel code is distributed to the down channel beyond scheduling HS-PDSCH.
Step 1203-5: start to dispatch one by one UE according to queue sequence from the highest UE of priority.
Scheduling flow to a UE is described with embodiment mono-, does not repeat them here.
The embodiment of the present invention six proposes the scheduler of HSDPA resource multiplex under a kind of default training sequence deviation method of salary distribution, comprising:
The resource pool module, be used at current subframe n, determine the multiplexing descending shared resource pond of user equipment (UE) of the subframe that is scheduled, described descending shared resource pond comprises that various channels that the channel combination of the scheduling HS-PDSCH resource of " n+d1+1 " subframe and appointment comprises are in the shared resource of n+d1+1 subframe; Channel combination at least one channel in belonging to first kind channel of described appointment forms; Described first kind channel is the channel in current subframe n known signal carrying situation; D1 means that base station carries out the time delay of HSDPA scheduling;
Child resource pond decomposing module, for judging the classification of each time slot of descending shared resource pond that described resource pool module is determined, according to the classification of time slot, two sub-resource pools are resolved into in above-mentioned descending shared resource pond, first child resource pond consists of each time slot that belongs to first kind time slot, and this resource pool comprises the channel code of 1 SF=1 in each time slot
Figure BSA00000134515000431
With training sequence deviation m (1)Second sub-resource pool consists of Equations of The Second Kind time slot and the 3rd class time slot.Within belonging to each time slot of Equations of The Second Kind time slot, this resource pool by with m (2)..., m (K)The channel code of corresponding each SF=16 forms; In each time slot that belongs to the 3rd class, the non-m that this resource pool is comprised at this time slot by descending shared resource pond (1)The channel code of the corresponding SF=16 of idle training sequence deviation form; Wherein K is the number of the training sequence deviation of community; SF is spreading factor; m (k)Mean k training sequence deviation; First kind time slot is training sequence deviation m (1)Be the time slot left unused, the Equations of The Second Kind time slot is that all training sequence deviation are all the time slots left unused, and the 3rd class time slot is that to only have the part training sequence deviation be all the time slot left unused;
The HS-SCCH distribution module, select one as current UE for the UE never be scheduled, and distributes to current UE from all available HS-SCCH, selecting a HS-SCCH;
The HS-PDSCH resource distribution module, for from described two sub-resource pools, selecting the available resource of part, distribute to current UE using selected available resources as HS-PDSCH;
The HS-SICH distribution module, for distributing to this UE with the HS-SICH of the HS-SCCH pairing of distributing to UE, as the scheduling HS-SICH of this UE;
The training sequence deviation distribution module, for the HS-PDSCH when distributing this UE during from first child resource pond, by the channel code of SF=1
Figure BSA00000134515000432
With training sequence deviation m (1)Distribute to UE; As the HS-PDSCH that distributes to this UE, during from second sub-resource pool, the corresponding training sequence deviation of each channel code that this HS-PDSCH comprises is distributed to UE.
Preferably, described first kind channel comprises: semi-persistent scheduling HS-PSDCH, DL DPCH, idle downlink resource, FPACH, E-HICH and E-AGCH.
Preferably, described resource pool module comprises:
The first resource determining unit, for determining scheduling HS-PDSCH resource in the n+d1+1 subframe, this resource is for configuring from RNC to the HS-PDSCH resource pool of NODEB, the shared resource of n+d1+1 subframe semi-persistent scheduling HS-PDSCH being removed to the resource obtained;
The Secondary resource determining unit, the various channels that comprise for the channel combination of determining appointment are in the shared resource of n+d1+1 subframe.
Preferably, described resource pool module further comprises:
The corresponding relation table unit, the mapping table of the application scenarios set in advance for storage and the combination of predefined channel type; And
Query unit, for determining the application scenarios of the subframe that is scheduled, search described mapping table according to described application scenarios, obtains corresponding predefined channel type combination; According to predefined channel type combination, determine that the various channels that comprise in this channel type combination of current subframe are in the shared resource of n+d1+1 subframe.
Preferably, described HS-PDSCH resource distribution module comprises:
Channel code number computing unit, be used to calculating the number of the needed channel code of current UE;
First resource piece allocation units, for the time slot of determining that in first child resource pond, current UE can be used, if available time slot is arranged, select the first resource piece in the first child resource pond;
Secondary resource piece allocation units, for the resource of determining that in second sub-resource pool, current UE can be used, if available resource is arranged, select the Secondary resource piece in the second child resource pond;
Selected cell, for from described first resource piece and Secondary resource piece, select a resource block assignments to current UE as its HS-PDSCH.
Preferably, described first resource piece allocation units comprise:
UE determines subelement, for any one time slot to first child resource pond, if this time slot exists first kind channel and these channels not to leave unused in " n+d1+1 " subframe, determines each down channel UE corresponding to carrying signal;
The same wireless channel judgment sub-unit, whether identical with the wireless channel of described each down channel UE that carrying signal is corresponding be used to the wireless channel that judges current UE, if in first child resource pond, this time slot is unavailable to current UE; Otherwise in first child resource pond, this time slot can be used current UE.
Preferably, described first resource piece allocation units comprise:
UE determines subelement, to any one time slot in first child resource pond, if this time slot exists first kind channel and these channels not to leave unused in " n+d1+1 " subframe, determines each down channel UE corresponding to carrying signal;
Wireless channel correlation judgment sub-unit, relative coefficient for the wireless channel that calculates the UE that the wireless channel of current UE is corresponding with each down channel carrying signal, judge whether described relative coefficient is more than or equal to the relevance threshold set in advance, if in first child resource pond, this time slot is unavailable to current UE; Otherwise in first child resource pond, this time slot can be used current UE.
Preferably, described first resource piece allocation units comprise: modulated degree UE wireless channel judgment sub-unit,
Any one time slot for to first child resource pond, judge whether the wireless channel of the UE that this time slot has successfully been dispatched is identical with the wireless channel of current UE, if in first child resource pond, this time slot is unavailable to current UE; Otherwise in first child resource pond, this time slot can be used current UE;
Perhaps,
For any one time slot to first child resource pond, calculate the relative coefficient of the wireless channel of the wireless channel of current UE and the UE that this time slot has successfully been dispatched, judge whether described relative coefficient is more than or equal to the relevance threshold set in advance, if in first child resource pond, this time slot is unavailable to current UE; Otherwise in first child resource pond, this time slot can be used current UE.
Preferably, described first resource piece allocation units comprise:
The number of time slot computation subunit, calculate the needed number of time slot of UE for the channel code number X according to the needed SF=16 of current UE
Figure BSA00000134515000451
Figure BSA00000134515000452
Expression is to rounding on x;
The Slot selection subelement, select Y time slot: Y=min{T for the time slot that can use current UE in first child resource pond, Z, and U}, wherein, the time slot sum that Z can use for this UE in first resource pool; U is the maximum number of time slot of the current UE HS-PDSCH that can support; Min{T, Z, U} mean to get the minimum value in T, Z and U.
Preferably, described Secondary resource piece allocation units comprise: modulated degree UE wireless channel judgment sub-unit,
For to any one time slot in first child resource pond, judge whether the wireless channel of the UE that this time slot successfully has been dispatched is identical with the wireless channel of current UE, if the interior resource of second interior this time slot of sub-resource pool is unavailable to current UE; Otherwise in second sub-resource pool, the interior resource of this time slot can be used current UE;
Perhaps,
For any one time slot to first child resource pond, calculate the relative coefficient of the wireless channel of the wireless channel of current UE and the UE that this time slot has successfully been dispatched, judge whether described relative coefficient is more than or equal to the relevance threshold set in advance, if in second sub-resource pool, the resource in this time slot is unavailable to current UE; Otherwise in second sub-resource pool, the interior resource of this time slot can be used current UE.
Preferably, described selected cell is used for:
If only select a Resource Block, by this resource block assignments to current UE;
When if two Resource Block selecting all can't carry the total data amount of current UE, select resource block assignments that the number of channel code of the SF=16 comprise is maximum to current UE;
If while in two Resource Block selecting, only having a Resource Block can carry the total data amount of current UE, by this resource block assignments to current UE;
When if two Resource Block selecting can carry the total data amount of UE, the resource block assignments of the minimum number of the channel code of the SF=16 that selection comprises is to current UE.
Preferably, the value of the number K of described training sequence deviation is 2,4,6,8,10,12,14 or 16.
Preferably, the combination of the channel of described appointment includes only idle downlink resource.
Preferably, the number of described HS-SCCH is 2.
The present invention is based on the TD-SCDMA system in the descending channel code that is merely able to adopt SF=1 and SF=16, propose: when adopting under default training sequence deviation configuration mode, carry out the best mode of HS-PDSCH resource multiplex at descending each time slot, and based on this best mode, will dispatch the HS-PDSCH resource pool and resolve into two sub-resource pools.By the scheduling in these two sub-resource pools, realize resource multiplex.
The foregoing is only preferred embodiment of the present invention, in order to limit the present invention, within the spirit and principles in the present invention not all, any modification of making, be equal to replacement, improvement etc., within all should being included in the scope of protection of the invention.

Claims (31)

1. the dispatching method of a HSDPA resource multiplex, is characterized in that, comprises the steps:
A, at current subframe n, determine the multiplexing descending shared resource pond of user equipment (UE) of the subframe that is scheduled, described descending shared resource pond is consisted of in the shared resource of n+d1+1 subframe the various channels that the channel combination of the scheduling HS-PDSCH resource of " n+d1+1 " subframe and appointment comprises; Channel combination at least one channel in belonging to first kind channel of described appointment forms; Described first kind channel is the channel in current subframe n known signal carrying situation; D1 means that base station carries out the time delay of HSDPA scheduling;
The classification of each time slot in B, judgement descending shared resource pond, according to the classification of time slot, two sub-resource pools are resolved into in above-mentioned descending shared resource pond, first child resource pond consists of each time slot that belongs to first kind time slot, and this first child resource pond comprises the channel code of 1 SF=1 in each time slot
Figure FDA0000387484710000011
With training sequence deviation m (1)Second sub-resource pool consists of Equations of The Second Kind time slot and the 3rd class time slot.Within belonging to each time slot of Equations of The Second Kind time slot, this second sub-resource pool by with m (2)..., m (K)The channel code of corresponding each SF=16 forms; In each time slot that belongs to the 3rd class time slot, the non-m that this second sub-resource pool comprised at this time slot by descending shared resource pond (1)The channel code of idle corresponding each SF=16 of training sequence deviation form; Wherein K is the number of the training sequence deviation of community; SF is spreading factor; m (k)Mean k training sequence deviation; First kind time slot is training sequence deviation m (1)Be the time slot left unused, the Equations of The Second Kind time slot is that all training sequence deviation are all the time slots left unused, and the 3rd class time slot is that to only have the part training sequence deviation be the time slot left unused;
In C, the UE that never is scheduled, select one as current UE, distribute to current UE from all available HS-SCCH, selecting a HS-SCCH;
D, from two sub-resource pools, selecting the available resource of part, selected available resources are distributed to current UE and are continued execution step E; If non-selected to available resource finish the scheduling to current UE, return to step C;
E, 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;
F, as the HS-PDSCH that distributes this UE during from first child resource pond, will
Figure FDA0000387484710000012
And m (1)Distribute to UE; As the HS-PDSCH that distributes to this UE, during from second sub-resource pool, the corresponding training sequence deviation of each channel code that this HS-PDSCH comprises is distributed to UE;
G, judge whether that all UE all have been scheduled or have not had and there is no available resource in available HS-SCCH or described two sub-resource pools, if, using next subframe as current subframe, return to steps A, otherwise, step C returned to.
2. method according to claim 1, is characterized in that, described first kind channel comprises: semi-persistent scheduling HS-PSDCH, DL DPCH, idle downlink resource, FPACH, E-HICH and E-AGCH.
3. method according to claim 1, is characterized in that, steps A comprises:
A1, determine scheduling HS-PDSCH resource in the n+d1+1 subframe, this resource is for configuring from RNC to the HS-PDSCH resource pool of NODEB, the shared resource of n+d1+1 subframe semi-persistent scheduling HS-PDSCH being removed to the resource obtained;
A2, determine that various channels that the channel combination of appointment comprises are in the shared resource of n+d1+1 subframe;
A3, the resource that steps A 1 and steps A 2 determined merge the descending shared resource pond that obtains described n+d1+1 subframe.
4. method according to claim 3, is characterized in that, sets in advance the mapping table of application scenarios and the combination of predefined channel type;
Before steps A 1, comprise: determine the application scenarios of place, descending shared resource pond subframe, search described mapping table according to described application scenarios, obtain corresponding predefined channel type combination; The channel combination that this predefined channel type combination is exactly described appointment.
5. method according to claim 1, is characterized in that, when the described selected available resources of step D can't be carried the minimum data piece of UE, finishes the scheduling to current UE, and return to step C.
6. method according to claim 1, is characterized in that, step D comprises:
The number of D1, the needed channel code of calculating current UE;
D2, determine the time slot that in first child resource pond, current UE can be used, if available time slot is arranged, in the first child resource pond, select the first resource piece;
D3, determine the resource that current UE can be used in second sub-resource pool, if available resource is arranged, in the second child resource pond, select the Secondary resource piece;
D4, from first resource piece and Secondary resource piece, select a resource block assignments to current UE as its HS-PDSCH.
7. method according to claim 6, is characterized in that, step D1 comprises:
According to the channel quality indicator (CQI) of the up-to-date HS-PDSCH of current UE, obtain the HS-DSCH data volume A that the channel code of 1 SF=16 can be carried;
According to the HS-DSCH data total amount B of current UE, calculate the number be used to the channel code of the needed SF=16 of all HS-DSCH data that carries this UE
Figure FDA0000387484710000031
Expression is on x, rounding, and selection is not less than the integer of the minimum of x.
8. method according to claim 6, is characterized in that, step D2 is described determine current UE in first child resource pond can with time slot comprise:
To any one time slot in first child resource pond, if this time slot exists first kind channel and these channels not to leave unused in " n+d1+1 " subframe, determine each down channel UE corresponding to carrying signal;
Whether the wireless channel that judges current UE is identical with the wireless channel of described each down channel UE that carrying signal is corresponding, if in first child resource pond, this time slot is unavailable to current UE; Otherwise in first child resource pond, this time slot can be used current UE.
9. method according to claim 6, is characterized in that, step D2 is described determine current UE in first child resource pond can with time slot comprise:
To any one time slot in first child resource pond, if this time slot exists first kind channel and these channels not to leave unused in " n+d1+1 " subframe, determine each down channel UE corresponding to carrying signal;
The relative coefficient of the wireless channel of the UE that the wireless channel of calculating current UE is corresponding with each down channel carrying signal, judge whether described relative coefficient is more than or equal to the relevance threshold set in advance, if in first child resource pond, this time slot is unavailable to current UE; Otherwise in first child resource pond, this time slot can be used current UE.
10. method according to claim 6, is characterized in that, step D2 is described determine current UE in first child resource pond can with time slot comprise:
To any one time slot in first child resource pond, judge whether the wireless channel of the UE that this time slot has successfully been dispatched is identical with the wireless channel of current UE, if in first child resource pond, this time slot is unavailable to current UE; Otherwise in first child resource pond, this time slot can be used current UE;
Perhaps,
Any one time slot to first child resource pond, calculate the relative coefficient of the wireless channel of the wireless channel of current UE and the UE that this time slot has successfully been dispatched, judge whether described relative coefficient is more than or equal to the relevance threshold set in advance, if in first child resource pond, this time slot is unavailable to current UE; Otherwise in first child resource pond, this time slot can be used current UE.
11. method according to claim 6, is characterized in that, the described first resource piece of selecting in the first child resource pond of step D2 comprises:
According to the channel code number X of the needed SF=16 of current UE, calculate the needed number of time slot of UE
Figure FDA0000387484710000041
In the time slot that can use current UE, select Y time slot: Y=min{T in first child resource pond, Z, U}, wherein, the time slot sum that Z can use for this UE in first resource pool; U is the maximum number of time slot of the current UE HS-PDSCH that can support; Min{T, Z, U} mean to get the minimum value in T, Z and U.
12. method according to claim 6, is characterized in that, step D3 is described determine current UE in second sub-resource pool can with resource comprise:
To any one time slot in first child resource pond, judge whether the wireless channel of the UE that this time slot has successfully been dispatched is identical with the wireless channel of current UE, if in second sub-resource pool, the resource in this time slot is unavailable to current UE; Otherwise in second sub-resource pool, the interior resource of this time slot can be used current UE;
Perhaps,
Any one time slot to first child resource pond, calculate the relative coefficient of the wireless channel of the wireless channel of current UE and the UE that this time slot has successfully been dispatched, judge whether described relative coefficient is more than or equal to the relevance threshold set in advance, if in second sub-resource pool, the resource in this time slot is unavailable to current UE; Otherwise in second sub-resource pool, the interior resource of this time slot can be used current UE.
13. method according to claim 6, is characterized in that, the described Secondary resource piece of selecting in the second child resource pond of step D3 comprises:
Channel code number according to the needed SF=16 of current UE, in second resource pool current UE can with resource in select a rectangle resource that is no more than the UE ability, this rectangle resource is that the channel code number of the SF=16 that comprises is not less than minimum rectangle in all rectangles of X, using this rectangle resource as the Secondary resource piece; If in second resource pool current UE can with resource in the rectangle resource of the UE ability that is no more than selected the channel code number of the included SF=16 of maximum rectangle resource all be less than X, the rectangle resource that this is maximum is as the Secondary resource piece.
14. method according to claim 6, is characterized in that, step D4 comprises:
If only select a Resource Block, by this resource block assignments to current UE;
When if these two Resource Block all can't carry the total data amount of current UE, select resource block assignments that the number of channel code of the SF=16 comprise is maximum to current UE;
If while in these two Resource Block, only having a Resource Block can carry the total data amount of current UE, by this resource block assignments to current UE;
When if these two Resource Block can carry the total data amount of UE, the resource block assignments of the minimum number of the channel code of the SF=16 that selection comprises is to current UE.
15. according to the described method of claim 1 to 14 any one, it is characterized in that, the value of the number K of described training sequence deviation is 2,4,6,8,10,12,14 or 16.
16. according to the described method of claim 1 to 14 any one, it is characterized in that, the channel combination of described appointment includes only idle downlink resource.
17. according to the described method of claim 1 to 14 any one, it is characterized in that, the number of described HS-SCCH is 2.
18. the scheduler of a HSDPA resource multiplex, is characterized in that, comprising:
The resource pool module, be used at current subframe n, determine the multiplexing descending shared resource pond of user equipment (UE) of the subframe that is scheduled, described descending shared resource pond is consisted of in the shared resource of n+d1+1 subframe the various channels that the channel combination of the scheduling HS-PDSCH resource of " n+d1+1 " subframe and appointment comprises; Channel combination at least one channel in belonging to first kind channel of described appointment forms; Described first kind channel is the channel in current subframe n known signal carrying situation; D1 means that base station carries out the time delay of HSDPA scheduling;
Child resource pond decomposing module, for judging the classification of each time slot of descending shared resource pond that described resource pool module is determined, according to the classification of time slot, two sub-resource pools are resolved into in above-mentioned descending shared resource pond, first child resource pond consists of each time slot that belongs to first kind time slot, and this first child resource pond comprises the channel code of 1 SF=1 in each time slot
Figure FDA0000387484710000062
With training sequence deviation m (1)Second sub-resource pool consists of Equations of The Second Kind time slot and the 3rd class time slot.Within belonging to each time slot of Equations of The Second Kind time slot, this second sub-resource pool by with m (2)..., m (K)The channel code of corresponding each SF=16 forms; In each time slot that belongs to the 3rd class time slot, the non-m that this second sub-resource pool comprised at this time slot by descending shared resource pond (1)The channel code of idle corresponding each SF=16 of training sequence deviation form; Wherein K is the number of the training sequence deviation of community; SF is spreading factor; m (k)Mean k training sequence deviation; First kind time slot is training sequence deviation m (1)Be the time slot left unused, the Equations of The Second Kind time slot is that all training sequence deviation are all the time slots left unused, and the 3rd class time slot is that to only have the part training sequence deviation be the time slot left unused;
The HS-SCCH distribution module, select one as current UE for the UE never be scheduled, and distributes to current UE from all available HS-SCCH, selecting a HS-SCCH;
The HS-PDSCH resource distribution module, for from described two sub-resource pools, selecting the available resource of part, distribute to current UE using selected available resources as HS-PDSCH;
The HS-SICH distribution module, for distributing to this UE with the HS-SICH of the HS-SCCH pairing of distributing to UE, as the scheduling HS-SICH of this UE;
The training sequence deviation distribution module, for the HS-PDSCH when distributing this UE during from first child resource pond, by the channel code of SF=1
Figure FDA0000387484710000061
With training sequence deviation m (1)Distribute to UE; As the HS-PDSCH that distributes to this UE, during from second sub-resource pool, the corresponding training sequence deviation of each channel code that this HS-PDSCH comprises is distributed to UE.
19. scheduler according to claim 18, is characterized in that, described first kind channel comprises: semi-persistent scheduling HS-PSDCH, DL DPCH, idle downlink resource, FPACH, E-HICH and E-AGCH.
20. scheduler according to claim 18, is characterized in that, the resource pool module comprises:
The first resource determining unit, for determining scheduling HS-PDSCH resource in the n+d1+1 subframe, this resource is for configuring from RNC to the HS-PDSCH resource pool of NODEB, the shared resource of n+d1+1 subframe semi-persistent scheduling HS-PDSCH being removed to the resource obtained;
The Secondary resource determining unit, the various channels that comprise for the channel combination of determining appointment are in the shared resource of n+d1+1 subframe.
21. scheduler according to claim 20, is characterized in that, described resource pool module further comprises:
The corresponding relation table unit, the mapping table of the application scenarios set in advance for storage and the combination of predefined channel type; And
Query unit, for determining the application scenarios of place, descending shared resource pond subframe, search described mapping table according to described application scenarios, obtains corresponding predefined channel type combination; The channel combination that described predefined channel type combination is exactly described appointment.
22. scheduler according to claim 18, is characterized in that, described HS-PDSCH resource distribution module comprises:
Channel code number computing unit, be used to calculating the number of the needed channel code of current UE;
First resource piece allocation units, for the time slot of determining that in first child resource pond, current UE can be used, if available time slot is arranged, select the first resource piece in the first child resource pond;
Secondary resource piece allocation units, for the resource of determining that in second sub-resource pool, current UE can be used, if available resource is arranged, select the Secondary resource piece in the second child resource pond;
Selected cell, for from described first resource piece and Secondary resource piece, select a resource block assignments to current UE as its HS-PDSCH.
23. scheduler according to claim 22, is characterized in that, described first resource piece allocation units comprise:
UE determines subelement, for any one time slot to first child resource pond, if this time slot exists first kind channel and these channels not to leave unused in " n+d1+1 " subframe, determines each down channel UE corresponding to carrying signal;
The same wireless channel judgment sub-unit, whether identical with the wireless channel of described each down channel UE that carrying signal is corresponding be used to the wireless channel that judges current UE, if in first child resource pond, this time slot is unavailable to current UE; Otherwise in first child resource pond, this time slot can be used current UE.
24. scheduler according to claim 22, is characterized in that, described first resource piece allocation units comprise:
UE determines subelement, to any one time slot in first child resource pond, if this time slot exists first kind channel and these channels not to leave unused in " n+d1+1 " subframe, determines each down channel UE corresponding to carrying signal;
Wireless channel correlation judgment sub-unit, relative coefficient for the wireless channel that calculates the UE that the wireless channel of current UE is corresponding with each down channel carrying signal, judge whether described relative coefficient is more than or equal to the relevance threshold set in advance, if in first child resource pond, this time slot is unavailable to current UE; Otherwise in first child resource pond, this time slot can be used current UE.
25. scheduler according to claim 22, is characterized in that, described first resource piece allocation units comprise: modulated degree UE wireless channel judgment sub-unit,
Any one time slot for to first child resource pond, judge whether the wireless channel of the UE that this time slot has successfully been dispatched is identical with the wireless channel of current UE, if in first child resource pond, this time slot is unavailable to current UE; Otherwise in first child resource pond, this time slot can be used current UE;
Perhaps,
For any one time slot to first child resource pond, calculate the relative coefficient of the wireless channel of the wireless channel of current UE and the UE that this time slot has successfully been dispatched, judge whether described relative coefficient is more than or equal to the relevance threshold set in advance, if in first child resource pond, this time slot is unavailable to current UE; Otherwise in first child resource pond, this time slot can be used current UE.
26. scheduler according to claim 22, is characterized in that, described first resource piece allocation units comprise:
The number of time slot computation subunit, calculate the needed number of time slot of UE for the channel code number X according to the needed SF=16 of current UE
Figure FDA0000387484710000081
Figure FDA0000387484710000082
Expression is to rounding on x;
The Slot selection subelement, select Y time slot: Y=min{T for the time slot that can use current UE in first child resource pond, Z, and U}, wherein, the time slot sum that Z can use for this UE in first resource pool; U is the maximum number of time slot of the current UE HS-PDSCH that can support; Min{T, Z, U} mean to get the minimum value in T, Z and U.
27. scheduler according to claim 22, is characterized in that, described Secondary resource piece allocation units comprise: modulated degree UE wireless channel judgment sub-unit,
For to any one time slot in first child resource pond, judge whether the wireless channel of the UE that this time slot successfully has been dispatched is identical with the wireless channel of current UE, if the interior resource of second interior this time slot of sub-resource pool is unavailable to current UE; Otherwise in second sub-resource pool, the interior resource of this time slot can be used current UE;
Perhaps,
For any one time slot to first child resource pond, calculate the relative coefficient of the wireless channel of the wireless channel of current UE and the UE that this time slot has successfully been dispatched, judge whether described relative coefficient is more than or equal to the relevance threshold set in advance, if in second sub-resource pool, the resource in this time slot is unavailable to current UE; Otherwise in second sub-resource pool, the interior resource of this time slot can be used current UE.
28. scheduler according to claim 22, is characterized in that, described selected cell is used for:
If only select a Resource Block, by this resource block assignments to current UE;
When if two Resource Block that choose all can't carry the total data amount of current UE, select resource block assignments that the number of channel code of the SF=16 comprise is maximum to current UE;
If while in two Resource Block that choose, only having a Resource Block can carry the total data amount of current UE, by this resource block assignments to current UE;
When if two Resource Block that choose can carry the total data amount of UE, the resource block assignments of the minimum number of the channel code of the SF=16 that selection comprises is to current UE.
29. according to claim 18 to the described scheduler of 28 any one, it is characterized in that, the value of the number K of described training sequence deviation is 2,4,6,8,10,12,14 or 16.
30. according to claim 18 to the described scheduler of 28 any one, it is characterized in that, the channel combination of described appointment includes only idle downlink resource.
31. according to claim 18 to the described scheduler of 28 any one, it is characterized in that, the number of described HS-SCCH is 2.
CN2010101867415A 2010-05-21 2010-05-21 Dispatching method and dispatcher for multiplexing HSDPA (High Speed Downlink Packet Access) resources Expired - Fee Related CN102256357B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2010101867415A CN102256357B (en) 2010-05-21 2010-05-21 Dispatching method and dispatcher for multiplexing HSDPA (High Speed Downlink Packet Access) resources

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2010101867415A CN102256357B (en) 2010-05-21 2010-05-21 Dispatching method and dispatcher for multiplexing HSDPA (High Speed Downlink Packet Access) resources

Publications (2)

Publication Number Publication Date
CN102256357A CN102256357A (en) 2011-11-23
CN102256357B true CN102256357B (en) 2013-11-27

Family

ID=44983278

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2010101867415A Expired - Fee Related CN102256357B (en) 2010-05-21 2010-05-21 Dispatching method and dispatcher for multiplexing HSDPA (High Speed Downlink Packet Access) resources

Country Status (1)

Country Link
CN (1) CN102256357B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103731925B (en) * 2013-12-31 2017-08-11 深圳信息职业技术学院 Based on the HSUPA polling dispatching methods and system for waiting timing in WCDMA
CN104821853B (en) * 2015-03-05 2017-04-12 北京北方烽火科技有限公司 Calculation method and device for PCCPCH (Primary Common Control Physical Channel) carrier and interference ratio

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101345982A (en) * 2007-07-09 2009-01-14 大唐移动通信设备有限公司 Method and apparatus for distributing high-speed physics downlink sharied signal channel resource
CN101394656A (en) * 2007-09-21 2009-03-25 大唐移动通信设备有限公司 Resource distribution method and apparatus for shared channel

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8155638B2 (en) * 2006-12-28 2012-04-10 Alcatel Lucent Orthogonal code noise simulator for high speed downlink packet access

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101345982A (en) * 2007-07-09 2009-01-14 大唐移动通信设备有限公司 Method and apparatus for distributing high-speed physics downlink sharied signal channel resource
CN101394656A (en) * 2007-09-21 2009-03-25 大唐移动通信设备有限公司 Resource distribution method and apparatus for shared channel

Also Published As

Publication number Publication date
CN102256357A (en) 2011-11-23

Similar Documents

Publication Publication Date Title
CN105075144B (en) Dispensing device and control signal mapping method
CN102882644B (en) The check processing of Downlink Control Information, detection method and device
CN108632781A (en) Vehicle is to the resource selection or reselecting method and user equipment in extraneous communicate
CN102026377B (en) Transmission method for uplink control signaling, base station and user equipment
CN101365220B (en) Stochastic access method based on user side cooperative grouping in collaboration cellular network
RU2006147238A (en) INTRACERAL GENERAL RE-USE FOR A WIRELESS COMMUNICATION SYSTEM
CN106936756A (en) The transmission method of synchronizing signal, apparatus and system
CN104144502A (en) Physical downlink control information acquisition method, device, terminal and system
CN102215588B (en) HSUPA (High Speed Uplink Packet Access) scheduler and scheduling method by adopting MU MIMO (Multiple User Multiple Input Multiple Output) technology
CN103002579A (en) Control information transmission method, base station and user equipment
CN103580792B (en) Resource allocation method and device
CN106060931A (en) Information processing method and user equipment
US8085711B2 (en) Method and system for managing radio resources for soft handoff in an OFDMA-based communication system
CN101783692B (en) Implementation method of uplink reference marks in time division-synchronization code division multiple access (TD-SCDMA) system
CN102264123B (en) Method and device for distributing PDSCH (physical downlink shared channel) power
CN101998634B (en) Method, system and equipment for transmitting periodical feedback information
US20050036456A1 (en) Methods and apparatus of transmitting user data using traffic channels
CN102404862A (en) Method for PDCCH (Physical Downlink Control Channel) resource allocation in LTE (Long Term Evolution) system
CN102238731B (en) High speed downlink packet access (HSDPA) scheduler and scheduling method based on multi-user multiple input multiple output (MU MIMO) technology
CN106561066A (en) Method and device for reducing network delay in wireless communication
CN102256357B (en) Dispatching method and dispatcher for multiplexing HSDPA (High Speed Downlink Packet Access) resources
CN102387497A (en) Base station and allocation method of radio network temporary identities
CN101155406B (en) Resource allocation indicating method and device
CN103379630B (en) A kind of Physical Downlink Shared Channel resource allocation methods and system
EP1654892B1 (en) Method and apparatus of transmitting user data using traffic channels

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20131127

Termination date: 20160521