CN108093483B - Multi-user scheduling and resource allocation processing method and system in large-scale antenna system - Google Patents
Multi-user scheduling and resource allocation processing method and system in large-scale antenna system Download PDFInfo
- Publication number
- CN108093483B CN108093483B CN201711436254.8A CN201711436254A CN108093483B CN 108093483 B CN108093483 B CN 108093483B CN 201711436254 A CN201711436254 A CN 201711436254A CN 108093483 B CN108093483 B CN 108093483B
- Authority
- CN
- China
- Prior art keywords
- resource block
- group
- resource
- matching
- joint
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Images
Classifications
-
- 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/50—Allocation or scheduling criteria for wireless resources
- H04W72/53—Allocation or scheduling criteria for wireless resources based on regulatory allocation policies
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides a multi-user scheduling and resource allocation processing method in a large-scale antenna system, which comprises the following steps: calculating a corresponding metric matrix according to the metric definition of the system; selecting a matching group for each resource block according to the measurement matrix and the maximum measurement principle between a single resource block and a single matching group; determining the combination of a locally optimal pairing group and a resource block; selecting a resource block by a pairing group; screening a feasible pairing group; detecting whether all resource blocks are distributed completely, if so, turning to the next step, and if not, entering into the construction of a new measurement matrix; constructing a new measurement matrix; repeating the steps until all resource blocks are distributed; and outputting the mapping relation between the resource block and the user pairing group. The invention provides a technology for joint processing of user pairing and resource allocation, and simultaneously joint processing is carried out in the selectable space and the allocable resource space of the whole user group, so that better performance than that of the prior art can be obtained with limited implementation complexity.
Description
Technical Field
The invention belongs to the technical field of wireless communication, and particularly relates to a multi-user scheduling and resource allocation processing method and system in a large-scale antenna system.
Background
In a 5G communication system, a base station generally adopts a large-scale multi-antenna configuration, and can support multiple users to perform signal transmission simultaneously while acquiring antenna gain. However, due to the size limitation of the terminal equipment, the number of antennas configured for the terminal is very limited. Therefore, in order to increase the transmission rate of users, multiple users are scheduled to form a pair group in one scheduling timeslot, and concurrent transmission is performed on the same time-frequency resource. How to schedule users to form a proper pairing group is one of the problems to be considered in the system implementation process.
In addition, due to the limitation of time-frequency resources, in each scheduling time slot, in addition to the selection of the user pairing group, an optimized resource allocation manner needs to be designed according to system measurement requirements (the measurement definition may be transmission rate, system energy efficiency, user fairness, or a weighted combination of some of the above measurements, etc.), and the limited transmission resources are reasonably allocated among a plurality of users or user pairing groups, so as to obtain optimal or suboptimal system performance under a certain measurement index.
In view of the above requirements, there are some specific allocation methods in the conventional multi-antenna system, but when the method is applied to a large-scale multi-antenna system, there are certain limitations in some aspects, such as scalability, complexity, performance, etc. of the method.
Disclosure of Invention
In view of the above-mentioned shortcomings of the prior art, the present invention aims to provide a joint processing method for multiuser scheduling and resource allocation in a large-scale antenna system, which can achieve better performance than the prior art by performing joint selection in the whole user group selectable space and resource space simultaneously.
To achieve the above and other related objects, the present invention provides a method for processing multiuser scheduling and resource allocation in a large-scale antenna system, the method comprising the steps of: s1, according to the measurement definition of the system, calculating the corresponding measurement matrix, the element value of the measurement matrix is the measurement value when the single resource block is allocated to the single matching group; s2, according to the measurement matrix, according to the principle of maximum measurement between a single resource block and a single pairing group, selecting a pairing group for each resource block; s3, determining the combination of the local optimal matching group and the resource block; s4, for the local optimal matching group, obtaining the local optimal resource block corresponding to the local optimal matching group and clearing other resource blocks; s5, according to the requirement that users in different pair groups can not have repetition, other pair groups with non-zero same users as the local optimal pair group are removed from the whole pair group space, and the rest pair groups are marked as feasible pair groups; s6 detecting whether all resource blocks are distributed, if so, turning to S9, and if not, turning to S7; s7, constructing a new measurement matrix according to the following construction rules: reserving all elements corresponding to resource blocks which are not paired in the previous round, and reserving all elements corresponding to feasible pairing groups in the previous round; s8, repeating the steps S2-S6 until all resource blocks are distributed; s9, the mapping relation between the resource block and the user pairing group is output, namely the result of the joint scheduling.
Preferably, the determining the combination of the locally optimal pair group and the resource block specifically includes: calculating a joint measurement value of the matching group and the resource block; comparing the joint measurement value of each matching group and the resource block; the matching group and the resource block corresponding to the maximum joint metric value are marked as the joint of the locally optimal matching group and the resource block, the matching group is the locally optimal matching group, and the resource block is the locally optimal resource block.
Preferably, the calculating a joint metric value of the pair group and the resource block specifically includes: if the pairing group is allocated to a single resource block, the joint measurement value of the pairing group and the resource block is the element value allocated to the pairing group by the resource block in the measurement matrix; if the pairing group is allocated to a plurality of resource blocks, dividing the plurality of resource blocks into blocks of the plurality of resource blocks; the joint metric value of the paired group and the resource block partition is the element value or the sum of the element values allocated to the paired group by a single resource block or a plurality of resource blocks from the resource block partition in the metric matrix.
Preferably, the screening method of the feasible pairing group is as follows: according to the fact that users in different matching groups cannot have repeated requirements, other matching groups with non-zero same users with the local optimal matching group are removed from the space of the whole matching group, and the remaining matching groups are feasible matching groups.
Preferably, the determining the combination of the locally optimal pair group and the resource block partition for the (N + 1) th time specifically includes: calculating a joint measurement value of the matching group and the resource block; comparing the joint measurement value of each matching group and the resource block; if the matching group and the resource block corresponding to the maximum joint metric value meet the resource allocation constraint of the system, marking the corresponding matching group and the resource block as the joint of the locally optimal matching group and the resource block, wherein the matching group is the locally optimal matching group, and the resource block is the locally optimal resource block; if the matching group and the resource block corresponding to the maximum joint metric value do not meet the resource allocation constraint of the system, if the joint metric value of the matching group and the resource block partitioning is larger than the joint metric values of other matching groups and resource block partitioning which hinder the resource allocation, the system enables the resource block which hinders the resource allocation to make a selection which meets the resource allocation of the system again; marking the pairing group and the resource block corresponding to the reselected maximum joint metric value as the joint of the locally optimal pairing group and the resource block, wherein the pairing group is the locally optimal pairing group, and the resource block is the locally optimal resource block; otherwise, eliminating the combination of the corresponding matching group and the resource block of the maximum combined metric value, and sequentially judging the combination of the residual matching group and the resource block, wherein N is an integer greater than or equal to 1.
Preferably, if the pairing group has obtained one or more resource blocks, the dividing the newly allocated resource block and the obtained resource block into a plurality of resource block partitions specifically includes: if the resource block contains the resource block obtained by the matching group, removing the resource block obtained by the matching group from the resource block to form a new resource block; the joint measurement value of the matched group and the new resource block is the element value or the sum of the element values distributed to the matched group by a single resource block or a plurality of resource blocks from the resource block in the measurement matrix; if the resource block partition does not contain the resource block obtained by the matching group, the joint measurement value of the matching group and the resource block partition is the element value or the sum of the element values distributed to the matching group by a single or a plurality of resource blocks in the resource block partition in the measurement matrix.
To achieve the above and other related objects, the present invention provides a system for scheduling and resource allocation for multiple users in a large-scale antenna system, the system comprising: the measurement matrix construction module is used for calculating a corresponding measurement matrix according to the measurement definition of the system, and the element value of the measurement matrix is the measurement value when a single resource block is allocated to a single pairing group; a resource block allocation module, configured to select a pair group for each resource block according to the metric matrix and the maximum metric rule between a single resource block and a single pair group; a joint determination module of the matching group and the resource block, which is used for determining the joint of the local optimal matching group and the resource block; the feasible matching group marking module is used for removing other matching groups which have non-zero same users with the local optimal matching group from the whole matching group space according to the fact that users in different matching groups can not have repeated requirements, and marking the remaining matching groups as feasible matching groups; the resource block allocation detection module is used for detecting whether all resource blocks are allocated completely; and the mapping relation output module is used for outputting the mapping relation between the resource block and the user pairing group, namely the joint scheduling result.
In order to achieve the above and other related objects, the present invention further provides a joint processing terminal, which includes a processor and a memory, where the memory stores program instructions, and the processor executes the program instructions to implement the foregoing processing method for scheduling multiple users and allocating resources in a large-scale antenna system.
To achieve the above and other related objects, the present invention further provides a storage medium having a computer program stored thereon, wherein the computer program is executed by a processor to implement the foregoing processing method for multiuser scheduling and resource allocation in a large-scale antenna system.
As described above, the method for processing multiuser scheduling and resource allocation in a large-scale antenna system of the present invention has the following beneficial effects: aiming at the defects of the prior art, the invention provides a technology for joint processing of user pairing and resource allocation, and simultaneously joint processing is carried out in the selectable space and the allocable resource space of the whole user group, so that better performance than that of the prior art can be obtained with limited implementation complexity.
Drawings
Fig. 1 is a schematic diagram of a large-scale antenna system according to the present invention.
Fig. 2 is a flowchart illustrating a multi-user scheduling and resource allocation processing method in a large-scale antenna system according to the present invention.
Detailed Description
The embodiments of the present invention are described below with reference to specific embodiments, and other advantages and effects of the present invention will be easily understood by those skilled in the art from the disclosure of the present specification. The invention is capable of other and different embodiments and of being practiced or of being carried out in various ways, and its several details are capable of modification in various respects, all without departing from the spirit and scope of the present invention. It is to be noted that the features in the following embodiments and examples may be combined with each other without conflict.
It should be noted that the drawings provided in the following embodiments are only for illustrating the basic idea of the present invention, and the components related to the present invention are only shown in the drawings rather than drawn according to the number, shape and size of the components in actual implementation, and the type, quantity and proportion of the components in actual implementation may be changed freely, and the layout of the components may be more complicated.
In a large-scale system under the sky, hundreds of antennas are often configured on the base station side, and a small number or few antennas are often configured on the receiving end due to the size, power consumption and the like. In order to fully utilize spatial multiplexing gain brought by a large-scale antenna at a base station side and improve transmission rate of users and other factors, a matching group is formed by preferentially selecting proper users from a plurality of users, so that multi-user concurrent transmission is realized. In addition, in order to limit transmission resources, it is necessary to reasonably allocate transmission resources among a plurality of allocation groups, and therefore, when a system is implemented, it is necessary to consider both the problems of user scheduling and resource allocation.
Of the existing methods, the main representative methods include: traversing users and resources; selecting user pairs and resources in stages; jointly selecting a user pair and a resource. The characteristics of the existing processing techniques were analyzed as follows:
1) users and resources are traversed. The method traverses all possible user pairing modes and all possible resource allocation modes, and calculates a system metric value under each traversal condition. And the matching group with the maximum metric value and the resource allocation mode correspond to the final allocation result. Obviously, the method is theoretically optimal, but as the number of users and the number of resources increase, the implementation complexity of the method tends to increase exponentially, so that the complexity is very high and the implementation is difficult.
2) User pairs and resources are selected in stages. The RA-MP method mentioned in the document [ H.ZHao, S.Ma, F.Liu, and Y.Tang "AJointmed Resource Allocation and Multiuser Pairing Allocation with LowComplexity for SC-FDMA Systems," Wireless Personal Commun ", No.79, pp.2227-2236,2014 ], and the RA-MP method mentioned in the document [ C.Wu, L.Chen and G.Wei," Joint User Pairing and Resource Allocation for Uplink SC-FDMA Systems, "in Proc.WCSP, Handzhou, pp.1-6,2013 ], all employ a method of determining the Allocation of a first User and its Resource blocks in a User pair in order, and then determining the respective paired users under the defined criteria. The method is relatively simple to implement, but the performance of the system cannot be kept optimal in the staged implementation process. Meanwhile, the RA _ MP and FuF methods proposed in the literature are only applicable to the case where the user pairing number is 2, and an algorithm needs to be additionally designed for the case of more than 2.
3) Jointly selecting a user pair and a resource. And the user pairing group and the resources are selected jointly, so that higher system performance can be obtained. The SubOpt method proposed in the documents [ C.Wu, L.Chen and G.Wei, "Joint User Pairing and resource allocation for Virtual MIMO in Uplink SC-FDMA System," in Proc.WCSP, Hangzhou, pp.1-6,2013 ] belongs to this class of methods. The method selects a pairing group in the whole set of pairable user groups, but when selecting resource blocks, only 1 resource block is selected at a time in order to simplify the algorithm. Thus, there is a certain loss in performance for the case of joint allocation of multiple resource blocks. The complexity of the method is higher than that of the method 2), but the performance is better overall. In addition, the method is suitable for the case that the user pairing number is an arbitrary value.
The processing method for multi-user scheduling and resource allocation in the large-scale antenna system belongs to the 3) category, but is different from the subOpt method in that the method simultaneously performs combined selection in the selectable space and the resource space of the whole user group, so the method is superior to the prior art in performance.
A system block diagram is shown in fig. 1. Within the coverage of a Base Station (BS), there are multiple active Users (UEs), each with random channel conditions to the base station. The base station needs to select one group or several groups of user pairing groups from a plurality of active users for concurrent transmission of signals. In addition, the transmission Resource of the base station is a finite value, and for convenience, a Resource format is defined below with reference to Resource Blocks (RBs) in the current wireless communication system. The base station needs to allocate a limited number of resource blocks to the appropriate paired users. The guiding target of the allocation mode is the performance measurement of the system, and the measurement definition can be transmission rate, system energy efficiency, user fairness, or the weighted combination of some measurement and the like.
Referring to fig. 2, the present invention provides a method for jointly processing user group allocation and resource block allocation, which can achieve better performance than the prior art by jointly selecting in the entire user group selectable space and resource space. The specific steps are described as follows:
s1, according to the measurement definition of the system, calculating the corresponding measurement matrix, the element value of the measurement matrix is the measurement value when the single resource block is allocated to the single matching group;
s2, according to the measurement matrix, according to the principle of maximum measurement between a single resource block and a single pairing group, selecting a pairing group for each resource block;
s3, determining the combination of the local optimal matching group and the resource block;
s4, for the local optimal matching group, obtaining the local optimal resource block corresponding to the local optimal matching group and clearing other resource blocks;
s5, according to the requirement that users in different pair groups can not have repetition, other pair groups with non-zero same users as the local optimal pair group are removed from the whole pair group space, and the rest pair groups are marked as feasible pair groups;
s6 detecting whether all resource blocks are distributed, if so, turning to S9, and if not, turning to S7;
s7, constructing a new measurement matrix according to the following construction rules: reserving all elements corresponding to resource blocks which are not paired in the previous round, and reserving all elements corresponding to feasible pairing groups in the previous round;
s8, repeating the steps S2-S6 until all resource blocks are distributed;
s9, the mapping relation between the resource block and the user pairing group is output, namely the result of the joint scheduling.
Aiming at the defects of the prior art, the invention provides a method for joint processing of user pairing and resource allocation, and simultaneously joint processing is carried out in the selectable space and the allocable resource space of the whole user group, so that better performance than that of the prior art can be obtained with limited implementation complexity.
The present invention will be described in detail in the following examples. This embodiment performs two-way selection of resource block and pair group.
Step 1, an initialization phase. And calculating a corresponding measurement matrix according to the measurement definition of the system, wherein the element value of the measurement matrix is the measurement value when a single resource block is allocated to a single pairing group. For example, if the total number of resource blocks is NrbThe total number of user pairing modes is NueOne possibility, then one N may be usedrbLine, NueMatrix of columns (i.e. matrix dimension: N)rb×Nue) To represent a metric matrix, wherein the ith row and the jth column element of the matrix represent the metric value when the ith resource block is allocated to the jth matching group, and i is not more than NrbJ is not more than NueIs a positive integer of (1).
And 2, starting the first round of bidirectional selection.
2.1 resource block selection pair group. According to the metric matrix defined in the foregoing, one pair group is selected for each resource block according to the metric maximization principle between a single resource block and a single pair group. After selection is complete, each pair group will be allocated either zero, one, or multiple resource blocks.
2.2 determining locally optimal combination of pairs and resource Block partitioning
1) Calculating the joint measurement value of the matching group and the resource block partitioning:
1-1: if a pair group is allocated to a single resource block, the joint metric value of the pair group and the resource block partition (i.e., a single resource block) is the value of the element in the metric matrix allocated to the pair group by the resource block.
1-2, if the pairing group is distributed to a plurality of resource blocks, dividing the plurality of resource blocks into blocks of the plurality of resource blocks, so that the blocks of each resource block respectively meet the resource distribution constraint condition of the system, but the joint of the resource blocks in each other does not meet the resource distribution constraint condition of the system. The joint metric value of the paired group and the resource block partition is the element value or the sum of the element values allocated to the paired group by a single resource block or a plurality of resource blocks from the resource block partition in the metric matrix.
2) And comparing the joint measurement value of each matching group and each resource block, wherein the matching group and each resource block corresponding to the maximum value are marked as the joint of the locally optimal matching group and each resource block. In addition, marking the matching group as a local optimal matching group; accordingly, the locally optimal resource block partitions are marked.
2.3 pairing group selection resource blocks
1) For the locally optimal pair group, the local optimal resource block corresponding to the local optimal pair group is obtained and other resource blocks are emptied.
2) And clearing the resource blocks allocated to other pairing groups.
2.4 screening of feasible pairings
According to the fact that users in different pair groups cannot have repeated requirements, other pair groups with non-zero same users with the local optimal pair group are removed from the space of the whole pair group, and the rest pair groups are marked as feasible pair groups.
If all resource blocks are distributed after the step 2, the step 5 is carried out
And 3, starting a second round of bidirectional selection.
And 3.1, constructing a new measurement matrix according to the rule that all elements corresponding to resource blocks which are not paired in the previous round are reserved, and all elements corresponding to feasible pairing groups in the previous round are reserved. With N as exemplified in step 1rb×NueThe measurement matrix is taken as an example, and the new measurement matrix is constructed in the following way: on the basis of the original matrix, all row elements corresponding to resource blocks which are not paired are reserved, and all column elements corresponding to feasible pairing groups are reserved.
3.2 resource block selection pair group. And according to the new measurement matrix and the principle of maximum measurement between a single resource block and a single pair group, selecting one pair group for each resource block. After the selection is completed, the reserved pair group in each previous round will be newly allocated with either zero or one or more resource blocks.
3.3 determining the combination of the locally optimal matching group and the resource block partitioning.
1) If the allocation group already obtains one or more resource blocks at the beginning of the round of selection, the newly allocated resource block and the obtained resource blocks are divided into blocks of a plurality of resource blocks together, so that the blocks of each resource block respectively meet the resource allocation constraint condition of the system, but the combination of the resource blocks in each other does not meet the resource allocation constraint condition of the system.
3.3.1-1 if the resource block contains the resource block which is obtained by the allocation group, removing the resource block which is obtained by the allocation group from the resource block to form a new resource block. The joint metric for the paired group and the new resource block partition is the element value or sum of element values allocated to the paired group for a single or multiple resource blocks from the resource block partition in the metric matrix.
3.3.1-2 if the resource block partition does not contain the resource block obtained by the pair of blocks, the joint measurement value of the pair of blocks and the resource block partition is the element value or the sum of the element values allocated to the pair of blocks from a single or a plurality of resource blocks in the resource block partition in the measurement matrix.
2) If the pair group does not obtain any resource block at the beginning of this round of selection, the joint metric value of the pair group and the resource block partition is calculated as described in step 2.2.
3) Comparing the joint metric value of each pair group and resource block partition
3.3.3-1 if the combination of the pairing group and the resource block corresponding to the maximum value meets the resource allocation constraint of the system, marking the combination as the combination of the locally optimal pairing group and the resource block. And marking the locally optimal matching group and the locally optimal resource block as in the step 2.2.
3.3.3-2, if the combination of the pair group and the resource block corresponding to the maximum value does not satisfy the resource allocation constraint of the system, but the combination of the pair group and the resource block is better than the combination of other pair groups and resource block blocks which hinder the satisfiability of the resource allocation, then the step 3.4 is carried out. In addition, the pair group and the resource block which destroy the satisfiability of the resource allocation of the pair group and the resource block are respectively marked as a blocked pair group and a blocked resource block, and the pair group and the resource block are marked as the combination of the pair group and the resource block which are hopeful to become locally optimal.
3.3.3-3 otherwise, removing the combination of the maximum matching group and the resource block, and re-executing the step 3.3.
3.4 pairing group selection resource blocks
1) If the combination of the locally optimal matching group and the resource block partition obtained in the step 3.3 is adopted, the operation of selecting the resource block by the matching group is executed according to the step 2.3
2) If the result of step 3.3 is a combination of the pair groups and resource block partitions which is hopeful to be locally optimal.
3.4.2-1 clears the resource blocks to which all pairs of assignments are assigned.
3.4.2-2 allocates the blocked resource blocks in the metric matrix to the elements corresponding to the pair groups which are expected to become locally optimal, and sets a very large value, and goes to step 3.2.
3.5 screening the feasible pairing groups. The feasible pairing groups were screened according to step 2.4.
And 4, if the resource blocks which are not distributed yet still exist after the step 2 and the step 3, repeating the steps, and continuing to perform multiple rounds of selection according to the mode of the step 3 until all the resource blocks are distributed.
And 5, outputting the mapping relation between the resource block and the user pairing group, namely the joint scheduling result.
In particular, in the metric comparison proposed in the above scheme, if there are multiple identical maxima, a random selection is made.
The following examples are given for the detailed implementation and specific operation of the present invention, but the scope of the present invention is not limited to the following examples.
In this embodiment, it is assumed that the resource allocation constraint of the system is that the resource blocks allocated to each user or each pair group must be continuous, and the system performance metric is defined as the rate. Suppose the number of active users in the system is 4, Nue4; in the transmission process, every 2 users are configured into a group; the number of available resource blocks is 8, i.e. Nrb8. For convenience of subsequent description, 4 users are respectively denoted by U1, U2, U3, U4, and 8 consecutive resource blocks are respectively denoted by R1, R2, R3, R4, R5, R6, R7, and R8. Based on the above assumptions, there are 6 possible pairing modes between users, namely { U1, U2}, { U1, U3}, { U1, U4}, { U2, U3}, { U2, U4}, { U3, U4 }; for the convenience of the following description, the above 6 pairing groups are respectively denoted by P1, P2, P3, P4, P5, and P6. The purpose of the following operation is to perform a bi-directional selection of the combined resource block in a preferred way, i.e. to decide which one or more of the above mentioned pair groups to select, while 8 resource blocks are allocated to the selected pair group.
Following the procedures described in the foregoing schemes, specific implementation steps are given below.
Step 1: and (5) initializing. According to the system metric definition, the metric values of R1-R8 assigned to P1-P6 are calculated respectively to obtain an 8 × 6 metric matrix, and in this embodiment, the calculation result is assumed to be:
the row of the matrix represents the index of the resource block, the column of the matrix represents the index of the matched group, and the element value of the matrix represents the value of the metric of the corresponding resource block allocated to the corresponding matched group. For example, the following steps are carried out: the value of the first row and the first column element is 6, which means that the performance metric when the resource block R1 is allocated to the pair P1 is 6, and the meaning of the values of the other elements in the matrix is analogized.
Step 2: the first two-way selection.
Step 2.1: resource block selection pairs. And according to the metric matrix (1), selecting a pair group for each resource block according to the maximum metric principle between a single resource block and a single pair group. Taking R1 as an example, the time metric values respectively assigned to the pair groups P1-P6 are the first row {6,5,2,2,3,4} of the matrix, where the maximum value is 6, and thus R1 is assigned to the pair group P1; by analogy, R2, R3, R4, R5, R6, R7, R8 are respectively assigned to pairing groups P2, P2, P1, P6, P3, P5, P5.
After the selection is completed, the pairing group P1 obtains 2 resource blocks { R1, R4 }; the pairing group P2 obtains 2 resource blocks { R2, R3 }; the pairing group P3 obtains 1 resource block { R6 }; pair P4 obtains zero resource blocks; the pairing group P5 obtains 2 resource blocks { R7, R8 }; the pair P6 obtains 1 resource block { R5 }.
Step 2.2: determining locally optimal association of a pair group and a resource block partition
The pair P1 is allocated 2 resource blocks { R1, R4}, which may be divided into two resource block partitions { R1} and { R4}, such that each satisfies the system resource allocation constraint but the union does not satisfy the system resource allocation constraint. The metric of the combination of the pair group and the resource block partition { P1, R1} is the value of the element in the metric matrix R1 assigned to P1, i.e. 6; and the metric for the combination of pair groups and resource block partitions P1, R4 is 9. The pair P2 is allocated 2 resource blocks { R2, R3}, which may be divided into one resource block subblock { R2, R3 }. Therefore, the metric of the combination of the pair group and the resource block partition { P2, R2, R3} is the sum of the values of the elements in the metric matrix that R2, R3 allocate to P2, i.e., 8+9 ═ 17. By analogy, the metric of the combination of the pair group and the resource block { P3, R6} is 8, the metric of the combination of the pair group and the resource block { P5, R7, R8} is 7+ 8-15, and the metric of the combination of the pair group and the resource block { P6, R5} is 8.
Therefore, the combination of the locally optimal pair group and the resource block partition in the round is { P2, R2, R3}, and the metric value is 17. The locally optimal pair group is P2, and the locally optimal resource block is R2, R3.
Step 2.3: pairing group selection resource blocks
And the local optimal matching group P2 obtains local optimal resource block blocks { R2, R3}, and clears the resource blocks allocated in the current round by P1, P3, P4, P5 and P6.
Step 2.4: screening of feasible pairing groups
Since the paired groups P1, P3, P4, P6 and P2 all have the same users, the remaining { P2, P5} is a feasible paired group.
In summary, in step 2, the selection result is: the pairing group P2 obtains 2 resource blocks { R2, R3 }; the unallocated resource blocks are { R1, R4, R5, R6, R7, R8 }; the feasible pairing group is { P2, P5 }.
And step 3: second round of selection
Step 3.1: constructing new metric matrix
The 1 st, 4 th, 5 th, 6 th, 7 th, 8 th row and 2 nd, 5 th column in the aforementioned measurement matrix (1) constitute the 6 × 2 measurement matrix selected in this round as follows
Step 3.2: resource block selection pair group
According to the new metric matrix (2) and the selection method, the selection result is obtained as follows: the pair P2 is allocated to 3 resource blocks { R1, R5, R6 }; the pair P5 is allocated 3 resource blocks { R4, R7, R8 }.
Step 3.3: determining locally optimal association of a pair group and a resource block partition
The matching group P2 is newly allocated with 3 resource blocks { R1, R5, R6}, and is added with the obtained 2 resource blocks { R2, R3}, so that 5 resource blocks { R1, R2, R3, R5, R6} are total. These 5 resource blocks can be divided into 2 resource block partitions: { R1, R2, R3} and { R5, R6 }. The resource block blocks { R1, R2 and R3} contain the obtained resource blocks { R2 and R3}, and new resource blocks { R1} are formed by removing { R2 and R3 }. The metric for the combination of paired group and resource block partition { P2, R1} is 5, while the metric for the combination of paired group and resource block partition { P2, R5, R6} is 6+ 6-12. By analogy, the metric of the combination of the pairing group and the resource block { P5, R4} is 8; the metric for the combination of pair groups and resource blocks P5, R7, R8 is 7+ 8-15.
And comparing the joint metric value of each pair group and the resource block. The maximum value is 15, the combination of the corresponding matched group and the resource block is { P5, R7, R8}, and the combination of the matched group and the resource block { P2, R2, R3}, which meet the resource allocation constraint of the system. Therefore, the combination of the locally optimal pair group and the resource block partition in the round is { P5, R7, R8}, and the metric value thereof is 15. The locally optimal pair group is P5, and the locally optimal resource block is R7, R8.
Step 3.4: pairing group selection resource blocks
Since the locally optimal pairing group and the resource block partition obtained in step 3.3 are combined, the resource block is selected directly according to step 2.3. The result is that the paired group P5 gets resource block { R7, R8} and clears other resource blocks { R4 }; pair P2 clears the round of allocated resource blocks { R1, R5, R6 }.
Step 3.5: and screening a feasible pairing group.
And other pairing groups of repeated users are not arranged in the pairing group which is locally optimal in the round, so that the feasible pairing group is kept unchanged.
In summary, in step 3, the selection result is: the paired group P5 obtains resource blocks { R7, R8 }; unallocated resource blocks are not { R1, R4, R5, R6 }; the feasible pairing group is { P2, P5 }.
And 4, step 4: multiple rounds of selection
Third round of selection
And 4.1, constructing a new measurement matrix. The 1 st, 4 th, 5 th, 6 th row and the 2 nd, 5 th column in the aforementioned measurement matrix (1) form a 6 × 2 measurement matrix selected in the current round as follows
Step 4.2. resource block selection pairing group
According to the new metric matrix (3) and the selection method, the selection result is obtained as follows: the pair P2 is allocated to 3 resource blocks { R1, R5, R6 }; the pair P5 is allocated 3 resource blocks { R4 }.
Step 4.3, determining the combination of the locally optimal matching group and the resource block
The matching group P2 is newly allocated with 3 resource blocks { R1, R5, R6}, and is added with the obtained 2 resource blocks { R2, R3}, so that 5 resource blocks { R1, R2, R3, R5, R6} are total. These 5 resource blocks can be divided into 2 resource block partitions: { R1, R2, R3} and { R5, R6 }. The resource block blocks { R1, R2 and R3} contain the obtained resource blocks { R2 and R3}, and new resource blocks { R1} are formed by removing { R2 and R3 }. The metric for the combination of paired group and resource block partition { P2, R1} is 5, while the metric for the combination of paired group and resource block partition { P2, R5, R6} is 6+ 6-12. By analogy, the metric for the combination of the pair group and the resource block { P5, R4} is 8.
And comparing the joint metric value of each pair group and the resource block. The maximum value of 12, which corresponds to a combination of pairs and resource block partitions of { P2, R5, R6}, together with a combination of pairs and resource block partitions of { P2, R2, R3}, does not satisfy the resource allocation constraints of the system, since the satisfiability of the system resource allocation is hindered by the combination of pairs and resource blocks of { P5, R4 }. Comparing metrics of { P2, R5, R6} and { P5, R4}, { P2, R5, R6} is more optimal, so that { P2, R5, R6} is a combination of a pair group and a resource block which is expected to be locally optimal, while { P5} is a blocking pair group and { R4} is a blocking resource block.
Step 4.4. selecting resource block by pairing group
Since the { P2, R5, R6} obtained in the last step is the combination of the allocation groups and the resource blocks which are expected to become locally optimal, all the resource blocks allocated to the allocation groups are cleared, and the elements corresponding to the combination { P5, R4} of the allocation groups and the resource blocks which are obstructed in the metric matrix are set to be infinite.
Step 4.5. resource block reselecting pairing group
According to the new metric matrix (4) and the selection method, the selection result is obtained as follows: the pair P2 is allocated to 4 resource blocks { R1, R4, R5, R6 }; the pair P5 is not divided into resource blocks.
Step 4.6, determining the combination of the locally optimal matching group and the resource block
The matching group P2 is newly allocated with 4 resource blocks { R1, R4, R5, R6}, and adds the obtained 2 resource blocks { R2, R3}, and there are 6 resource blocks { R1, R2, R3, R4, R5, R6 }. These 6 resource blocks can be divided into 1 resource block partition: { R1, R2, R3, R4, R5, R6 }. The resource block contains the obtained resource blocks { R2, R3}, and new resource blocks { R1, R4, R5, R6} are formed by removing { R2, R3 }. The metric for the combination of pair groups and resource block partitions { P2, R1, R4, R5, R6} is 5+2+6+6 ═ 19. Because no other combination of the matching group and the resource block partition exists, and the combination of the matching group and the resource block partition meets the system resource allocation constraint, the locally optimal matching group and the resource block partition are { P2, R1, R4, R5, R6}, the locally optimal matching group is { P2}, and the locally optimal resource block is { R1, R4, R5, R6 }.
Step 4.7. selecting resource block by pairing group
Since the { P2, R1, R4, R5, R6} obtained in the last step is the combination of the locally optimal matching group and the resource block, the resource block { R1, R4, R5, R6} is obtained by the matching group P2.
In summary, in step 4, the selection result is: the paired group P2 obtains resource blocks { R1, R4, R5, R6 }; there are no unallocated resource blocks.
And at this point, all resource blocks are allocated completely.
The present embodiment further provides a system for scheduling and resource allocation for multiple users in a large-scale antenna system, where the system includes:
the measurement matrix construction module is used for calculating a corresponding measurement matrix according to the measurement definition of the system, and the element value of the measurement matrix is the measurement value when a single resource block is allocated to a single pairing group;
a resource block allocation module, configured to select a pair group for each resource block according to the metric matrix and the maximum metric rule between a single resource block and a single pair group;
a joint determination module of the matching group and the resource block, which is used for determining the joint of the local optimal matching group and the resource block;
the feasible matching group marking module is used for removing other matching groups which have non-zero same users with the local optimal matching group from the whole matching group space according to the fact that users in different matching groups can not have repeated requirements, and marking the remaining matching groups as feasible matching groups;
the resource block allocation detection module is used for detecting whether all resource blocks are allocated completely;
and the mapping relation output module is used for outputting the mapping relation between the resource block and the user pairing group, namely the joint scheduling result.
Aiming at the defects of the prior art, the method and the system for the joint processing of the user pairing and the resource allocation provided by the invention can simultaneously carry out the joint processing in the selectable space and the allocable resource space of the whole user group, and can obtain better performance than the prior art with limited implementation complexity.
In this embodiment, the present embodiment further provides a joint processing terminal, which includes a processor and a memory, where the memory stores program instructions, and the processor executes the program instructions to implement the foregoing processing method for scheduling multiple users and allocating resources in a large-scale antenna system.
In this embodiment, the present embodiment further provides a storage medium having a computer program stored thereon, where the computer program is executed by a processor to implement the foregoing processing method for multiuser scheduling and resource allocation in a large-scale antenna system.
The foregoing embodiments are merely illustrative of the principles and utilities of the present invention and are not intended to limit the invention. Any person skilled in the art can modify or change the above-mentioned embodiments without departing from the spirit and scope of the present invention. Accordingly, it is intended that all equivalent modifications or changes which can be made by those skilled in the art without departing from the spirit and technical spirit of the present invention be covered by the claims of the present invention.
Claims (9)
1. A multi-user scheduling and resource allocation processing method in a large-scale antenna system is characterized by comprising the following steps:
s1, calculating a corresponding measurement matrix according to the measurement definition of the system, wherein the element value of the measurement matrix is the measurement value when a single resource block is allocated to a single pairing group;
s2, according to the measurement matrix, according to the maximum measurement principle between the single resource block and the single matching group, selecting a matching group for each resource block;
s3, determining the combination of the local optimal matching group and the resource block;
s4, for the local optimal matching group, obtaining the corresponding local optimal resource block and clearing other resource blocks;
s5, according to the requirement that users in different matching groups can not have repetition, other matching groups with non-zero same users as the local optimal matching group are removed from the whole matching group space, and the rest matching groups are marked as feasible matching groups;
s6, detecting whether all resource blocks are distributed, if so, turning to S9, and if not, turning to S7;
s7, constructing a new measurement matrix according to the following construction rules: reserving all elements corresponding to resource blocks which are not paired in the previous round, and reserving all elements corresponding to feasible pairing groups in the previous round;
s8, repeating the steps S2-S6 until all resource blocks are distributed;
and S9, outputting the mapping relation between the resource block and the user pairing group, namely the result of the joint scheduling.
2. The method of claim 1, wherein the determining the locally optimal combination of the pair groups and the resource blocks specifically comprises:
calculating a joint measurement value of the matching group and the resource block;
comparing the joint measurement value of each matching group and the resource block; the matching group and the resource block corresponding to the maximum joint metric value are marked as the joint of the locally optimal matching group and the resource block, the matching group is the locally optimal matching group, and the resource block is the locally optimal resource block.
3. The method according to claim 2, wherein the calculating the joint metric of the pair group and the resource block specifically comprises:
if the pairing group is allocated to a single resource block, the joint measurement value of the pairing group and the resource block is the element value allocated to the pairing group by the resource block in the measurement matrix;
if the pairing group is allocated to a plurality of resource blocks, dividing the plurality of resource blocks into blocks of the plurality of resource blocks; the joint metric value of the paired group and the resource block partition is the element value or the sum of the element values allocated to the paired group by a single resource block or a plurality of resource blocks from the resource block partition in the metric matrix.
4. The method for processing multiuser scheduling and resource allocation in a large-scale antenna system according to claim 2 or 3, wherein the method for screening the feasible matching groups comprises: according to the fact that users in different matching groups cannot have repeated requirements, other matching groups with non-zero same users with the local optimal matching group are removed from the space of the whole matching group, and the remaining matching groups are feasible matching groups.
5. The method for processing multiuser scheduling and resource allocation in a large-scale antenna system according to claim 4, wherein the determining of the locally optimal pair group and the combination of resource block partitioning for the (N + 1) th time specifically comprises:
calculating a joint measurement value of the matching group and the resource block;
comparing the joint measurement value of each matching group and the resource block;
if the matching group and the resource block corresponding to the maximum joint metric value meet the resource allocation constraint of the system, marking the corresponding matching group and the resource block as the joint of the locally optimal matching group and the resource block, wherein the matching group is the locally optimal matching group, and the resource block is the locally optimal resource block;
if the matching group and the resource block corresponding to the maximum joint metric value do not meet the resource allocation constraint of the system, if the joint metric value of the matching group and the resource block partitioning is larger than the joint metric values of other matching groups and resource block partitioning which hinder the resource allocation, the system enables the resource block which hinders the resource allocation to make a selection which meets the resource allocation of the system again;
marking the pairing group and the resource block corresponding to the reselected maximum joint metric value as the joint of the locally optimal pairing group and the resource block, wherein the pairing group is the locally optimal pairing group, and the resource block is the locally optimal resource block;
otherwise, the combination of the corresponding matching group and the resource block of the maximum joint metric value is removed, and the combination of the residual matching group and the resource block is sequentially judged.
6. The method of claim 5, wherein if the pair group has obtained one or more resource blocks, the dividing the newly allocated resource block and the obtained resource block into multiple resource block partitions specifically comprises:
if the resource block contains the resource block obtained by the matching group, removing the resource block obtained by the matching group from the resource block to form a new resource block; the joint measurement value of the matched group and the new resource block is the element value or the sum of the element values distributed to the matched group by a single resource block or a plurality of resource blocks from the resource block in the measurement matrix;
if the resource block partition does not contain the resource block obtained by the matching group, the joint measurement value of the matching group and the resource block partition is the element value or the sum of the element values distributed to the matching group by a single or a plurality of resource blocks in the resource block partition in the measurement matrix.
7. A multi-user scheduling and resource allocation processing system in a large-scale antenna system is characterized in that: the system comprises:
the measurement matrix construction module is used for calculating a corresponding measurement matrix according to the measurement definition of the system, and the element value of the measurement matrix is the measurement value when a single resource block is allocated to a single pairing group;
a resource block allocation module, configured to select a pair group for each resource block according to the metric matrix and the maximum metric rule between a single resource block and a single pair group;
a joint determination module of the matching group and the resource block, which is used for determining the joint of the local optimal matching group and the resource block;
the feasible matching group marking module is used for removing other matching groups which have non-zero same users with the local optimal matching group from the whole matching group space according to the fact that users in different matching groups can not have repeated requirements, and marking the remaining matching groups as feasible matching groups;
the resource block allocation detection module is used for detecting whether all resource blocks are allocated completely;
and the mapping relation output module is used for outputting the mapping relation between the resource blocks and the user pairing group under the condition that all the resource blocks are completely allocated, namely the mapping relation is a joint scheduling result.
8. A joint processing terminal comprising a processor and a memory, the memory storing program instructions, characterized in that: the processor executes program instructions to implement the method of any one of claims 1 to 6.
9. A storage medium on which a computer program is stored, which computer program, when being executed by a processor, carries out the method according to any one of claims 1 to 6.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711436254.8A CN108093483B (en) | 2017-12-26 | 2017-12-26 | Multi-user scheduling and resource allocation processing method and system in large-scale antenna system |
| PCT/CN2018/094952 WO2019128183A1 (en) | 2017-12-26 | 2018-07-27 | Multi-user scheduling and resource allocation processing method and system in large-scale antenna system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711436254.8A CN108093483B (en) | 2017-12-26 | 2017-12-26 | Multi-user scheduling and resource allocation processing method and system in large-scale antenna system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108093483A CN108093483A (en) | 2018-05-29 |
| CN108093483B true CN108093483B (en) | 2020-03-10 |
Family
ID=62179445
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711436254.8A Expired - Fee Related CN108093483B (en) | 2017-12-26 | 2017-12-26 | Multi-user scheduling and resource allocation processing method and system in large-scale antenna system |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN108093483B (en) |
| WO (1) | WO2019128183A1 (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108093483B (en) * | 2017-12-26 | 2020-03-10 | 上海无线通信研究中心 | Multi-user scheduling and resource allocation processing method and system in large-scale antenna system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103369688A (en) * | 2012-03-27 | 2013-10-23 | 普天信息技术研究院有限公司 | Resource allocation method for MU-MIMO user pairing |
| CN104702326A (en) * | 2015-03-21 | 2015-06-10 | 西安电子科技大学 | MSE-based (mean square error-based) virtual MIMO (multiple input multiple output) user pairing and resource allocating method |
| WO2016033953A1 (en) * | 2014-09-02 | 2016-03-10 | 中兴通讯股份有限公司 | Resource allocation method and device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108093483B (en) * | 2017-12-26 | 2020-03-10 | 上海无线通信研究中心 | Multi-user scheduling and resource allocation processing method and system in large-scale antenna system |
-
2017
- 2017-12-26 CN CN201711436254.8A patent/CN108093483B/en not_active Expired - Fee Related
-
2018
- 2018-07-27 WO PCT/CN2018/094952 patent/WO2019128183A1/en active Application Filing
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103369688A (en) * | 2012-03-27 | 2013-10-23 | 普天信息技术研究院有限公司 | Resource allocation method for MU-MIMO user pairing |
| WO2016033953A1 (en) * | 2014-09-02 | 2016-03-10 | 中兴通讯股份有限公司 | Resource allocation method and device |
| CN104702326A (en) * | 2015-03-21 | 2015-06-10 | 西安电子科技大学 | MSE-based (mean square error-based) virtual MIMO (multiple input multiple output) user pairing and resource allocating method |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2019128183A1 (en) | 2019-07-04 |
| CN108093483A (en) | 2018-05-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104936186B (en) | Cognitive radio network spectrum allocation method based on cuckoo searching algorithm | |
| Li et al. | Multi-dimensional conflict graph based computing for optimal capacity in MR-MC wireless networks | |
| CN110518956B (en) | Time slot allocation algorithm-based hopping pattern optimization method and device, and storage medium | |
| CN104980389A (en) | Differential new user selection access method applicable to non-orthogonal multi-access system | |
| JP5517701B2 (en) | Resource scheduling method and apparatus for uplink transmission | |
| Naparstek et al. | Fully distributed optimal channel assignment for open spectrum access | |
| CN105554808A (en) | D2D (Device-to-Device) resource distribution method and device in cellular network | |
| JP2008011522A (en) | Method and apparatus for sub-channel allocation | |
| CN104684095A (en) | Resource allocation method based on genetic operation in heterogeneous network convergence scenes | |
| Zhang et al. | An enhanced greedy resource allocation algorithm for localized SC-FDMA systems | |
| CN107994933B (en) | Method for optimizing system capacity of secondary user in cognitive MIMO network | |
| CN108199763B (en) | Repeater satellite method for scheduling task and system | |
| CN109995496B (en) | Pilot frequency distribution method of large-scale antenna system | |
| CN108093483B (en) | Multi-user scheduling and resource allocation processing method and system in large-scale antenna system | |
| Cheng et al. | A systematic study of the delayed column generation method for optimizing wireless networks | |
| CN105163328B (en) | A kind of offsetting pilot position distribution method and device | |
| EP3634065A1 (en) | Systems and methods for reuse of spectrum resources | |
| CN109005593B (en) | Method and equipment for optimizing spectrum allocation | |
| Vieira et al. | Scheduling links for heavy traffic on interfering routes in wireless mesh networks | |
| Cheng et al. | An approximate bandwidth allocation algorithm for tradeoff between fairness and throughput in WSN | |
| Zheng et al. | Optimization model for an Indoor WLAN-based Positioning System | |
| CN106575983B (en) | Method and apparatus for switching control region in wireless communication system | |
| Rouskas et al. | Minimization of frequency assignment span in cellular networks | |
| KR101717921B1 (en) | Method and Apparatus for Scheduling Resource Allocation for Wireless Communication System | |
| CN107548068B (en) | Method and system for realizing wireless carrier frequency resource pool allocation |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20200310 Termination date: 20201226 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |