CN113286373B - Uplink multi-user-multi-input multi-output scheduling method and device - Google Patents
Uplink multi-user-multi-input multi-output scheduling method and device Download PDFInfo
- Publication number
- CN113286373B CN113286373B CN202010105832.5A CN202010105832A CN113286373B CN 113286373 B CN113286373 B CN 113286373B CN 202010105832 A CN202010105832 A CN 202010105832A CN 113286373 B CN113286373 B CN 113286373B
- Authority
- CN
- China
- Prior art keywords
- users
- user
- resource
- paired
- resource blocks
- 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
Images
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/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
- H04W72/569—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient of the traffic information
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/20—Control channels or signalling for resource management
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
- H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
- H04B7/0413—MIMO systems
- H04B7/0452—Multi-user MIMO systems
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0446—Resources in time domain, e.g. slots or frames
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The embodiment of the invention provides an uplink multi-user-multi-input multi-output scheduling method and device. The method comprises the following steps: acquiring a plurality of users scheduled by a target uplink subframe, wherein the target uplink subframe is a subframe scheduled this time; determining paired users and non-paired users in the multiple users, allocating resource blocks for the paired users in a first resource set and a second resource set, and allocating resource blocks for the non-paired users in the first resource set; the first resource set comprises resource blocks under the maximum bandwidth supported by the current network, and the second resource set comprises the resource blocks supporting space division multiplexing in the first resource set; the paired users are two users with orthogonal spatial channels, and the non-paired users do not have users with orthogonal spatial channels. Therefore, the scheme of the invention can solve the problem that the MUMIMO function can not be realized when the hardware resource of the baseband processing is insufficient and can not meet the requirement of full-bandwidth double-current processing in the prior art.
Description
Technical Field
The present invention relates to the field of mobile communications technologies, and in particular, to a method and an apparatus for uplink multi-user-mimo scheduling.
Background
At present, LTE (Long Term Evolution) and a subsequent system of LTE (also referred to as LTE-a network) adopt an advanced MIMO (Multiple-Input Multiple-Output) key technology to improve system capacity. Because of the irrelevance of spatial channels, a plurality of paths with independent fading exist, and a plurality of parallel channels are generated, so that the spatial dimension can be fully utilized to improve the data transmission rate by utilizing the MIMO technology.
For the uplink of the LTE system, the UE side only supports single-antenna transmission, and data streams transmitted by different UEs multiplex the same time-frequency domain resource for data transmission, which is a virtual MIMO from the receiving end of the base station, also called uplink MUMIMO (Multi-User Multiple-Input Multiple-Output). Uplink MUMIMO can significantly increase the uplink transmission rate of the network, for example, the uplink transmission rate can be doubled at most in case of full bandwidth scheduling MUMIMO.
In the current implementation, it is assumed that no MUMIMO pairing is performed between UEs, m users scheduled per TTI (subframe) are selected according to scheduling priority, and the required RB (resource block) and TBsize (transport block size) are estimated for each UE. And then selecting the pairing relation between the UE and allocating the RB according to the channel correlation between the UE, wherein the scheduling algorithm does not consider the demodulation capability, so the RB allocation principle is that the RB number and the RB position of the paired UE are required to be the same.
However, although the uplink MUMIMO can significantly improve the uplink transmission rate of the network, it also brings the requirement of baseband processing resources and efficiency improvement on the base station side, which is a challenge for the hardware platform of baseband processing. For example, the uplink transmission rate is doubled, the number of RB resources for baseband processing is doubled, and the resources required for baseband processing are several times more than the original resources due to the introduction of multi-user detection, joint reception, and MIMO user peer-to-peer processing.
Thus, in order to maximize the gain as much as possible, the resources required for the MUMIMO processing are evaluated with respect to the processing resources in the full bandwidth dual stream case. In case of sufficient hardware resources for baseband processing, the MUMIMO function is enabled for all reason; and when the hardware resource shortage of the baseband processing can not meet the requirement of full-bandwidth double-flow processing, the MUMIMO function can not be directly selected to be enabled. If the current base station hardware resources support the processing of 150 RBs per cell, the requirement of the MUMIMO function at the bandwidth of 15M can be met, but the requirement of the MUMIMO function at the bandwidth of 20M cannot be met, and the MUMIMO function cannot be enabled at the bandwidth of 20M.
Therefore, in the prior art, when the hardware resource shortage of the baseband processing cannot meet the requirement of full-bandwidth dual-stream processing, the MUMIMO function cannot be realized.
Disclosure of Invention
The embodiment of the invention provides an uplink multi-user-multi-input multi-output scheduling method and device, aiming at solving the problem that the MUMIMO function cannot be realized when the hardware resources of baseband processing are insufficient and the requirement of full-bandwidth double-flow processing cannot be met in the prior art.
In one aspect, an embodiment of the present invention provides an uplink multiuser-mimo scheduling method, where the method includes:
acquiring a plurality of users scheduled by a target uplink subframe, wherein the target uplink subframe is a subframe scheduled this time;
determining paired users and non-paired users in the plurality of users, allocating resource blocks for the paired users in a first resource set and a second resource set, and allocating resource blocks for the non-paired users in the first resource set;
the first resource set comprises resource blocks under the maximum bandwidth supported by the current network, and the second resource set comprises the resource blocks which support space division multiplexing in the first resource set; the paired users are two users with orthogonal spatial channels, and the non-paired users do not have users with orthogonal spatial channels.
On the other hand, an embodiment of the present invention further provides a scheduling apparatus, which is applied to a base station, and the apparatus includes:
the system comprises a user acquisition module, a scheduling module and a scheduling module, wherein the user acquisition module is used for acquiring a plurality of users scheduled by a target uplink subframe, and the target uplink subframe is a subframe scheduled this time;
a resource block allocation module, configured to determine paired users and non-paired users in the multiple users, allocate resource blocks to the paired users in a first resource set and a second resource set, and allocate resource blocks to the non-paired users in the first resource set;
the first resource set comprises resource blocks under the maximum bandwidth supported by the current network, and the second resource set comprises the resource blocks supporting space division multiplexing in the first resource set; the paired users are two users with orthogonal spatial channels, and the non-paired users do not have users with orthogonal spatial channels.
In still another aspect, an embodiment of the present invention further provides an electronic device, which includes a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor implements the steps in the uplink multi-user-multiple-input multiple-output scheduling method as described above when executing the computer program.
In still another aspect, an embodiment of the present invention further provides a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the steps in the uplink multi-user-multiple-input multiple-output scheduling method described above are implemented.
In the embodiment of the present invention, a plurality of users scheduled by a target uplink subframe are obtained, and users whose spatial channels are orthogonal to each other (i.e., paired users) and users whose spatial channels are not orthogonal to the spatial channels (i.e., non-paired users) among the users are determined, so that in a first resource set composed of resource blocks under the maximum bandwidth supported by the current network and a second resource set composed of resource blocks supporting spatial multiplexing in the first resource set, resource blocks are allocated for the paired users, and in the first resource set, resource blocks are allocated for the non-paired users, where the second resource set is a set of resource blocks supporting spatial multiplexing in the first resource set, that is, the second resource set is a subset of the first resource set in the frequency domain, and thus if there are resource blocks assigned to users with the same number in the end, it is indicated that there are multiple users and multiple outputs, and if there are no resource blocks with the same number, it is indicated that there is a single data stream on the target subframe.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the description of the embodiments of the present invention will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to these drawings without inventive labor.
Fig. 1 is a flowchart illustrating steps of an uplink multiuser-mimo scheduling method according to an embodiment of the present invention;
fig. 2 is a flowchart of an embodiment of an uplink multiuser-mimo scheduling method according to the present invention;
fig. 3 is a block diagram of an uplink multiuser-mimo scheduling apparatus according to an embodiment of the present invention;
fig. 4 is a block diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
It should be appreciated that reference throughout this specification to "one embodiment" or "an embodiment" means that a particular feature, structure or characteristic described in connection with the embodiment is included in at least one embodiment of the present invention. Thus, the appearances of the phrases "in one embodiment" or "in an embodiment" in various places throughout this specification are not necessarily all referring to the same embodiment. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.
In various embodiments of the present invention, it should be understood that the sequence numbers of the following processes do not mean the execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation to the implementation process of the embodiments of the present invention.
In the embodiments provided herein, it should be understood that "B corresponding to a" means that B is associated with a from which B can be determined. It should also be understood that determining B from a does not mean determining B from a alone, but may be determined from a and/or other information.
Fig. 1 is a flowchart illustrating a method for scheduling uplink multiuser-mimo according to an embodiment of the present invention.
As shown in fig. 1, an embodiment of the present invention provides an uplink multiuser-mimo scheduling method, where the method includes:
step 101: and acquiring a plurality of users scheduled by the target uplink subframe.
When the uplink scheduling is carried out, the scheduling is carried out according to the subframes one by one. The target uplink subframe in the embodiment of the invention is a subframe scheduled this time, namely a subframe to be scheduled currently.
In addition, if the number of users scheduled by each subframe is known, some users with higher scheduling priority may be preferentially selected, and thus, optionally, the obtaining of multiple users scheduled by the target uplink subframe includes:
and sequencing the schedulable users of the target uplink subframe according to the priority of the users, and acquiring a preset number of users before the sequencing as a plurality of users scheduled by the target uplink subframe.
Therefore, in the embodiment of the present invention, the user with higher priority is scheduled preferentially, and the service of the user with higher priority can be preferentially executed.
Step 102: and determining paired users and non-paired users in the plurality of users, allocating resource blocks for the paired users in a first resource set and a second resource set, and allocating resource blocks for the non-paired users in the first resource set.
The first resource set comprises resource blocks under the maximum bandwidth supported by the current network, and the second resource set comprises the resource blocks supporting space division multiplexing in the first resource set; that is, the second resource set is a subset of the first resource set in the frequency domain, the paired users are two users with orthogonal spatial channels, and the non-paired users have no user with orthogonal spatial channels.
As can be seen from the foregoing, in the embodiments of the present invention, multiple users scheduled by a target uplink sub-frame can be obtained, and a user whose spatial channels are orthogonal to each other (i.e. paired user) and a user whose spatial channel is not orthogonal to the user (i.e. non-paired user) among the users are determined, so that in a first resource set composed of resource blocks under the maximum bandwidth supported by a current network and a second resource set composed of resource blocks supporting spatial multiplexing in the first resource set, a resource block is allocated to a paired user, and a resource block is allocated to a non-paired user only in the first resource set, where, the second resource set is a set of resource blocks supporting space division multiplexing in the first resource set, that is, the second resource set is a subset of the first resource set in the frequency domain, so that if the resource blocks with the same number exist in the resource blocks finally distributed to the users, it indicates that there are multiple users multiple inputs and multiple outputs, and if there are no resource blocks with the same number, it indicates that the target subframe is a single data stream.
Optionally, the determining paired users and non-paired users in the multiple users, and allocating resource blocks to the paired users in a first resource set and a second resource set, and allocating resource blocks to the non-paired users in the first resource set, includes:
pre-estimating the number of resource blocks required by each user;
and determining paired users and non-paired users in the plurality of users, allocating resource blocks for the paired users in a first resource set and a second resource set according to the estimated number of the resource blocks required by each user, and allocating resource blocks for the non-paired users in the first resource set.
The number of resource blocks and the size of code blocks can be estimated according to the Buffer Status (BSR) of each user, QCI (QoS Class Identifier, qoS scale value) parameters, channel conditions, and other factors.
In the embodiment of the invention, the number of the resource blocks required by each of a plurality of users to be scheduled by the target sub-frame is estimated in advance, and then the resource blocks are distributed to each user according to the estimation result, so that the distribution result of the resource blocks can better meet the requirements of each user.
Optionally, the determining paired users and non-paired users in the multiple users, and allocating resource blocks to the paired users in a first resource set and a second resource set according to the estimated number of resource blocks required by each user, and allocating resource blocks to the non-paired users in the first resource set, includes:
according to the priority order of the users, searching users matched with a first user from among the users which are not allocated with resource blocks, wherein the first user is one of the users;
under the condition that a second user is searched, distributing resource blocks for the paired users in the first resource set and the second resource set according to the estimated first number of the resource blocks required by the first user and the estimated second number of the resource blocks required by the second user; the second user is a searched first user paired with the first user;
in the case that the number of remaining resource blocks in the first resource set is smaller than the larger of the first number and the second number, or the number of remaining resource blocks in the second resource set is smaller than the smaller of the first number and the second number, re-searching users paired with the first user among users to which resource blocks are not allocated among the users according to the priority order of the users;
and when the number of the remaining resource blocks in the first resource set is smaller than the larger of the first number and the third number, or the number of the remaining resource blocks in the second resource set is smaller than the smaller of the first number and the third number, or a user paired with the first user is not searched, the first user is failed to pair, and then the resource blocks are allocated to the first user in the first resource set, wherein the third number is the estimated number of the resource blocks required by the third user, and the third user is the last searched user paired with the first user.
In the embodiment of the invention, when the resource blocks are distributed to a plurality of users to be scheduled by the target sub-frame, the resource blocks are distributed one by one according to the priority order of the users. For example, the user to be scheduled by the target sub-frame includes four users, i.e., UEi, UEj, UEk, and UEh, the priority is UEi, UEj, UEk, and UEh in order from high to low, and at this time, no resource block allocation is performed among these users, and then a resource block is allocated to the UEi first, and the specific process is as follows:
and according to the priority order of the UEj, the UEk and the UEh, judging whether the UEj is orthogonal to a UEi spatial channel, if the UEj is not orthogonal to the UEi spatial channel, continuously judging whether the UEk is orthogonal to the UEi spatial channel, if the UEk is orthogonal to the UEi spatial channel, allocating resource blocks for the UEk and the UEi in a first resource set and a second resource set, however, if the remaining resources of the first resource set and the second resource set cannot meet the resource requirements of the UEk and the UEi, continuously judging whether UEh is orthogonal to the UEi spatial channel, if UEh is orthogonal to the UEi spatial channel, allocating resource blocks for UEh and the UEi in the first resource set and the second resource set, and if the remaining resources of the first resource set and the second resource set can meet the resource requirements of UEh and the UEi, successfully scheduling UEh and UEi.
If there is no user orthogonal to the UEi spatial channel in UEj, UEk, UEh, UEi is a non-paired user and a resource block is allocated to UEi in the first resource set.
Therefore, in the embodiment of the present invention, resource blocks are preferentially allocated to users with high priority, and when a paired user with a certain user is searched, the matching is also performed according to the order of priority, and after a paired user is found for the first time, resource blocks are allocated to the paired user. If the first resource set and the second resource set cannot meet the resource requirement of the paired user, the next paired user is continuously searched according to the priority order, so that the uplink multi-user-multi-input multi-output scheduling method of the embodiment of the invention can preferentially meet the scheduling of the high-priority user.
Optionally, the allocating resource blocks for the paired users in the first resource set and the second resource set according to the estimated first number of resource blocks required by the first user and the estimated second number of resource blocks required by the second user includes:
on a condition that the first number is the same as the second number, allocating resource blocks for one of the first user and the second user in the first set of resources, and allocating resource blocks for the other of the first user and the second user in the second set of resources;
and under the condition that the first quantity is different from the second quantity, allocating resource blocks to the user corresponding to the larger one of the first quantity and the second quantity in the first resource set, and allocating resource blocks to the user corresponding to the smaller one of the first quantity and the second quantity in the second resource set.
For example, for a paired user composed of UEi and UEj, when allocating a resource set to the paired user, first determining whether the number of resource blocks required by UEi and UEj is the same, if so, allocating resource blocks to UEi in a first resource set, allocating resource blocks to UEj in a second resource set, or allocating resource blocks to UEi in the second resource set, and allocating resource blocks to UEj in the first resource set; if the resource allocation information is different, acquiring the larger one of the number of the resource blocks needed by the UE i and the UE j, if the larger one is the UE i and the smaller one is the UE j, allocating the resource blocks for the UE i in the first resource set and allocating the resource blocks for the UE j in the second resource set; if the larger is UEj and the smaller is UEi, then allocating resource blocks for UEj in the first resource set and allocating resource blocks for UEi in the second resource set.
In addition, after the foregoing process is performed to allocate resource blocks to the multiple users scheduled by the target subframe, the specific position of the resource block of each user needs to be further determined. The method for determining the specific position of the resource block of each user can be as follows:
for simplicity, without considering the requirement of frequency selective scheduling, the users successfully scheduled in the first resource set sequentially and incrementally allocate resource blocks of the number of the scheduled resources from low frequency to high frequency according to the scheduling sequence. And the initial position of the resource block is the same as the initial position of the matched user, and the resource blocks of the scheduling resource number are sequentially and incrementally distributed from low frequency to high frequency.
In summary, a specific implementation manner of the uplink multiuser-mimo scheduling method according to the embodiment of the invention can be as shown in fig. 2, and is specifically as follows:
assuming that M is the number of RBs (resource blocks) of the full bandwidth, and defining users for distributing the RBs in the M RBs as user group A users; n is the number of RBs of schedulable MUMIMO, N is a subset of M in the frequency domain, and the users that allocate RBs among N RBs are defined as group B users:
step one, according to the number of users scheduled per TTI (sub-frame), selecting a users according to the priority, and carrying out RB estimation to determine the RB quantity and the code block size of each user.
Step two, scheduling is sequentially performed according to the priority order of the selected a users, and a user capable of performing MIMO pairing with the currently scheduled user is searched, specifically as follows:
recording the ith user as UEi, and entering the third step if the UEi is an unscheduled user; and if the UE i is the user which is successfully scheduled, the user is skipped to pair and schedule the next user until all the UE are scheduled and then the step six is carried out.
Step three: search for users orthogonal to the UEi spatial channel:
for example, for the ue i, sequentially searching for a ue j orthogonal to the spatial channel of the ue i in the users that have not been scheduled among the a users, and if a ue j that can be orthogonal is found, performing step four; and if no orthogonal UE is found, performing the step five.
Step four: for orthogonal users UEi and UEj, after pairing, RB allocation is tried in group a and group B, respectively, as follows:
firstly, according to a first preset rule PrimRBNum = MaxRB (UEi, UEj) and MimorRBNum = MinRB (UEi, UEj), placing UEi and UEj in a group A or a group B; wherein PrimRBNum represents users in group A, and MimorRBNum represents users in group B;
namely: if the RB numbers of the UEi and the UEj are equal, the UEi is placed in the group A, and the UEj is placed in the group B; otherwise, the users with the larger RB number in the two groups are selected to be placed in the group A, and the users with the smaller RB number are placed in the group B.
Secondly, whether a paired RBNum + MimorRBNum < N and a main queue RBNum + PrimRBNum < M are satisfied or not is judged, wherein the paired RBNum is the total number of RBs of paired users with successful resource allocation, and the main queue RBNum is the total number of RBs of non-paired users with successful resource allocation, namely whether the residual RB number of the group A and the group B can meet the RB number required by two users or not is judged.
The user in group A tries to divide RB from the RB left by the user in group A, the user in group B tries to divide RB from the RB left by the user in group B, if the number of the RB left by the group A and the number of the RB left by the user in group B respectively meets the number of the RB needed by two users, UEi and UEj are successfully paired, MUMIMO is successfully scheduled, a formula of 'pairing RBNum + = MimorRBNum' is executed, the total number of the RB of the paired user for which resource allocation is successful is updated, a formula of 'main queue RBNum + = PrimRBNum' is executed, the total number of the RB of the non-paired user for which resource allocation is successful is updated, and the step II is returned; and if the number of the RB remained in the group A and the group B does not meet the number of the RB required by the two users, the MIMO pairing of the UEi and the UEj fails, the step three is returned, and the next orthogonal UE of the UEi is searched again for the MIMO pairing.
Step five: and the UEi has no paired users, and the UEi is placed in the group A according to a second preset rule PrimRBNum = UEi RB, namely the RB is divided in the rest RB numbers of the users in the group A. If the RBNum + PrimRBNum of the main queue is less than M, namely if the number of RBs left by the group A users meets the number of RBs required by UEi, the scheduling is successful, and a formula of 'RBNum + PrimRBNum' is executed, namely the total number of RBs of the non-paired users with successfully allocated resources is updated; otherwise, if the RB allocation fails, the UE i scheduling fails, and the step two is returned to carry out the scheduling of the next UE.
Step six: all UE scheduling is finished, at this time, the MUMIMO pairing process is finished, and RB position allocation is carried out on the UE which is successfully scheduled, specifically as follows:
firstly, successively and incrementally allocating the RB resources occupied by the successfully scheduled users in the group A from low frequency to high frequency according to the scheduling sequence, then allocating the RB resources to the successfully scheduled users in the group B, wherein the starting position of the RB of the successfully scheduled users in the group B is the same as the starting position of the RB of the paired users in the group A, and the starting position of the RB of the successfully scheduled users in the group B is also successively and incrementally allocated from low frequency to high frequency.
Step seven: the MUMIMO scheduling is complete.
In summary, the embodiments of the present invention schedule MUMIMO on available RB resources without any impact on the non-MUMIMO scheduling method, wherein when the number N of RBs supporting MUMIMO is less than or equal to the number of RBs under the maximum bandwidth supported by the current network, MUMIMO can be scheduled within the full bandwidth if the processing resources are sufficient, and MUMIMO can be scheduled within the partial bandwidth if the processing resources are limited. That is, the embodiments of the present invention can schedule MUMIMO as much as possible within the allowable range of processing resources from the viewpoint of frequency resource multiplexing without changing non-MUMIMO scheduling. For example, when the hardware resources of the current base station support processing of 150 RBs per cell, by using the uplink multiuser-mimo scheduling method according to the embodiment of the invention, MUMIMO can be scheduled on 50 RBs at 20M bandwidth, and frequency resources of 50 RBs are more than those when the 20M bandwidth does not enable the MUMIMO function.
In addition, testing has shown that scheduling MUMIMO over 50RB bandwidths on a 20M bandwidth system can result in an uplink traffic gain of over 40%, and scheduling MUMIMO over 50RB bandwidths on a 10M bandwidth system can result in an uplink traffic gain of over 80%. Compared with the non-MUMIMO scheduling scheme, the MUMIMO scheduling scheme only adds a process of searching and pairing UE and RB resource allocation on the basis of the MUMIMO scheduling scheme, and the implementation method is simple.
The uplink multi-user-multiple-input multiple-output scheduling method provided by the embodiment of the present invention is described above, and a communication apparatus provided by the embodiment of the present invention will be described below with reference to the accompanying drawings.
Referring to fig. 3, an embodiment of the present invention further provides an uplink multiuser-mimo scheduling apparatus, where the apparatus includes:
a user obtaining module 301, configured to obtain multiple users scheduled by a target uplink subframe, where the target uplink subframe is a subframe of this scheduling;
a resource block allocation module 302, configured to determine a paired user and a non-paired user in the multiple users, allocate a resource block to the paired user in a first resource set and a second resource set, and allocate a resource block to the non-paired user in the first resource set;
the first resource set comprises resource blocks under the maximum bandwidth supported by the current network, and the second resource set comprises the resource blocks supporting space division multiplexing in the first resource set; the paired users are two users with orthogonal spatial channels, and the non-paired users do not have users with orthogonal spatial channels.
Optionally, the resource block allocation module 302 includes:
the estimation submodule is used for estimating the number of the resource blocks required by each user;
the resource block allocation submodule is used for determining a paired user and a non-paired user in the plurality of users, allocating resource blocks for the paired user in a first resource set and a second resource set according to the estimated quantity of the resource blocks required by each user, and allocating resource blocks for the non-paired user in the first resource set.
Optionally, the resource block allocation sub-module includes:
a first searching unit, configured to search, according to a priority order of the multiple users, for a user paired with a first user among users to which a resource block is not allocated, where the first user is one of the multiple users;
a first allocation unit, configured to, when a second user is searched, allocate resource blocks to the paired users in the first resource set and the second resource set according to an estimated first number of resource blocks required by the first user and an estimated second number of resource blocks required by the second user; the second user is a searched first user paired with the first user;
a second searching unit, configured to, when the number of resource blocks remaining in the first resource set is smaller than the larger of the first number and the second number, or the number of resource blocks remaining in the second resource set is smaller than the smaller of the first number and the second number, re-search, in order of priority of the multiple users, a user paired with the first user among users to which no resource block is allocated, among the multiple users;
a second allocating unit, configured to allocate resource blocks to the first user in the first resource set when the number of remaining resource blocks in the first resource set is smaller than the larger of the first number and the third number, or when the number of remaining resource blocks in the second resource set is smaller than the smaller of the first number and the third number, or when a user paired with the first user is not searched, where the third number is an estimated number of resource blocks required by a third user, and the third user is a last searched user paired with the first user.
Optionally, the second allocating unit is specifically configured to:
on a condition that the first number is the same as the second number, allocating resource blocks for one of the first user and the second user in the first set of resources, and allocating resource blocks for the other of the first user and the second user in the second set of resources;
and under the condition that the first quantity is different from the second quantity, allocating resource blocks to the user corresponding to the larger one of the first quantity and the second quantity in the first resource set, and allocating resource blocks to the user corresponding to the smaller one of the first quantity and the second quantity in the second resource set.
Optionally, the user obtaining module is specifically configured to:
and sequencing the schedulable users of the target uplink subframe according to the priority of the users, and acquiring a preset number of users before the sequencing as a plurality of users scheduled by the target uplink subframe.
The uplink multi-user-multi-input multi-output scheduling apparatus provided in the embodiment of the present invention can implement each process implemented in the method embodiment of fig. 1, and is not described herein again to avoid repetition.
In the embodiment of the present invention, a plurality of users scheduled by a target uplink subframe are obtained, and users whose spatial channels are orthogonal to each other (i.e., paired users) and users whose spatial channels are not orthogonal to the spatial channels (i.e., non-paired users) among the users are determined, so that in a first resource set composed of resource blocks under the maximum bandwidth supported by the current network and a second resource set composed of resource blocks supporting spatial multiplexing in the first resource set, resource blocks are allocated for the paired users, and in the first resource set, resource blocks are allocated for the non-paired users, where the second resource set is a set of resource blocks supporting spatial multiplexing in the first resource set, that is, the second resource set is a subset of the first resource set in the frequency domain, and thus if there are resource blocks assigned to users with the same number in the end, it is indicated that there are multiple users and multiple outputs, and if there are no resource blocks with the same number, it is indicated that there is a single data stream on the target subframe.
On the other hand, an embodiment of the present invention further provides an electronic device, which includes a memory, a processor, a bus, and a computer program that is stored in the memory and is executable on the processor, where the processor implements the steps in the uplink multi-user-multiple-input-multiple-output scheduling method when executing the program.
For example, as follows, fig. 4 shows a schematic physical structure diagram of an electronic device.
As shown in fig. 4, the electronic device may include: a processor (processor) 410, a communication Interface 420, a memory (memory) 430 and a communication bus 440, wherein the processor 410, the communication Interface 420 and the memory 430 are communicated with each other via the communication bus 440. The processor 410 may call logic instructions in the memory 430 to perform the following method:
acquiring a plurality of users scheduled by a target uplink subframe, wherein the target uplink subframe is a subframe scheduled this time;
determining a paired user and a non-paired user in the multiple users, allocating resource blocks for the paired user in a first resource set and a second resource set, and allocating resource blocks for the non-paired user in the first resource set;
the first resource set comprises resource blocks under the maximum bandwidth supported by the current network, and the second resource set comprises the resource blocks supporting space division multiplexing in the first resource set; the paired users are two users with orthogonal spatial channels, and the non-paired users do not have users with orthogonal spatial channels.
In addition, the logic instructions in the memory 430 may be implemented in the form of software functional units and stored in a computer readable storage medium when the software functional units are sold or used as independent products. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk, and various media capable of storing program codes.
In another aspect, an embodiment of the present invention further provides a computer-readable storage medium, on which a computer program is stored, where the computer program is implemented to, when executed by a processor, perform the uplink multi-user-multiple-input multiple-output scheduling method provided in the foregoing embodiments, for example, the method includes:
acquiring a plurality of users scheduled by a target uplink subframe, wherein the target uplink subframe is a subframe scheduled this time;
determining paired users and non-paired users in the plurality of users, allocating resource blocks for the paired users in a first resource set and a second resource set, and allocating resource blocks for the non-paired users in the first resource set;
the first resource set comprises resource blocks under the maximum bandwidth supported by the current network, and the second resource set comprises the resource blocks supporting space division multiplexing in the first resource set; the paired users are two users with orthogonal spatial channels, and the non-paired users do not have users with orthogonal spatial channels.
The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one position, or may be distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware. With this understanding in mind, the above-described technical solutions may be embodied in the form of a software product, which can be stored in a computer-readable storage medium such as ROM/RAM, magnetic disk, optical disk, etc., and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the methods described in the embodiments or some parts of the embodiments.
Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, and not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
Claims (12)
1. An uplink multiuser-mimo scheduling method, comprising:
acquiring a plurality of users scheduled by a target uplink subframe, wherein the target uplink subframe is a subframe scheduled this time;
determining paired users and non-paired users in the plurality of users, allocating resource blocks for the paired users in a first resource set and a second resource set, and allocating resource blocks for the non-paired users in the first resource set, wherein the remaining resources of the first resource set and the second resource set meet the resource requirements of the paired users;
the first resource set comprises resource blocks under the maximum bandwidth supported by the current network, and the second resource set comprises the resource blocks supporting space division multiplexing in the first resource set; the paired users are two users with orthogonal spatial channels, and the non-paired users do not have users with orthogonal spatial channels.
2. The uplink mu-mimo scheduling method of claim 1, wherein the determining paired users and non-paired users of the multiple users, and allocating resource blocks to the paired users in a first resource set and a second resource set, and allocating resource blocks to the non-paired users in the first resource set, comprises:
pre-estimating the number of resource blocks required by each user;
and determining paired users and non-paired users in the multiple users, allocating resource blocks for the paired users in a first resource set and a second resource set according to the estimated number of the resource blocks required by each user, and allocating resource blocks for the non-paired users in the first resource set.
3. The uplink multiuser-mimo scheduling method according to claim 2, wherein the determining paired users and non-paired users of the multiple users, and allocating resource blocks to the paired users in a first resource set and a second resource set according to the estimated number of resource blocks required by each of the users, and allocating resource blocks to the non-paired users in the first resource set, comprises:
according to the priority order of the users, searching users which are not allocated with resource blocks in the users for matching with a first user, wherein the first user is one of the users;
under the condition that a second user is searched, distributing resource blocks for the paired users in the first resource set and the second resource set according to the estimated first number of the resource blocks required by the first user and the estimated second number of the resource blocks required by the second user; the second user is a searched first user paired with the first user;
in the case that the number of remaining resource blocks in the first resource set is smaller than the larger of the first number and the second number, or the number of remaining resource blocks in the second resource set is smaller than the smaller of the first number and the second number, re-searching users paired with the first user among users to which resource blocks are not allocated among the users according to the priority order of the users;
and allocating resource blocks to the first user in the first resource set under the condition that the number of the remaining resource blocks in the first resource set is smaller than the larger of the first number and the third number, or under the condition that the number of the remaining resource blocks in the second resource set is smaller than the smaller of the first number and the third number, or under the condition that a user paired with the first user is not searched, wherein the third number is the estimated number of the resource blocks required by the third user, and the third user is the last searched user paired with the first user.
4. The uplink mu-mimo scheduling method of claim 3, wherein the allocating resource blocks for the paired users in the first resource set and the second resource set according to the estimated first number of resource blocks required by the first user and the estimated second number of resource blocks required by the second user comprises:
on a condition that the first number is the same as the second number, allocating resource blocks for one of the first user and the second user in the first set of resources, and allocating resource blocks for the other of the first user and the second user in the second set of resources;
and under the condition that the first quantity is different from the second quantity, allocating resource blocks to the user corresponding to the larger one of the first quantity and the second quantity in the first resource set, and allocating resource blocks to the user corresponding to the smaller one of the first quantity and the second quantity in the second resource set.
5. The uplink multiuser-mimo scheduling method according to claim 1, wherein the obtaining of the plurality of users scheduled by the target uplink subframe comprises:
and sequencing schedulable users of the target uplink subframe according to the priority of the users, and acquiring a preset number of users before the sequencing as a plurality of users scheduled by the target uplink subframe.
6. An uplink multiuser-mimo scheduling apparatus, comprising:
the system comprises a user acquisition module, a scheduling module and a scheduling module, wherein the user acquisition module is used for acquiring a plurality of users scheduled by a target uplink subframe, and the target uplink subframe is a subframe scheduled this time;
a resource block allocation module, configured to determine a paired user and a non-paired user in the multiple users, allocate a resource block to the paired user in a first resource set and a second resource set, and allocate a resource block to the non-paired user in the first resource set, where remaining resources of the first resource set and the second resource set meet resource requirements of the paired user;
the first resource set comprises resource blocks under the maximum bandwidth supported by the current network, and the second resource set comprises the resource blocks supporting space division multiplexing in the first resource set; the paired users are two users with orthogonal spatial channels, and the non-paired users do not have users with orthogonal spatial channels.
7. The uplink multiuser-mimo scheduling device according to claim 6, wherein the resource block allocating module comprises:
the estimation submodule is used for estimating the number of the resource blocks required by each user;
and the resource block allocation submodule is used for determining a paired user and a non-paired user in the plurality of users, allocating resource blocks for the paired user in a first resource set and a second resource set according to the estimated number of the resource blocks required by each user, and allocating resource blocks for the non-paired user in the first resource set.
8. The uplink mu-mimo scheduling apparatus of claim 7, wherein the resource block allocation submodule comprises:
a first searching unit, configured to search, according to a priority order of the multiple users, a user paired with a first user among users to which a resource block is not allocated among the multiple users, where the first user is one of the multiple users;
a first allocation unit, configured to, when a second user is searched, allocate resource blocks to the paired users in the first resource set and the second resource set according to an estimated first number of resource blocks required by the first user and an estimated second number of resource blocks required by the second user; the second user is a searched first user paired with the first user;
a second searching unit, configured to, when the number of resource blocks remaining in the first resource set is smaller than the larger of the first number and the second number, or the number of resource blocks remaining in the second resource set is smaller than the smaller of the first number and the second number, re-search, in order of priority of the multiple users, a user paired with the first user among users to which no resource block is allocated, among the multiple users;
a second allocating unit, configured to allocate resource blocks to the first user in the first resource set when the number of remaining resource blocks in the first resource set is smaller than the larger of the first number and the third number, or when the number of remaining resource blocks in the second resource set is smaller than the smaller of the first number and the third number, or when a user paired with the first user is not searched, where the third number is an estimated number of resource blocks required by a third user, and the third user is a last searched user paired with the first user.
9. The uplink mu-mimo scheduling apparatus according to claim 8, wherein the second allocating unit is specifically configured to:
on a condition that the first number is the same as the second number, allocating resource blocks for one of the first user and the second user in the first set of resources, and allocating resource blocks for the other of the first user and the second user in the second set of resources;
and under the condition that the first quantity is different from the second quantity, allocating resource blocks to the user corresponding to the larger one of the first quantity and the second quantity in the first resource set, and allocating resource blocks to the user corresponding to the smaller one of the first quantity and the second quantity in the second resource set.
10. The uplink mu-mimo scheduling apparatus according to claim 6, wherein the user acquisition module is specifically configured to:
and sequencing the schedulable users of the target uplink subframe according to the priority of the users, and acquiring a preset number of users before the sequencing as a plurality of users scheduled by the target uplink subframe.
11. An electronic device comprising a processor, a memory and a computer program stored on the memory and executable on the processor, wherein the computer program, when executed by the processor, implements the steps of the uplink multiuser-multiple-input multiple-output scheduling method according to any one of claims 1 to 5.
12. A computer-readable storage medium, wherein a computer program is stored on the computer-readable storage medium, and when executed by a processor, the computer program implements the steps of the uplink multiuser-multiple-input multiple-output scheduling method according to any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010105832.5A CN113286373B (en) | 2020-02-19 | 2020-02-19 | Uplink multi-user-multi-input multi-output scheduling method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010105832.5A CN113286373B (en) | 2020-02-19 | 2020-02-19 | Uplink multi-user-multi-input multi-output scheduling method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113286373A CN113286373A (en) | 2021-08-20 |
| CN113286373B true CN113286373B (en) | 2022-11-04 |
Family
ID=77275183
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010105832.5A Active CN113286373B (en) | 2020-02-19 | 2020-02-19 | Uplink multi-user-multi-input multi-output scheduling method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113286373B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115243378B (en) * | 2022-07-20 | 2024-06-07 | 中国联合网络通信集团有限公司 | Resource allocation method and device, electronic equipment and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102025461A (en) * | 2010-12-06 | 2011-04-20 | 大唐移动通信设备有限公司 | Frequency domain scheduling method and device |
| CN104703284A (en) * | 2013-12-09 | 2015-06-10 | 普天信息技术研究院有限公司 | Resource allocation method |
| CN106656443A (en) * | 2015-11-02 | 2017-05-10 | 华为技术有限公司 | Method and device for increasing paired users |
| WO2017107707A1 (en) * | 2015-12-22 | 2017-06-29 | 电信科学技术研究院 | Method and apparatus for determining multi-user transmission mode |
| CN108012331A (en) * | 2016-10-31 | 2018-05-08 | 中国移动通信集团广东有限公司 | Resource allocation methods and base station in LTE uplink multi-users virtual MIMO systems |
-
2020
- 2020-02-19 CN CN202010105832.5A patent/CN113286373B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102025461A (en) * | 2010-12-06 | 2011-04-20 | 大唐移动通信设备有限公司 | Frequency domain scheduling method and device |
| CN104703284A (en) * | 2013-12-09 | 2015-06-10 | 普天信息技术研究院有限公司 | Resource allocation method |
| CN106656443A (en) * | 2015-11-02 | 2017-05-10 | 华为技术有限公司 | Method and device for increasing paired users |
| WO2017107707A1 (en) * | 2015-12-22 | 2017-06-29 | 电信科学技术研究院 | Method and apparatus for determining multi-user transmission mode |
| CN106911372A (en) * | 2015-12-22 | 2017-06-30 | 电信科学技术研究院 | A kind of method and device for determining multi-user transmission mode |
| CN108012331A (en) * | 2016-10-31 | 2018-05-08 | 中国移动通信集团广东有限公司 | Resource allocation methods and base station in LTE uplink multi-users virtual MIMO systems |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113286373A (en) | 2021-08-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11025379B2 (en) | Localized and distributed transmission | |
| Liao et al. | An efficient downlink radio resource allocation with carrier aggregation in LTE-advanced networks | |
| US8190168B2 (en) | Enhanced scheduling techniques for wireless communication networks | |
| EP2924908B1 (en) | Pilot time slot allocation for a MIMO system | |
| EP2317809B1 (en) | Scheduling of up-link transmissions of a wireless communication system | |
| JP2020184799A (en) | Resource scheduling method, apparatus and device | |
| CN103096493B (en) | Method, subscriber equipment and the base station received and transmit control channel | |
| US8320479B2 (en) | Ranking and grouping of transmissions in communication system | |
| CN106685494B (en) | Packet scheduling method and device in MU-MIMO system | |
| EP2843849A1 (en) | User pairing method, device and system for achieving user scheduling | |
| US10681714B2 (en) | Method and device for transmission instruction, transmission triggering, and transmission implementation for multi-station | |
| EP2499870A1 (en) | An improved method and apparatus for co-scheduling transmissions in a wireless network | |
| KR101948872B1 (en) | Method of Joint Optimization of Channel Selection and Frame Scheduling for Coexistence of LTE and WLAN in Unlicensed Band | |
| WO2016033953A1 (en) | Resource allocation method and device | |
| EP3079286B1 (en) | Method and base station apparatus for processing data | |
| CN104936233A (en) | Resource scheduling distribution method and device | |
| US10581574B2 (en) | Data transmission method, and apparatus | |
| KR20100126547A (en) | A method for communicating in mobile system | |
| EP3307001A1 (en) | Inter-carrier frequency cooperation method and device | |
| CN113286373B (en) | Uplink multi-user-multi-input multi-output scheduling method and device | |
| CN102740480B (en) | Method and device for interference suppression of paired users | |
| Sarigiannidis et al. | On the use of learning automata in tuning the channel split ratio of WiMAX networks | |
| Sarigiannidis et al. | Using learning automata for adaptively adjusting the downlink-to-uplink ratio in IEEE 802.16 e wireless networks | |
| CN108462564B (en) | Control channel resource allocation and wireless communication signal transmission method and device | |
| CN105722199B (en) | Scheduling method, network equipment and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |