CN106793120A - Fast joint resource allocation methods based on partition number in virtual MIMO system - Google Patents
Fast joint resource allocation methods based on partition number in virtual MIMO system Download PDFInfo
- Publication number
- CN106793120A CN106793120A CN201611204196.1A CN201611204196A CN106793120A CN 106793120 A CN106793120 A CN 106793120A CN 201611204196 A CN201611204196 A CN 201611204196A CN 106793120 A CN106793120 A CN 106793120A
- Authority
- CN
- China
- Prior art keywords
- user
- matrix
- group
- pairing
- resource allocation
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
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 the fast joint resource allocation methods based on partition number in virtual MIMO system in a kind of wireless communication field.It is main to solve the problems, such as on-fixed user pairing and resource allocation when number of users is big.Technical scheme is：Build complete resource block assignments set, user's group partition number set；Fast joint resource allocator model based on partition number in construction virtual MIMO system, with based on greedy algorithm Hungarian Method；Obtain user's pairing and resource allocation result；User profile is modulated according to the result and user's modulation matrix；Information is sent to receiver on the Resource Block that user is assigned to after modulation, completes user grouping and resource allocation.User grouping of the present invention based on partition number quickly carries out on-fixed number multi-user pairing, in solution distribution model from local optimum to global optimum.The present invention maximizes system frequency utilization rate in the case where computation complexity is low, improves system communication quality.For virtual MIMO system communication.
Description
Technical field
The invention belongs to communication technical field, virtual multiple-input and multiple-output MIMO resource allocation methods are further related to,
Specifically a kind of fast resource distribution method based on partition number.In the up-link of virtual MIMO system.
Background technology
Multiple-input and multiple-output MIMO technology is widely used for improving spectrum efficiency in various wireless communication systems.So
And, due to user equipment the practical operation such as cost and size in terms of difficulty so that multiple-input and multiple-output MIMO technology is upper
The application of line link is limited to.In order to solve this problem, researcher proposes the side of virtual multiple-input and multiple-output MIMO
Method, the effective problem of the cost and size limitation of user equipment for solving, i.e. up-link is entered to two or more users
Row pairing, single transmitting antenna is disposed in identical frequency band and time slot to each pairing user, how defeated with conventional multi input
Go out mimo system to compare, virtual multiple-input and multiple-output MIMO can be matched by designing good user and resource dispatching strategy come
To the larger availability of frequency spectrum and less bit error rate.Therefore, user's pairing and resource allocation are that to directly affect multi input more
The key of output system performance.
Existing resource allocation techniques are the problems for considering that resource allocation is optimal mostly, are usually when being matched with a certain user
One or more users are chosen in consideration from all users, i.e., the user for being fixed number using ergodic matches.Ergodic
Algorithm carries out pairing and searches element to all users, causes algorithm complicated.User's pairing of fixed number, existing can not be according to user's reality
Border causes the waste that system resource is unnecessary using the problem of channel condition pairing.Resource allocation is carried out again after user's pairing, i.e.,
Optimization aim is turned to system spectrum utilization rate maximum, resource block assignments are given the user couple for having prepared.Subject matter is existing
There is method not account for computation complexity.Especially with number of users gradually increase when, the run time of system can be notable
Raising, cause the inefficient of system, and when number of users reaches certain value, existing algorithm cannot almost be realized.
To sum up, now with mobile subscriber increase and the increase of customer service, existing virtual multiple-input and multiple-output
User's pairing of mimo system and resource allocation algorithm do not consider that on-fixed user matches situation, cause system spectrum utilization rate not
It is high；And excessively pursue algorithm and optimize, causing that its computation complexity is higher, system effectiveness is relatively low.
The content of the invention
It is an object of the invention to be directed to above-mentioned the deficiencies in the prior art, propose that a kind of algorithm complex is low, make full use of
Frequency spectrum resource, the fast joint resource allocation methods based on partition number in communication quality virtual MIMO system higher.
Its implementation is included：
(1) base station obtains basic parameter
Base station obtains user's set l to be paired, number of users Nu to be paired, resource set of blocks r, the Resource Block of current time slots
Number N and reception antenna number Nr；
(2) complete resource block assignments set and resource allocation constraint matrix are built
According to Resource Block number N, complete resource block assignments set P is formed；It is raw according to the complete resource block assignments set P
Into resource block assignments mode matrix T, resource allocation constraint matrix is obtained：Wherein 1NRepresent length and resource
N is identical for block number, and element value is equal to 1 vector,The computing of Kronecker product is asked in expression；
(3) set of user's group partition number and user's partition number pairing constraint matrix are built
(3.1) user's group partition number set is built
According to number of users Nu to be paired, user to be paired is split into user's group of the every group of number of users no more than Nu, obtained
Number of users set A；Further according to reception antenna number Nr, set of the number of users more than Nr, generates user's group in removal number of users set A
Partition number set G；
(3.2) user's partition number pairing constraint matrix is built
According to user's group partition number set G, user's partition number pairing mode matrix B is generated, obtain the pairing of user's partition number
Constraint matrix：Wherein 1NuRepresent that length is identical with number of users Nu to be paired, and element value is equal to 1
Vector；
(4) user's order of modulation matrix and user's group capacity matrix are built
It is that N*Nu rows, the user order of modulation matrix M of Na row, and size are N rows, the use of Na row by grey iterative generation size
Pool-size matrix ψ, wherein Na are numerically equal to the element number in user's group partition number set G at family；
(5) user capacity vector is calculated
According to resource block assignments mode matrix T and user's group capacity matrix ψ, capacity vector η is obtained；
(6) the fast joint resource allocator model based on partition number in construction virtual MIMO system
The capacity vector η obtained with resource assignment constraints Matrix C 1, user pairing constraint matrix C2 and step (5) is ginseng
Number, builds user's pairing and resource allocation system model：
s.t.C1x≤1N
C2x≤1Nu
Wherein, x represents user's pairing and the instruction of resource allocation vector, ηTX represents power system capacity value, 1NRepresent that length is N
And vector of the element all equal to 1,1NuRepresent that length is the vector of Nu and element all equal to 1, ()TTransposition operation is represented,The operation of the x for causing the value in bracket maximum is obtained in expression；
(7) using the Hungarian Method user pairing based on greedy algorithm and resource allocation system model, and obtain
User matches and resource allocation result
Manifold is torn open by traverse user component and closes every kind of user grouping situation in G, obtain its complete resource block assignments of correspondence
The channel capacity of every kind of resource model in set P, local channel capacity is drawn most by the Hungary Algorithm based on greedy algorithm
Excellent result, the result is stored in set C；Hungary Algorithm is carried out again to set C, user's pairing of global optimum is obtained
With the result vector U of resource allocation；
(8) data message serviced required for user is modulated
According to user's pairing and the result vector U and user order of modulation matrix M of resource allocation, each user is carried
Information is modulated, then the information after each user modulation is sent into base station in the Resource Block assigned by this user
Signal receiver, the user's pairing for completing this time slot user stream and resource allocation；
(9) dispatching distribution of next time slot is proceeded
User's stream of next time slot is judged whether, if so, selecting the user of next time slot to flow, returning to (1) is carried out down
User's pairing of one time slot user stream and resource allocation；Otherwise, user's pairing and the resource allocation of all user's streams are completed.
The present invention realizes that the concrete thought of above-mentioned purpose is quickly to obtain user grouping using partition number, is matched somebody with somebody by user
To constraint matrix, resource allocation constraint matrix, user to capacity vector, using the Hungarian Method based on greedy algorithm,
Result and resource allocation result are matched to obtain the low optimal user of computation complexity.
The present invention has advantages below compared with prior art：
First, because the present invention is by by the method for user's pairing and resource allocation conjunctive model, by user's marriage problem
Join together to consider simultaneously with resource allocation problem, overcoming in the prior art can not be while carries out user's pairing and resource allocation
Problem, also overcome prior art can only be fixed user pairing problem so that the present invention can efficiently simultaneously carry out
User matches and resource allocation, and then maximizes the frequency efficiency of system；
Second, because the present invention is using the user's matching method based on partition number, overcomes prior art and matched in user
During can not carry out the problem of on-fixed user's pairing so that the present invention can in the frequency efficiency of the system of maximization, and then
Improve system communication quality；
3rd, because the present invention is using the user's matching method based on partition number, overcomes prior art and matched in user
During travel through complexity problem high repeatedly so that the present invention can remain to quickly to carry out user to match somebody with somebody when number of users is higher
It is right, and then greatly reduce system-computed complexity.
Brief description of the drawings：
Fig. 1 is schematic flow sheet of the invention；
Fig. 2 is, with of the invention and existing fixed user packet method, to carry out the frequency of system after user's pairing and resource allocation
Spectrum utilization rate simulation comparison curve map；
Fig. 3 is, with of the invention and existing fixed user packet method, when more or less in number of users, user to be matched somebody with somebody
Pair and resource allocation after system availability of frequency spectrum simulation comparison curve map.
Specific embodiment
Below in conjunction with the accompanying drawings to the detailed description of the invention：
Embodiment 1
With the increase of communication user number, the growing tension of frequency spectrum resource, selection of the prior art for user and money
The distribution of source block can not realize the more efficient utilization of frequency spectrum, therefore the present invention proposes a kind of user's pairing based on partition number
And the scheme of resource allocation.It is directed to base station, multi-user, the Resource Block being associated with base station, are in virtual MIMO system
Middle realization.
The present invention is the fast joint resource allocation methods based on partition number in a kind of virtual MIMO system, referring to Fig. 1, bag
Include and have the following steps,
(1) base station obtains basic parameter
Base station obtains user's set l to be paired, number of users Nu to be paired, resource set of blocks r, the money of this cell current time slots
Source block number N and reception antenna number Nr etc..Prepared to form user's set and resource set of blocks below.
(2) complete resource block assignments set and resource allocation constraint matrix are built
According to this local resource block number N, complete resource block assignments set P is formed by Adjacent resource block；It is complete according to this
Resource block assignments set P, generates resource block assignments mode matrix T, obtains resource allocation constraint matrix：Its
In 1NRepresent that length is identical with Resource Block number N, and element value is equal to 1 vector,The fortune of Kronecker product is sought in expression
Calculate.To ensure that a Resource Block is assigned to only a user's group.
(3) set of user's group partition number and user's partition number pairing constraint matrix are built
(3.1) user's group partition number set is built
According to number of users Nu to be paired, user to be paired is split into user's group of the every group of number of users no more than Nu, obtained
Number of users set A；Further according to reception antenna number Nr, set of the number of users more than Nr, generates user's group in removal number of users set A
Partition number set G.
(3.2) user's partition number pairing constraint matrix is built
According to user's group partition number set G, user's partition number pairing mode matrix B is generated, obtain the pairing of user's partition number
Constraint matrix：Wherein 1NuRepresent that length is identical with number of users Nu to be paired, and element value is equal to 1
Vector.
Due to the present invention using based on partition number user's matching method, overcome prior art user match during
The problem of on-fixed user's pairing can not be carried out so that the present invention in the frequency efficiency of the system of maximization, and then can improve
System communication quality.
(4) user's order of modulation matrix and user's group capacity matrix are built
It is that N*Nu rows, the user order of modulation matrix M of Na row, and size are N rows, the use of Na row by grey iterative generation size
Pool-size matrix ψ, wherein Na are numerically equal to the element number in user's group partition number set G at family.For subsequent calculations user holds
Amount vector is prepared.
(5) user capacity vector is calculated
The user's group capacity matrix ψ that the resource block assignments mode matrix T and step (4) obtained according to step (2) are obtained, obtains
To capacity vector η.The size of user's pool-size reflects the quality that user matches situation, the user capacity that the step of the invention is obtained
Vector can be used as the standard of optimal user pairing with the result after user's pairing multiplication of vectors.
(6) the fast joint resource allocator model based on partition number in construction virtual MIMO system
User pairing constraint matrix C2 and step that the resource allocation constraint matrix C1 that is obtained with step (2), step (3) are obtained
Suddenly the capacity vector η that (5) obtain is parameter, builds user's pairing and resource allocation system model：
s.t.C1x≤1N
C2x≤1Nu
Wherein, x represents user's pairing and the instruction of resource allocation vector, ηTX represents power system capacity value, 1NRepresent that length is N
And vector of the element all equal to 1,1NuRepresent that length is the vector of Nu and element all equal to 1, ()TTransposition operation is represented,The operation of the x for causing the value in bracket maximum is obtained in expression, establish in virtual MIMO system of the invention based on point
Tear several fast joint resource allocator models open.
The model form is simple, is ensuring that Resource Block is assigned to only a user's group, and a user only takes up a resource
On the basis of model so that the user capacity that the user's matching method based on partition number is obtained is maximum, i.e. the use based on partition number
Family pairing situation is optimal.(7) utilize and be based on being based on partition number in the Hungarian Method virtual MIMO system of greedy algorithm
Fast joint resource allocator model, the model may be simply referred to as user's pairing and resource allocation system model, and obtain user's pairing
And resource allocation result.
A user grouping and resource allocation result Matrix C are initially set up, the matrix row vector is user grouping, longitudinal direction amount
It is resource block models.Then manifold is torn open by traverse user component and closes every kind of user grouping situation in G, obtain its complete money of correspondence
The channel capacity of every kind of resource model, first passes through the Hungary Algorithm based on greedy algorithm and draws virtually in source block distribution set P
The local channel capacity optimal result of mimo system, user grouping and resource allocation result square are stored in by the local optimum result
Battle array C.Hungary Algorithm is carried out second time to user grouping and resource allocation result Matrix C again, virtual MIMO system is obtained
User's pairing of global optimum and the result vector U of resource allocation.
The present invention by by user match and resource allocation conjunctive model method, by user's marriage problem and resource allocation
Problem join together simultaneously consider, overcome in the prior art can not and meanwhile carry out user pairing and resource allocation problem,
Overcome prior art can only be fixed user pairing problem so that the present invention can efficiently simultaneously carry out user pairing and
Resource allocation, and then maximize the frequency efficiency of system.The present invention carries out user grouping using partition number in addition, without to institute
Some user grouping situations are iterated, and to travel through computation complexity repeatedly high during user matches to overcome prior art
Problem so that the present invention can increase in number of users and remain to quickly carry out user's pairing when higher, greatly reduce system meter
Calculate complexity.
(8) data message serviced required for user is modulated
The user's order of modulation matrix M that result vector U and step (4) according to user's pairing and resource allocation are obtained is right
The information that each user carries carries out quadrature amplitude modulation, then by the information after each user's quadrature amplitude modulation in this user
The signal receiver of base station is sent in assigned Resource Block, the user's pairing for completing this time slot user stream and resource are divided
Match somebody with somebody.So far, step (1)-step (8) completes a user for time slot and matches and resource allocation.
(9) dispatching distribution of next time slot is proceeded
User's stream of next time slot is judged whether, if so, the user of a time slot flows in the presence of i.e., selection enters next
User's stream of time slot, returning to execution (1) carries out user's pairing and the resource allocation of next time slot user stream；Otherwise, that is, do not exist
User's stream of next time slot, then completed user's pairing and the resource allocation of all user's streams in virtual MIMO system.
Because the present invention is using the user's matching method based on partition number, user's pairing and resource allocation is combined and is taken into account
Row on-fixed user grouping, overcomes the user grouping feelings that prior art is traveled through under all situations repeatedly during user matches
Condition, computation complexity is high and can not completely utilize the problem of frequency spectrum.Enable the present invention when number of users rises to higher
Remain to quickly carry out user's pairing, and then greatly reduce system-computed complexity, improve system spectrum utilization rate.
Embodiment 2
The fast joint resource allocation methods based on partition number are with embodiment 1, wherein step (3.1) in virtual MIMO system
According to number of users Nu to be paired, form user's group partition number set G, by taking Nu=5 as an example, including have the following steps：
3.1a) generate the initial user integer matrix Q that an element is 00。
Number of users Nu=5 3.1b) is carried out into split of integral number, will positive integer 5 be expressed as the sum of several positive integers, do not examine
Consider the order of its summation.Respectively by number of users spin-off 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,0), (4,1,0,0,0), (5,0,0,0,0) are put into user's integer matrix as row vector
Q0In.
3.1c) the neutral element in removal number of users spin-off result vector, obtain (1,1,1,1,1), (2,1,1,1), (2,2,
1), (3,1,1), (3,2), (4,1), (5), obtain user's integer set Q.
3.1d) generate the initial user group set A that an element is 0.
1 user 3.1e) is chosen in 5 users to be paired, the numbering of these users is put into user as element
Group set A1,1In.
1 user 3.1f) is chosen in remaining 4 users to be paired, the numbering of these users is put as element
Access customer group set A1,2In.
3.1g) repeat step 3.1e) and 3.1f) until number of users spin-off result vector (1,1,1,1,1) is completed, make user
Group set A1Completely.
3.1h) repeat step 3.1c), 3.1d) and 3.1e) until number of users spin-off result vector (1,1,1,1,1), (2,
1,1,1), (2,2,1), (3,1,1), (3,2), (4,1), (5) are fully completed, and make user's group set A complete.
3.1g) in removal user's group set A set of the number of users more than antenna number Nr=4, i.e. number of users spin-off result to
The user's group set for (5) is measured, user's group partition number set G is obtained.
Above step is completed, user's group partition number set is obtained, for being subsequently generated user's pairing mode matrix.Profit of the invention
The user grouping quickly obtained with partition number contains the user grouping situation in all virtual MIMO systems, and all users
Number of users is not fixed in packet, i.e. on-fixed user grouping.
Embodiment 3
The fast joint resource allocation methods based on partition number are with embodiment 1-2, wherein step in virtual MIMO system
(3.2) the generation user's pairing mode matrix B in is, according to optional user pair set G, to generate user's pairing mode matrix B, bag
Include and have the following steps：
A Nu=5 row, Na row 3.2a) are generated, and element is 0 initial user pairing mode matrix B0, wherein, Na
Equal to the number of element in user's group partition number set G, i.e.,
3.2b) judge whether be equal to l comprising numbering in p-th element of user's group partition number set GiUser, if so,
Then make user's pairing mode matrix B0LiRow, the element of pth row are equal to 1, otherwise, make it be equal to 0.
To 3.2c) possess the initial user pairing mode matrix B of element value0As final user's pairing mode matrix B.
User's pairing mode matrix of present invention needs is more than completed, specify that each is based on the user grouping of partition number
Comprising user, for subsequently set up in virtual MIMO system based on partition number fast joint resource allocator model.
User pairing and resource allocation of the present invention in dynamic adjustment system, realize to the Adaptive Modulation of user
On the basis of, while reducing computation complexity, it is ensured that ensure that system spectrum utilization rate reaches maximum while system bit error rate.
Embodiment 4
The fast joint resource allocation methods based on partition number are with embodiment 1-3, wherein step (4) in virtual MIMO system
In structure user's order of modulation matrix and user's group capacity matrix, including have the following steps：
U=1, h=1 4a) are made, one size of generation is the initial user modulation that N*Nu rows, Na row, and element are equal to 0
Exponent number matrix M0；One size of generation is N rows, Na row simultaneously, and element is equal to 0 initial user pool-size matrix ψ0。
K=1 4b) is made, u-th user's group is selected from user's group partition number set G.
4c) according to the following formula, calculate on h-th Resource Block, the Signal to Interference plus Noise Ratio of k-th user in u-th user's group
Value SINRu,k,h：
Wherein, EkRepresent k-th transmission power of user, σ2Represent the channel noise power of current time slots, ζu,hRepresent u
Channel matrix of the individual user's group on h-th Resource Block, InExpression size is n rows, the unit matrix of n row, and n represents u-th use
User's number that family group is included, ()HRepresent the operation of Hermitian transposition, ()-1Expression takes inverse operation, []k,kRepresenting matrix kth
The element of row, kth row.
4d) in the case of given bit error rate threshold value b, according to the following formula, k-th user in u-th user's group is calculated
Order of modulation on h-th Resource BlockAnd shouldIt is put into matrix M0(h-1) * Nu+lkRow, v1Row, its
In, v1Numerically equal to u, lkRepresent k-th numbering of user：
Wherein, b is default system bit error rate threshold value, and floor () represents downward floor operation, log2() table
Show the log operations taken with 2 bottom of for, ln () is represented and taken from right log operations.
4e) judge whether k is equal to the number n of the user included in u-th user's group, if so, performing 4f), otherwise, make k
=k+1, returns to 4c).
4f) judge whether the order of modulation of each user in u-th user's group is not equal to 0, if so, then by u-th use
The order of modulation of all users is added in the group of family, obtains u-th capacity of user's group；Otherwise, u-th capacity of user's group etc. is made
In 0；The capability value of u-th user's group that will be obtained again is put into matrix ψ0V2Row, v3Row, wherein, v2Numerically equal to h,
v3Numerically equal to u, performs 4g).
4g) judge whether u is equal to Na, if so, then performing 4h)；Otherwise, u=u+1 is made, 4b is returned).
4h) judge whether h is equal to N, if so, will then possess the initial user order of modulation matrix M of element value0As final
User order of modulation matrix M, and will possess the initial user capacity matrix ψ of element value0As final user capacity matrix
ψ, terminates；Otherwise, h=h+1, u=1 are made, 4b is returned).
User's order of modulation matrix and user's group capacity matrix of present invention needs are more than completed, each user is specify that
The capacity of group, user capacity vector is calculated for follow-up.
Embodiment 5
The fast joint resource allocation methods based on partition number are with embodiment 1-4, wherein step (7) in virtual MIMO system
In utilization be based on greedy algorithm Hungarian Method user pairing and resource allocation system model, and obtain user pairing
And resource allocation result, including have the following steps：
7a) generate a Na row, the full null matrix C of Z row0, wherein Na be equal to user's group partition number set G in element
Number, Z is equal to the number of element in complete resource block assignments set P.
7b) take family component and tear manifold open and close any one user grouping in G, in seeking the complete resource block assignments set P of its correspondence
The channel capacity of every kind of resource model.Its locally optimal resource model of correspondence is obtained using Hungary Algorithm, and by Matrix C0
In element corresponding to this pairing situation be equal to 1.
7c) repeat 7b) operate until Matrix C0In often row all there is element 1, that is, obtain every in user's group partition number set G
Plant the corresponding resource model of user grouping.To possess the initial matrix C of element value0Matched as the user of final local optimum
With resource allocation result Matrix C.
7d) the user's pairing using Hungary Algorithm treatment local optimum and resource allocation result Matrix C, you can obtain complete
The optimal user's pairing of office and resource allocation result matrix U.
Above step is completed, user's pairing and the resource allocation result matrix of virtual MIMO system global optimum is obtained.This
Invention is matched and resource allocation system model using the Hungarian Method user based on greedy algorithm, by user's marriage problem
Join together to consider simultaneously with resource allocation problem, and without calculating all of user grouping situation.
A complete example is given below, and the present invention is further described.
Embodiment 6
The fast joint resource allocation methods of partition number are based in virtual MIMO system with embodiment 1-5, referring to the drawings 1,
Specific implementation step of the invention is described as follows：
Step 1, base station obtains user's set l to be paired, number of users Nu=32 to be paired, the resource set of blocks of current time slots
R, Resource Block number N=6 and reception antenna number Nr=4.
User's set l to be paired is expressed as：L={ l1,l2,…,li,…,l32, wherein, liRepresent i-th use to be paired
The numbering at family, i ∈ [1,32]；
Resource set of blocks r is expressed as：R={ r1,r2,r3,…r6, wherein, rjRepresent j-th numbering of Resource Block, j ∈
[1,6]。
Step 2, according to resource set of blocks r and Resource Block number N, forms complete resource block assignments set P.
2a) one initial value of generation is zero empty initial complete resource block assignments set P0。
2b) in resource set of blocks r={ r1,r2,r3,r4, it is middle selection 1 Resource Block, using the numbering of this Resource Block as
One element is put into P0In.
2c) in resource set of blocks r choose 2 continuous Resource Block, using this 2 the 2 of continuous resource blocks numberings as
One element is put into P0In.
3 continuous Resource Block 2d) are chosen in resource set of blocks r, this 3 the 3 of continuous resource blocks numberings are made again
For another element is put into P0In.
2e) in resource set of blocks r choose 4 continuous Resource Block, using this 4 the 4 of continuous resource blocks numberings as
Another is put into P by element0In.
2f) repeat step 2b), 2c), 2d), 2e) until being chosen to all possible Resource Block group in resource set of blocks r
Close and the mutual unduplicated continuous resource blocks of combination.As empty initial complete resource block assignments set P0After assignment is completed, i.e.,
As complete resource block assignments set P.
Step 3, according to complete resource block assignments set P, generates complete resource block assignments mode matrix T.
A N row, Z row 3a) are generated, and element is 0 initial resource block allocation model matrix T0, wherein Z has been equal to
The number of element in standby resource block assignments set P.
3b) judge whether be equal to r comprising numbering in q-th element in complete resource block assignments set PjResource Block, if
It is then to make T0In rjRow, the element of q row are equal to 1；Otherwise, it is made to be equal to 0.
To 3c) possess the initial resource block allocation model matrix T of element value0As final resource block assignments mode matrix
T。
Step 4, according to user's set l to be paired and reception antenna number Nr, generation user's group partition number set G.
Number of users Nu 4a) is carried out into split of integral number, will positive integer Nu be expressed as the sum of several positive integers, do not consider it
The order of summation.Every kind of number of users spin-off result vectorIt is put into user's integer matrix Q as i-th row vector.
4b) removal number of users spin-off result vectorIn neutral element, obtain qi={ qi,1,qi,2,…,qi,W, wherein 0<
qi,1≤qi,2≤…≤qi,W≤Nu,W≤Nu.This operation is repeated until often row is finished in matrix Q, new user is obtained whole
Number partition set Q.
A q 4c) is chosen in Nu user to be pairedi,1Individual user, user is put into using the numbering of these users as element
Group set Ai,1In.
4d) in remaining Nu-qi,1A q is chosen in individual user to be pairedi,2Individual user, using the numbering of these users as unit
Element is put into user's group set Ai,2In.
4e) repeat step 4c) and 4d) until user's group set AiCompletely.
4f) repeat step 4c), 4d) and 4e) until user's group set A is complete.
4g) number of users q in removal user's group set Ai,WMore than the set of antenna number Nr, user's group partition number set is obtained
G。
Step 5, according to user's group partition number set G, generates user's pairing mode matrix B
A Nu row, Na row 5a) are generated, and element is 0 initial user pairing mode matrix B0, wherein, Na is equal to
The number of element in user's group partition number set G.
5b) judge whether be equal to l comprising numbering in p-th element of user's group partition number set GiUser, if so, then
Make user's pairing mode matrix B0LiRow, the element of pth row are equal to 1, otherwise, make it be equal to 0.
To 5c) possess the initial user pairing mode matrix B of element value0As final user's pairing mode matrix B.
Step 6, is N*Nu rows by grey iterative generation size, and the user order of modulation matrix M of Na row, and size is N rows, Na
The user's group capacity matrix ψ of row
U=1, h=1 6a) are made, one size of generation is the initial user modulation that N*Nu rows, Na row, and element are equal to 0
Exponent number matrix M0；One size of generation is N rows, Na row simultaneously, and element is equal to 0 initial user pool-size matrix ψ0。
K=1 6b) is made, u-th user's group is selected from user's group partition number set G.
6c) according to the following formula, calculate on h-th Resource Block, the Signal to Interference plus Noise Ratio of k-th user in u-th user's group
Value SINRu,k,h：
Wherein, EkRepresent k-th transmission power of user, σ2Represent the channel noise power of current time slots, ζu,hRepresent u
Channel matrix of the individual user's group on h-th Resource Block, InExpression size is n rows, the unit matrix of n row, and n represents u-th use
User's number that family group is included, ()HRepresent the operation of Hermitian transposition, ()-1Expression takes inverse operation, []k,kRepresenting matrix kth
The element of row, kth row.
6d) in the case of given bit error rate threshold value b, according to the following formula, k-th user in u-th user's group is calculated
Order of modulation on h-th Resource BlockAnd shouldIt is put into matrix M0(h-1) * Nu+lkRow, v1Row, its
In, v1Numerically equal to u, lkRepresent k-th numbering of user：
Wherein, b is default system bit error rate threshold value, and floor () represents downward floor operation, log2() table
Show the log operations taken with 2 bottom of for, ln () is represented and taken from right log operations.
6e) judge whether k is equal to the number n of the user included in u-th user's group, if so, performing 6f), otherwise, make k
=k+1, returns to 6c).
6f) judge whether the order of modulation of each user in u-th user's group is not equal to 0, if so, then by u-th use
The order of modulation of all users is added in the group of family, obtains u-th capacity of user's group；Otherwise, u-th capacity of user's group etc. is made
In 0；The capability value of u-th user's group that will be obtained again is put into matrix ψ0V2Row, v3Row, wherein, v2Numerically equal to h,
v3Numerically equal to u, performs 6g).
6g) judge whether u is equal to Na, if so, then performing 6h)；Otherwise, u=u+1 is made, 6b is returned).
6h) judge whether h is equal to N, if so, will then possess the initial user order of modulation matrix M of element value0As final
User order of modulation matrix M, and will possess the initial user capacity matrix ψ of element value0As final user capacity matrix
ψ, terminates；Otherwise, h=h+1, u=1 are made, 6b is returned).
Step 7, according to resource block assignments mode matrix T and user's group capacity matrix ψ, obtains capacity vector η
7a) make τ=1,And length is generated for Na*Z, initial capacity vector η of the element all equal to 00。
7b) the of the row vector that will be obtained after the τ column data transposition of user capacity matrix ψ and resource assignment matrix TRow
Data are multiplied, and the product is assigned into initial capacity vector η0InIndividual element.
7c) judge whether τ is equal to Na, if so, then performing 7d)；Otherwise, then τ=τ+1 is made, 7b is returned).
7d) judgeWhether Z is equal to, if so, then by the initial capacity vector η after assignment0As user capacity vector η；It is no
Then, makeτ=1, returns to 7b).
Step 8, according to resource allocation constraint matrix, user pairing constraint matrix and capacity vector η, builds virtual MIMO system
System user pairing and resource allocation system model：
s.t.C1x≤1N
C2x≤1Nu
Wherein, x represents user's pairing and the instruction of resource allocation vector, ηTX represents power system capacity value, 1NRepresent that length is N
And vector of the element all equal to 1,1NuRepresent that length is the vector of Nu and element all equal to 1, ()TTransposition operation is represented,The operation of the x for causing the value in bracket maximum is obtained in expression.
Step 9, using the Hungarian Method user pairing based on greedy algorithm and resource allocation system model, and obtains
Take family pairing and resource allocation result
9a) generate a Na row, the full null matrix C of Z row0, wherein Na be equal to user's group partition number set G in element
Number, Z is equal to the number of element in complete resource block assignments set P.
9b) take family component and tear manifold open and close any one user grouping in G, in seeking the complete resource block assignments set P of its correspondence
The channel capacity of every kind of resource model.Its locally optimal resource model of correspondence is obtained using Hungary Algorithm, and by Matrix C0
In element corresponding to this pairing situation be equal to 1.
9c) repeat 9b) operate until Matrix C0In often row all there is element 1, that is, obtain every in user's group partition number set G
Plant the corresponding resource model of user grouping.To possess the initial matrix C of element value0Matched as the user of final local optimum
With resource allocation result Matrix C.
9d) the user's pairing using Hungary Algorithm treatment local optimum and resource allocation result Matrix C, you can obtain complete
The optimal user's pairing of office and resource allocation result matrix U.
Step 10, using user's pairing and the result vector U and user order of modulation matrix M of resource allocation, to each use
The information that family carries is modulated
10a) make δ=1.
10b) take out (δ -1) * Nr+1 to (δ -1) * Nr+Nr units of the result vector U of user's pairing and resource allocation
It is not equal to 0 element in element, and it is u to set them1,u2,…,uγ,…,ud, wherein, uγRepresent user's pairing and resource allocation
The γ element for being not equal to 0, γ ∈ [1, d], d etc. in (δ -1) * Nr+1 of result vector U to (δ -1) * Nr+Nr elements
It is not equal to 0 unit in (δ -1) * Nr+1 to (δ -1) * Nr+Nr elements of user's pairing and the result vector U of resource allocation
The total number of element.
10c) according to u1,u2,…,uγ,…,ud, according to the following formula, calculate the numbering w of user couple：
Wherein, C is represented and is taken number of combinations operation.
10d) make γ=1.
10e) take (δ -1) * Nu+u in family order of modulation matrix MγRow, theThe element m of rowγIt is equal to as numbering
uγUser optimal order of modulation, to numbering be equal to ujUser carry data message carry out mγThe quadrature amplitude of rank is adjusted
System, whereinThe numerically equal to numbering w of user couple.
10f) judge whether γ is equal to d, if so, then performing 10g), otherwise, γ=γ+1 is made, return to 10e).
10g) judge whether δ is equal to N, if so, then end loop；Otherwise, δ=δ+1 is made, 10b is returned).
Step 11, judges whether user's stream of next time slot, if so, selecting the user of next time slot to flow, returns to step
Rapid 1；Otherwise, user's pairing and the resource allocation of all user's streams are completed.
User grouping of the present invention based on partition number quickly carries out on-fixed number multi-user pairing, with based on greedy algorithm
Hungarian Method virtual MIMO system in based on partition number fast joint resource allocator model during obtain first
Local optimum, further solves global optimum.The present invention maximizes system frequency and utilizes in the case where computation complexity is low
Rate, improves system communication quality.
Effect of the invention can be further illustrated by emulation：
Embodiment 7
The fast joint resource allocation methods based on partition number are with embodiment 1-6 in virtual MIMO system.
Simulated conditions：
Implementation process of the present invention is related to base station, and multi-user, the Resource Block being associated with base station, are in virtual MIMO system
Middle realization.Based on this situation, emulation is carried out in the radio communication scene of multiple base stations, if number of users to be paired is 32, is connect
It is 4 to receive antenna number, and Resource Block number is 6, and the detection mode of emulation experiment setting signal receiver of the present invention is lowest mean square
Error-detecting, and assume that channel matrix is constant in single time slot.Existing fixation and is fixed into 3 users at 2 user groupings
Pairing and resource allocation methods and the method for the present invention are in system spectrum utilization rate, number of users is more and the few time-frequency spectrum of number of users is utilized
The performance of rate these two aspects carries out emulation experiment contrast.
Emulation content：
Emulation 1, according to above-mentioned simulated conditions, respectively with being based on partition number in virtual MIMO system proposed by the present invention
Fast joint resource allocation methods and existing fix 2 users and fix 3 user groupings and resource allocation methods and carry out virtually
The availability of frequency spectrum emulation of mimo system, simulation result such as Fig. 2.
Simulation result：
As can be seen from Figure 2：The availability of frequency spectrum obtained with the inventive method is apparently higher than existing method.Signal to noise ratio exists
During 0-3dB, the availability of frequency spectrum that the availability of frequency spectrum and the inventive method obtained using existing method are obtained is more or less the same；Noise
During than more than 3dB, the spectrum efficiency that the inventive method is obtained, when signal to noise ratio reaches 24dB, is invented apparently higher than existing method
The spectrum efficiency that method is obtained has reached 25bit/s/Hz, and existing fixes 3 user groupings and resource allocation methods obtain
Spectrum efficiency is 21bit/s/Hz, existing to fix the spectrum efficiency that 2 user groupings and resource allocation methods obtain and only reach
17bit/s/Hz.This explanation using the fast joint resource allocation methods in virtual MIMO system of the invention based on partition number with
It is existing to fix 2 users and maximize the availability of frequency spectrum of system with fixing 3 user groupings and compared with resource allocation methods.
Embodiment 8
The fast joint resource allocation methods based on partition number are with embodiment 1-6 in virtual MIMO system, simulated conditions and
Emulation content is with embodiment 7, wherein when emulation number of users is more, number of users to be paired is 32, when emulation number of users is less,
Number of users to be paired is 8, and simulation result is referring to Fig. 3.
Emulation 2, according to above-mentioned simulated conditions, respectively with being based on partition number in virtual MIMO system proposed by the present invention
The availability of frequency spectrum that fast joint resource allocation methods and existing fixed user grouping and resource allocation methods carry out system is imitated
Very, as a result such as Fig. 3.
As can be seen from Figure 3：Two dotted lines are respectively the frequency of the inventive method and existing method when number of users is less
Spectrum utilization rate curve, it is bent that two solid lines are respectively the availability of frequency spectrum of the inventive method and existing method when number of users is more
Line.Can be drawn by simulation curve obtained with the fast joint resource allocation methods based on partition number in virtual MIMO system of the present invention
The availability of frequency spectrum apparently higher than existing fixed user grouping and resource allocation methods.No matter number of users it is more or
When number of users is less, the spectrum efficiency that the inventive method is obtained all apparently higher than existing method, in addition when number of users is more
When, the availability of frequency spectrum of the inventive method can be higher.This explanation is had using the method for the present invention when number of users is a lot
System spectrum utilization rate higher.
In sum, it is of the invention that user's marriage problem and resource allocation problem are joined together to consider simultaneously, using partition
Number is quick to carry out user's pairing joint virtual MIMO resource allocation, and mainly solving prior art cannot be in the big situation of number of users
The dynamic subscriber's pairing for quickly carrying out on-fixed number of users down and resource allocation and cause that the availability of frequency spectrum is low and communication quality is poor
Problem.Its technical scheme is：User grouping is quickly obtained using partition number, constraint matrix, resource allocation are matched by user
Constraint matrix, user are low to obtain computation complexity using the Hungarian Method based on greedy algorithm to capacity vector
Optimal user pairing result and resource allocation result；Each user is carried according to the result vector and user's modulation matrix
Data message is modulated；Data message after modulation is sent to signal receiver on the Resource Block that user is assigned to.This
Invention can efficiently carry out multi-user's pairing, the resource allocation of on-fixed number, can be by user's marriage problem and resource allocation
Problem joins together to consider simultaneously, in the case where computation complexity is low, maximizes the frequency efficiency of system, raising system
Communication quality.
Claims (5)
1. the fast joint resource allocation methods of partition number are based in virtual MIMO system, it is characterised in that include following step
Suddenly：
(1) base station obtains basic parameter
Base station obtains user's set l to be paired, number of users Nu to be paired, resource set of blocks r, the Resource Block number N of current time slots
And reception antenna number Nr；
(2) complete resource block assignments set and resource allocation constraint matrix are built
According to Resource Block number N, complete resource block assignments set P is formed；According to the complete resource block assignments set P, generation money
Source block allocation model matrix T, obtains resource allocation constraint matrix：Wherein 1NRepresent length with Resource Block
N is identical for number, and element value is equal to 1 vector,The computing of Kronecker product is asked in expression；
(3) set of user's group partition number and user's partition number pairing constraint matrix are built
(3.1) user's group partition number set is built
According to number of users Nu to be paired, user to be paired is split into user's group of the every group of number of users no more than Nu, obtains user
Manifold closes A；Further according to reception antenna number Nr, set of the number of users more than Nr in removal number of users set A, generation user's group partition
Manifold closes G；
(3.2) user's partition number pairing constraint matrix is built
According to user's group partition number set G, user's partition number pairing mode matrix B is generated, obtain the pairing constraint of user's partition number
Matrix：Wherein 1NuRepresent length it is identical with number of users Nu to be paired, and element value be equal to 1 to
Amount；
(4) user's order of modulation matrix and user's group capacity matrix are built
It is that N*Nu rows, the user order of modulation matrix M of Na row, and size are N rows, the user's group of Na row by grey iterative generation size
Capacity matrix ψ, wherein Na are numerically equal to the element number in user's group partition number set G；
(5) user capacity vector is calculated
According to resource block assignments mode matrix T and user's group capacity matrix ψ, capacity vector η is obtained；
(6) the fast joint resource allocator model based on partition number in construction virtual MIMO system
Constraint matrix C2 and capacity vector η is matched as parameter with resource assignment constraints Matrix C 1, user, user's pairing is built and is provided
Source distribution system model：
s.t.C1x≤1N
C2x≤1Nu
Wherein, x represents user's pairing and the instruction of resource allocation vector, ηTX represents power system capacity value, 1NRepresent that length is N and unit
Vector of the element all equal to 1,1NuRepresent that length is the vector of Nu and element all equal to 1, ()TTransposition operation is represented,The operation of the x for causing the value in bracket maximum is obtained in expression；
(7) using the Hungarian Method user pairing based on greedy algorithm and resource allocation system model, and user is obtained
Pairing and resource allocation result
Manifold is torn open by traverse user component and closes every kind of user grouping situation in G, obtain the complete resource block assignments set P of its correspondence
In every kind of resource model channel capacity, the optimal knot of local channel capacity is drawn by the Hungary Algorithm based on greedy algorithm
Really, the result is stored in set C；Hungary Algorithm is carried out again to set C, user's pairing of global optimum is obtained and is provided
The result vector U of source distribution；
(8) data message serviced required for user is modulated
According to user's pairing and the result vector U and user order of modulation matrix M of resource allocation, the information carried to each user
It is modulated, then the information after each user modulation is sent to the signal of base station in the Resource Block assigned by this user
Receiver, the user's pairing for completing this time slot user stream and resource allocation；
(9) dispatching distribution of next time slot is proceeded
User's stream of next time slot is judged whether, if so, selecting the user of next time slot to flow, returning to (1) carries out lower a period of time
User's pairing of gap user stream and resource allocation；Otherwise, user's pairing and the resource allocation of all user's streams are completed.
2. the fast joint resource allocation methods of partition number are based in virtual MIMO system according to claim 1, wherein
According to user's set l to be paired and reception antenna number Nr in step (3), user's group partition number set G is generated, entered as follows
OK：
Number of users Nu 3.1a) is carried out into split of integral number, will positive integer Nu be expressed as the sum of several positive integers, do not consider that it is asked
The order of sum.Every kind of number of users spin-off result vectorIt is put into user's integer matrix Q as i-th row vector；
3.1b) removal number of users spin-off result vectorIn neutral element, obtain qi={ qi,1,qi,2,…,qi,W, wherein 0<qi,1
≤qi,2≤…≤qi,W≤Nu,W≤Nu.This operation is repeated until often row is finished in matrix Q, new user's integer point is obtained
Tear set Q open；
A q 3.1c) is chosen in Nu user to be pairedi,1Individual user, user's group is put into using the numbering of these users as element
Set Ai,1In；
3.1d) in remaining Nu-qi,1A q is chosen in individual user to be pairedi,2Individual user, using the numbering of these users as element
It is put into user's group set Ai,2In；
3.1e) repeat step 3.1c) and 3.1d) until user's group set AiCompletely；
3.1f) repeat step 3.1c), 3.1d) and 3.1e) until user's group set A is complete；
3.1g) number of users q in removal user's group set Ai,WMore than the set of antenna number Nr, user's group partition number set G is obtained.
3. the fast joint resource allocation methods of partition number are based in virtual MIMO system according to claim 1, wherein
According to user's group partition number set G in step (3), user's pairing mode matrix B is generated, carried out as follows：
A Nu row, Na row 3.2a) are generated, and element is 0 initial user pairing mode matrix B0, wherein, Na is equal to user
Component tears the number that manifold closes element in G open；
3.2b) judge whether be equal to l comprising numbering in p-th element of user's group partition number set GiUser, if so, then making
User's pairing mode matrix B0LiRow, the element of pth row are equal to 1, otherwise, make it be equal to 0；
To 3.2c) possess the initial user pairing mode matrix B of element value0As final user's pairing mode matrix B.
4. the fast joint resource allocation methods of partition number are based in virtual MIMO system according to claim 1, wherein
In step (4) is that N*Nu rows, the user order of modulation matrix M of Na row, and size are N rows, Na row by grey iterative generation size
User's group capacity matrix ψ, carry out as follows：
U=1, h=1 4a) are made, one size of generation is N*Nu rows, and Na is arranged, and element is equal to 0 initial user order of modulation
Matrix M0；One size of generation is N rows, Na row simultaneously, and element is equal to 0 initial user pool-size matrix ψ0；
K=1 4b) is made, u-th user's group is selected from user's group partition number set G；
4c) according to the following formula, calculate on h-th Resource Block, the value of the Signal to Interference plus Noise Ratio of k-th user in u-th user's group
SINRu,k,h：
Wherein, EkRepresent k-th transmission power of user, σ2The channel noise power of current time slots is represented, ζ u, h is represented u-th
Channel matrix of the user's group on h-th Resource Block, InExpression size is n rows, the unit matrix of n row, and n represents u-th user
User's number that group is included, ()HRepresent the operation of Hermitian transposition, ()-1Expression takes inverse operation, []k,kRepresenting matrix row k,
The element of kth row；
4d) in the case of given bit error rate threshold value b, according to the following formula, k-th user is in h in calculating u-th user's group
Order of modulation on individual Resource BlockAnd shouldIt is put into matrix M0(h-1) * Nu+lkRow, v1Row, wherein, v1Number
U, l are equal in valuekRepresent k-th numbering of user；
Wherein, b is default system bit error rate threshold value, and floor () represents downward floor operation, log2() represents and takes
It is the log operations at bottom with 2, ln () is represented and taken from right log operations；
4e) judge whether k is equal to the number n of the user included in u-th user's group, if so, performing 4f), otherwise, make k=k+
1, return to 4c)；
4f) judge whether the order of modulation of each user in u-th user's group is not equal to 0, if so, then by u-th user's group
In all users order of modulation be added, obtain u-th capacity of user's group；Otherwise, u-th capacity of user's group is made to be equal to 0；
The capability value of u-th user's group that will be obtained again is put into matrix ψ0V2Row, v3Row, wherein, v2Numerically equal to h, v3Number
U is equal in value, 4g is performed)；
4g) judge whether u is equal to Na, if so, then performing 4h)；Otherwise, u=u+1 is made, 4b is returned)；
4h) judge whether h is equal to N, if so, will then possess the initial user order of modulation matrix M of element value0As final use
Family order of modulation matrix M, and will possess the initial user capacity matrix ψ of element value0As final user capacity matrix ψ, knot
Beam；Otherwise, h=h+1, u=1 are made, 4b is returned).
5. the fast joint resource allocation methods of partition number are based in virtual MIMO system according to claim 1, and it is special
Levy and be, the wherein utilization in step (7) is based on Hungarian Method user pairing and the resource allocation system of greedy algorithm
Model, and user's pairing and resource allocation result are obtained, carry out as follows：
7a) generate a Na row, the full null matrix C of Z row0, wherein Na be equal to user's group partition number set G in element number, Z
Equal to the number of element in complete resource block assignments set P；
7b) take family component and tear manifold open and close any one user grouping in G, ask every kind of in the complete resource block assignments set P of its correspondence
The channel capacity of resource model.Its locally optimal resource model of correspondence is obtained using Hungary Algorithm, and by Matrix C0In this
Element corresponding to pairing situation is equal to 1；
7c) repeat 7b) operate until Matrix C0In often row all there is element 1, that is, obtain every kind of use in user's group partition number set G
Family is grouped corresponding resource model.To possess the initial matrix C of element value0As user's pairing of final local optimum and money
Source allocation result Matrix C；
7d) the user's pairing using Hungary Algorithm treatment local optimum and resource allocation result Matrix C, you can obtain the overall situation most
Excellent user's pairing and resource allocation result matrix U.
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 true CN106793120A (en) | 2017-05-31 |
| CN106793120B 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) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107478981A (en) * | 2017-08-22 | 2017-12-15 | 哈尔滨工业大学 | A kind of test and excitation set method for optimizing based on greedy algorithm |
| CN109728891A (en) * | 2018-12-26 | 2019-05-07 | 西安电子科技大学 | User's matching method in MU-MIMO system based on cluster |
Citations (2)
| 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 |
-
2016
- 2016-12-23 CN CN201611204196.1A patent/CN106793120B/en active Active
Patent Citations (2)
| 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)
| Title |
|---|
| 张立: "LTE-A系统上行链路虚拟MIMO用户配对算法研究", 《西安电子科技大学学位论文》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107478981A (en) * | 2017-08-22 | 2017-12-15 | 哈尔滨工业大学 | A kind of test and excitation set method for optimizing based on greedy algorithm |
| CN109728891A (en) * | 2018-12-26 | 2019-05-07 | 西安电子科技大学 | User's matching method in MU-MIMO system based on cluster |
| CN109728891B (en) * | 2018-12-26 | 2021-05-18 | 西安电子科技大学 | Clustering-based user pairing method in MU-MIMO system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106793120B (en) | 2019-12-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105827273B (en) | The extensive mimo system user double antenna Pilot Interference removing method of multiple cell | |
| CN104702326B (en) | Virtual MIMO user pairing and resource allocation methods based on MSE | |
| CN103220024A (en) | Beam forming algorithm of multi-user pairing virtual multi-input multi-output (MIMO) system | |
| CN107613555A (en) | Non-orthogonal multiple accesses honeycomb and terminal direct connection dense network resource management-control method | |
| CN104980389A (en) | Differential new user selection access method applicable to non-orthogonal multi-access system | |
| CN103763782A (en) | Dispatching method for MU-MIMO down link based on fairness related to weighting users | |
| CN105429741B (en) | Joint virtual MIMO resource allocation methods based on dynamic subscriber's pairing | |
| CN101925070A (en) | A kind of resource allocation method for cognitive system based on spatial reuse | |
| CN106304364A (en) | A kind of relay system federated resource distribution method optimum based on efficiency | |
| CN102025462B (en) | Block diagonalization precoding method used in MU-MIMO (Multiuser-Multiple Input Multiple Output) system down link | |
| CN105680925A (en) | Interference-alignment-based power control method for D2D user | |
| CN105871434A (en) | Topology interference alignment method for MIMO (Multiple Input Multiple Output) interference channel | |
| CN105450274A (en) | Optimal energy efficiency-based user number optimization method for large-scale and multi-antenna relay system | |
| CN107734697A (en) | Low-complexity multi-user group technology based on NOMA systems | |
| CN102958172B (en) | Based on the resource allocation algorithm of proportional fairness in grouping MIMO-MC-CDMA system | |
| CN106231665A (en) | Resource allocation methods based on the switching of RRH dynamic mode in number energy integrated network | |
| CN107947841A (en) | Extensive MIMO non-orthogonal multiple system multiple antennas users are to dispatching method | |
| CN105490795A (en) | Mobile wireless network node one-dimensional disposition method based on cooperative transmission technology | |
| CN106793120A (en) | Fast joint resource allocation methods based on partition number in virtual MIMO system | |
| CN106793111B (en) | Joint virtual MIMO resource allocation methods are matched based on dynamic multiple cell user | |
| CN106304239A (en) | The relay selection method of energy acquisition multi-relay cooperation communication system | |
| CN105978673A (en) | User distance based pilot frequency distribution method in large scale distributive antenna system | |
| CN102006146B (en) | User scheduling method for multiple-user multiple input multiple output (MU-MIMO) system downlink | |
| CN105072686B (en) | A kind of wireless resource allocation methods based on OFDMA junction network | |
| CN103269488B (en) | Based on maximum and speed collaborative communication method in cognition wireless network |
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 |