[go: up one dir, main page]

CN104936233A - Resource scheduling distribution method and device - Google Patents

Resource scheduling distribution method and device Download PDF

Info

Publication number
CN104936233A
CN104936233A CN201410103051.7A CN201410103051A CN104936233A CN 104936233 A CN104936233 A CN 104936233A CN 201410103051 A CN201410103051 A CN 201410103051A CN 104936233 A CN104936233 A CN 104936233A
Authority
CN
China
Prior art keywords
resource
dispatching priority
available resources
cqi
low
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.)
Granted
Application number
CN201410103051.7A
Other languages
Chinese (zh)
Other versions
CN104936233B (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.)
China Academy of Telecommunications Technology CATT
Datang Mobile Communications Equipment Co Ltd
Original Assignee
China Academy of Telecommunications Technology CATT
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 China Academy of Telecommunications Technology CATT filed Critical China Academy of Telecommunications Technology CATT
Priority to CN201410103051.7A priority Critical patent/CN104936233B/en
Priority to PCT/CN2015/074596 priority patent/WO2015139651A1/en
Publication of CN104936233A publication Critical patent/CN104936233A/en
Application granted granted Critical
Publication of CN104936233B publication Critical patent/CN104936233B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
    • H04W72/542—Allocation or scheduling criteria for wireless resources based on quality criteria using measured or perceived quality
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
    • H04W72/566—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient

Landscapes

  • Engineering & Computer Science (AREA)
  • Quality & Reliability (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention relates to the communication filed and discloses a resource scheduling distribution method and device which are used for optimize integral MU-MIMO transmission performance of a system. The method comprises the steps that when a network side is distributing MU resources after system available resources occupied by no UE are distributed, the sequence of the UE is changed, US scheduling is performed no longer based on a PF priority, and MU resource distribution is performed again for the UE without undergoing resource distribution according to the sequence from high channel quality to low channel quality, so that the edge performance of the system is ensured, the scheduling ordering mode of the UE is optimized, the UE higher in channel quality can preferentially select relatively good resources under an MU condition, the waste of system resources is avoided, the advantages of the MU-MIMO transmission mode are also fully developed, and the integral MU-MIMO transmission performance of the system achieves the best.

Description

A kind of scheduling of resource distribution method and device
Technical field
The present invention relates to the communications field, particularly a kind of scheduling of resource distribution method and device.
Background technology
So-called multiple-input and multiple-output (Multple Input Multiple Output, MIMO) technology, is namely all use many antennas to carry out transmission and the reception of data at transmitting terminal and receiving terminal, and sends different data bits on transmitting terminal every root antenna.By utilizing the irrelevance of space channel, and the path of multiple independent decline, produce multiple parallel channel, and the data of each channel are different, thus improve channel capacity.If all multiplexed data flows are all for a subscriber unit, then be called single user multiple antennas (Single-user MIMO, SU-MIMO), if multiple multiplexed data flow is used for multiple terminal, then be called multi-user multi-antenna (Multiple-user MIMO, MU-MIMO).Adopt MU-MIMO transmission pattern can dispatch multiple user on same running time-frequency resource, therefore, when abundant user has data transfer demands simultaneously (namely in the region of dense traffic), adopt MU-MIMO transmission pattern can obtain gain more more than SU-MIMO pattern.
In order to make MU-MIMO technology better be applied, playing larger advantage, needing the system call algorithm after to introducing MU-MIMO transmission form and resource allocation algorithm to study, effective solution is provided.
Dispatching priority sort method conventional is at present equitable proportion (Propotional Fair, PF) algorithm, this algorithm has taken into account subscriber equipment (User Equipment while raising throughput of system, UE) fairness between is a kind of algorithm sought throughput of system maximization and seek to compromise between fairness between UE.
Under PF algorithm, the computational methods of the dispatching priority weights of UE are as follows:
PRI j i = r j ( i ) R i ( i - 1 )
Suppose that the cycle that speed upgrades is T, then in above formula:
for a jth radio bearer (Radio Bearer, RB) the dispatching priority weights within i-th right value update cycle, larger, the dispatching priority weights of UE are higher;
R ji () is the application speed of a jth RB within i-th right value update cycle, this parameter reflection be UE current channel quality instruction (Channel Quality Indicator, CQI), the broadband CQI that this RB can be utilized to belong to UE the last time feedback calculates (Physical Resource Block (Physical ResourceBlock, PRB number can be considered according to 1);
R j(i-1) for a jth RB is in the Mean Speed in the i-th-1 right value update cycle, the mode of this variable uses forgetting factor filtering upgrades, and computing formula is:
R j ( i ) = ( 1 - 1 t c ) · R j ( i - 1 ) + 1 t c · CR j ( i )
In above formula, t cfor weighting parameter, the longest time correlation of failing to serve that the value of this parameter and UE can bear, t clarger, show that the non-service time that UE can bear is longer
CR ji () is the actual transfer rate of a jth RB within i-th right value update cycle.If RB does not transmit data within the right value update cycle, according to CR ji speed renewal is carried out to it in ()=0.If the buffer of RB is empty, then without the need to carrying out speed renewal.
When adopting MU-MIMO transmission pattern, the resource-sharing between multi-user can be realized.And the resource allocation methods adopted based on MU-MIMO transmission pattern is at present generally: first carry out prioritization to user, determine Resourse Distribute order (usually adopting above-mentioned PF algorithm); Then user resource allocation is followed successively by according to the order sequenced.When Resourse Distribute, first for user distributes not by the frequency domain resource of any CU, MU-MIMO transmission pattern is adopted if consider again when there is no unappropriated resource, namely attempt matching with the user being assigned with resource, after meeting matching request (some known pairing algorithms can be adopted) successful matching, between pairing user, public resource is adopted to carry out transfer of data.
In this case, owing to adopting PF algorithm, prioritization is carried out to user, be that the user priority that priority is high distributes not by the frequency domain resource of CU again, therefore, the resource priority of high-quality is likely distributed to the poor user of channel quality (PF grade may be higher) by system, thus both caused the waste of system resource, also fail to give full play to the advantage of MU-MIMO transmission pattern, make the MU-MIMO transmission performance of entire system not reach optimum.
Summary of the invention
The embodiment of the present invention provides a kind of scheduling of resource distribution method and device, in order to the MU-MIMO transmission performance of optimization system entirety.
First aspect, a kind of scheduling of resource distribution method, comprising:
When carrying out Resourse Distribute, judge currently whether exist not by available resources that UE takies;
Determine current when there are not the available resources do not taken by UE, carry out the sequence of CQI dispatching priority according to channel quality to each UE, wherein, the CQI dispatching priority of the UE that channel quality is the highest is the highest;
Dispatch each UE successively according to CQI dispatching priority order from high to low, and distribute corresponding MU resource for it.
In sum, in the embodiment of the present invention, network side is after the system available resources do not taken by any UE are assigned, when distributing MU resource, the sequence of change UE, no longer carry out UE scheduling based on PF priority, but re-start MU Resourse Distribute according to the UE that the channel quality order from high to low of UE is unallocated resource, like this, can while guarantee system edges performance, the scheduling mode of UE is optimized, making can the preferential good resource of picking at the higher UE of MU situation lower channel quality, thus both avoided the waste of system resource, also the advantage of MU-MIMO transmission pattern has been given full play to, the MU-MIMO transmission performance of entire system is made to reach optimum.
In conjunction with first aspect, in the implementation that the first is possible, comprise further:
When determining the available resources that current existence do not take by UE, determine the PF dispatching priority of each UE, then dispatch each UE successively according to PF dispatching priority order from high to low, and distribute corresponding not by available resources that UE takies for it.
In conjunction with the first possible implementation of first aspect, in the implementation that the second is possible, comprise further:
In resource allocation process, the resource do not taken by UE if determine has been assigned and has still there is the UE do not dispatched, then carry out the sequence of CQI dispatching priority according to channel quality to each UE do not dispatched, wherein, the CQI dispatching priority of the UE that channel quality is the highest is the highest;
Dispatch each UE do not dispatched successively according to CQI dispatching priority order from high to low, and distribute corresponding MU resource for it.
In conjunction with first aspect, in the implementation that the third is possible, comprise further:
When determining the available resources that current existence do not take by UE, determine the PF dispatching priority of each UE, each UE is dispatched successively again according to PF dispatching priority order from high to low, and distribute corresponding resource for it, wherein, when for any one UE Resources allocation, calculate described UE and use the volume of transmitted data of the available resources do not taken by UE and use the volume of transmitted data of MU resource, and the Resourse Distribute selecting volume of transmitted data large gives described UE.
In resource integral dispensing process, system synthesis considers all available resources (comprise MU resource and not by available resources that any UE takies), the selection of resource is carried out from transmission availability angle, namely search from all available resources and the maximum resource of transmitted data amount can complete the distribution of resource, thus the systematic function effectively improved further in MU situation, and implementation complexity is lower, there is stronger practicality.
In conjunction with any one possible implementation above-mentioned of first aspect or first aspect, in the 4th kind of possible implementation, dispatch each UE successively according to CQI dispatching priority order from high to low, and distribute corresponding MU resource for it, comprising:
From UE queue, each UE ID is read successively according to CQI dispatching priority;
Often read a UE ID, corresponding UE and the UE being assigned with resource are matched, if successful matching, then share identical resource, until UE queue is the load thresholding that sky or local resource occupancy reach load balancing between subframe.
Second aspect, a kind of scheduling of resource distribution method, comprising:
When carrying out Resourse Distribute, judge currently whether exist not by available resources that UE takies;
When determining the available resources that current existence do not take by UE, determine the PF dispatching priority of each UE, each UE is dispatched successively again according to PF dispatching priority order from high to low, and distribute corresponding resource for it, wherein, when for any one UE Resources allocation, calculate described UE and use the volume of transmitted data of the available resources do not taken by UE and use the volume of transmitted data of MU resource, and the Resourse Distribute selecting volume of transmitted data large gives described UE.
In resource integral dispensing process, system synthesis considers all available resources (comprise MU resource and not by available resources that any UE takies), the selection of resource is carried out from transmission availability angle, namely search from all available resources and the maximum resource of transmitted data amount can complete the distribution of resource, thus the systematic function effectively improved further in MU situation, and implementation complexity is lower, there is stronger practicality.
In conjunction with second aspect, in the implementation that the first is possible, dispatch each UE successively according to PF dispatching priority order from high to low, and distribute corresponding MU resource for it, comprising:
From UE queue, each UE ID is read successively according to PF dispatching priority;
Often read a UE ID, for UE distributes the corresponding available resources that do not taken by UE or MU resource, until UE queue is empty or local resource occupancy reaches the load thresholding of load balancing between subframe.
The third aspect, a kind of scheduling of resource distributor, comprising:
Judging unit, for when carrying out Resourse Distribute, judges currently whether exist not by available resources that UE takies;
Processing unit, for determine current there are not the available resources do not taken by UE time, according to channel quality, the sequence of CQI dispatching priority is carried out to each UE, wherein, the CQI dispatching priority of the UE that channel quality is the highest is the highest, and dispatch each UE successively according to CQI dispatching priority order from high to low, and distribute corresponding multi-user MU resource for it.
In sum, in the embodiment of the present invention, network side is after the system available resources do not taken by any UE are assigned, when distributing MU resource, the sequence of change UE, no longer carry out UE scheduling based on PF priority, but re-start MU Resourse Distribute according to the UE that the channel quality order from high to low of UE is unallocated resource, like this, can while guarantee system edges performance, the scheduling mode of UE is optimized, making can the preferential good resource of picking at the higher UE of MU situation lower channel quality, thus both avoided the waste of system resource, also the advantage of MU-MIMO transmission pattern has been given full play to, the MU-MIMO transmission performance of entire system is made to reach optimum.
In conjunction with the third aspect, in the implementation that the first is possible, described processing unit is further used for:
When determining the available resources that current existence do not take by UE, determine the PF dispatching priority of each UE, then dispatch each UE successively according to PF dispatching priority order from high to low, and distribute corresponding not by available resources that UE takies for it.
In conjunction with in the first possible implementation of the third aspect, in the implementation that the second is possible, described processing unit is further used for:
In resource allocation process, the resource do not taken by UE if determine has been assigned and has still there is the UE do not dispatched, then carry out the sequence of CQI dispatching priority according to channel quality to each UE do not dispatched, wherein, the CQI dispatching priority of the UE that channel quality is the highest is the highest;
Dispatch each UE do not dispatched successively according to CQI dispatching priority order from high to low, and distribute corresponding MU resource for it.
In conjunction with the third aspect, in the implementation that the third is possible, described processing unit is further used for:
When determining the available resources that current existence do not take by UE, determine the PF dispatching priority of each UE, each UE is dispatched successively again according to PF dispatching priority order from high to low, and distribute corresponding resource for it, wherein, when for any one UE Resources allocation, calculate described UE and use the volume of transmitted data of the available resources do not taken by UE and use the volume of transmitted data of MU resource, and the Resourse Distribute selecting volume of transmitted data large gives described UE.
In resource integral dispensing process, system synthesis considers all available resources (comprise MU resource and not by available resources that any UE takies), the selection of resource is carried out from transmission availability angle, namely search from all available resources and the maximum resource of transmitted data amount can complete the distribution of resource, thus the systematic function effectively improved further in MU situation, and implementation complexity is lower, there is stronger practicality.
In conjunction with any one possible implementation above-mentioned of the third aspect or the third aspect, in the 4th kind of possible implementation, dispatching each UE successively according to CQI dispatching priority order from high to low, and for its distribute corresponding MU resource time, described processing unit specifically for:
From UE queue, each UE ID is read successively according to CQI dispatching priority;
Often read a UE ID, corresponding UE and the UE being assigned with resource are matched, if successful matching, then share identical resource, until UE queue is the load thresholding that sky or local resource occupancy reach load balancing between subframe.
Fourth aspect, a kind of scheduling of resource distributor, comprising:
Judging unit, for when carrying out Resourse Distribute, judges currently whether exist not by available resources that UE takies;
Processing unit, for when determining the available resources that current existence is not taken by UE, determine the PF dispatching priority of each UE, each UE is dispatched successively again according to PF dispatching priority order from high to low, and distribute corresponding resource for it, wherein, when for any one UE Resources allocation, calculate described UE use the volume of transmitted data of the available resources do not taken by UE and use the volume of transmitted data of MU resource, and the Resourse Distribute selecting volume of transmitted data large gives described UE.
In resource integral dispensing process, system synthesis considers all available resources (comprise MU resource and not by available resources that any UE takies), the selection of resource is carried out from transmission availability angle, namely search from all available resources and the maximum resource of transmitted data amount can complete the distribution of resource, thus the systematic function effectively improved further in MU situation, and implementation complexity is lower, there is stronger practicality.
In conjunction with fourth aspect, in the implementation that the first is possible, dispatching each UE successively according to PF dispatching priority order from high to low, and for its distribute corresponding MU resource time, described processing unit specifically for:
From UE queue, each UE ID is read successively according to PF dispatching priority;
Often read a UE ID, for UE distributes the corresponding available resources that do not taken by UE or MU resource, until UE queue is empty or local resource occupancy reaches the load thresholding of load balancing between subframe.
5th aspect, a kind of scheduling of resource distributor, comprising:
Processor, for when carrying out Resourse Distribute, judge currently whether exist not by available resources that UE takies, and determine current there are not the available resources do not taken by UE time, carry out the sequence of CQI dispatching priority according to channel quality to each UE, wherein, the CQI dispatching priority of the UE that channel quality is the highest is the highest, and dispatch each UE successively according to CQI dispatching priority order from high to low, and distribute corresponding MU resource for it.
In the embodiment of the present invention, network side is after the system available resources do not taken by any UE are assigned, when distributing MU resource, the sequence of change UE, no longer carry out UE scheduling based on PF priority, but re-start MU Resourse Distribute according to the UE that the channel quality order from high to low of UE is unallocated resource, like this, can while guarantee system edges performance, the scheduling mode of UE is optimized, making can the preferential good resource of picking at the higher UE of MU situation lower channel quality, thus both avoided the waste of system resource, also the advantage of MU-MIMO transmission pattern has been given full play to, the MU-MIMO transmission performance of entire system is made to reach optimum.
In conjunction with the 5th aspect, in the implementation that the first is possible, described processor is further used for:
When determining the available resources that current existence do not take by UE, determine the PF dispatching priority of each UE, then dispatch each UE successively according to PF dispatching priority order from high to low, and distribute corresponding not by available resources that UE takies for it.
In the first possible implementation in conjunction with the 5th aspect, in the implementation that the second is possible, described processor is further used for:
In resource allocation process, the resource do not taken by UE if determine has been assigned and has still there is the UE do not dispatched, then carry out the sequence of CQI dispatching priority according to channel quality to each UE do not dispatched, wherein, the CQI dispatching priority of the UE that channel quality is the highest is the highest;
Dispatch each UE do not dispatched successively according to CQI dispatching priority order from high to low, and distribute corresponding MU resource for it.
In conjunction with the 5th aspect, in the implementation that the third is possible, described processor is further used for:
When determining the available resources that current existence do not take by UE, determine the PF dispatching priority of each UE, each UE is dispatched successively again according to PF dispatching priority order from high to low, and distribute corresponding resource for it, wherein, when for any one UE Resources allocation, calculate described UE and use the volume of transmitted data of the available resources do not taken by UE and use the volume of transmitted data of MU resource, and the Resourse Distribute selecting volume of transmitted data large gives described UE.
In resource integral dispensing process, system synthesis considers all available resources (comprise MU resource and not by available resources that any UE takies), the selection of resource is carried out from transmission availability angle, namely search from all available resources and the maximum resource of transmitted data amount can complete the distribution of resource, thus the systematic function effectively improved further in MU situation, and implementation complexity is lower, there is stronger practicality.
In conjunction with any one possible implementation above-mentioned of the 5th aspect or the 5th aspect, in the 4th kind of possible implementation, dispatching each UE successively according to CQI dispatching priority order from high to low, and for its distribute corresponding MU resource time, described processor specifically for:
From UE queue, each UE ID is read successively according to CQI dispatching priority;
Often read a UE ID, corresponding UE and the UE being assigned with resource are matched, if successful matching, then share identical resource, until UE queue is the load thresholding that sky or local resource occupancy reach load balancing between subframe.
6th aspect, a kind of scheduling of resource distributor, comprising:
Processor, for when carrying out Resourse Distribute, judge currently whether exist not by available resources that UE takies, when determining the available resources that current existence is not taken by user equipment (UE), determine the PF dispatching priority of each UE, each UE is dispatched successively again according to PF dispatching priority order from high to low, and distribute corresponding resource for it, wherein, when for any one UE Resources allocation, calculate described UE use the volume of transmitted data of the available resources do not taken by UE and use the volume of transmitted data of MU resource, and the Resourse Distribute selecting volume of transmitted data large gives described UE.
In resource integral dispensing process, system synthesis considers all available resources (comprise MU resource and not by available resources that any UE takies), the selection of resource is carried out from transmission availability angle, namely search from all available resources and the maximum resource of transmitted data amount can complete the distribution of resource, thus the systematic function effectively improved further in MU situation, and implementation complexity is lower, there is stronger practicality.
In conjunction with the 6th aspect, in the implementation that the first is possible, dispatching each UE successively according to PF dispatching priority order from high to low, and for its distribute corresponding MU resource time, described processor specifically for:
From UE queue, each UE ID is read successively according to PF dispatching priority;
Often read a UE ID, for UE distributes the corresponding available resources that do not taken by UE or MU resource, until UE queue is empty or local resource occupancy reaches the load thresholding of load balancing between subframe.
Accompanying drawing explanation
Fig. 1 is that in the embodiment of the present invention, scheduling of resource distributes the first flow chart;
Fig. 2 is that in the embodiment of the present invention, scheduling of resource distributes the second flow chart;
Fig. 3 is that in the embodiment of the present invention, scheduling of resource distributes detail flowchart;
Fig. 4-Fig. 7 is network side apparatus kind structural representation in the embodiment of the present invention.
Embodiment
In order to the MU-MIMO transmission performance of optimization system entirety, in the embodiment of the present invention, the Resource Distribution and Schedule process based on MU-MIMO transmission pattern is optimized.Main have the optimization of two aspects: a kind of dispatching sequence changing UE; Another kind is when Resources allocation, considers to carry out Resourse Distribute in conjunction with the resource do not taken by UE and MU resource two aspect.
Below in conjunction with accompanying drawing, the preferred embodiment of the present invention is described in detail.
Consult shown in Fig. 1, in the embodiment of the present invention, the first flow process that network side (e.g., base station) carries out scheduling of resource distribution is as follows:
Step 100: when carrying out Resourse Distribute, network side judges currently whether to exist not by available resources that UE takies.
Step 110: network side is determined current when there are not the available resources do not taken by UE, and carry out the sequence of CQI dispatching priority according to channel quality to each UE, wherein, the CQI dispatching priority of the UE that channel quality is the highest is the highest.
In the present embodiment, the CQI that network side can report based on each UE determines the corresponding channel quality of each UE, and determines the CQI dispatching priority of each UE according to channel quality order from high to low.
Step 120: network side dispatches each UE successively according to CQI dispatching priority order from high to low, and distribute corresponding MU resource (namely by resource that other UE take) for it.
Based on above-described embodiment, further, in step 300, if exist not by the available resources that UE takies in network side determination current system, then can adopt but be not limited to following two spike-type cultivars scheduling mode:
First kind of way is: when determining to there are the available resources do not taken by UE in current system, network side determines the PF dispatching priority of each UE, dispatch each UE successively according to PF dispatching priority order from high to low again, and distribute corresponding not by resource that UE takies for it; Wherein, the PF dispatching priority of each UE can before step 300 (namely before execution determining step) precalculate, also can determining to need to calculate again when using PF dispatching priority to carry out Resourse Distribute.
In resource allocation process, if network side determines that the resource do not taken by UE has been assigned and has still there is the UE do not dispatched, then according to channel quality, the sequence of CQI dispatching priority is carried out to each UE do not dispatched, wherein, the CQI dispatching priority of the UE that channel quality is the highest is the highest, then, then dispatch each UE do not dispatched successively according to CQI dispatching priority order from high to low, and distribute corresponding MU resource for it.In other words, in this case, network side meeting is first is that UE distributes not by the available resources that UE takies, after this type of Resourse Distribute according to PF dispatching priority, according to CQI dispatching priority, remaining UE is resequenced again, and distribute MU resource to the UE after rearrangement successively.
The second way is: when determining to there are the available resources do not taken by UE in current system, network side determines the PF dispatching priority of each UE, each UE is dispatched successively again according to PF dispatching priority order from high to low, and distribute corresponding resource for it, wherein, in the process for any one UE Resources allocation, network side calculates this UE and uses the volume of transmitted data of the available resources do not taken by UE and use the volume of transmitted data of MU resource, and the Resourse Distribute selecting volume of transmitted data large gives this UE.Namely under a second technique, network side is when distributing system resource, take into account the available resources and MU resource that are not taken by UE, also contemplate validity and the efficiency of transmission of resource simultaneously, for each UE chooses the current resource be applicable to the most, therefore, although network side dispatches UE according to PF dispatching priority, but each UE both can obtain not by the available resources that UE takies, and also can obtain MU resource.
In above-mentioned steps 100-step 120, (available resources or MU resource that are not taken by UE no matter are distributed when network side is UE Resources allocation, also no matter be distribute according to PF dispatching priority or distribute according to CQI dispatching priority), network side can read UE ID successively from UE queue, each UE ID corresponding resource respectively again for reading, the load thresholding (namely do not dispatch full UE, but without available resources) of load balancing between subframe is reached until UE queue is empty (namely all UE scheduling are complete) or local resource occupancy.Wherein, network side is when distributing MU resource for UE, UE and the UE being assigned with resource can be attempted to match, and placement algorithm can adopt the UE of some known algorithms (e.g., based on correlation pairing algorithm) successful matching to share identical resource to carry out transfer of data.
Such as: calculate the channel estimating of UE1 and UE2 or the correlation of forming vectors, and judge whether correlation is less than setting thresholding, if so, then successful matching, otherwise, match unsuccessful.
Certainly, in actual applications, the above-mentioned second way also can be used alone, and specifically consults shown in Fig. 2, and in the embodiment of the present invention, the second flow process that network side (e.g., base station) carries out scheduling of resource distribution is as follows:
Step 200: when carrying out Resourse Distribute, network side judges currently whether to exist not by available resources that UE takies.
Step 210: when network side determines the available resources that current existence do not take by UE, determine the PF dispatching priority of each UE, each UE is dispatched successively again according to PF dispatching priority order from high to low, and distribute corresponding resource for it, wherein, when for any one UE Resources allocation, calculate this UE and use the volume of transmitted data of the available resources do not taken by UE and use the volume of transmitted data of MU resource, and the Resourse Distribute selecting volume of transmitted data large gives this UE.
Concrete, each UE is being dispatched successively according to PF dispatching priority order from high to low, and for its distribute corresponding MU resource time, preferably, network side reads each UE ID successively according to PF dispatching priority from UE queue, often read a UE ID, network side just distributes the corresponding available resources that do not taken by UE or MU resource (needing when distributing MU resource to match with the UE of Resources allocation) for UE, until UE queue is empty or local resource occupancy reaches the load thresholding of load balancing between subframe.
Below in conjunction with concrete application scenarios, further description is made to above-described embodiment.
Consult shown in Fig. 3, in the embodiment of the present invention, the detailed process that network side (e.g., base station) carries out scheduling of resource distribution is as follows:
Step 300: network side carries out prioritization according to PF algorithm to each UE, determines the PF dispatching priority order of Resourse Distribute.
In the present embodiment, be introduced to carry out PF sequence in advance, also can carry out PF sequence in follow-up needs again when using, not repeat them here.
Step 301: network side judges whether do not existed by the available resources that any UE takies, if so, then carry out step 302, otherwise, carry out step 305.
Step 302: network side reads the highest UE ID of current priority from based on the UE queue of PF dispatching priority, and carry out Resourse Distribute for the UE that this UE ID is corresponding.
For UE1, when being Resources allocation for UE1, network side can only be chosen in the available resources do not taken by UE, volume of transmitted data when also can use with reference to UE1 the available resources do not taken by UE and volume of transmitted data when using MU resource (by resource that UE takies), the resource choosing volume of transmitted data large is distributed.
Each Resources allocation is complete, and network side needs the UE ID of the UE obtaining resource to delete from UE queue.
Step 303: it is empty that network side judges based on the UE queue of PF dispatching priority? if so, then carry out step 309; Otherwise, carry out step 304.
Step 304: network side judges whether that local resource occupancy reaches the load thresholding of load balancing between subframe? if so, then carry out step 309; Otherwise, return step 302.
Step 305: network side carries out the sequence of CQI dispatching priority based on channel quality to each UE.
Step 306: network side reads the highest UE ID of current priority from based on the UE queue of CQI dispatching priority, and carry out Resourse Distribute for the UE that this UE ID is corresponding.
Still for UE1, when being Resources allocation for UE1, UE1 and other UE of Resources allocation are carried out pairing by network side to be attempted, and makes UE1 and the UE of successful matching share identical resource carrying out transfer of data.
Each Resources allocation is complete, and network side needs the UE ID of the UE obtaining resource to delete from UE queue.
Step 307: it is empty that network side judges based on the UE queue of CQI priority? if so, then carry out step 309; Otherwise, carry out step 308.
Step 308: network side judges that local resource occupancy reaches the load thresholding of load balancing between subframe? if so, then carry out step 309; Otherwise, return step 306.
Step 309: network side ending resource allocation flow.
Based on above-described embodiment, consult shown in Fig. 4, in the embodiment of the present invention, network side apparatus comprises judging unit 40 and processing unit 41, wherein,
Judging unit 40, for when carrying out Resourse Distribute, judges currently whether exist not by available resources that UE takies;
Processing unit 41, for determine current there are not the available resources do not taken by UE time, according to channel quality, the sequence of channel quality indicator (CQI) dispatching priority is carried out to each UE, wherein, the CQI dispatching priority of the UE that channel quality is the highest is the highest, and dispatch each UE successively according to CQI dispatching priority order from high to low, and distribute corresponding MU resource for it.
Processing unit 41 is further used for:
When determining the available resources that current existence do not take by UE, determine the PF dispatching priority of each UE, then dispatch each UE successively according to PF dispatching priority order from high to low, and distribute corresponding not by available resources that UE takies for it.
Processing unit 41 is further used for:
In resource allocation process, the resource do not taken by UE if determine has been assigned and has still there is the UE do not dispatched, then carry out the sequence of CQI dispatching priority according to channel quality to each UE do not dispatched, wherein, the CQI dispatching priority of the UE that channel quality is the highest is the highest;
Dispatch each UE do not dispatched successively according to CQI dispatching priority order from high to low, and distribute corresponding MU resource for it.
Processing unit 41 is further used for:
When determining the available resources that current existence do not take by UE, determine the PF dispatching priority of each UE, each UE is dispatched successively again according to PF dispatching priority order from high to low, and distribute corresponding resource for it, wherein, when for any one UE Resources allocation, calculate this UE and use the volume of transmitted data of the available resources do not taken by UE and use the volume of transmitted data of MU resource, and the Resourse Distribute selecting volume of transmitted data large gives this UE.
Dispatching each UE successively according to CQI dispatching priority order from high to low, and for its distribute corresponding MU resource time, processing unit 41 specifically for:
From UE queue, each UE ID is read successively according to CQI dispatching priority;
Often read a UE ID, corresponding UE and the UE being assigned with resource are matched, if successful matching, then share identical resource, until UE queue is the load thresholding that sky or local resource occupancy reach load balancing between subframe.
Consult shown in Fig. 5, in the embodiment of the present invention, network side apparatus comprises judging unit 50 and processing unit 51, wherein,
Judging unit 50, for when carrying out Resourse Distribute, judges currently whether exist not by available resources that UE takies;
Processing unit 51, for when determining the available resources that current existence is not taken by UE, determine the PF dispatching priority of each UE, each UE is dispatched successively again according to PF dispatching priority order from high to low, and distribute corresponding resource for it, wherein, when for any one UE Resources allocation, calculate this UE use the volume of transmitted data of the available resources do not taken by UE and use the volume of transmitted data of MU resource, and the Resourse Distribute selecting volume of transmitted data large gives this UE.
Dispatching each UE successively according to PF dispatching priority order from high to low, and for its distribute corresponding MU resource time, processing unit 51 specifically for:
From UE queue, each UE ID is read successively according to PF dispatching priority;
Often read a UE ID, for UE distributes the corresponding available resources that do not taken by UE or MU resource, until UE queue is empty or local resource occupancy reaches the load thresholding of load balancing between subframe.
Consult shown in Fig. 6, in the embodiment of the present invention, network side apparatus comprises processor 60, wherein,
Processor 60, for when carrying out Resourse Distribute, judge currently whether exist not by available resources that UE takies, and determine current there are not the available resources do not taken by UE time, carry out the sequence of CQI dispatching priority according to channel quality to each UE, wherein, the CQI dispatching priority of the UE that channel quality is the highest is the highest, and dispatch each UE successively according to CQI dispatching priority order from high to low, and distribute corresponding multi-user MU resource for it.
Processor 60 is further used for:
When determining the available resources that current existence do not take by UE, determine the PF dispatching priority of each UE, then dispatch each UE successively according to PF dispatching priority order from high to low, and distribute corresponding not by available resources that UE takies for it.
Processor 60 is further used for:
In resource allocation process, the resource do not taken by UE if determine has been assigned and has still there is the UE do not dispatched, then carry out the sequence of CQI dispatching priority according to channel quality to each UE do not dispatched, wherein, the CQI dispatching priority of the UE that channel quality is the highest is the highest;
Dispatch each UE do not dispatched successively according to CQI dispatching priority order from high to low, and distribute corresponding MU resource for it.
Processor 60 is further used for:
When determining the available resources that current existence do not take by UE, determine the PF dispatching priority of each UE, each UE is dispatched successively again according to PF dispatching priority order from high to low, and distribute corresponding resource for it, wherein, when for any one UE Resources allocation, calculate this UE and use the volume of transmitted data of the available resources do not taken by UE and use the volume of transmitted data of MU resource, and the Resourse Distribute selecting volume of transmitted data large gives this UE.
Dispatching each UE successively according to CQI dispatching priority order from high to low, and for its distribute corresponding MU resource time, processor 60 specifically for:
From UE queue, each UE ID is read successively according to CQI dispatching priority;
Often read a UE ID, corresponding UE and the UE being assigned with resource are matched, if successful matching, then share identical resource, until UE queue is the load thresholding that sky or local resource occupancy reach load balancing between subframe.
Consult shown in Fig. 7, in the embodiment of the present invention, network side apparatus comprises processor 70, wherein,
Processor 70, for when carrying out Resourse Distribute, judge currently whether exist not by available resources that UE takies, when determining the available resources that current existence is not taken by UE, determine the equitable proportion PF dispatching priority of each UE, each UE is dispatched successively again according to PF dispatching priority order from high to low, and distribute corresponding resource for it, wherein, when for any one UE Resources allocation, calculate this UE use the volume of transmitted data of the available resources do not taken by UE and use the volume of transmitted data of MU resource, and the Resourse Distribute selecting volume of transmitted data large gives this UE.
Dispatching each UE successively according to PF dispatching priority order from high to low, and for its distribute corresponding MU resource time, processor 70 specifically for:
From UE queue, each UE ID is read successively according to PF dispatching priority;
Often read a UE ID, for UE distributes the corresponding available resources that do not taken by UE or MU resource, until UE queue is empty or local resource occupancy reaches the load thresholding of load balancing between subframe.
In sum, in the embodiment of the present invention, network side is after the system available resources do not taken by any UE are assigned, when distributing MU resource, the sequence of change UE, no longer carry out UE scheduling based on PF priority, but re-start MU Resourse Distribute according to the UE that the channel quality order from high to low of UE is unallocated resource, like this, can while guarantee system edges performance, the scheduling mode of UE is optimized, making can the preferential good resource of picking at the higher UE of MU situation lower channel quality, thus both avoided the waste of system resource, also the advantage of MU-MIMO transmission pattern has been given full play to, the MU-MIMO transmission performance of entire system is made to reach optimum.
On the other hand, in resource integral dispensing process, system synthesis considers all available resources (comprise MU resource and not by available resources that any UE takies), the selection of resource is carried out from transmission availability angle, namely search from all available resources and the maximum resource of transmitted data amount can complete the distribution of resource, thus the systematic function effectively improved further in MU situation, and implementation complexity is lower, has stronger practicality.
Those skilled in the art should understand, embodiments of the invention can be provided as method, system or computer program.Therefore, the present invention can adopt the form of complete hardware embodiment, completely software implementation or the embodiment in conjunction with software and hardware aspect.And the present invention can adopt in one or more form wherein including the upper computer program implemented of computer-usable storage medium (including but not limited to magnetic disc store, CD-ROM, optical memory etc.) of computer usable program code.
The present invention describes with reference to according to the flow chart of the method for the embodiment of the present invention, equipment (system) and computer program and/or block diagram.Should understand can by the combination of the flow process in each flow process in computer program instructions realization flow figure and/or block diagram and/or square frame and flow chart and/or block diagram and/or square frame.These computer program instructions can being provided to the processor of all-purpose computer, special-purpose computer, Embedded Processor or other programmable data processing device to produce a machine, making the instruction performed by the processor of computer or other programmable data processing device produce device for realizing the function of specifying in flow chart flow process or multiple flow process and/or block diagram square frame or multiple square frame.
These computer program instructions also can be stored in can in the computer-readable memory that works in a specific way of vectoring computer or other programmable data processing device, the instruction making to be stored in this computer-readable memory produces the manufacture comprising command device, and this command device realizes the function of specifying in flow chart flow process or multiple flow process and/or block diagram square frame or multiple square frame.
These computer program instructions also can be loaded in computer or other programmable data processing device, make on computer or other programmable devices, to perform sequence of operations step to produce computer implemented process, thus the instruction performed on computer or other programmable devices is provided for the step realizing the function of specifying in flow chart flow process or multiple flow process and/or block diagram square frame or multiple square frame.
Although describe the preferred embodiments of the present invention, those skilled in the art once obtain the basic creative concept of cicada, then can make other change and amendment to these embodiments.So claims are intended to be interpreted as comprising preferred embodiment and falling into all changes and the amendment of the scope of the invention.
Obviously, those skilled in the art can carry out various change and modification to the embodiment of the present invention and not depart from the spirit and scope of the embodiment of the present invention.Like this, if these amendments of the embodiment of the present invention and modification belong within the scope of the claims in the present invention and equivalent technologies thereof, then the present invention is also intended to comprise these change and modification.

Claims (14)

1. a scheduling of resource distribution method, is characterized in that, comprising:
When carrying out Resourse Distribute, judge currently whether exist not by available resources that user equipment (UE) takies;
Determine current when there are not the available resources do not taken by UE, carry out the sequence of channel quality indicator (CQI) dispatching priority according to channel quality to each UE, wherein, the CQI dispatching priority of the UE that channel quality is the highest is the highest;
Dispatch each UE successively according to CQI dispatching priority order from high to low, and distribute corresponding multi-user MU resource for it.
2. the method for claim 1, is characterized in that, comprises further:
When determining the available resources that current existence do not take by UE, determine the equitable proportion PF dispatching priority of each UE, then dispatch each UE successively according to PF dispatching priority order from high to low, and distribute corresponding not by available resources that UE takies for it.
3. method as claimed in claim 2, is characterized in that, comprise further:
In resource allocation process, the resource do not taken by UE if determine has been assigned and has still there is the UE do not dispatched, then carry out the sequence of CQI dispatching priority according to channel quality to each UE do not dispatched, wherein, the CQI dispatching priority of the UE that channel quality is the highest is the highest;
Dispatch each UE do not dispatched successively according to CQI dispatching priority order from high to low, and distribute corresponding MU resource for it.
4. the method for claim 1, is characterized in that, comprises further:
When determining the available resources that current existence do not take by UE, determine the PF dispatching priority of each UE, each UE is dispatched successively again according to PF dispatching priority order from high to low, and distribute corresponding resource for it, wherein, when for any one UE Resources allocation, calculate described UE and use the volume of transmitted data of the available resources do not taken by UE and use the volume of transmitted data of MU resource, and the Resourse Distribute selecting volume of transmitted data large gives described UE.
5. the method as described in any one of claim 1-4, is characterized in that, dispatches each UE successively according to CQI dispatching priority order from high to low, and distributes corresponding MU resource for it, comprising:
From UE queue, each UE ID is read successively according to CQI dispatching priority;
Often read a UE ID, corresponding UE and the UE being assigned with resource are matched, if successful matching, then share identical resource, until UE queue is the load thresholding that sky or local resource occupancy reach load balancing between subframe.
6. a scheduling of resource distribution method, is characterized in that, comprising:
When carrying out Resourse Distribute, judge currently whether exist not by available resources that user equipment (UE) takies;
When determining the available resources that current existence do not take by UE, determine the equitable proportion PF dispatching priority of each UE, each UE is dispatched successively again according to PF dispatching priority order from high to low, and distribute corresponding resource for it, wherein, when for any one UE Resources allocation, calculate described UE and use the volume of transmitted data of the available resources do not taken by UE and use the volume of transmitted data of MU resource, and the Resourse Distribute selecting volume of transmitted data large gives described UE.
7. method as claimed in claim 6, is characterized in that, dispatch each UE successively according to PF dispatching priority order from high to low, and distribute corresponding MU resource for it, comprising:
From UE queue, each UE ID is read successively according to PF dispatching priority;
Often read a UE ID, for UE distributes the corresponding available resources that do not taken by UE or MU resource, until UE queue is empty or local resource occupancy reaches the load thresholding of load balancing between subframe.
8. a scheduling of resource distributor, is characterized in that, comprising:
Judging unit, for when carrying out Resourse Distribute, judges currently whether exist not by available resources that user equipment (UE) takies;
Processing unit, for determine current there are not the available resources do not taken by UE time, according to channel quality, the sequence of channel quality indicator (CQI) dispatching priority is carried out to each UE, wherein, the CQI dispatching priority of the UE that channel quality is the highest is the highest, and dispatch each UE successively according to CQI dispatching priority order from high to low, and distribute corresponding multi-user MU resource for it.
9. device as claimed in claim 8, it is characterized in that, described processing unit is further used for:
When determining the available resources that current existence do not take by UE, determine the equitable proportion PF dispatching priority of each UE, then dispatch each UE successively according to PF dispatching priority order from high to low, and distribute corresponding not by available resources that UE takies for it.
10. device as claimed in claim 9, it is characterized in that, described processing unit is further used for:
In resource allocation process, the resource do not taken by UE if determine has been assigned and has still there is the UE do not dispatched, then carry out the sequence of CQI dispatching priority according to channel quality to each UE do not dispatched, wherein, the CQI dispatching priority of the UE that channel quality is the highest is the highest;
Dispatch each UE do not dispatched successively according to CQI dispatching priority order from high to low, and distribute corresponding MU resource for it.
11. devices as claimed in claim 8, it is characterized in that, described processing unit is further used for:
When determining the available resources that current existence do not take by UE, determine the PF dispatching priority of each UE, each UE is dispatched successively again according to PF dispatching priority order from high to low, and distribute corresponding resource for it, wherein, when for any one UE Resources allocation, calculate described UE and use the volume of transmitted data of the available resources do not taken by UE and use the volume of transmitted data of MU resource, and the Resourse Distribute selecting volume of transmitted data large gives described UE.
12. devices as described in any one of claim 8-11, is characterized in that, dispatching each UE successively according to CQI dispatching priority order from high to low, and for its distribute corresponding MU resource time, described processing unit specifically for:
From UE queue, each UE ID is read successively according to CQI dispatching priority;
Often read a UE ID, corresponding UE and the UE being assigned with resource are matched, if successful matching, then share identical resource, until UE queue is the load thresholding that sky or local resource occupancy reach load balancing between subframe.
13. 1 kinds of scheduling of resource distributors, is characterized in that, comprising:
Judging unit, for when carrying out Resourse Distribute, judges currently whether exist not by available resources that user equipment (UE) takies;
Processing unit, for when determining the available resources that current existence is not taken by UE, determine the equitable proportion PF dispatching priority of each UE, each UE is dispatched successively again according to PF dispatching priority order from high to low, and distribute corresponding resource for it, wherein, when for any one UE Resources allocation, calculate described UE use the volume of transmitted data of the available resources do not taken by UE and use the volume of transmitted data of MU resource, and the Resourse Distribute selecting volume of transmitted data large gives described UE.
14. devices as claimed in claim 13, is characterized in that, are dispatching each UE successively according to PF dispatching priority order from high to low, and for its distribute corresponding MU resource time, described processing unit specifically for:
From UE queue, each UE ID is read successively according to PF dispatching priority;
Often read a UE ID, for UE distributes the corresponding available resources that do not taken by UE or MU resource, until UE queue is empty or local resource occupancy reaches the load thresholding of load balancing between subframe.
CN201410103051.7A 2014-03-19 2014-03-19 A kind of scheduling of resource distribution method and device Active CN104936233B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201410103051.7A CN104936233B (en) 2014-03-19 2014-03-19 A kind of scheduling of resource distribution method and device
PCT/CN2015/074596 WO2015139651A1 (en) 2014-03-19 2015-03-19 Method and apparatus for scheduling and allocating resources

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410103051.7A CN104936233B (en) 2014-03-19 2014-03-19 A kind of scheduling of resource distribution method and device

Publications (2)

Publication Number Publication Date
CN104936233A true CN104936233A (en) 2015-09-23
CN104936233B CN104936233B (en) 2019-04-02

Family

ID=54123131

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410103051.7A Active CN104936233B (en) 2014-03-19 2014-03-19 A kind of scheduling of resource distribution method and device

Country Status (2)

Country Link
CN (1) CN104936233B (en)
WO (1) WO2015139651A1 (en)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106535339A (en) * 2016-11-17 2017-03-22 南京邮电大学 Multi-hop channel allocation method based on CS-DCA algorithm
CN107294571A (en) * 2017-06-26 2017-10-24 维沃移动通信有限公司 A kind of data transmission method, base station and mobile terminal
CN107852732A (en) * 2015-07-30 2018-03-27 英特尔公司 System and method for the distributed fair resource allocation in the heterogeneous network based on multi radio access technology
CN108702769A (en) * 2016-01-20 2018-10-23 华为技术有限公司 Method, base station and the channel quality classifying equipoment of resource allocation
WO2019127086A1 (en) * 2017-12-27 2019-07-04 华为技术有限公司 Scheduling method, apparatus and system
WO2020118636A1 (en) * 2018-12-13 2020-06-18 Telefonaktiebolaget Lm Ericsson (Publ) Method and base station for multi-user multiple input multiple output

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107942310B (en) * 2017-10-25 2019-12-03 中国人民解放军信息工程大学 The resource joint optimization method of distributed MIMO radar system multiple target location estimation
CN110290590B (en) * 2019-06-03 2022-03-25 西安电子科技大学 Distribution method of LTE system MAC layer resource block with improved weight
CN114416309A (en) * 2021-12-28 2022-04-29 珠海大横琴科技发展有限公司 Method and device for job scheduling
CN119396598A (en) * 2024-12-31 2025-02-07 北京开源芯片研究院 Request allocation method, device, electronic device and storage medium for network on chip

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101729366A (en) * 2008-10-30 2010-06-09 中兴通讯股份有限公司 Method for distributing resources to plurality of users in multi-input multi-output system
CN102025461A (en) * 2010-12-06 2011-04-20 大唐移动通信设备有限公司 Frequency domain scheduling method and device
US20110188599A1 (en) * 2010-02-04 2011-08-04 Samsung Electronics Co., Ltd. Method and apparatus for pre-scheduling in closed-loop mu-mimo antenna system
CN102237903A (en) * 2010-05-06 2011-11-09 中兴通讯股份有限公司 Data transmission method and device for MIMO (multi-input multi-output) system

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP5119977B2 (en) * 2008-02-28 2013-01-16 富士通株式会社 Radio resource allocation control apparatus and method, and radio base station

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101729366A (en) * 2008-10-30 2010-06-09 中兴通讯股份有限公司 Method for distributing resources to plurality of users in multi-input multi-output system
US20110188599A1 (en) * 2010-02-04 2011-08-04 Samsung Electronics Co., Ltd. Method and apparatus for pre-scheduling in closed-loop mu-mimo antenna system
CN102237903A (en) * 2010-05-06 2011-11-09 中兴通讯股份有限公司 Data transmission method and device for MIMO (multi-input multi-output) system
CN102025461A (en) * 2010-12-06 2011-04-20 大唐移动通信设备有限公司 Frequency domain scheduling method and device

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107852732A (en) * 2015-07-30 2018-03-27 英特尔公司 System and method for the distributed fair resource allocation in the heterogeneous network based on multi radio access technology
CN108702769A (en) * 2016-01-20 2018-10-23 华为技术有限公司 Method, base station and the channel quality classifying equipoment of resource allocation
CN106535339A (en) * 2016-11-17 2017-03-22 南京邮电大学 Multi-hop channel allocation method based on CS-DCA algorithm
CN107294571A (en) * 2017-06-26 2017-10-24 维沃移动通信有限公司 A kind of data transmission method, base station and mobile terminal
CN107294571B (en) * 2017-06-26 2020-11-13 维沃移动通信有限公司 Data transmission method, base station and mobile terminal
WO2019127086A1 (en) * 2017-12-27 2019-07-04 华为技术有限公司 Scheduling method, apparatus and system
CN111357348A (en) * 2017-12-27 2020-06-30 华为技术有限公司 Scheduling method, device and system
CN111357348B (en) * 2017-12-27 2022-03-29 华为技术有限公司 Scheduling method, device and system
WO2020118636A1 (en) * 2018-12-13 2020-06-18 Telefonaktiebolaget Lm Ericsson (Publ) Method and base station for multi-user multiple input multiple output
US11943667B2 (en) 2018-12-13 2024-03-26 Telefonaktiebolaget Lm Ericsson (Publ) Method and base station for multi-user multiple input multiple output

Also Published As

Publication number Publication date
WO2015139651A1 (en) 2015-09-24
CN104936233B (en) 2019-04-02

Similar Documents

Publication Publication Date Title
CN104936233A (en) Resource scheduling distribution method and device
CN106685494B (en) Packet scheduling method and device in MU-MIMO system
JP5206945B2 (en) Multi-user MIMO scheduling method
CN105846983B (en) Send and receive method, user equipment and the base station of control channel
KR101731479B1 (en) Scheduling transmission for multi-user, multiple-input, multiple-output data
CN102595385B (en) Downlink transmission method and device
CN104854935B (en) Method and apparatus of the distributing equipment to the equipment communication resource
CN103999513B (en) Up-link power control for MU MIMO
US8743755B2 (en) Downlink resource scheduling method and transmission end for multiple-input multiple-output beam-forming system
CN102420645B (en) A kind of grouping scheduling method of multiuser mimo system and device
CN107710654A (en) Radio communication device
CN108055701B (en) Resource scheduling method and base station
JP2011146882A (en) Wireless communication system, remote station device, and base station device
CN105472754A (en) Resource allocation method and device
CN105612707A (en) Multiplexing method for multiple users, base station, and user terminal
CN108075783B (en) Communication method and device
CN102300326A (en) Scheduling method of multi-user multi-input multi-output (MIMO) communication system and base station
CN114698134A (en) Data transmission method and device, storage medium and electronic device
CN102740480B (en) Method and device for interference suppression of paired users
CN113286373B (en) Uplink multi-user-multi-input multi-output scheduling method and device
CN101527673B (en) Method and system for allocating resources of single-user MIMO
US20210282051A1 (en) Method and apparatus for selecting carrier in mobile communication system
CN104838714A (en) Base station and user scheduling method
CN115833884B (en) MIMO-based base station scheduling method, device and storage medium
CN114599063B (en) Load balancing method, device and storage medium

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
CP01 Change in the name or title of a patent holder
CP01 Change in the name or title of a patent holder

Address after: 100191 No. 40, Haidian District, Beijing, Xueyuan Road

Patentee after: CHINA ACADEMY OF TELECOMMUNICATIONS TECHNOLOGY

Address before: 100191 No. 40, Haidian District, Beijing, Xueyuan Road

Patentee before: CHINA ACADEMY OF TELECOMMUNICATIONS TECHNOLOGY

TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20210527

Address after: 100085 1st floor, building 1, yard 5, Shangdi East Road, Haidian District, Beijing

Patentee after: DATANG MOBILE COMMUNICATIONS EQUIPMENT Co.,Ltd.

Address before: 100191 No. 40, Haidian District, Beijing, Xueyuan Road

Patentee before: CHINA ACADEMY OF TELECOMMUNICATIONS TECHNOLOGY