CN106793120B - Splitting number-based rapid joint resource allocation method in virtual MIMO system - Google Patents

Splitting number-based rapid joint resource allocation method in virtual MIMO system Download PDF

Info

Publication number
CN106793120B
CN106793120B CN201611204196.1A CN201611204196A CN106793120B CN 106793120 B CN106793120 B CN 106793120B CN 201611204196 A CN201611204196 A CN 201611204196A CN 106793120 B CN106793120 B CN 106793120B
Authority
CN
China
Prior art keywords
user
matrix
pairing
resource allocation
equal
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
Application number
CN201611204196.1A
Other languages
Chinese (zh)
Other versions
CN106793120A (en
Inventor
卢小峰
郭惠
范宁
李文娜
刘博文
赵丹萍
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xian University of Electronic Science and Technology
Original Assignee
Xian University of Electronic Science and Technology
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Xian University of Electronic Science and Technology filed Critical Xian University of Electronic Science and Technology
Priority to CN201611204196.1A priority Critical patent/CN106793120B/en
Publication of CN106793120A publication Critical patent/CN106793120A/en
Application granted granted Critical
Publication of CN106793120B publication Critical patent/CN106793120B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/0453—Resources in frequency domain, e.g. a carrier in FDMA
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/02—Arrangements for optimising operational condition

Landscapes

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

Abstract

The invention discloses a split number-based rapid joint resource allocation method in a virtual MIMO system in the field of wireless communication. The method mainly solves the problems of non-fixed user pairing and resource allocation when the number of users is large. The technical scheme is as follows: constructing a complete resource block allocation set and a user group splitting number set; constructing a split number-based rapid joint resource allocation model in a virtual MIMO system, and solving by using a greedy algorithm-based Hungary algorithm; obtaining user pairing and resource allocation results; modulating the user information according to the result and the user modulation matrix; and the modulated information is sent to a receiver on the resource blocks allocated to the users, so that user grouping and resource allocation are completed. The invention quickly performs non-fixed number multi-user pairing based on the user grouping of the splitting number, and solves the problem from local optimization to global optimization in the distribution model. The invention maximizes the frequency utilization rate of the system and improves the communication quality of the system under the condition of low calculation complexity. For virtual MIMO system communication.

Description

Splitting number-based rapid joint resource allocation method in virtual MIMO system
Technical Field
The invention belongs to the technical field of communication, and further relates to a virtual multiple-input multiple-output (MIMO) resource allocation method, in particular to a split number-based rapid resource allocation method. For use in the uplink of a virtual MIMO system.
Background
Multiple-input multiple-output MIMO technology has been widely used to improve spectral efficiency in various wireless communication systems. However, the MIMO technology is limited in its uplink application due to difficulties in practical operation such as cost and size of the user equipment. In order to solve the problem, researchers have proposed a method of virtual MIMO, which effectively solves the problem of cost and size limitation of user equipment, that is, two or more users are paired in an uplink, and a single transmitting antenna is deployed for each paired user in the same frequency band and time slot. Therefore, user pairing and resource allocation are key to directly affect the performance of the mimo system.
Most of the existing resource allocation technologies consider the optimal resource allocation, and when a user is paired with a certain user, generally, one or more users are selected from all the users, that is, a fixed number of user pairs are performed by using the ergodicity. The ergodic algorithm performs pairing search on all users, so that the algorithm is complex. The fixed number of user pairs has the problem that the user pairs according to the actual utilization condition of the channel, which causes unnecessary waste of system resources. And allocating resources after the users are paired, namely allocating resource blocks to the matched user pairs by taking the maximum utilization rate of the system frequency spectrum as an optimization target. The main problem is that the existing method does not consider the computational complexity. Especially, as the number of users increases gradually, the operation time of the system is significantly increased, which results in low system efficiency, and when the number of users reaches a certain value, the existing algorithm can hardly be implemented.
In summary, with the increase of mobile users and the increase of user services, the user pairing and resource allocation algorithm of the existing virtual multiple-input multiple-output MIMO system does not consider the non-fixed user pairing situation, resulting in low system spectrum utilization rate; and algorithm optimization is excessively pursued, so that the calculation complexity is high, and the system efficiency is low.
Disclosure of Invention
Aiming at the defects of the prior art, the invention provides a quick joint resource allocation method based on the split number in a virtual MIMO system, which has low algorithm complexity, fully utilizes spectrum resources and has higher communication quality.
The implementation scheme comprises the following steps:
(1) base station obtains basic parameters
A base station obtains a set l of users to be paired, a number Nu of users to be paired, a set r of resource blocks, the number N of the resource blocks and the number Nr of receiving antennas of a current time slot;
(2) constructing complete resource block allocation set and resource allocation constraint matrix
Forming a complete resource block distribution set P according to the number N of the resource blocks; generating a resource block distribution mode matrix T according to the complete resource block distribution set P to obtain a resource distribution constraint matrix:wherein 1 isNThe vector with the length same as the number N of the resource blocks and the element values equal to 1 is represented,represents an operation of solving a kronecker product;
(3) constructing user group split number set and user split number pairing constraint matrix
(3.1) constructing user group split number set
According to the number Nu of users to be paired, dividing the users to be paired into user groups of which the number of users does not exceed the Nu, and obtaining a user number set A; according to the number Nr of the receiving antennas, removing a set with the number of users being larger than Nr in the user number set A, and generating a user group splitting number set G;
(3.2) constructing a user split number pairing constraint matrix
Generating a user split number pairing mode matrix B according to the user group split number set G to obtain a user split number pairing constraint matrix:wherein 1 isNuA vector with the length equal to the number Nu of users to be paired and the element value equal to 1 is represented;
(4) constructing a user modulation order matrix and a user group capacity matrix
Generating a user modulation order matrix M with the size of N x Nu rows and Na columns and a user group capacity matrix psi with the size of N rows and Na columns through iteration, wherein the Na value is equal to the number of elements in the user group splitting number set G;
(5) calculating a user capacity vector
Obtaining a capacity vector eta according to the resource block distribution mode matrix T and the user group capacity matrix psi;
(6) rapid joint resource allocation model based on split number in virtual MIMO system construction
And (3) constructing a user pairing and resource allocation system model by taking the resource allocation constraint matrix C1, the user pairing constraint matrix C2 and the capacity vector eta obtained in the step (5) as parameters:
s.t.C1x≤1N
C2x≤1Nu
where x represents an indicator vector of user pairing and resource allocation, ηTx represents the system capacity value, 1NRepresenting a vector of length N and elements all equal to 1,1NuRepresents a vector of length Nu and elements all equal to 1 (.)TIt is shown that the transpose operation,an operation of finding x that maximizes the value in the parentheses;
(7) solving a user pairing and resource allocation system model by using a Hungarian algorithm based on a greedy algorithm, and acquiring user pairing and resource allocation results
Acquiring the channel capacity of each resource model in the corresponding complete resource block distribution set P by traversing each user grouping condition in the user group splitting number set G, obtaining an optimal result of the local channel capacity by a Hungary algorithm based on a greedy algorithm, and storing the result in the set C; performing Hungarian algorithm on the set C again to obtain a globally optimal result vector U of user pairing and resource allocation;
(8) modulating data information of service required by user
According to the result vector U of user pairing and resource allocation and the user modulation order matrix M, modulating the information carried by each user, and then sending the information modulated by each user to a signal receiver of a base station in a resource block allocated to the user to complete the user pairing and resource allocation of the time slot user stream;
(9) continuing the scheduling assignment of the next time slot
Judging whether a user stream of the next time slot exists, if so, selecting the user stream of the next time slot, and returning to the step (1) for user pairing and resource allocation of the user stream of the next time slot; otherwise, completing the user pairing and resource allocation of all the user flows.
The specific idea of the invention for achieving the above purpose is to use the splitting number to quickly obtain user groups, and to use the greedy algorithm-based Hungary algorithm to solve through the user pairing constraint matrix, the resource allocation constraint matrix and the user pair capacity vector to obtain the optimal user pairing result and resource allocation result with low computation complexity.
Compared with the prior art, the invention has the following advantages:
firstly, the invention combines the user pairing problem and the resource allocation problem to consider simultaneously by a method of combining the user pairing and the resource allocation model, thereby overcoming the problem that the user pairing and the resource allocation can not be carried out simultaneously in the prior art and also overcoming the problem that the fixed user pairing can only be carried out in the prior art, so that the invention can efficiently carry out the user pairing and the resource allocation simultaneously, and further maximize the frequency utilization rate of the system;
secondly, the invention overcomes the problem that the prior art can not carry out non-fixed user pairing in the user pairing process by using the user pairing method based on the splitting number, so that the invention can maximize the frequency utilization rate of the system and further improve the communication quality of the system;
thirdly, the invention overcomes the problem of high complexity of repeated traversal in the user pairing process in the prior art by using the user pairing method based on the splitting number, so that the invention can still carry out user pairing quickly when the number of users is high, thereby greatly reducing the system calculation complexity.
Description of the drawings:
FIG. 1 is a schematic flow diagram of the present invention;
FIG. 2 is a graph showing the comparison of the spectrum utilization simulation of the system after the user pairing and resource allocation are performed by the present invention and the existing fixed user grouping method;
fig. 3 is a simulation comparison graph of spectrum utilization of the system after user pairing and resource allocation when the number of users is large or small by using the present invention and the existing fixed user grouping method.
Detailed Description
The invention is described in detail below with reference to the accompanying drawings:
example 1
With the increase of the number of communication users and the increasing tension of spectrum resources, the prior art cannot realize more efficient utilization of the spectrum for the selection of users and the allocation of resource blocks, so the invention provides a scheme of user pairing and resource allocation based on the split number. Where a base station is involved, multiple users, resource blocks, associated with the base station, are implemented in a virtual MIMO system.
The invention relates to a method for fast joint resource allocation based on split number in a virtual MIMO system, which is shown in figure 1 and comprises the following steps,
(1) base station obtains basic parameters
The base station obtains a set l of users to be paired, a number Nu of users to be paired, a set r of resource blocks, the number N of the resource blocks, the number Nr of receiving antennas and the like of the current time slot of the cell. Preparation is made for later forming of user sets and resource block sets.
(2) Constructing complete resource block allocation set and resource allocation constraint matrix
According to the number N of resource blocks in the cell, a complete resource block allocation set P is formed by adjacent resource blocks; generating according to the complete resource block allocation set PForming a resource block distribution mode matrix T to obtain a resource distribution constraint matrix:wherein 1 isNThe vector with the length same as the number N of the resource blocks and the element values equal to 1 is represented,the operation of calculating the kronecker product is shown. To ensure that one resource block is allocated to only one user group.
(3) Constructing user group split number set and user split number pairing constraint matrix
(3.1) constructing user group split number set
According to the number Nu of users to be paired, dividing the users to be paired into user groups of which the number of users does not exceed the Nu, and obtaining a user number set A; and then according to the number Nr of the receiving antennas, removing the set of the user number in the user number set A, wherein the user number is larger than the Nr, and generating a user group splitting number set G.
(3.2) constructing a user split number pairing constraint matrix
Generating a user split number pairing mode matrix B according to the user group split number set G to obtain a user split number pairing constraint matrix:wherein 1 isNuAnd the vector with the length equal to the number Nu of the users to be paired and the element value equal to 1 is represented.
The invention utilizes the user pairing method based on the splitting number, thereby overcoming the problem that the prior art can not carry out non-fixed user pairing in the user pairing process, ensuring that the invention can maximize the frequency utilization rate of the system, and further improving the communication quality of the system.
(4) Constructing a user modulation order matrix and a user group capacity matrix
A user modulation order matrix M of size N x Nu rows and Na columns and a user group capacity matrix ψ of size N rows and Na columns are generated by iteration, where Na is numerically equal to the number of elements in the user group split set G. In preparation for later calculation of the user capacity vector.
(5) Calculating a user capacity vector
And (4) obtaining a capacity vector eta according to the resource block distribution mode matrix T obtained in the step (2) and the user group capacity matrix psi obtained in the step (4). The user group capacity reflects the quality of the user pairing condition, and the result obtained by multiplying the user capacity vector and the user pairing vector can be used as the standard of optimal user pairing.
(6) Rapid joint resource allocation model based on split number in virtual MIMO system construction
And (3) constructing a user pairing and resource allocation system model by taking the resource allocation constraint matrix C1 obtained in the step (2), the user pairing constraint matrix C2 obtained in the step (3) and the capacity vector eta obtained in the step (5) as parameters:
s.t.C1x≤1N
C2x≤1Nu
where x represents an indicator vector of user pairing and resource allocation, ηTx represents the system capacity value, 1NRepresenting a vector of length N and elements all equal to 1,1NuRepresents a vector of length Nu and elements all equal to 1 (.)TIt is shown that the transpose operation,the operation of finding x that maximizes the value in parentheses is shown, and a split number-based fast joint resource allocation model in the virtual MIMO system of the present invention is established.
The model is simple in form, and on the basis of ensuring that a resource block is only allocated to one user group and one user only occupies one resource model, the user capacity obtained by the user pairing method based on the splitting number is maximum, namely the user pairing condition based on the splitting number is optimal. (7) And solving a split number-based rapid joint resource allocation model in the virtual MIMO system by using a greedy algorithm-based Hungarian algorithm, wherein the model can be referred to as a user pairing and resource allocation system model for short, and acquiring user pairing and resource allocation results.
Firstly, a user grouping and resource distribution result matrix C is established, the row vector of the matrix is a user grouping, and the longitudinal vector of the matrix is a resource block model. And then, acquiring the channel capacity of each resource model in the corresponding complete resource block distribution set P by traversing each user grouping condition in the user group splitting number set G, obtaining the optimal result of the local channel capacity of the virtual MIMO system by a Hungary algorithm based on a greedy algorithm, and storing the optimal result in a user grouping and resource distribution result matrix C. And performing Hungarian algorithm on the user grouping and resource allocation result matrix C for the second time to obtain a globally optimal user pairing and resource allocation result vector U of the virtual MIMO system.
According to the invention, the user pairing problem and the resource allocation problem are considered simultaneously by combining the user pairing problem and the resource allocation problem through a method of a combined model of user pairing and resource allocation, so that the problem that the user pairing and the resource allocation cannot be carried out simultaneously in the prior art is solved, and the problem that only fixed user pairing can be carried out in the prior art is also solved, so that the user pairing and the resource allocation can be carried out simultaneously with high efficiency, and the frequency utilization rate of the system is further maximized. In addition, the invention utilizes the splitting number to carry out user grouping without iteration on all user grouping conditions, and overcomes the problem of high complexity of repeated traversal calculation in the user pairing process in the prior art, so that the invention can still carry out user pairing quickly when the number of users is increased and higher, and greatly reduces the system calculation complexity.
(8) Modulating data information of service required by user
And (4) carrying out quadrature amplitude modulation on the information carried by each user according to the result vector U of user pairing and resource allocation and the user modulation order matrix M obtained in the step (4), and then sending the information after quadrature amplitude modulation of each user to a signal receiver of the base station in the resource block allocated to the user to complete user pairing and resource allocation of the user stream of the time slot. To this end, the steps (1) to (8) complete the user pairing and resource allocation for one time slot.
(9) Continuing the scheduling assignment of the next time slot
Judging whether a user stream of the next time slot exists, if so, selecting the user stream entering the next time slot, and returning to execute the step (1) to carry out user pairing and resource allocation of the user stream of the next time slot; otherwise, that is, there is no user stream in the next time slot, the user pairing and resource allocation for all user streams in the virtual MIMO system are completed.
Because the invention uses the user pairing method based on the splitting number to jointly consider the user pairing and the resource allocation for the non-fixed user grouping, the problems that the prior art repeatedly traverses the user grouping conditions under all conditions in the user pairing process, has high calculation complexity and can not fully utilize the frequency spectrum are solved. The invention can still quickly pair the users when the number of the users is increased to be higher, thereby greatly reducing the calculation complexity of the system and improving the utilization rate of the frequency spectrum of the system.
Example 2
The method for fast allocating joint resources based on split numbers in a virtual MIMO system is the same as that in embodiment 1, wherein in step (3.1), a user group split number set G is formed according to the number Nu of users to be paired, and taking Nu as an example of 5, the method includes the following steps:
3.1a) generating an initial user integer partition matrix Q with elements of 00。
3.1b) the number Nu of users is divided into integers by 5, i.e. the positive integer 5 is represented as the sum of several positive integers, regardless of the order of their summation. The user integer partition matrix Q is put into the user integer partition result vector (1,1,1,1,1), (2,1,1,1,0), (2,2,1,0,0), (3,1,1,0,0), (3,2,0, 0), (4,1,0,0,0), (5,0,0, 0) as a row vector0In (1).
3.1c) removing zero elements in the user number splitting result vector to obtain (1,1,1,1,1), (2,2,1), (3,1,1), (3,2), (4,1) and (5), and obtaining a user integer splitting set Q.
3.1d) generating an initial set of user groups A with elements of 0.
3.1e) at 5 to be pairedSelecting 1 user from the users, and putting the numbers of the users as elements into a user group set A1,1In (1).
3.1f) selecting 1 user from the remaining 4 users to be paired, and putting the numbers of the users as elements into the user group set A1,2In (1).
3.1g) repeating steps 3.1e) and 3.1f) until the user number splitting result vector (1,1,1,1,1) is completed, so that the user group set A is1And (4) completing.
3.1h) repeating the steps 3.1c), 3.1d) and 3.1e) until the user number splitting result vectors (1,1,1,1,1), (2,2,1), (3,1,1), (3,2), (4,1) and (5) are all completed, so that the user group set A is complete.
3.1G) removing the set with the number of users in the user group set A being larger than the number of antennas Nr being 4, namely the user group set with the user number splitting result vector being (5), and obtaining a user group splitting number set G.
And finishing the steps to obtain a user group splitting number set for subsequently generating a user pairing mode matrix. The user grouping obtained quickly by the splitting number contains the user grouping situation in all the virtual MIMO systems, and the number of the users in all the user groupings is not fixed, namely the user groupings are not fixed.
Example 3
The method for fast joint resource allocation based on the split number in the virtual MIMO system is the same as that in embodiment 1-2, wherein the generating of the user pairing mode matrix B in step (3.2) is to generate the user pairing mode matrix B according to the selectable user pair set G, and includes the following steps:
3.2a) generate an initial user pairing pattern matrix B with Nu ═ 5 rows, Na columns, and elements all 00Where Na is equal to the number of elements in the user group split set G, i.e.
3.2b) determining whether the p-th element of the user group split number set G contains a serial number equal to liIf yes, let the user pair the pattern matrix B0L. 1iRow, p-th columnIs equal to 1, otherwise it is made equal to 0.
3.2c) initial user pairing pattern matrix B to which element values are assigned0As the final user pairing pattern matrix B.
The user pairing mode matrix required by the invention is completed, and the users contained in each user group based on the split number are defined so as to be used for subsequently establishing a split number-based rapid joint resource allocation model in a virtual MIMO system.
The invention reduces the calculation complexity and ensures the bit error rate of the system and the maximum spectrum utilization rate of the system on the basis of dynamically adjusting the user pairing and the resource allocation in the system and realizing the self-adaptive modulation of the user.
Example 4
The method for fast joint resource allocation based on the split number in the virtual MIMO system is the same as the embodiment 1-3, wherein the step (4) of constructing a user modulation order matrix and a user group capacity matrix comprises the following steps:
4a) let u be 1 and h be 1, and generate an initial user modulation order matrix M with N × Nu rows and Na columns, and elements all equal to 00(ii) a Simultaneously generating an initial user group capacity matrix psi with the size of N rows and Na columns and the elements equal to 00。
4b) Let k be 1, select the u-th user group from the user group split set G.
4c) Calculating the SINR value of the kth user in the kth user group on the h resource block according to the following formulau,k,h：
Wherein E iskRepresenting the transmission power, σ, of the k-th user2Indicating the channel noise power, ζ, of the current time slotu,hIndicating the channel matrix of the u-th user group on the h-th resource block, InAn identity matrix of n rows and n columns is represented, n represents the number of users in the u-th user group, (-)HRepresenting Hermite transpositionOperation, (.)-1Represents the inverse operation [ ·]k,kRepresenting the elements of the k-th row and the k-th column of the matrix.
4d) Under the condition of giving a bit error rate threshold value b, calculating the modulation order of the kth user in the kth user group on the h resource block according to the following formulaAnd apply the samePut into matrix M0(h-1) Nu + lkLine, v th1Column in which v1Is equal in value to u, lkNumber representing kth user:
where b is the preset threshold value of the bit error rate of the system, floor (·) represents the rounding-down operation, log2(. cndot.) denotes a base-2 logarithmic operation, and ln (. cndot.) denotes a natural logarithmic operation.
4e) And judging whether k is equal to the number n of users in the u-th user group, if so, executing 4f), otherwise, making k equal to k +1, and returning to 4 c).
4f) Judging whether the modulation order of each user in the u user group is not equal to 0, if so, adding the modulation orders of all users in the u user group to obtain the capacity of the u user group; otherwise, the capacity of the u user group is equal to 0; then the capacity value of the u-th user group is put into the matrix psi0V. of (b)2Line, v th3Column in which v2Is numerically equal to h, v3Equal in value to u, perform 4 g).
4g) Judging whether u is equal to Na or not, if so, executing for 4 h); otherwise, let u be u +1, return to 4 b).
4h) Judging whether h is equal to N, if so, assigning an initial user modulation order matrix M with element values0As final user modulation order matrix M and will be assigned element valuesInitial user capacity matrix psi0As the final user capacity matrix ψ, end; otherwise, let h be h +1 and u be 1, return to 4 b).
The user modulation order matrix and the user group capacity matrix required by the invention are completed, and the capacity of each user group is defined for subsequent calculation of the user capacity vector.
Example 5
The method for fast joint resource allocation based on the split number in the virtual MIMO system is the same as the embodiment 1-4, wherein the Hungarian algorithm based on the greedy algorithm is utilized to solve the user pairing and resource allocation system model in the step (7), and the user pairing and resource allocation result is obtained, and the method comprises the following steps:
7a) generating an all-zero matrix C of Na rows and Z columns0And Na is equal to the number of elements in the user group splitting number set G, and Z is equal to the number of elements in the complete resource block allocation set P.
7b) And (4) grouping any user in the user group splitting number set G, and solving the channel capacity of each resource model in the corresponding complete resource block allocation set P. Obtaining a resource model with optimal local correspondence by using the Hungarian algorithm, and calculating a matrix C0Wherein the element corresponding to this pairing case is equal to 1.
7c) Repeating the operation of 7b) until the matrix C0And (4) each row of the user group has an element 1, so that the resource model corresponding to each user group in the user group splitting number set G is obtained. Initial matrix C to be assigned element values0And obtaining a final local optimal user pairing and resource allocation result matrix C.
7d) And processing the locally optimal user pairing and resource allocation result matrix C by using the Hungarian algorithm to obtain a globally optimal user pairing and resource allocation result matrix U.
And finishing the steps to obtain a globally optimal user pairing and resource allocation result matrix of the virtual MIMO system. The method solves the user pairing and resource allocation system model by using the greedy algorithm, combines the user pairing problem and the resource allocation problem and simultaneously considers the user pairing problem and the resource allocation problem, and does not need to calculate all user grouping conditions.
The invention is further illustrated by the following full examples.
Example 6
The method for allocating fast joint resources based on the split number in the virtual MIMO system is the same as embodiments 1 to 5, referring to fig. 1, and the specific implementation steps of the present invention are described as follows:
step 1, the base station obtains a user set l to be paired, a user number Nu to be paired, a resource block set r, a resource block number N6 and a receiving antenna number Nr 4 of a current time slot.
The set l of users to be paired is represented as: l ═ l1,l2,…,li,…,l32In which liNumber representing the ith user to be paired, i ∈ [1,32 ]]；
The resource block set r is represented as: r ═ r { [ r ]1,r2,r3,…r6Wherein r isjNumber indicating the jth resource block, j ∈ [1,6 ]]。
And 2, forming a complete resource block distribution set P according to the resource block set r and the number N of the resource blocks.
2a) Generating a null initial complete resource block allocation set P with an initial value of zero0。
2b) In resource block set r ═ { r ═ r1,r2,r3,r4Selecting 1 resource block, and putting the number of the resource block as an element into P0In (1).
2c) 2 continuous resource blocks are selected from the resource block set r, and 2 serial numbers of the 2 continuous resource blocks are taken as an element to be put into P0In (1).
2d) Selecting 3 continuous resource blocks in the resource block set r, and putting 3 serial numbers of the 3 continuous resource blocks as another element into P0In (1).
2e) Selecting 4 continuous resource blocks in the resource block set r, and putting 4 serial numbers of the 4 continuous resource blocks as a further element into P0In (1).
2f) Repeating the steps 2b), 2c), 2d) and 2e) until all resource blocks in the resource block set r are selectedPossible combinations of resource blocks and combinations of consecutive resource blocks that do not repeat with each other. When empty initial complete resource block allocation set P0And after the assignment is completed, the resource block is taken as a complete resource block allocation set P.
And 3, generating a complete resource block distribution mode matrix T according to the complete resource block distribution set P.
3a) Generating an initial resource block allocation pattern matrix T with N rows, Z columns and 0 elements0Wherein Z is equal to the number of elements in the complete resource block allocation set P.
3b) Judging whether the q-th element in the complete resource block allocation set P contains a number equal to rjIf so, let T0Middle rjThe elements of row, q column are equal to 1; otherwise, it is made equal to 0.
3c) Initial resource block allocation pattern matrix T to be assigned with element values0As the final resource block allocation pattern matrix T.
And 4, generating a user group splitting number set G according to the user set l to be paired and the receiving antenna number Nr.
4a) The number Nu of users is subjected to integer splitting, namely, a positive integer Nu is expressed as the sum of a plurality of positive integers, and the summation sequence is not considered. Splitting the result vector for each type of userAnd putting the ith row vector into a user integer splitting matrix Q.
4b) Removing user number split result vectorsTo obtain qi＝{qi,1,qi,2,…,qi,WTherein 0<qi,1≤qi,2≤…≤qi,WNu is not more than Nu, W is not more than Nu. This operation is repeated until each row in the matrix Q is executed, resulting in a new user integer split set Q.
4c) Selecting q users from Nu users to be pairedi,1The numbers of the users are taken as elements to be put into the user group set Ai,1In (1).
4d) In the remaining Nu-qi,1Selecting q users from the users to be pairedi,2The numbers of the users are taken as elements to be put into the user group set Ai,2In (1).
4e) Repeating steps 4c) and 4d) until the set of user groups AiAnd (4) completing.
4f) Repeating steps 4c), 4d) and 4e) until the user group set a is complete.
4g) Removing the user number q in the user group set Ai,WAnd obtaining a user group splitting number set G when the number of the antennas Nr is larger than the set of the antenna number Nr.
Step 5, generating a user pairing mode matrix B according to the user group split number set G
5a) Generating an initial user pairing mode matrix B with Nu rows and Na columns and 0 elements0And Na is equal to the number of elements in the user group splitting number set G.
5b) Judging whether the p-th element of the user group splitting number set G contains a serial number equal to liIf yes, let the user pair the pattern matrix B0L. 1iThe row, column p, element is equal to 1, otherwise, it is made equal to 0.
5c) Pairing the initial users with element values to the pattern matrix B0As the final user pairing pattern matrix B.
And 6, generating a user modulation order matrix M with the size of N × Nu rows and Na columns and a user group capacity matrix psi with the size of N rows and Na columns through iteration
6a) Let u be 1 and h be 1, and generate an initial user modulation order matrix M with N × Nu rows and Na columns, and elements all equal to 00(ii) a Simultaneously generating an initial user group capacity matrix psi with the size of N rows and Na columns and the elements equal to 00。
6b) Let k be 1, select the u-th user group from the user group split set G.
6c) Calculating the SINR value of the kth user in the kth user group on the h resource block according to the following formulau,k,h：
Wherein E iskRepresenting the transmission power, σ, of the k-th user2Indicating the channel noise power, ζ, of the current time slotu,hIndicating the channel matrix of the u-th user group on the h-th resource block, InAn identity matrix of n rows and n columns is represented, n represents the number of users in the u-th user group, (-)HRepresents Hermite transposition operations, (.)-1Represents the inverse operation [ ·]k,kRepresenting the elements of the k-th row and the k-th column of the matrix.
6d) Under the condition of giving a bit error rate threshold value b, calculating the modulation order of the kth user in the kth user group on the h resource block according to the following formulaAnd apply the samePut into matrix M0(h-1) Nu + lkLine, v th1Column in which v1Is equal in value to u, lkNumber representing kth user:
where b is the preset threshold value of the bit error rate of the system, floor (·) represents the rounding-down operation, log2(. cndot.) denotes a base-2 logarithmic operation, and ln (. cndot.) denotes a natural logarithmic operation.
6e) And judging whether k is equal to the number n of users in the u-th user group, if so, executing 6f), otherwise, making k equal to k +1, and returning to 6 c).
6f) Judging whether the modulation order of each user in the u user group is not equal to 0, if so, adding the modulation orders of all users in the u user group to obtain the capacity of the u user group; otherwise, the capacity of the u user group is equal to 0; then the obtained u-th user groupCapacity value of into the matrix psi0V. of (b)2Line, v th3Column in which v2Is numerically equal to h, v3Equal in value to u, perform 6 g).
6g) Judging whether u is equal to Na, if so, executing for 6 h); otherwise, let u be u +1, return to 6 b).
6h) Judging whether h is equal to N, if so, assigning an initial user modulation order matrix M with element values0As final user modulation order matrix M, and initial user capacity matrix psi to which element values are assigned0As the final user capacity matrix ψ, end; otherwise, let h be h +1 and u be 1, return to 6 b).
Step 7, obtaining a capacity vector eta according to the resource block distribution mode matrix T and the user group capacity matrix psi
7a) Let tau be 1,And generating an initial capacity vector η of length Na x Z, elements all equal to 00。
7b) Transposing the τ th column data of the user capacity matrix ψ to obtain the row vector and the resource allocation matrix TMultiplying the column data and assigning the product to the initial capacity vector eta0To (1)And (4) each element.
7c) Judging whether tau is equal to Na or not, if yes, executing 7 d); otherwise, let τ be τ +1, return to 7 b).
7d) Judgment ofIf the initial capacity vector eta is equal to Z, if so, the assigned initial capacity vector eta is used0As a user capacity vector η; otherwise, it ordersτ is 1, return 7 b).
Step 8, constructing a virtual MIMO system user pairing and resource allocation system model according to the resource allocation constraint matrix, the user pairing constraint matrix and the capacity vector eta:
s.t.C1x≤1N
C2x≤1Nu
where x represents an indicator vector of user pairing and resource allocation, ηTx represents the system capacity value, 1NRepresenting a vector of length N and elements all equal to 1,1NuRepresents a vector of length Nu and elements all equal to 1 (.)TIt is shown that the transpose operation,this represents an operation of finding x that maximizes the value in parentheses.
Step 9, solving a user pairing and resource allocation system model by using a greedy algorithm-based Hungary algorithm, and acquiring user pairing and resource allocation results
9a) Generating an all-zero matrix C of Na rows and Z columns0And Na is equal to the number of elements in the user group splitting number set G, and Z is equal to the number of elements in the complete resource block allocation set P.
9b) And (4) grouping any user in the user group splitting number set G, and solving the channel capacity of each resource model in the corresponding complete resource block allocation set P. Obtaining a resource model with optimal local correspondence by using the Hungarian algorithm, and calculating a matrix C0Wherein the element corresponding to this pairing case is equal to 1.
9c) Repeating the operation of 9b) until the matrix C0And (4) each row of the user group has an element 1, so that the resource model corresponding to each user group in the user group splitting number set G is obtained. Initial matrix C to be assigned element values0And obtaining a final local optimal user pairing and resource allocation result matrix C.
9d) And processing the locally optimal user pairing and resource allocation result matrix C by using the Hungarian algorithm to obtain a globally optimal user pairing and resource allocation result matrix U.
Step 10, utilizing the result vector U of user pairing and resource allocation and the user modulation order matrix M to modulate the information carried by each user
10a) Let δ be 1.
10b) Taking out the elements which are not equal to 0 from the (delta-1) × Nr +1 to (delta-1) × Nr + Nr elements of the result vector U of the user pairing and the resource allocation, and setting the elements as U1,u2,…,uγ,…,udWherein u isγThe Gamma element which is not equal to 0 in the (delta-1) × Nr +1 to (delta-1) × Nr + Nr elements of the result vector U representing the user pairing and the resource allocation, and the Gamma is the [1, d ]]D is equal to the total number of elements not equal to 0 in the (δ -1) × Nr +1 to (δ -1) × Nr + Nr elements of the result vector U of user pairing and resource allocation.
10c) According to u1,u2,…,uγ,…,udThe number w of the user pair is calculated according to the following formula:
wherein, C represents the operation of taking the number of combinations.
10d) Let γ equal to 1.
10e) Taking the (delta-1) × Nu + u in the user modulation order matrix MγLine and firstElement m of columnγIs equal to u as a numberγOf users of (1) is equal to u for the numberjThe data information carried by the user carries out mγQuadrature amplitude modulation of order, in whichThe value is equal to the number w of the user pair.
10f) And judging whether the gamma is equal to d, if so, executing 10g), and if not, making the gamma equal to gamma +1 and returning to 10 e).
10g) Judging whether the delta is equal to N, if so, ending the circulation; otherwise, let δ be δ +1, return to 10 b).
Step 11, judging whether a user stream of the next time slot exists, if so, selecting the user stream of the next time slot, and returning to the step 1; otherwise, completing the user pairing and resource allocation of all the user flows.
According to the method, the non-fixed number of multi-user pairing is rapidly carried out on the user grouping based on the splitting number, the local optimum is firstly obtained in the process of solving the split number-based rapid combined resource allocation model in the virtual MIMO system by using the greedy algorithm, and the global optimum is further obtained. The invention maximizes the frequency utilization rate of the system and improves the communication quality of the system under the condition of low calculation complexity.
The effects of the invention can be further illustrated by simulation:
example 7
The method for allocating fast joint resources based on the split number in the virtual MIMO system is the same as that in embodiments 1 to 6.
Simulation conditions are as follows:
the implementation process of the invention relates to a base station, and multiple users and resource blocks associated with the base station are implemented in a virtual MIMO system. Based on the situation, simulation is carried out in a wireless communication scene of a plurality of base stations, the number of users to be paired is set to be 32, the number of receiving antennas is set to be 4, the number of resource blocks is set to be 6, and the simulation experiment of the invention sets the detection mode of a signal receiver to be minimum mean square error detection and assumes that a channel matrix is unchanged in a single time slot. The performance of the existing fixed 2 user grouping and fixed 3 user pairing and resource allocation method and the method of the invention in the aspects of system spectrum utilization rate, more user number and less user number, spectrum utilization rate are compared in simulation experiments.
Simulation content:
simulation 1, according to the simulation conditions, respectively using the split number-based fast joint resource allocation method in the virtual MIMO system and the existing fixed 2 user and fixed 3 user grouping and resource allocation method to perform spectrum utilization simulation of the virtual MIMO system, with the simulation result as shown in fig. 2.
And (3) simulation results:
as can be seen from fig. 2: the frequency spectrum utilization rate obtained by the method is obviously higher than that of the existing method. When the signal-to-noise ratio is 0-3dB, the frequency spectrum utilization rate obtained by the existing method is not much different from that obtained by the method of the invention; when the signal-to-noise ratio is larger than 3dB, the spectrum efficiency obtained by the method is obviously higher than that obtained by the existing method, when the signal-to-noise ratio reaches 24dB, the spectrum efficiency obtained by the method reaches 25bit/s/Hz, the spectrum efficiency obtained by the existing fixed 3 user grouping and resource allocation method is 21bit/s/Hz, and the spectrum efficiency obtained by the existing fixed 2 user grouping and resource allocation method only reaches 17 bit/s/Hz. This shows that the split number-based fast joint resource allocation method in the virtual MIMO system according to the present invention can maximize the spectrum utilization of the system compared to the existing fixed 2 user and fixed 3 user grouping and resource allocation methods.
Example 8
The method for allocating fast joint resources based on the split number in the virtual MIMO system is the same as embodiments 1 to 6, and the simulation conditions and the simulation contents are the same as embodiment 7, wherein when the number of the simulation users is large, the number of the users to be paired is 32, and when the number of the simulation users is small, the number of the users to be paired is 8, and the simulation result is shown in fig. 3.
And 2, according to the simulation conditions, respectively using the split number-based fast joint resource allocation method in the virtual MIMO system and the existing fixed user grouping and resource allocation method to perform spectrum utilization rate simulation of the system, wherein the result is shown in FIG. 3.
As can be seen in fig. 3: the two dotted lines are respectively the spectrum utilization rate curves of the method and the existing method when the number of users is small, and the two solid lines are respectively the spectrum utilization rate curves of the method and the existing method when the number of users is large. The simulation curve can be used for obtaining that the frequency spectrum utilization rate obtained by the split number-based rapid joint resource allocation method in the virtual MIMO system is obviously higher than that of the existing fixed user grouping and resource allocation method. The spectrum efficiency obtained by the method is obviously higher than that obtained by the existing method no matter the number of users is more or the number of users is less, and in addition, the spectrum utilization rate of the method is higher when the number of users is more. This shows that the method of the present invention has higher system spectrum utilization rate when the number of users is large.
In summary, the present invention combines the user pairing problem and the resource allocation problem together, and uses the splitting number to quickly perform the user pairing and virtual MIMO resource allocation, thereby mainly solving the problems of low spectrum utilization and poor communication quality caused by the inability to quickly perform dynamic user pairing and resource allocation of non-fixed users under the condition of large number of users in the prior art. The technical scheme is as follows: the user grouping is quickly obtained by utilizing the splitting number, and the optimal user pairing result and the optimal resource allocation result with low calculation complexity are obtained by utilizing the greedy algorithm to solve through the user pairing constraint matrix, the resource allocation constraint matrix and the user pairing capacity vector; modulating the data information carried by each user according to the result vector and the user modulation matrix; and transmitting the modulated data information to a signal receiver on the resource block allocated to the user. The invention can efficiently carry out non-fixed number of multi-user pairing and resource allocation, can combine the user pairing problem and the resource allocation problem and consider simultaneously, maximizes the frequency utilization rate of the system and improves the communication quality of the system under the condition of low calculation complexity.

Claims (4)

1. A quick joint resource allocation method based on split number in a virtual MIMO system is characterized by comprising the following steps:
(1) base station obtains basic parameters
A base station obtains a set l of users to be paired, a number Nu of users to be paired, a set r of resource blocks, the number N of the resource blocks and the number Nr of receiving antennas of a current time slot;
(2) constructing complete resource block allocation set and resource allocation constraint matrix
Forming a complete resource block distribution set P according to the number N of the resource blocks; generating a resource block distribution mode matrix T according to the complete resource block distribution set P to obtain a resource distribution contractA beam matrix:wherein 1 isNThe vector with the length same as the number N of the resource blocks and the element values equal to 1 is represented,represents an operation of solving a kronecker product;
(3) constructing user group split number set and user split number pairing constraint matrix
(3.1) constructing user group split number set
According to the number Nu of users to be paired, dividing the users to be paired into user groups of which the number of users does not exceed the Nu, and obtaining a user number set A; according to the number Nr of the receiving antennas, removing the set with the number of users larger than Nr in the user number set A, generating a user group splitting number set G, and performing the following steps:
3.1a) carrying out integer splitting on the user number Nu, namely, expressing the positive integer Nu as the sum of a plurality of positive integers, and not considering the summation sequence; splitting the result vector for each type of userPutting the ith row vector into a user integer splitting matrix Q;
3.1b) removing user number splitting result vectorsTo obtain qi＝{qi,1,qi,2,…,qi,WWherein 0 < qi,1≤qi,2≤…≤qi,WNu is not more than Nu, W is not more than Nu; repeating the operation until each row in the matrix Q is executed, and obtaining a new user integer split set Q;
3.1c) selecting q users from Nu users to be pairedi,1The numbers of the users are taken as elements to be put into the user group set Ai,1Performing the following steps;
3.1d) in the remaining Nu-qi,1Selecting among users to be pairedGet a piece qi,2The numbers of the users are taken as elements to be put into the user group set Ai,2Performing the following steps;
3.1e) repeating steps 3.1c) and 3.1d) until the set of user groups AiThe integrity is realized;
3.1f) repeating steps 3.1c), 3.1d) and 3.1e) until the user group set A is complete;
3.1g) removing the number q of users in the user group set Ai,WObtaining a user group splitting number set G by the set with the number greater than the number Nr of the antennas;
(3.2) constructing a user split number pairing constraint matrix
Generating a user split number pairing mode matrix B according to the user group split number set G to obtain a user split number pairing constraint matrix:wherein 1 isNuA vector with the length equal to the number Nu of users to be paired and the element value equal to 1 is represented;
(4) constructing a user modulation order matrix and a user group capacity matrix
Generating a user modulation order matrix M with the size of N x Nu rows and Na columns and a user group capacity matrix psi with the size of N rows and Na columns through iteration, wherein the Na value is equal to the number of elements in the user group splitting number set G;
(5) calculating a user capacity vector
Obtaining a capacity vector eta according to the resource block distribution mode matrix T and the user group capacity matrix psi;
(6) rapid joint resource allocation model based on split number in virtual MIMO system construction
And (3) constructing a user pairing and resource allocation system model by taking the resource allocation constraint matrix C1, the user pairing constraint matrix C2 and the capacity vector eta as parameters:
s.t.C1x≤1N
C2x≤1Nu
where x represents an indicator vector of user pairing and resource allocation, ηTx represents the system capacity value, 1NRepresenting a vector of length N and elements all equal to 1,1NuRepresents a vector of length Nu and elements all equal to 1 (.)TIt is shown that the transpose operation,an operation of finding x that maximizes the value in the parentheses;
(7) solving a user pairing and resource allocation system model by using a Hungarian algorithm based on a greedy algorithm, and acquiring user pairing and resource allocation results
Acquiring the channel capacity of each resource model in the corresponding complete resource block distribution set P by traversing each user grouping condition in the user group splitting number set G, obtaining an optimal result of the local channel capacity by a Hungary algorithm based on a greedy algorithm, and storing the result in the set C; performing Hungarian algorithm on the set C again to obtain a globally optimal result vector U of user pairing and resource allocation;
(8) modulating data information of service required by user
According to the result vector U of user pairing and resource allocation and the user modulation order matrix M, modulating the information carried by each user, and then sending the information modulated by each user to a signal receiver of a base station in a resource block allocated to the user to complete the user pairing and resource allocation of the time slot user stream;
(9) continuing the scheduling assignment of the next time slot
Judging whether a user stream of the next time slot exists, if so, selecting the user stream of the next time slot, and returning to the step (1) for user pairing and resource allocation of the user stream of the next time slot; otherwise, completing the user pairing and resource allocation of all the user flows.
2. The method for fast joint resource allocation based on split number in a virtual MIMO system according to claim 1, wherein in step (3), a user pairing mode matrix B is generated according to the user group split number set G, and the method is performed according to the following steps:
3.2a) generating an initial user pairing pattern matrix B with Nu rows and Na columns and 0 elements0Wherein Na is equal to the number of elements in the user group splitting number set G;
3.2b) determining whether the p-th element of the user group split number set G contains a serial number equal to liIf yes, let the user pair the pattern matrix B0L. 1iThe elements of the row and the p-th column are equal to 1, otherwise, the elements are equal to 0;
3.2c) initial user pairing pattern matrix B to which element values are assigned0As the final user pairing pattern matrix B.
3. The method of claim 1, wherein the step (4) iteratively generates a user modulation order matrix M with size N × Nu rows and Na columns and a user group capacity matrix ψ with size N rows and Na columns by the following steps:
4a) let u be 1 and h be 1, and generate an initial user modulation order matrix M with N × Nu rows and Na columns, and elements all equal to 00(ii) a Simultaneously generating an initial user group capacity matrix psi with the size of N rows and Na columns and the elements equal to 00；
4b) Let k be 1, select the u user group from the user group split set G;
4c) calculating the SINR value of the kth user in the kth user group on the h resource block according to the following formulau,k,h：
Wherein E iskRepresenting the transmission power, σ, of the k-th user2Denotes the channel noise power of the current time slot, ζ u, h denotes the channel matrix of the u user group on the h resource block, InAn identity matrix of n rows and n columns is represented, n represents the number of users in the u-th user group, (-)HRepresents Hermite transposition operations, (.)-1Represents the inverse operation [ ·]k,kElements representing the kth row and the kth column of the matrix;
4d) under the condition of giving a bit error rate threshold value b, calculating the modulation order of the kth user in the kth user group on the h resource block according to the following formulaAnd apply the samePut into matrix M0(h-1) Nu + lkLine, v th1Column in which v1Is equal in value to u, lkA number representing the kth user;
where b is the preset threshold value of the bit error rate of the system, floor (·) represents the rounding-down operation, log2(. cndot.) represents a base-2 logarithm operation, ln (·) represents a natural logarithm operation;
4e) judging whether k is equal to the number n of users in the u-th user group, if so, executing 4f), otherwise, making k equal to k +1, and returning to 4 c);
4f) judging whether the modulation order of each user in the u user group is not equal to 0, if so, adding the modulation orders of all users in the u user group to obtain the capacity of the u user group; otherwise, the capacity of the u user group is equal to 0; then the capacity value of the u-th user group is put into the matrix psi0V. of (b)2Line, v th3Column in which v2Is numerically equal to h, v3Equal in value to u, perform 4 g);
4g) judging whether u is equal to Na or not, if so, executing for 4 h); otherwise, let u be u +1, return to 4 b);
4h) judging whether h is equal to N, if so, assigning an initial user modulation order matrix M with element values0As the most importantThe final user modulation order matrix M and the initial user capacity matrix psi to which the element values are assigned0As the final user capacity matrix ψ, end; otherwise, let h be h +1 and u be 1, return to 4 b).
4. The method for fast joint resource allocation based on split number in a virtual MIMO system according to claim 1, wherein the Hungarian algorithm based on greedy algorithm is used to solve the user pairing and resource allocation system model in the step (7), and the user pairing and resource allocation result is obtained, and the method is performed according to the following steps:
7a) generating an all-zero matrix C of Na rows and Z columns0Wherein Na is equal to the number of elements in the user group splitting number set G, and Z is equal to the number of elements in the complete resource block allocation set P;
7b) taking any user group in the user group splitting number set G, and solving the channel capacity of each resource model in the corresponding complete resource block allocation set P; obtaining a resource model with optimal local correspondence by using the Hungarian algorithm, and calculating a matrix C0Wherein the element corresponding to the pairing case is equal to 1;
7c) repeating the operation of 7b) until the matrix C0Each row in the user group splitting number set G has an element 1, and a resource model corresponding to each user group in the user group splitting number set G is obtained; initial matrix C to be assigned element values0A final local optimal user pairing and resource allocation result matrix C;
7d) and processing the locally optimal user pairing and resource allocation result matrix C by using the Hungarian algorithm to obtain a globally optimal user pairing and resource allocation result matrix U.
CN201611204196.1A 2016-12-23 2016-12-23 Splitting number-based rapid joint resource allocation method in virtual MIMO system Active CN106793120B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201611204196.1A CN106793120B (en) 2016-12-23 2016-12-23 Splitting number-based rapid joint resource allocation method in virtual MIMO system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201611204196.1A CN106793120B (en) 2016-12-23 2016-12-23 Splitting number-based rapid joint resource allocation method in virtual MIMO system

Publications (2)

Publication Number Publication Date
CN106793120A CN106793120A (en) 2017-05-31
CN106793120B true CN106793120B (en) 2019-12-24

Family

ID=58897806

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201611204196.1A Active CN106793120B (en) 2016-12-23 2016-12-23 Splitting number-based rapid joint resource allocation method in virtual MIMO system

Country Status (1)

Country Link
CN (1) CN106793120B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107478981B (en) * 2017-08-22 2019-12-10 哈尔滨工业大学 Greedy algorithm based test excitation set optimization method
CN109728891B (en) * 2018-12-26 2021-05-18 西安电子科技大学 Clustering-based user pairing method in MU-MIMO system

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
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
CN105429741A (en) * 2015-10-29 2016-03-23 西安电子科技大学 Combined virtual MIMO resource distribution method based on dynamic user pairing

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
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
CN105429741A (en) * 2015-10-29 2016-03-23 西安电子科技大学 Combined virtual MIMO resource distribution method based on dynamic user pairing

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
LTE-A系统上行链路虚拟MIMO用户配对算法研究;张立;《西安电子科技大学学位论文》;20150415;第3.4节，第4.3节 *

Also Published As

Publication number Publication date
CN106793120A (en) 2017-05-31

Similar Documents

Publication Publication Date Title
CN109005551B (en) Multi-user NOMA downlink power distribution method of non-ideal channel state information
Kimy et al. Non-orthogonal multiple access in a downlink multiuser beamforming system
CN110932764B (en) User matching and power distribution method of MIMO-NOMA downlink communication system
CN108990167B (en) Machine learning-assisted large-scale MIMO downlink user scheduling method
CN111132264B (en) User clustering method for downlink of multi-user MIMO-NOMA system
US9363815B2 (en) Method for SDMA transmission in multicarrier MU MIMO system and base station
CN110401476A (en) A kind of codebook-based millimetre-wave attenuator multi-user parallel beam training method
CN108566236B (en) User terminal, base station, and hybrid beamforming transmission method and system
CN104702326A (en) MSE-based (mean square error-based) virtual MIMO (multiple input multiple output) user pairing and resource allocating method
Yuan et al. A novel pilot decontamination scheme for uplink massive MIMO systems
WO2016000451A1 (en) Pilot frequency allocation method and device based on mimo
CN106793120B (en) Splitting number-based rapid joint resource allocation method in virtual MIMO system
CN106899338A (en) User packet method based on density in extensive mimo system downlink
CN105429741B (en) Joint virtual MIMO resource allocation methods based on dynamic subscriber&#39;s pairing
CN108702231A (en) Sending device, reception device, control station, communication system and transmission method for precoding
Lee et al. A per-user successive MMSE precoding technique in multiuser MIMO systems
CN106793111B (en) Joint virtual MIMO resource allocation methods are matched based on dynamic multiple cell user
CN106972878A (en) A kind of data processing method and device
CN103167597B (en) A kind of processing method of forming coefficient power of wave beam forming and device
CN106209191B (en) A kind of MU-MIMO system true environment low complex degree user choosing method
JP3860796B2 (en) Uplink data communication apparatus and method
CN104618921A (en) Estimation method for user capacity of multi-service large-scale MIMO system
CN112136280B (en) Transmission method, computer-readable storage medium, and transmitter
CN102223342B (en) Downlink multi-input single-output-OFDMA (Orthogonal Frequency Division Multiplex Access) multicast system resource allocation method
CN113872650B (en) Wireless communication method, device, equipment, system and storage medium

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