CN104936233B - A kind of scheduling of resource distribution method and device - Google Patents
A kind of scheduling of resource distribution method and device Download PDFInfo
- Publication number
- CN104936233B CN104936233B CN201410103051.7A CN201410103051A CN104936233B CN 104936233 B CN104936233 B CN 104936233B CN 201410103051 A CN201410103051 A CN 201410103051A CN 104936233 B CN104936233 B CN 104936233B
- Authority
- CN
- China
- Prior art keywords
- resource
- dispatching priority
- occupied
- available resources
- sequence
- 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.)
- Active
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
Abstract
The present invention relates to the communications field, a kind of scheduling of resource distribution method and device, the MU-MIMO transmission performance to optimization system entirety are disclosed.This method are as follows: network side by any UE system available resources occupied after not being assigned, when distributing MU resource, change the sequence of UE, it is no longer based on PF priority and carries out UE scheduling, but MU resource allocation is re-started according to the UE that the sequence of the channel quality of UE from high to low is unallocated resource, in this way, it can be while guaranteeing system edges performance, the scheduling mode of UE is optimized, enable in MU the preferable resource of the preferential picking of the higher UE of channel quality, to both avoid the waste of system resource, also the advantage of MU-MIMO transmission mode has been given full play to, the MU-MIMO transmission performance of system entirety is enabled to be optimal.
Description
Technical field
The present invention relates to the communications field, in particular to a kind of scheduling of resource distribution method and device.
Background technique
So-called multiple-input and multiple-output (Multple Input Multiple Output, MIMO) technology, is in transmitting terminal
Sending and receiving for data is carried out using more antennas with receiving end, and sends different numbers on every antenna of transmitting terminal
According to bit.Irrelevance and multiple paths independently to decline by utilization space channel, generate multiple parallel channels,
And the data of each channel are different, to improve channel capacity.If all multiplexed data flows are all used for a use
Family unit, then referred to as single user multiple antennas (Single-user MIMO, SU-MIMO), if multiple multiplexed data flows are used for
Multiple terminals, then referred to as multi-user multi-antenna (Multiple-user MIMO, MU-MIMO).Using MU-MIMO transmission mode energy
It is enough that multiple users are dispatched on same running time-frequency resource, therefore, there are the feelings of data transfer demands simultaneously in enough users
(i.e. in the region of dense traffic) under condition, gains more more than SU-MIMO mode can be obtained using MU-MIMO transmission mode.
In order to enable MU-MIMO technology is preferably applied, bigger advantage is played, needs to pass introducing MU-MIMO
System call algorithm and resource allocation algorithm after defeated form are studied, and effective solution is provided.
Currently used dispatching priority sort method is fair (Propotional Fair, the PF) algorithm of ratio, the calculation
Method has taken into account the fairness between user equipment (User Equipment, UE) while improving throughput of system, is to seek
Throughput of system maximizes and seeks between UE one of folding algorithm between fairness.
The calculation method of the dispatching priority weight of UE is as follows under PF algorithm:
Assuming that the period that rate updates is T, then in above formula:
For dispatching priority of j-th of radio bearer (Radio Bearer, RB) within i-th of right value update period
Weight,Bigger, the dispatching priority weight of UE is higher；
rjIt (i) is application rate of j-th of RB within i-th of right value update period, parameter reflection is UE current
Channel quality indicates (Channel Quality Indicator, CQI), can use what RB ownership UE the last time fed back
Broadband CQI is calculated (Physical Resource Block (Physical Resource Block, PRB number can consider according to 1)；
RjIt (i-1) is Mean Speed of j-th of RB (i-1)-th right value update period, variable uses forgetting factor filter
The mode of wave is updated, calculation formula are as follows:
In above formula, tcFor weighting parameter, the longest that the value and UE of the parameter can be born fails the time correlation of service, tc
Bigger, the non-service time for showing that UE can be born is longer
CRjIt (i) is actual transfer rate of j-th of RB within i-th of right value update period.If RB is in right value update week
Without transmission data in phase, according to CRj(i)=0 rate update is carried out to it.If the buffer of RB is sky, without carrying out speed
Rate updates.
Using MU-MIMO transmission mode, the resource-sharing between multi-user may be implemented.And currently based on
Resource allocation methods used by MU-MIMO transmission mode are usual are as follows: carry out priority ranking to user first, determine resource point
Sequence ligand (generallys use above-mentioned PF algorithm)；Then user is followed successively by according to the sequence sequenced distribute resource.In resource allocation
When, it distributes first for user not by the frequency domain resource of any user occupancy, if without considering further that use when unappropriated resource
MU-MIMO transmission mode is attempted to match with the user for having been allocated for resource, meeting matching request (can be used some known
Pairing algorithm) after successful matching, match and carried out data transmission between user using public resource.
In this case, priority ranking is carried out to user due to use PF algorithm, then excellent for the high user of priority
First distribute the frequency domain resource not by user occupancy, therefore, system be possible to distribute to good resource priority channel quality compared with
User's (PF grade may be higher) of difference also fails to give full play to MU-MIMO transmission to both cause the waste of system resource
The advantage of mode enables the MU-MIMO transmission performance of system entirety not up to optimal.
Summary of the invention
The embodiment of the present invention provides a kind of scheduling of resource distribution method and device, the MU-MIMO to optimization system entirety
Transmission performance.
First aspect, a kind of scheduling of resource distribution method, comprising:
When carrying out resource allocation, judgement is currently with the presence or absence of the available resources not occupied by UE；
It determines there is currently no when the available resources not occupied by UE, CQI scheduling is carried out to each UE according to channel quality
Priority ranking, wherein the CQI dispatching priority highest of the highest UE of channel quality；
Each UE is successively dispatched according to the sequence of CQI dispatching priority from high to low, and distributes corresponding MU resource for it.
In conclusion network side be not assigned by any UE system available resources occupied in the embodiment of the present invention
Afterwards, when distributing MU resource, the sequence of UE is changed, PF priority is no longer based on and carries out UE scheduling, but according to the channel matter of UE
The sequence of amount from high to low is that the UE of unallocated resource re-starts MU resource allocation, in such manner, it is possible to guaranteeing system edges
While energy, the scheduling mode of UE is optimized, enables the higher UE of channel quality in MU preferential
The preferable resource of picking had also given full play to the advantage of MU-MIMO transmission mode to both avoid the waste of system resource, enabled
The MU-MIMO transmission performance of system entirety is optimal.
With reference to first aspect, in the first possible implementation, further comprise:
It determines there is currently when the available resources not occupied by UE, the PF dispatching priority of each UE is determined, according still further to PF
The sequence of dispatching priority from high to low successively dispatches each UE, and is the corresponding available resources not occupied by UE of its distribution.
The possible implementation of with reference to first aspect the first further wraps in the second possible implementation
It includes:
In resource allocation process, however, it is determined that it has not been assigned by the UE resource occupied and there are still unscheduled UE,
The sequence of CQI dispatching priority then is carried out to each unscheduled UE according to channel quality, wherein the highest UE's of channel quality
CQI dispatching priority highest；
Each unscheduled UE is successively dispatched according to the sequence of CQI dispatching priority from high to low, and corresponding for its distribution
MU resource.
With reference to first aspect, in the third possible implementation, further comprise:
It determines there is currently when the available resources not occupied by UE, the PF dispatching priority of each UE is determined, according still further to PF
The sequence of dispatching priority from high to low successively dispatches each UE, and distributes corresponding resource for it, wherein for any one
When a UE distribution resource, calculates the UE and use not by the volume of transmitted data of the UE available resources occupied and using the number of MU resource
According to transmission quantity, and the resource allocation for selecting volume of transmitted data big gives the UE.
During resource integral dispensing, system has comprehensively considered all available resources (including MU resource and not any
The available resources that UE is occupied), the selection of resource is carried out from transmission availability angle, i.e., searching from all available resources can
The maximum resource of transmitted data amount completes the distribution of resource, so that the system performance in the case of MU is further effectively improved, and
And implementation complexity is lower, has stronger practicability.
With reference to first aspect or the possible implementation of any one of the above of first aspect, in the 4th kind of possible realization
In mode, each UE is successively dispatched according to the sequence of CQI dispatching priority from high to low, and distribute corresponding MU resource for it,
Include:
Each UE ID is successively read from UE queue according to CQI dispatching priority；
One UE ID of every reading, corresponding UE is matched with the UE for being assigned with resource, if successful matching, altogether
Identical resource is enjoyed, until the load thresholding that UE queue is load balancing between empty or local resource occupancy reaches subframe.
Second aspect, a kind of scheduling of resource distribution method, comprising:
When carrying out resource allocation, judgement is currently with the presence or absence of the available resources not occupied by UE；
It determines there is currently when the available resources not occupied by UE, the PF dispatching priority of each UE is determined, according still further to PF
The sequence of dispatching priority from high to low successively dispatches each UE, and distributes corresponding resource for it, wherein for any one
When a UE distribution resource, calculates the UE and use not by the volume of transmitted data of the UE available resources occupied and using the number of MU resource
According to transmission quantity, and the resource allocation for selecting volume of transmitted data big gives the UE.
During resource integral dispensing, system has comprehensively considered all available resources (including MU resource and not any
The available resources that UE is occupied), the selection of resource is carried out from transmission availability angle, i.e., searching from all available resources can
The maximum resource of transmitted data amount completes the distribution of resource, so that the system performance in the case of MU is further effectively improved, and
And implementation complexity is lower, has stronger practicability.
In conjunction with second aspect, in the first possible implementation, according to the sequence of PF dispatching priority from high to low
Each UE is successively dispatched, and distributes corresponding MU resource for it, comprising:
Each UE ID is successively read from UE queue according to PF dispatching priority；
One UE ID of every reading, it is corresponding not by the available resources or MU resource of UE occupancy for UE distribution, until UE queue
Reach the load thresholding of load balancing between subframe for empty or local resource occupancy.
The third aspect, a kind of scheduling of resource distributor, comprising:
Judging unit, for when carrying out resource allocation, judgement to be currently with the presence or absence of the available resources not occupied by UE；
Processing unit, for determine there is currently no not by UE occupy available resources when, according to channel quality to each
UE carries out the sequence of CQI dispatching priority, wherein the CQI dispatching priority highest of the highest UE of channel quality, and according to CQI
The sequence of dispatching priority from high to low successively dispatches each UE, and distributes corresponding multi-user MU resource for it.
In conclusion network side be not assigned by any UE system available resources occupied in the embodiment of the present invention
Afterwards, when distributing MU resource, the sequence of UE is changed, PF priority is no longer based on and carries out UE scheduling, but according to the channel matter of UE
The sequence of amount from high to low is that the UE of unallocated resource re-starts MU resource allocation, in such manner, it is possible to guaranteeing system edges
While energy, the scheduling mode of UE is optimized, enables the higher UE of channel quality in MU preferential
The preferable resource of picking had also given full play to the advantage of MU-MIMO transmission mode to both avoid the waste of system resource, enabled
The MU-MIMO transmission performance of system entirety is optimal.
In conjunction with the third aspect, in the first possible implementation, the processing unit is further used for:
It determines there is currently when the available resources not occupied by UE, the PF dispatching priority of each UE is determined, according still further to PF
The sequence of dispatching priority from high to low successively dispatches each UE, and is the corresponding available resources not occupied by UE of its distribution.
In the first possible implementation in conjunction with the third aspect, in the second possible implementation, the place
Reason unit is further used for:
In resource allocation process, however, it is determined that it has not been assigned by the UE resource occupied and there are still unscheduled UE,
The sequence of CQI dispatching priority then is carried out to each unscheduled UE according to channel quality, wherein the highest UE's of channel quality
CQI dispatching priority highest；
Each unscheduled UE is successively dispatched according to the sequence of CQI dispatching priority from high to low, and corresponding for its distribution
MU resource.
In conjunction with the third aspect, in the third possible implementation, the processing unit is further used for:
It determines there is currently when the available resources not occupied by UE, the PF dispatching priority of each UE is determined, according still further to PF
The sequence of dispatching priority from high to low successively dispatches each UE, and distributes corresponding resource for it, wherein for any one
When a UE distribution resource, calculates the UE and use not by the volume of transmitted data of the UE available resources occupied and using the number of MU resource
According to transmission quantity, and the resource allocation for selecting volume of transmitted data big gives the UE.
During resource integral dispensing, system has comprehensively considered all available resources (including MU resource and not any
The available resources that UE is occupied), the selection of resource is carried out from transmission availability angle, i.e., searching from all available resources can
The maximum resource of transmitted data amount completes the distribution of resource, so that the system performance in the case of MU is further effectively improved, and
And implementation complexity is lower, has stronger practicability.
In conjunction with the possible implementation of any one of the above of the third aspect or the third aspect, in the 4th kind of possible realization
In mode, each UE is successively being dispatched according to the sequence of CQI dispatching priority from high to low, and distribute corresponding MU resource for it
When, the processing unit is specifically used for:
Each UE ID is successively read from UE queue according to CQI dispatching priority；
One UE ID of every reading, corresponding UE is matched with the UE for being assigned with resource, if successful matching, altogether
Identical resource is enjoyed, until the load thresholding that UE queue is load balancing between empty or local resource occupancy reaches subframe.
Fourth aspect, a kind of scheduling of resource distributor, comprising:
Judging unit, for when carrying out resource allocation, judgement to be currently with the presence or absence of the available resources not occupied by UE；
Processing unit, for determining that there is currently the PF scheduling for when available resources not occupied by UE, determining each UE
Priority successively dispatches each UE according still further to the sequence of PF dispatching priority from high to low, and distributes corresponding resource for it,
In, when for any one UE distribution resource, calculates the UE and use not by the volume of transmitted data of the UE available resources occupied
With the resource allocation that uses the volume of transmitted data of MU resource, and select volume of transmitted data big to the UE.
During resource integral dispensing, system has comprehensively considered all available resources (including MU resource and not any
The available resources that UE is occupied), the selection of resource is carried out from transmission availability angle, i.e., searching from all available resources can
The maximum resource of transmitted data amount completes the distribution of resource, so that the system performance in the case of MU is further effectively improved, and
And implementation complexity is lower, has stronger practicability.
In conjunction with fourth aspect, in the first possible implementation, according to PF dispatching priority from high to low suitable
Sequence successively dispatches each UE, and when distributing corresponding MU resource for it, the processing unit is specifically used for:
Each UE ID is successively read from UE queue according to PF dispatching priority；
One UE ID of every reading, it is corresponding not by the available resources or MU resource of UE occupancy for UE distribution, until UE queue
Reach the load thresholding of load balancing between subframe for empty or local resource occupancy.
5th aspect, a kind of scheduling of resource distributor, comprising:
Processor currently whether there is the available resources not occupied by UE for judging when carrying out resource allocation, and
It is determining there is currently no when the available resources not occupied by UE, CQI dispatching priority is carried out to each UE according to channel quality
Sequence, wherein the CQI dispatching priority highest of the highest UE of channel quality, and from high to low according to CQI dispatching priority
Sequence successively dispatches each UE, and distributes corresponding MU resource for it.
In the embodiment of the present invention, network side is distributing after not being assigned by any UE system available resources occupied
When MU resource, the sequence of UE is changed, PF priority is no longer based on and carries out UE scheduling, but from high to low according to the channel quality of UE
Sequence be that the UE of unallocated resource re-starts MU resource allocation, it is right in such manner, it is possible to while guaranteeing system edges performance
The scheduling mode of UE is optimized, and the preferential picking of the higher UE of channel quality in MU is preferably provided
Source had also given full play to the advantage of MU-MIMO transmission mode to both avoid the waste of system resource, enabled the MU- of system entirety
MIMO transmission performance is optimal.
In conjunction with the 5th aspect, in the first possible implementation, the processor is further used for:
It determines there is currently when the available resources not occupied by UE, the PF dispatching priority of each UE is determined, according still further to PF
The sequence of dispatching priority from high to low successively dispatches each UE, and is the corresponding available resources not occupied by UE of its distribution.
In the first possible implementation in conjunction with the 5th aspect, in the second possible implementation, the place
Reason device is further used for:
In resource allocation process, however, it is determined that it has not been assigned by the UE resource occupied and there are still unscheduled UE,
The sequence of CQI dispatching priority then is carried out to each unscheduled UE according to channel quality, wherein the highest UE's of channel quality
CQI dispatching priority highest；
Each unscheduled UE is successively dispatched according to the sequence of CQI dispatching priority from high to low, and corresponding for its distribution
MU resource.
In conjunction with the 5th aspect, in the third possible implementation, the processor is further used for:
It determines there is currently when the available resources not occupied by UE, the PF dispatching priority of each UE is determined, according still further to PF
The sequence of dispatching priority from high to low successively dispatches each UE, and distributes corresponding resource for it, wherein for any one
When a UE distribution resource, calculates the UE and use not by the volume of transmitted data of the UE available resources occupied and using the number of MU resource
According to transmission quantity, and the resource allocation for selecting volume of transmitted data big gives the UE.
During resource integral dispensing, system has comprehensively considered all available resources (including MU resource and not any
The available resources that UE is occupied), the selection of resource is carried out from transmission availability angle, i.e., searching from all available resources can
The maximum resource of transmitted data amount completes the distribution of resource, so that the system performance in the case of MU is further effectively improved, and
And implementation complexity is lower, has stronger practicability.
In conjunction with the possible implementation of any one of the above of the 5th aspect or the 5th aspect, in the 4th kind of possible realization
In mode, each UE is successively being dispatched according to the sequence of CQI dispatching priority from high to low, and distribute corresponding MU resource for it
When, the processor is specifically used for:
Each UE ID is successively read from UE queue according to CQI dispatching priority；
One UE ID of every reading, corresponding UE is matched with the UE for being assigned with resource, if successful matching, altogether
Identical resource is enjoyed, until the load thresholding that UE queue is load balancing between empty or local resource occupancy reaches subframe.
6th aspect, a kind of scheduling of resource distributor, comprising:
Processor, for when carrying out resource allocation, judgement to be currently with the presence or absence of the available resources not occupied by UE, true
Determine the PF dispatching priority of each UE to be determined, according still further to PF tune there is currently when the available resources not occupied by user equipment (UE)
The sequence of degree priority from high to low successively dispatches each UE, and distributes corresponding resource for it, wherein is being directed to any one
When UE distributes resource, calculates the UE and use not by the volume of transmitted data of the UE available resources occupied and using the data of MU resource
Transmission quantity, and the resource allocation for selecting volume of transmitted data big gives the UE.
During resource integral dispensing, system has comprehensively considered all available resources (including MU resource and not any
The available resources that UE is occupied), the selection of resource is carried out from transmission availability angle, i.e., searching from all available resources can
The maximum resource of transmitted data amount completes the distribution of resource, so that the system performance in the case of MU is further effectively improved, and
And implementation complexity is lower, has stronger practicability.
In conjunction with the 6th aspect, in the first possible implementation, according to PF dispatching priority from high to low suitable
Sequence successively dispatches each UE, and when distributing corresponding MU resource for it, the processor is specifically used for:
Each UE ID is successively read from UE queue according to PF dispatching priority；
One UE ID of every reading, it is corresponding not by the available resources or MU resource of UE occupancy for UE distribution, until UE queue
Reach the load thresholding of load balancing between subframe for empty or local resource occupancy.
Detailed description of the invention
Fig. 1 is that scheduling of resource distributes the first flow chart in the embodiment of the present invention；
Fig. 2 is that scheduling of resource distributes second of flow chart in the embodiment of the present invention；
Fig. 3 is that scheduling of resource distributes detail flowchart in the embodiment of the present invention；
Fig. 4-Fig. 7 is network side apparatus kind structural schematic diagram in the embodiment of the present invention.
Specific embodiment
For the MU-MIMO transmission performance of optimization system entirety, in the embodiment of the present invention, to being based on MU-MIMO transmission mould
The Resource Distribution and Schedule process of formula is optimized.Main there are two the optimizations of aspect: a kind of dispatching sequence changing UE；It is another
It kind is when distribute resource, in conjunction with not carried out resource allocation from the aspect of the resource and MU resource two of UE occupancy.
The preferred embodiment of the present invention is described in detail with reference to the accompanying drawing.
As shown in fig.1, network side (e.g., base station) carries out the first stream of scheduling of resource distribution in the embodiment of the present invention
Journey is as follows:
Step 100: when carrying out resource allocation, network side judgement is currently with the presence or absence of the available resources not occupied by UE.
Step 110: network side determine there is currently no not by UE occupy available resources when, according to channel quality to each
UE carries out the sequence of CQI dispatching priority, wherein the CQI dispatching priority highest of the highest UE of channel quality.
In the present embodiment, network side can determine the corresponding channel quality of each UE based on the CQI that each UE is reported, and
The CQI dispatching priority of each UE is determined according to the sequence of channel quality from high to low.
Step 120: network side successively dispatches each UE according to the sequence of CQI dispatching priority from high to low, and is its point
With corresponding MU resource (resource occupied by other UE).
Based on the above embodiment, further, in step 300, exist if network side determines in current system not by UE
The available resources of occupancy can then use but be not limited to following two source scheduling mode:
First way are as follows: when there are the available resources not occupied by UE in determining current system, network side determines each
The PF dispatching priority of a UE is successively dispatched each UE according still further to the sequence of PF dispatching priority from high to low, and is distributed for it
The resource not occupied accordingly by UE；Wherein, the PF dispatching priority of each UE (can be sentenced in execution before step 300
Before disconnected step) it is precalculated, it can also be carried out again when needing and carrying out resource allocation using PF dispatching priority determining
It calculates.
In resource allocation process, if network side determination has not been assigned by the UE resource occupied and there are still unscheduled
UE, then the sequence of CQI dispatching priority is carried out to each unscheduled UE according to channel quality, wherein channel quality is highest
Then the CQI dispatching priority highest of UE is successively dispatched according still further to the sequence of CQI dispatching priority from high to low and each is not adjusted
The UE of degree, and corresponding MU resource is distributed for it.In other words, in this case, network side can be first according to PF dispatching priority
It is UE distribution not by the available resources of UE occupancy, after such resource allocation, according still further to CQI dispatching priority to remaining
UE resequences, and successively distributes MU resource to the UE after rearrangement.
The second way are as follows: when there are the available resources not occupied by UE in determining current system, network side determines each
The PF dispatching priority of a UE is successively dispatched each UE according still further to the sequence of PF dispatching priority from high to low, and is distributed for it
Corresponding resource, wherein during for any one UE distribution resource, network side calculates UE use and do not occupied by UE
Available resources volume of transmitted data and using MU resource volume of transmitted data, and the resource allocation for selecting volume of transmitted data big to
The UE.I.e. under a second technique, network side has been taken into account and has not been provided by the UE available resources occupied and MU in distributing system resource
Source, while the validity and efficiency of transmission of resource are also contemplated, presently most suitable resource is chosen for each UE, therefore,
Although network side is to be scheduled according to PF dispatching priority to UE, each UE can both obtain the available money not occupied by UE
Source, it is also possible to obtain MU resource.
In above-mentioned steps 100- step 120, when network side is that UE (is either distributed and do not occupied by UE when distributing resource
Available resources or MU resource, also either according to PF dispatching priority distribute also according to CQI dispatching priority distribute),
Network side can be successively read UE ID from UE queue, then distinguish corresponding resource for each UE ID of reading, until UE team
It is classified as empty (i.e. all UE scheduling finish) or local resource occupancy reaches the load thresholding of load balancing between subframe and (do not adjust
Whole UE is spent, but without available resources).Wherein, network side for UE distribute MU resource when, can attempt by UE be assigned with
The UE of resource is matched, and placement algorithm can be paired into using some well known algorithms (e.g., matching algorithm based on correlation)
The UE of function shares identical resource and carries out data transmission.
Such as: the correlation of the channel estimation either forming vectors of UE1 and UE2 is calculated, and judges whether correlation is small
In setting thresholding, if so, otherwise successful matching is matched unsuccessful.
Certainly, in practical applications, the above-mentioned second way also can be used alone, referring particularly to shown in Fig. 2, the present invention
In embodiment, second of process that network side (e.g., base station) carries out scheduling of resource distribution is as follows:
Step 200: when carrying out resource allocation, network side judgement is currently with the presence or absence of the available resources not occupied by UE.
Step 210: network side determines excellent there is currently when the available resources not occupied by UE, determining that the PF of each UE is dispatched
First grade successively dispatches each UE according still further to the sequence of PF dispatching priority from high to low, and distributes corresponding resource for it,
In, for any one UE distribution resource when, calculate the UE using not by UE occupy available resources volume of transmitted data and
Using the volume of transmitted data of MU resource, and the resource allocation for selecting volume of transmitted data big gives the UE.
Specifically, successively dispatching each UE according to the sequence of PF dispatching priority from high to low, and it is corresponding for its distribution
MU resource when, preferably, network side is successively read each UE ID, every reading according to PF dispatching priority from UE queue
One UE ID, network side is just that UE distribution is corresponding (not to be needed by the UE available resources occupied or MU resource when distribution MU resource
Matched with the UE for having distributed resource), the load balancing between UE queue reaches subframe for empty or local resource occupancy
Load thresholding.
Further description is made to above-described embodiment below with reference to specific application scenarios.
As shown in fig.3, network side (e.g., base station) carries out the detailed process of scheduling of resource distribution in the embodiment of the present invention
It is as follows:
Step 300: network side carries out priority ranking to each UE according to PF algorithm, determines that the PF scheduling of resource allocation is excellent
First grade sequence.
In the present embodiment, be introduced for carrying out PF sequence in advance, can also it is subsequent need using when carry out again
PF sequence, details are not described herein.
Step 301: network side judgement not whether there is by any UE available resources occupied, if so, carrying out step
302, otherwise, carry out step 305.
Step 302: network side reads the highest UE ID of current priority from the UE queue based on PF dispatching priority,
And resource allocation is carried out for the corresponding UE of the UE ID.
By taking UE1 as an example, when for UE1 be distribution resource when, network side can only not by UE occupy available resources in select
It takes, the volume of transmitted data when available resources not by UE occupancy can also be used with reference to UE1 and (has been accounted for by UE using MU resource
Resource) when volume of transmitted data, choose the big resource of volume of transmitted data and be allocated.
Every sub-distribution resource finishes, and network side needs delete the UE ID for the UE for having obtained resource from UE queue.
Does step 303: network side judge that the UE queue based on PF dispatching priority is empty? if so, carrying out step
309；Otherwise, step 304 is carried out.
Does step 304: network side judge whether the load thresholding of load balancing between local resource occupancy reaches subframe? if
It is then to carry out step 309；Otherwise, return step 302.
Step 305: network side is based on channel quality and carries out the sequence of CQI dispatching priority to each UE.
Step 306: network side reads the highest UE ID of current priority from the UE queue based on CQI dispatching priority,
And resource allocation is carried out for the corresponding UE of the UE ID.
Still by taking UE1 as an example, when being distribution resource for UE1, network side matches UE1 with other UE for having distributed resource
To trial, and enables UE1 and the UE of successful matching share identical resource and carry out data transmission.
Every sub-distribution resource finishes, and network side needs delete the UE ID for the UE for having obtained resource from UE queue.
Does step 307: network side judge that the UE queue based on CQI priority is empty? if so, carrying out step 309；It is no
Then, step 308 is carried out.
Does step 308: network side judge the load thresholding of load balancing between local resource occupancy reaches subframe? if
It is then to carry out step 309；Otherwise, return step 306.
Step 309: network side ending resource allocation flow.
Based on the above embodiment, as shown in fig.4, in the embodiment of the present invention, network side apparatus includes 40 He of judging unit
Processing unit 41, wherein
Judging unit 40, for when carrying out resource allocation, judgement to be currently with the presence or absence of the available resources not occupied by UE；
Processing unit 41, for determine there is currently no not by UE occupy available resources when, according to channel quality to each
A UE carries out the sequence of channel quality indicator (CQI) dispatching priority, wherein the CQI dispatching priority of the highest UE of channel quality is most
Height, and each UE is successively dispatched according to the sequence of CQI dispatching priority from high to low, and distribute corresponding MU resource for it.
Processing unit 41 is further used for:
It determines there is currently when the available resources not occupied by UE, the PF dispatching priority of each UE is determined, according still further to PF
The sequence of dispatching priority from high to low successively dispatches each UE, and is the corresponding available resources not occupied by UE of its distribution.
Processing unit 41 is further used for:
In resource allocation process, however, it is determined that it has not been assigned by the UE resource occupied and there are still unscheduled UE,
The sequence of CQI dispatching priority then is carried out to each unscheduled UE according to channel quality, wherein the highest UE's of channel quality
CQI dispatching priority highest；
Each unscheduled UE is successively dispatched according to the sequence of CQI dispatching priority from high to low, and corresponding for its distribution
MU resource.
Processing unit 41 is further used for:
It determines there is currently when the available resources not occupied by UE, the PF dispatching priority of each UE is determined, according still further to PF
The sequence of dispatching priority from high to low successively dispatches each UE, and distributes corresponding resource for it, wherein for any one
When a UE distribution resource, calculates the UE and use not by the volume of transmitted data of the UE available resources occupied and using the data of MU resource
Transmission quantity, and the resource allocation for selecting volume of transmitted data big gives the UE.
Each UE is successively being dispatched according to the sequence of CQI dispatching priority from high to low, and is distributing corresponding MU money for it
When source, processing unit 41 is specifically used for:
Each UE ID is successively read from UE queue according to CQI dispatching priority；
One UE ID of every reading, corresponding UE is matched with the UE for being assigned with resource, if successful matching, altogether
Identical resource is enjoyed, until the load thresholding that UE queue is load balancing between empty or local resource occupancy reaches subframe.
As shown in fig.5, network side apparatus includes judging unit 50 and processing unit 51 in the embodiment of the present invention, wherein
Judging unit 50, for when carrying out resource allocation, judgement to be currently with the presence or absence of the available resources not occupied by UE；
Processing unit 51 determines the PF tune of each UE for determining there is currently when the available resources not occupied by UE
Priority is spent, successively dispatches each UE according still further to the sequence of PF dispatching priority from high to low, and distribute corresponding resource for it,
Wherein, it when for any one UE distribution resource, calculates the UE and uses not by the volume of transmitted data of the UE available resources occupied
With the resource allocation that uses the volume of transmitted data of MU resource, and select volume of transmitted data big to the UE.
Each UE is successively being dispatched according to the sequence of PF dispatching priority from high to low, and is distributing corresponding MU resource for it
When, processing unit 51 is specifically used for:
Each UE ID is successively read from UE queue according to PF dispatching priority；
One UE ID of every reading, it is corresponding not by the available resources or MU resource of UE occupancy for UE distribution, until UE queue
Reach the load thresholding of load balancing between subframe for empty or local resource occupancy.
As shown in fig.6, network side apparatus includes processor 60 in the embodiment of the present invention, wherein
Processor 60 currently whether there is the available resources not occupied by UE for judging when carrying out resource allocation, with
And determining there is currently no when the available resources not occupied by UE, CQI dispatching priority is carried out to each UE according to channel quality
Grade sequence, wherein the CQI dispatching priority highest of the highest UE of channel quality, and from high to low according to CQI dispatching priority
Sequence successively dispatch each UE, and be that it distributes corresponding multi-user MU resource.
Processor 60 is further used for:
It determines there is currently when the available resources not occupied by UE, the PF dispatching priority of each UE is determined, according still further to PF
The sequence of dispatching priority from high to low successively dispatches each UE, and is the corresponding available resources not occupied by UE of its distribution.
Processor 60 is further used for:
In resource allocation process, however, it is determined that it has not been assigned by the UE resource occupied and there are still unscheduled UE,
The sequence of CQI dispatching priority then is carried out to each unscheduled UE according to channel quality, wherein the highest UE's of channel quality
CQI dispatching priority highest；
Each unscheduled UE is successively dispatched according to the sequence of CQI dispatching priority from high to low, and corresponding for its distribution
MU resource.
Processor 60 is further used for:
It determines there is currently when the available resources not occupied by UE, the PF dispatching priority of each UE is determined, according still further to PF
The sequence of dispatching priority from high to low successively dispatches each UE, and distributes corresponding resource for it, wherein for any one
When a UE distribution resource, calculates the UE and use not by the volume of transmitted data of the UE available resources occupied and using the data of MU resource
Transmission quantity, and the resource allocation for selecting volume of transmitted data big gives the UE.
Each UE is successively being dispatched according to the sequence of CQI dispatching priority from high to low, and is distributing corresponding MU money for it
When source, processor 60 is specifically used for:
Each UE ID is successively read from UE queue according to CQI dispatching priority；
One UE ID of every reading, corresponding UE is matched with the UE for being assigned with resource, if successful matching, altogether
Identical resource is enjoyed, until the load thresholding that UE queue is load balancing between empty or local resource occupancy reaches subframe.
As shown in fig.7, network side apparatus includes processor 70 in the embodiment of the present invention, wherein
Processor 70 currently whether there is the available resources not occupied by UE for judging when carrying out resource allocation,
It determines there is currently when the available resources not occupied by UE, the ratio justice PF dispatching priority of each UE is determined, according still further to PF
The sequence of dispatching priority from high to low successively dispatches each UE, and distributes corresponding resource for it, wherein for any one
When a UE distribution resource, calculates the UE and use not by the volume of transmitted data of the UE available resources occupied and using the data of MU resource
Transmission quantity, and the resource allocation for selecting volume of transmitted data big gives the UE.
Each UE is successively being dispatched according to the sequence of PF dispatching priority from high to low, and is distributing corresponding MU resource for it
When, processor 70 is specifically used for:
Each UE ID is successively read from UE queue according to PF dispatching priority；
One UE ID of every reading, it is corresponding not by the available resources or MU resource of UE occupancy for UE distribution, until UE queue
Reach the load thresholding of load balancing between subframe for empty or local resource occupancy.
In conclusion network side be not assigned by any UE system available resources occupied in the embodiment of the present invention
Afterwards, when distributing MU resource, the sequence of UE is changed, PF priority is no longer based on and carries out UE scheduling, but according to the channel matter of UE
The sequence of amount from high to low is that the UE of unallocated resource re-starts MU resource allocation, in such manner, it is possible to guaranteeing system edges
While energy, the scheduling mode of UE is optimized, enables the higher UE of channel quality in MU preferential
The preferable resource of picking had also given full play to the advantage of MU-MIMO transmission mode to both avoid the waste of system resource, enabled
The MU-MIMO transmission performance of system entirety is optimal.
On the other hand, during resource integral dispensing, system comprehensively considered all available resources (including MU resource and
The available resources not occupied by any UE), the selection of resource is carried out from transmission availability angle, i.e., from all available resources
The distribution for capableing of the maximum resource completion resource of transmitted data amount is searched, to further effectively improve the system in the case of MU
Performance, and implementation complexity is lower, has stronger practicability.
It should be understood by those skilled in the art that, the embodiment of the present invention can provide as method, system or computer program
Product.Therefore, complete hardware embodiment, complete software embodiment or reality combining software and hardware aspects can be used in the present invention
Apply the form of example.Moreover, it wherein includes the computer of computer usable program code that the present invention, which can be used in one or more,
The computer program implemented in usable storage medium (including but not limited to magnetic disk storage, CD-ROM, optical memory etc.) produces
The form of product.
The present invention be referring to according to the method for the embodiment of the present invention, the process of equipment (system) and computer program product
Figure and/or block diagram describe.It should be understood that every one stream in flowchart and/or the block diagram can be realized by computer program instructions
The combination of process and/or box in journey and/or box and flowchart and/or the block diagram.It can provide these computer programs
Instruct the processor of general purpose computer, special purpose computer, Embedded Processor or other programmable data processing devices to produce
A raw machine, so that being generated by the instruction that computer or the processor of other programmable data processing devices execute for real
The device for the function of being specified in present one or more flows of the flowchart and/or one or more blocks of the block diagram.
These computer program instructions, which may also be stored in, is able to guide computer or other programmable data processing devices with spy
Determine in the computer-readable memory that mode works, so that it includes referring to that instruction stored in the computer readable memory, which generates,
Enable the manufacture of device, the command device realize in one box of one or more flows of the flowchart and/or block diagram or
The function of being specified in multiple boxes.
These computer program instructions also can be loaded onto a computer or other programmable data processing device, so that counting
Series of operation steps are executed on calculation machine or other programmable devices to generate computer implemented processing, thus in computer or
The instruction executed on other programmable devices is provided for realizing in one or more flows of the flowchart and/or block diagram one
The step of function of being specified in a box or multiple boxes.
Although preferred embodiments of the present invention have been described, it is created once a person skilled in the art knows basic
Property concept, then additional changes and modifications may be made to these embodiments.So it includes excellent that the following claims are intended to be interpreted as
It selects embodiment and falls into all change and modification of the scope of the invention.
Obviously, those skilled in the art can carry out various modification and variations without departing from this hair to the embodiment of the present invention
The spirit and scope of bright embodiment.In this way, if these modifications and variations of the embodiment of the present invention belong to the claims in the present invention
And its within the scope of equivalent technologies, then the present invention is also intended to include these modifications and variations.
Claims (12)
1. a kind of scheduling of resource distribution method characterized by comprising
When carrying out resource allocation, judgement is currently with the presence or absence of the available resources not occupied by user equipment (UE)；Wherein, work as presence
When the available resources not used by UE, the available resources are allocated according to the PF dispatching priority of each UE；
It determines there is currently no when the available resources not occupied by UE, channel quality instruction is carried out to each UE according to channel quality
CQI dispatching priority sequence, wherein the CQI dispatching priority highest of the highest UE of channel quality；
Each UE is successively dispatched according to the sequence of CQI dispatching priority from high to low, and distributes corresponding multi-user MU money for it
Source.
2. the method as described in claim 1, which is characterized in that further comprise:
It determines there is currently when the available resources not occupied by UE, determines the ratio justice PF dispatching priority of each UE, then press
Each UE is successively dispatched according to the sequence of PF dispatching priority from high to low, and is the corresponding available money not occupied by UE of its distribution
Source.
3. method according to claim 2, which is characterized in that further comprise:
In resource allocation process, however, it is determined that be not assigned and by the UE resource occupied there are still unscheduled UE, then pressed
The sequence of CQI dispatching priority is carried out to each unscheduled UE according to channel quality, wherein the CQI tune of the highest UE of channel quality
Spend highest priority；
Each unscheduled UE is successively dispatched according to the sequence of CQI dispatching priority from high to low, and distributes corresponding MU for it
Resource.
4. the method as described in claim 1, which is characterized in that further comprise:
It determines there is currently when the available resources not occupied by UE, determines the PF dispatching priority of each UE, dispatched according still further to PF
The sequence of priority from high to low successively dispatches each UE, and distributes corresponding resource for it, wherein is being directed to any one UE
When distributing resource, calculates the UE and passed using not by the volume of transmitted data of the UE available resources occupied and using the data of MU resource
Throughput rate, and the resource allocation for selecting volume of transmitted data big gives the UE.
5. method according to any of claims 1-4, which is characterized in that according to CQI dispatching priority from high to low suitable
Sequence successively dispatches each UE, and distributes corresponding MU resource for it, comprising:
Each UE ID is successively read from UE queue according to CQI dispatching priority；
One UE ID of every reading, corresponding UE is matched with the UE for being assigned with resource, if successful matching, shares phase
Same resource, until the load thresholding that UE queue is load balancing between empty or local resource occupancy reaches subframe.
6. a kind of scheduling of resource distribution method characterized by comprising
When carrying out resource allocation, judgement is currently with the presence or absence of the available resources not occupied by user equipment (UE)；
It determines there is currently when the available resources not occupied by UE, determines the ratio justice PF dispatching priority of each UE, then press
Each UE ID, and one UE ID of every reading are successively read from UE queue according to PF dispatching priority, it is corresponding for UE distribution
The available resources or MU resource not occupied by UE, until UE queue is to load between empty or local resource occupancy reaches subframe
The load thresholding of weighing apparatus；Wherein, it when for any one UE distribution resource, calculates the UE and uses the available money not occupied by UE
The volume of transmitted data in source and the volume of transmitted data for using MU resource, and the resource allocation for selecting volume of transmitted data big gives the UE,
The available resources are allocated according to the PF dispatching priority of each UE.
7. a kind of scheduling of resource distributor characterized by comprising
Judging unit, for when carrying out resource allocation, judgement to be currently with the presence or absence of the available money not occupied by user equipment (UE)
Source；Wherein, the available resources are allocated according to the PF dispatching priority of each UE；
Processing unit, for determine there is currently no not by UE occupy available resources when, according to channel quality to each UE into
The sequence of row channel quality indicator (CQI) dispatching priority, wherein the CQI dispatching priority highest of the highest UE of channel quality, and
Each UE is successively dispatched according to the sequence of CQI dispatching priority from high to low, and distributes corresponding multi-user MU resource for it.
8. device as claimed in claim 7, which is characterized in that the processing unit is further used for:
It determines there is currently when the available resources not occupied by UE, determines the ratio justice PF dispatching priority of each UE, then press
Each UE is successively dispatched according to the sequence of PF dispatching priority from high to low, and is the corresponding available money not occupied by UE of its distribution
Source.
9. device as claimed in claim 8, which is characterized in that the processing unit is further used for:
In resource allocation process, however, it is determined that be not assigned and by the UE resource occupied there are still unscheduled UE, then pressed
The sequence of CQI dispatching priority is carried out to each unscheduled UE according to channel quality, wherein the CQI tune of the highest UE of channel quality
Spend highest priority；
Each unscheduled UE is successively dispatched according to the sequence of CQI dispatching priority from high to low, and distributes corresponding MU for it
Resource.
10. device as claimed in claim 7, which is characterized in that the processing unit is further used for:
It determines there is currently when the available resources not occupied by UE, determines the PF dispatching priority of each UE, dispatched according still further to PF
The sequence of priority from high to low successively dispatches each UE, and distributes corresponding resource for it, wherein is being directed to any one UE
When distributing resource, calculates the UE and passed using not by the volume of transmitted data of the UE available resources occupied and using the data of MU resource
Throughput rate, and the resource allocation for selecting volume of transmitted data big gives the UE.
11. such as the described in any item devices of claim 7-10, which is characterized in that according to CQI dispatching priority from high to low
Sequence successively dispatch each UE, and when distributing corresponding MU resource for it, the processing unit is specifically used for:
Each UE ID is successively read from UE queue according to CQI dispatching priority；
One UE ID of every reading, corresponding UE is matched with the UE for being assigned with resource, if successful matching, shares phase
Same resource, until the load thresholding that UE queue is load balancing between empty or local resource occupancy reaches subframe.
12. a kind of scheduling of resource distributor characterized by comprising
Judging unit, for when carrying out resource allocation, judgement to be currently with the presence or absence of the available money not occupied by user equipment (UE)
Source；
Processing unit determines the ratio justice PF of each UE for determining there is currently when the available resources not occupied by UE
Dispatching priority is successively read each UE ID, and one UE ID of every reading according still further to PF dispatching priority from UE queue,
It is corresponding not by the available resources or MU resource of UE occupancy for UE distribution, until UE queue is that empty or local resource occupancy reaches
To the load thresholding of load balancing between subframe；Wherein, when for any one UE distribution resource, calculate the UE using not by
The volume of transmitted data for the available resources that UE is occupied and the volume of transmitted data for using MU resource, and the resource for selecting volume of transmitted data big
The UE is distributed to, the available resources are allocated according to the PF dispatching priority of each UE.
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 CN104936233A (en) | 2015-09-23 |
| CN104936233B true 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) |
Families Citing this family (8)
| 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 |
| WO2017124323A1 (en) * | 2016-01-20 | 2017-07-27 | 华为技术有限公司 | Resource allocation method, base station and channel quality grading device |
| CN106535339A (en) * | 2016-11-17 | 2017-03-22 | 南京邮电大学 | Multi-hop channel allocation method based on CS-DCA algorithm |
| CN107294571B (en) * | 2017-06-26 | 2020-11-13 | 维沃移动通信有限公司 | Data transmission method, base station and mobile terminal |
| CN107942310B (en) * | 2017-10-25 | 2019-12-03 | 中国人民解放军信息工程大学 | The resource joint optimization method of distributed MIMO radar system multiple target location estimation |
| WO2019127086A1 (en) * | 2017-12-27 | 2019-07-04 | 华为技术有限公司 | Scheduling method, apparatus and system |
| US11943667B2 (en) | 2018-12-13 | 2024-03-26 | Telefonaktiebolaget Lm Ericsson (Publ) | Method and base station for multi-user multiple input multiple output |
| CN110290590B (en) * | 2019-06-03 | 2022-03-25 | 西安电子科技大学 | Distribution method of LTE system MAC layer resource block with improved weight |
Citations (3)
| 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 |
| CN102237903A (en) * | 2010-05-06 | 2011-11-09 | 中兴通讯股份有限公司 | Data transmission method and device for MIMO (multi-input multi-output) system |
Family Cites Families (2)
| 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 |
| KR101585697B1 (en) * | 2010-02-04 | 2016-01-25 | 삼성전자주식회사 | Method and apparatus for pre-scheduling in closed-loop mu-mimo system |
-
2014
- 2014-03-19 CN CN201410103051.7A patent/CN104936233B/en active Active
-
2015
- 2015-03-19 WO PCT/CN2015/074596 patent/WO2015139651A1/en active Application Filing
Patent Citations (3)
| 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 |
| 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104936233A (en) | 2015-09-23 |
| WO2015139651A1 (en) | 2015-09-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104936233B (en) | A kind of scheduling of resource distribution method and device | |
| JP4406446B2 (en) | Subchannel allocation apparatus and subchannel allocation method | |
| CN106685494B (en) | Packet scheduling method and device in MU-MIMO system | |
| CN102098737B (en) | Cell priority level based cooperation scheduling method and system | |
| CN105721123B (en) | A kind of user pairing and power distribution method and device | |
| JP5222746B2 (en) | UL radio resource allocation method, apparatus, and base station | |
| CN103999513B (en) | Up-link power control for MU MIMO | |
| CN104602352B (en) | For the improved method and device of the cooperative scheduling transmission in wireless network | |
| CN101127752A (en) | Method for channel estimation with spatial division multiplexing in an orthogonal frequency division multiplexing system | |
| CN103415081B (en) | A kind of resource regulating method and base station | |
| CN101218775A (en) | Multi-user access system MIMO-OFDM resource distributing method | |
| CN101346902A (en) | Method for selection of an optimized number of subscribers in mobile radio systems | |
| CN103906253B (en) | A kind of user scheduling method, apparatus and system | |
| CN102595385A (en) | Downlink transmission method and device | |
| CN108370569A (en) | The communication resource distribution of telecommunication network | |
| JP2009171535A (en) | Scheduling method for multi-user mimo | |
| CN101989874B (en) | Multi-user, multi-input and multi-output pairing method and device | |
| CN102196582A (en) | Method and sending terminal for dispatching downlink resource of multi-input multi-output beam-forming system | |
| US20090002235A1 (en) | Radio Communication System, Transmission Apparatus, Transmission Method, Program and Recording Medium | |
| CN110445518B (en) | Pilot frequency distribution method based on micro cell clustering under large-scale MIMO heterogeneous network system | |
| CN102300326A (en) | Scheduling method of multi-user multi-input multi-output (MIMO) communication system and base station | |
| JP4846000B2 (en) | User selection device for mobile communication system | |
| JP5033901B2 (en) | Apparatus and method for assigning a plurality of subchannels to a plurality of terminals | |
| CN106209191B (en) | A kind of MU-MIMO system true environment low complex degree user choosing method | |
| CN104022809B (en) | A kind of MU MIMO wave beam formings originator disturbance restraining method and device |
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 |
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 |
|
| CP01 | Change in the name or title of a patent holder | ||
| 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 |
|
| TR01 | Transfer of patent right |