CN106793111B - Joint virtual MIMO resource allocation methods are matched based on dynamic multiple cell user - Google Patents
Joint virtual MIMO resource allocation methods are matched based on dynamic multiple cell user Download PDFInfo
- Publication number
- CN106793111B CN106793111B CN201611065970.5A CN201611065970A CN106793111B CN 106793111 B CN106793111 B CN 106793111B CN 201611065970 A CN201611065970 A CN 201611065970A CN 106793111 B CN106793111 B CN 106793111B
- Authority
- CN
- China
- Prior art keywords
- user
- matrix
- equal
- resource
- vector
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses one kind to match joint virtual MIMO resource allocation methods based on dynamic multiple cell user, mainly solves the problems, such as the prior art can not dynamic debugging system multiple cell user match and cause the availability of frequency spectrum low poor with communication quality with resource allocation.Technical solution is: matching constraint matrix, cell assignment constraints matrix and user to capacity vector as parameter using resource assignment constraints matrix, user, multiple cell user pairing and model and the solution of resource allocation are constructed, optimal user pairing and resource allocation result vector are obtained；It is modulated according to the data information that result vector and user's modulation matrix carry each user；Data information is sent to signal receiver on the resource block that user is assigned to after modulation.The present invention can efficiently carry out dynamic, multi-user pairing and resource allocation, realize when meeting system communication quality requirement and maximize the communication system availability of frequency spectrum.Multiple cell user pairing and resource allocation are carried out for the mobile phone user in virtual MIMO system.
Description
Technical field
The invention belongs to fields of communication technology, further relate to virtual multiple-input and multiple-output MIMO resource allocation methods,
It is specifically a kind of that joint virtual MIMO resource allocation methods are matched based on dynamic multiple cell user.For in virtual MIMO system
In uplink.
It is used for resource block in the uplink of virtual MIMO system, dynamically to be distributed to the mobile phone matched
Family pair, so that information entrained by each mobile phone user of mobile phone user's centering on the resource block that it is assigned to while being sent to base
The signal receiver stood maximizes the availability of frequency spectrum of system
Background technique
Multiple-input and multiple-output MIMO technology is widely used for improving spectrum efficiency in various wireless communication systems.So
And due to the cost and size of user equipment and difficulty in terms of practical operations is waited, so that multiple-input and multiple-output MIMO technology
Limited in the application of uplink.In order to solve this problem, researcher proposes virtual multiple-input and multiple-output MIMO
Method, the problem of the cost and size limitation of the user equipment of effective solution, i.e., uplink is to two or more use
Family is matched, and disposes single transmitting antenna to each pairing user in identical frequency band and time slot, with conventional multi input
Multi output mimo system is compared, and virtual multiple-input and multiple-output MIMO can be by designing good single community user pairing and resource tune
Strategy is spent to obtain the biggish availability of frequency spectrum and lesser bit error rate.But since the number of users of single subdistrict is limited,
It is limited to match number of users, user in cell selects gain limited, and selection gain of the user in base station is limited, still remains and is
The not high enough problem of the availability of frequency spectrum of uniting.
Existing resource allocation techniques are mostly to consider single community user marriage problem and resource allocation problem, are usually first examined
Consider single community user marriage problem, that is, single community user pairing of number is fixed；Consider further that resource allocation problem, i.e., to be
System availability of frequency spectrum maximum turns to optimization aim, and resource block is distributed to the user couple prepared.This method will not be more
Community user marriage problem takes into account, and the existing selection gain of multiple cell user pairing is not accounted for, so cannot obtain most
Big system spectrum utilization rate；
To sum up, now with the increase of mobile subscriber and the increase of customer service, existing multiple-input and multiple-output MIMO system
Its system spectrum utilization rate of uniting is not high, also, existing method cannot be guaranteed that the bit error rate of system under a certain threshold value, influences
The raising of communication quality.
Summary of the invention
It is an object of the invention in view of the above shortcomings of the prior art, propose that one kind makes full use of frequency spectrum resource, communication
Quality is higher to match joint virtual MIMO resource allocation methods based on dynamic multiple cell user.
The present invention is a kind of joint virtual MIMO resource allocation methods based on dynamic multiple cell user pairing, and feature exists
In, including have the following steps,
(1) base station obtains basic parameter
(2) base station obtains user's set l to be paired, the single N of current time slotsuCell number of users N to be pairedu, number of cells
L, resource set of blocks r, resource block number N, receiving antenna number NrAnd each user is to the distance d of each cell base station；
(2) resource allocation constraint matrix is constructed
According to resource set of blocks r and resource block number N, optional resource block distribution set P is formed；According to the optional resource block
Set P is distributed, resource block allocation model matrix T is generated, obtains resource allocation constraint matrix:1|G|
With 1LUnit vector is indicated, wherein 1|G|For the element number of length and optional user pair set G | G | identical unit vector, 1L
For length unit vector identical with number of cells L,The operation of Kronecker product is asked in expression；
(3) building user matches constraint matrix
According to user's set l to be paired and receiving antenna number Nr, generate optional user pair set G；According to optional user couple
Set G generates user's pairing mode matrix B, obtains user and matches constraint matrix:1LWith 1PIt indicates
Unit vector, wherein 1LFor length unit vector identical with number of cells L, 1PFor length and single cell number of users N to be pairedu
Identical unit vector；
(4) cell assignment constraints matrix is constructed
Set P, user pair set G, number of cells L are distributed according to obtained resource block, obtains cell assignment constraints matrix:Wherein 1LIndicate that length is identical as number of cells L, ILIt is unit matrix, 1P×|G|Expression length is P
× | G | unit vector；
(5) decay factor is calculated, generates user's order of modulation matrix and user to capacity matrix
β refers to disturbing factor caused by path loss and shadow fading, according to each user to each cell base station
Distance calculates each user to the relative attenuation factor of each cell base station, is N* further according to number of cells L grey iterative generation size
L*NuRow, the user order of modulation matrix M and size of Na column are the users of N row, Na column to undamped capacity matrix ψ, wherein
Na is numerically equal to the element number in optional user pair set G, then, by decay factor β and user to undamped capacity moment
Battle array ψ obtains actual user to capacity matrix ζ；
(6) user capacity vector is calculated
According to resource block allocation model matrix T and user to capacity matrix ψ, capacity vector is calculated using channel capacity
η；
(7) it constructs and solves dynamic multiple cell user and match joint virtual MIMO resource allocator model
(7.1) construction dynamic multiple cell user matches joint virtual MIMO resource allocator model
Constraint matrix C2, cell assignment constraints Matrix C 3 and capacity vector η are matched with resource assignment constraints Matrix C 1, user
For parameter, user's pairing and resource allocator model are constructed, realizes that, in number of users, resource block number, number of cells three is common
The maximum system capacity of constraint；
s.t.C1x≤1N
C3x≤1L
Wherein, x indicates user's pairing, the instruction vector of resource allocation and cell distribution, ηTX expression power system capacity value, 1NTable
Show that length is the vector of N and element all equal to 1,Indicate that length is NuAnd vector of the element all equal to 1,1LIndicate length
It is the vector of L and element all equal to 1, ()TIndicate transposition operation,Expression is found out so that the value in bracket is maximum
The operation of x；
(7.2) it solves dynamic multiple cell user and matches joint virtual MIMO resource allocator model
Dynamic multiple cell user is solved using business software MATLAB and matches joint virtual MIMO resource allocator model, is solved
User matches out, and the instruction vector x of resource allocation and cell distribution, instruction vector x carries required for multiple cell dynamic subscriber
The data information of service；
(8) data information of service required for the multiple cell dynamic subscriber carried to user is modulated
It is matched according to specific user, user's order of modulation of the data result vector U sum of resource allocation and cell distribution
Matrix M, the data carried to each user are modulated, then by the modulated information of each user assigned by this user
Resource block in be sent to base station, complete this time slot user stream user pairing, resource allocation and cell distribution；
(9) continue the dispatching distribution of next time slot
The user's stream for judging whether there is next time slot, if so, the user of next time slot is selected to flow, return step (1) after
The continuous joint virtual MIMO scheduling of resource for carrying out dynamic multiple cell user pairing；Otherwise, user's pairing of all user's streams is completed,
Resource allocation and cell distribution.
User pairing and resource allocation of the present invention in dynamic adjustment system, are realized to the Adaptive Modulation of user
On the basis of, it adds base station selected between multiple cell, ensures system spectrum utilization rate while guaranteeing system bit error rate
Reach maximum.
Compared with the prior art, the present invention has the following advantages:
First, it, will be how small since the present invention is using the method for building multiple cell user pairing and resource allocation conjunctive model
Area's user's marriage problem and resource allocation problem join together to consider simultaneously, overcome cannot carry out simultaneously in the prior art it is how small
The problem of area user pairing and resource allocation, also overcomes the problem of 2 users that the prior art can only be fixed match, so that
The present invention can efficiently carry out dynamic multiple cell user pairing and resource allocation simultaneously, and then maximize the frequency utilization of system
Rate；
Second, since the present invention uses in the case where given system bit error rate thresholding, dynamically according to channel status
The method for carrying out multiple cell user pairing and resource allocation overcomes the prior art in resource allocation process it cannot be guaranteed that system
The problem of communication quality, enables the present invention while frequency efficiency of the system of maximization, guarantees the bit error rate of system
Under threshold value, and then improve system communication quality.
Detailed description of the invention:
Fig. 1 is flow diagram of the invention；
Fig. 2 is user's pairing and resource under the selection gain for whether including multiple cell with the present invention and the prior art
The availability of frequency spectrum simulation comparison figure of system after distribution；
Fig. 3 is matched when each community user number is more or less to user with the present invention and the prior art
With the availability of frequency spectrum simulation comparison figure of system after resource allocation.
Specific embodiment
With the increase of communication user number, the microminiaturization of urban cells, the growing tension of frequency spectrum resource, the prior art pair
The more efficient utilization of frequency spectrum is can not achieve in the selection of the user of single subdistrict and the distribution of resource block, therefore the present invention proposes
A kind of user's pairing of dynamic multiple cell and the scheme of resource allocation.Referring to attached drawing 1, specific implementation step of the invention is such as
Under:
Embodiment 1
The present invention is a kind of joint virtual MIMO resource allocation methods based on dynamic multiple cell user pairing, referring to Fig. 1,
Including having the following steps,
(1) base station obtains basic parameter
User's set l to be paired, the single N of base station acquisition current time slotsuCell number of users N to be pairedu, number of cells L,
Resource set of blocks r, resource block number N, receiving antenna number NrAnd each user is to the distance d of each cell base station；Base of the present invention
The parameter obtained of standing not only includes the parameter of user itself, further includes resource block, the parameter of cell.
(2) resource allocation constraint matrix is constructed
According to resource set of blocks r and resource block number N, optional resource block distribution set P is formed；According to the optional resource block
Set P is distributed, resource block allocation model matrix T is generated, obtains resource allocation constraint matrix:1|G|
With 1LUnit vector is indicated, wherein 1|G|For the element number of length and optional user pair set G | G | identical unit vector, 1L
For length unit vector identical with number of cells L,The operation of Kronecker product, the reflection of resource allocation constraint matrix are asked in expression
Complete resource block assembled scheme.
(3) building user matches constraint matrix
According to user's set l to be paired and receiving antenna number Nr, generate optional user pair set G；According to optional user couple
Set G generates user's pairing mode matrix B, obtains user and matches constraint matrix:1LWith 1PIt indicates
Unit vector, wherein 1LFor length unit vector identical with number of cells L, 1PFor length and single cell number of users N to be pairedu
Identical unit vector, that is, wherein 1LIndicate that length is identical as number of cells L, and element value is equal to 1 vector, 1P
Indicate length and single subdistrict number of users N to be paireduIt is identical, and element value is equal to 1 vector, user matches constraint matrix
It reflects complete user and matches scheme.
(4) cell assignment constraints matrix is constructed
Set P, user pair set G, number of cells L are distributed according to obtained resource block, obtains cell assignment constraints matrix:Wherein 1LIndicate that length is identical as number of cells L, ILIt is unit matrix, 1P×|G|Expression length is P
× | G | unit vector；Cell assignment constraints matrix embodies complete cell allocation plan.
Above step constructs the constraint condition of dispatching criterion of the present invention.
(5) decay factor is calculated, generates user's order of modulation matrix and user to capacity matrix
β refers to disturbing factor caused by path loss and shadow fading, according to each user to each cell base station
Distance, calculate each user to each cell base station the relative attenuation factor；Channel relative attenuation factor-beta is introduced, further according to small
Area's number L grey iterative generation size is N*L*NuRow, the user order of modulation matrix M and size of Na column are the users of N row, Na column
To undamped capacity matrix ψ, wherein Na is numerically equal to the element number in optional user pair set G, then, by decaying because
Sub- β and user obtain actual user to capacity matrix ζ to undamped capacity matrix ψ；Channel relative attenuation factor-beta is introduced, is used for
Actual gain situation between user and base station is described.I.e. by decay factor, actual channel gain information has been calculated,
And then the capacity of each user has been obtained, in case resource allocation below, scheduling is used.
(6) user capacity vector is calculated
The user that the resource block allocation model matrix T and step (5) obtained according to step (2) is obtained adopts capacity matrix ψ
Capacity vector η is calculated with channel capacity；
Above step constructs the objective function of dispatching criterion of the present invention.
(7) it constructs and solves dynamic multiple cell user and match joint virtual MIMO resource allocator model
(7.1) construction dynamic multiple cell user matches joint virtual MIMO resource allocator model
The user that the resource allocation constraint matrix C1 that is obtained with step (2), step (3) obtain matches constraint matrix C2, step
Suddenly the capacity vector η that the cell assignment constraints Matrix C 3 and step (6) that (4) obtain obtain is parameter, building user pairing and money
Source distribution model is realized in number of users, resource block number, the maximum system capacity that number of cells three constrains jointly；
s.t.C1x≤1N
C3x≤1L
Wherein, x indicates user's pairing, the instruction vector of resource allocation and cell distribution, ηTX expression power system capacity value, 1NTable
Show that length is the vector of N and element all equal to 1,Indicate that length is NuAnd vector of the element all equal to 1,1LIndicate length
It is the vector of L and element all equal to 1, ()TIndicate transposition operation,Expression is found out so that the value in bracket is maximum
The operation of x；
(7.2) it solves dynamic multiple cell user and matches joint virtual MIMO resource allocator model
Dynamic multiple cell user is solved using business software MATLAB and matches joint virtual MIMO resource allocator model, is solved
User matches out, and the instruction vector x of resource allocation and cell distribution, instruction vector x carries required for multiple cell dynamic subscriber
The data information of service.
(8) data information of service required for the multiple cell dynamic subscriber carried to user is modulated
It is matched according to specific user, the use that the data result vector U and step (5) of resource allocation and cell distribution are obtained
Family order of modulation matrix M, the data carried to each user are modulated, then by the modulated information of each user in this use
It is sent to base station in resource block assigned by family, the user's pairing for completing this time slot user stream, resource allocation and cell are distributed；
(9) continue the dispatching distribution of next time slot
The user's stream for judging whether there is next time slot, if so, the user of next time slot is selected to flow, return step (1) after
The continuous joint virtual MIMO scheduling of resource for carrying out dynamic multiple cell user pairing；Otherwise, user's pairing of all user's streams is completed,
Resource allocation and cell distribution.
The bigger selection gain of bring, the bit error rate of system are matched due to not accounting for multiple cell user in the prior art
Performance, therefore the bit error rate that cannot be guaranteed system influences the raising of communication quality under a certain threshold value.
Concrete thought of the invention is to obtain user by base station and match constraint matrix, resource allocation constraint matrix, cell
Assignment constraints matrix and user are to capacity vector, simultaneously with the mathematical model of the building federated user pairing of these parameters and resource allocation
It solves, matches result and resource allocation result to obtain optimal user.
Embodiment 2
Joint virtual MIMO resource allocation methods based on dynamic multiple cell user pairing are with embodiment 1, wherein step (2)
Described according to resource set of blocks r and resource block number N=4, form optional resource block distribution set P, include following step
It is rapid:
It 2a) generates an empty initial optional resource block and distributes set P0；
2b) in resource set of blocks r={ r1,r2,…,rj,…,r4, 1 resource block of middle selection, by the volume of this resource block
Number P is put into as an element0In；
2c) in resource set of blocks r choose 2 continuous resource blocks, using 2 numbers of this 2 continuous resource blocks as
One element is put into P0In；
3 continuous resource blocks 2d) are chosen in resource set of blocks r, and 3 numbers of this 3 continuous resource blocks are made again
P is put into for an element0In；
2e) in resource set of blocks r choose 4 continuous resource blocks, using 4 numbers of this 4 continuous resource blocks as
One element is put into P0In；
2f) repeat step 2b), 2c), 2d), 2e) and 2f) until resource set of blocks r include all possible continuous money
Source block and mutually unduplicated combined situation distribute the initial optional resource block after assignment to set P0As optional resource block point
With set P.
Generation resource block allocation model matrix T described in step (2) is to be distributed to gather according to the optional resource block of acquisition
P generates resource block allocation model matrix T, comprises the following steps that
A N row, Z column 2g) are generated, and element is 0 initial resource block allocation model matrix T0, wherein Z be equal to can
Select the total number of element in resource block distribution set P.To resource block allocation model matrix initialisation；
2h) judge in optional resource block distribution set P in q-th of element whether comprising number equal to rjResource block, if
It is then to enable T0In rjThe element that row, q are arranged is equal to 1；Otherwise, it is enabled to be equal to 0, here it is the present invention gradually to fill T matrix.
2i) the initial resource block allocation model matrix T that will possess element value0As final resource block allocation model square
Battle array generates resource block allocation model matrix T.
The resource allocation mode matrix that the present invention needs is completed above, is used so that subsequent step models.
Embodiment 3
Joint virtual MIMO resource allocation methods based on dynamic multiple cell user pairing are with embodiment 1-2, wherein step
(3) according to user's set l to be paired and receiving antenna number N inr=4, optional user pair set G is generated, is carried out as follows:
3a) generate an empty initial optional user pair set set G0；
3b) in user's set l={ l to be paired1,l2,…,li,…,l321 user of middle selection, by the volume of this user
Number G is put into as an element0In；
2 users 3c) are chosen in user's set l to be paired, 2 numbers of this 2 users are put as an element
Enter G0In；
3 users 3d) are chosen in user's set l to be paired, 3 numbers of this 3 users are put as an element
Enter G0In；
4 users 3e) are chosen in user's set l to be paired, 4 numbers of this 4 users are put as an element
Enter G0In；
3f) repeat step 3b), 3c), 3d) and 3e) until in user's set l to be paired include it is all possible and mutual
Mutually unduplicated user's combined situation, by the initial optional user pair set G after assignment0As final optional user pair set
G。
Above step is completed, available optional user pair set uses for generating user's pairing mode matrix as follows.
Generation user pairing mode matrix B described in step (3) is to generate user according to optional user pair set G and match
To mode matrix B, comprise the following steps that
A L × Nu=4 × 8=32 row, Na column 3e) are generated, and element is 0 initial user pairing mode matrix
B0, wherein Na is equal to the number of element in optional user pair set G, i.e.,
Whether 3f) judge in p-th of element of optional user pair set G comprising numbering equal to liUser, if so, enable
User's pairing mode matrix B0LiThe element that row, pth arrange is equal to 1, otherwise, it is enabled to be equal to 0；
3g) the initial user pairing mode matrix B that will possess element value0It is raw as final user's pairing mode matrix
At user's pairing mode matrix B.
User's pairing mode matrix that the present invention needs is completed above, is used so that subsequent step models.
Embodiment 4
Joint virtual MIMO resource allocation methods based on dynamic multiple cell user pairing are with embodiment 1-3, in step (4)
The building cell assignment constraints matrix is to distribute set P according to resource block, and user pair set G, number of cells L are obtained small
Area distributes constraint matrix: by dimension be P × | G | the pairing of single community user and resource allocation confederate matrix to carry out multiple cell multiple
System, i.e. progress Kronecker product operation, obtains under multiple cell, user's pairing and resource assignment matrix.
Embodiment 5
Joint virtual MIMO resource allocation methods based on dynamic multiple cell user pairing are with embodiment 1-4, in step (5)
The building fading channel factor, specifically, β refers to disturbing factor caused by path loss and shadow fading, namely
Decay factor:
dk,l,jIt is distance of i-th of user terminal to the base station cell j, d in cell kkIt is distributed across all of each cell
Average distance of the user to this cell base station；γ is damped expoential, and general value is 2 here；Z is lognormal stochastic variable,
That is 10log10It is 0 that the value of z, which submits to mean value, standard deviation σshadThe Gaussian Profile of=8dB, Hi,j,hExpression is not considering
In the case where decaying, i-th of user is to the channel gain to j-th of base station on h-th of resource block, when consideration decay factor
βk,i,jIn the case where, new channel gain matrix can be obtained
I.e. by decay factor, actual channel gain information is calculated, and then obtained the capacity of each user,
In case resource allocation, scheduling use below.
Embodiment 6
Joint virtual MIMO resource allocation methods based on dynamic multiple cell user pairing are with embodiment 1-5, in step (5)
By number of cells L grey iterative generation size be N*L*Nu=4*4*8=128 row, Na=41448 column user's order of modulation square
Battle array M and size are the user of N=4 row, Na column to capacity matrix ψ, are carried out as follows:
I=1, h=1 5a) are enabled, generating a size is N*L*Nu row, and Na is arranged, and element is equal to 0 initial user tune
Order matrix M processed0；Size is generated simultaneously and is that N row, Na are arranged, and element is equal to 0 initial user to capacity matrix ψ0；
The user's number in user capacity calculated required for 5b) enabling g=1, g indicate, g maximum are no more than receiving antenna number
Nr, i-th of user couple is selected from optional user pair set G；
5c) according to the following formula, it calculates on h-th of resource block, the Signal to Interference plus Noise Ratio of q-th of user in i-th of user couple
Value SINRu,k,h:
Wherein, EqIndicate the transmission power of q-th of user, σ2Indicate the channel noise power of current time slots, ζi,j,hIt indicates
I-th of user is to the channel matrix to j-th of base station on h-th of resource block, InExpression size is the unit square of n row, n column
Battle array, n indicate i-th of user to comprising user's number, ()HIndicate the operation of Hermitian transposition, ()-1Expression takes inverse operation,
[·]q,qThe element of representing matrix q row, q column；
5d) in the case where given bit error rate threshold value b, according to the following formula, q-th of user in i-th of user couple is calculated
Order of modulation on h-th of resource blockAnd it shouldIt is put into matrix M0(h-1) * Nu+pqRow, v1Column,
In, v1Numerically equal to i, pqIndicate the number of q-th of user；
Wherein, b is preset system bit error rate threshold value, and floor () indicates downward floor operation, log2() table
Show the log operations taken with 2 bottom of for, ln () expression is derived from right log operations；
5e) judge whether g is equal to the number n of the user in i-th of user couple included, if so, executing 4f), otherwise, enable g
=g+1 returns to 4c)；
The order of modulation of each user in i-th of user couple 5f) is judged whether not equal to 0, if so, i-th is used
The order of modulation of all users of family centering is added, and obtains the capacity of i-th of user couple；Otherwise, the capacity etc. of i-th of user couple is enabled
In 0；The capability value of i-th obtained of user couple is put into matrix ψ again0V2Row, v3Column, wherein v2Numerically equal to h,
v3Numerically equal to g executes 4g)；
5g) judge whether u is equal to the number Na of element in optional user pair set G, if so, executing 4h)；Otherwise, g is enabled
=g+1 returns to 4b)；
5h) judge whether h is equal to N, if so, the initial user order of modulation matrix M that will possess element value0As final
User order of modulation matrix M, and will possess element value initial user capacity matrix ψ0As final user capacity matrix
ψ terminates；Otherwise, h=h+1, g=1 are enabled, 4b is returned), wherein h indicates the resource block for participating in calculating, and N is the sum of resource block.
It is also essential although the determination step of capacity is specific.
Embodiment 7
Joint virtual MIMO resource allocation methods based on dynamic multiple cell user pairing are with embodiment 1-6, in step (6)
It is the resource block allocation model matrix T obtained according to step (2) and step that capacity vector η, which is calculated, in the use channel capacity
Suddenly the user that (5) obtain obtains capacity vector η to capacity matrix ψ, carries out as follows:
6a) enable τ=1,And generating length is Na*Z, initial capacity vector η of the element all equal to 00, wherein τ,
Indicate capacity vector η0Row and column
6b) by the of the row vector obtained after the τ column data transposition of user capacity matrix ψ and resource assignment matrix TColumn
Data are multiplied, and the product is assigned to initial capacity vector η0InA element；
6c) judge whether τ is equal to Na, if so, executing 6d)；Otherwise, then τ=τ+1 is enabled, 6b is returned)；
6d) judgeWhether Z is equal to, if so, by the initial capacity vector η after assignment0As user capacity vector η；It is no
Then, it enablesτ=1 returns to 6b).
Above step is completed, the capacity vector of available user, when for modeling, construction objective function is used.
Embodiment 8
Joint virtual MIMO resource allocation methods based on dynamic multiple cell user pairing are with embodiment 1-7, in step 7.2
It solves dynamic multiple cell user and matches joint virtual MIMO resource allocator model, be to obtain user's pairing and resource allocation according to x
Result vector U, comprise the following steps that
α=1 7.2a) is enabled, and generates a length as Nr*N, and initial results vector U of the element all equal to 00；
The positional value for 7.2b) determining the α elements equal to 1 in x, with the positional value divided by optional user pair set G
The number Na of element obtains quotient c1 and remainder c2；
7.2c) according to remainder c2, the column identical with remainder c2 numerical value of user's pairing mode matrix B are found, the column are obtained
In it is all be equal to 1 element line number, then by these line numbers by from small to large sequence arrange, if the number of these line numbers is inadequate
Nr, then in these line number trailing zeros, user is obtained to vector
C3 7.2d) is obtained to the quotient c1 operation that rounds up, finds the identical with c3 numerical value of resource allocation mode matrix T
Column, obtain in the column it is all be equal to 1 element line number, these line numbers are rearranged into vector by sequence from small to largeWherein yjIndicate theIt is a be equal to 1 element line number,
7.2e) enableBy user to vectorIn element be stored in initial results vector U respectively0?It arrivesIn a element；
7.2f) judgeWhether N is equal to, if so, executing 7.2g)；Otherwise, it enablesAnd return to 7.2e)；
7.2g) judge whether α is equal to the number of element of the size equal to 1 in x, if so, by the initial results after assignment
Vector U0It is matched as final user, resource allocation and cell allocation result vector U；Otherwise, α=α+1 is enabled, 7.2b is returned)
It is selected again to determine user and resource block.
Above step instruction vector x carries the data information serviced required for multiple cell dynamic subscriber, obtains further according to x
Specific user's pairing, the data result vector U of resource allocation and cell distribution.
Embodiment 9
Joint virtual MIMO resource allocation methods based on dynamic multiple cell user pairing are with embodiment 1-8, in step (8)
User's pairing and resource allocation result vector U and the obtained user order of modulation matrix M of step (4), each user is taken
The data information serviced required for the multiple cell dynamic subscriber of band is modulated, and is carried out as follows:
δ=1, δ 8a) is enabled to indicate the resource block of selection, the resource initialization block to selection.
8b) take out (δ -1) * Nr+1 to (δ -1) * Nr+Nr element of the result vector U of user's pairing and resource allocation
In be not equal to 0 element, and set these not equal to 0 element as u1,u2,…,uγ,…,ud, wherein uγIndicate user pairing and
The γ elements not equal to 0 in (δ -1) * Nr+1 to (δ -1) * Nr+Nr element of the result vector U of resource allocation, γ
∈ [1, d], d are equal in (δ -1) * Nr+1 to (δ -1) * Nr+Nr element of the result vector U of user's pairing and resource allocation
The total number of element not equal to 0；
8c) according to the element u for being not equal to 01,u2,…,uγ,…,ud, according to the following formula, calculate the number w of user couple:
Wherein, C expression takes number of combinations to operate；
8d) enable γ=1, γ indicate be not 0 element, to not for 0 element position initialization.
8e) take (δ -1) * Nu+u in the order of modulation matrix M of familyγRow, theThe element m of columnγIt is equal to as number
uγUser best order of modulation, to number be equal to ujUser carry data information carry out mγThe quadrature amplitude tune of rank
System, whereinThe numerically equal to number w of user couple；
8f) judge whether γ is equal to d, if so, executing 8g), otherwise, enable γ=γ+1, return to 8g)；
8g) judge whether δ is equal to N, if so, end loop；Otherwise, δ=δ+1 is enabled, 8b is returned).
The above operation, the data for completing user's carrying to selection are modulated, and obtain the best order of modulation of each user,
To guarantee power system capacity maximum.
A complete example is given below, and the present invention is further described.
Embodiment 10
Joint virtual MIMO resource allocation methods based on dynamic multiple cell user pairing are with embodiment 1-8, referring to attached drawing
1, specific implementation step of the invention is as follows:
Step 1, base station obtains user's set l to be paired of current time slots, single cell number of users Nu=8 to be paired, cell
Number L=4, resource set of blocks r, resource block number N=6 and receiving antenna number Nr=4.
User's set l to be paired is indicated are as follows: l={ l1,l2,…,li,…,l32, wherein liIndicate i-th of use to be paired
The number at family, i ∈ [1,32]；
Resource set of blocks r is indicated are as follows: r={ r1,r2,…,rj,…,r6, wherein rjIndicate the number of j-th of resource block, j
∈[1,6]。
Step 2, according to resource set of blocks r and resource block number N, optional resource block distribution set P is formed.
It 2a) generates an empty initial optional resource block and distributes set P0；
1 resource block 2b) is chosen in resource set of blocks r, is put into P for the number of this resource block as an element0
In；
2 continuous resource blocks 2c) are chosen in resource set of blocks r, using the number of these resource blocks as another yuan
Element is put into P0In；
3 continuous resource blocks 2d) are chosen in resource set of blocks r, using the number of these resource blocks as another yuan
Element is put into P0In；
4 continuous resource blocks 2e) are chosen in resource set of blocks r, using the number of these resource blocks as another yuan
Element is put into P0In；
5 continuous resource blocks 2f) are chosen in resource set of blocks r, using the number of these resource blocks as another yuan
Element is put into P0In；
6 continuous resource blocks 2g) are chosen in resource set of blocks r, using the number of these resource blocks as another yuan
Element is put into P0In；
2h) repeat step 2b), 2c), 2d), 2e), 2f) and 2g) until continuous in resource set of blocks r selection N=6
Resource block distributes the initial optional resource block after assignment to set P0Set P is distributed as optional resource block.
Step 3, set P is distributed according to optional resource block, generates resource block allocation model matrix T.
A N row, Z column 3a) are generated, and element is 0 initial resource block allocation model matrix T0, wherein Z be equal to can
Select the number of element in resource block distribution set P；
3b) judge in optional resource block distribution set P in q-th of element whether comprising number equal to rjResource block, if
It is then to enable T0In rjThe element that row, q are arranged is equal to 1；Otherwise, it is enabled to be equal to 0.
3c) the initial resource block allocation model matrix T that will possess element value0As final resource block allocation model matrix
T。
Step 4, according to resource block allocation model matrix T, resource allocation constraint matrix C1 is obtained:
Wherein 1|G|With 1LRespectively indicate the element number of length with optional user pair set G | G | and number of cells L is identical,
And element value is equal to 1 vector,The operation of Kronecker product is asked in expression, and the specific method is as follows for the operation:
By each element of resource block allocation model matrix T multiplied by vector 1|G|, a transition matrix C0 is obtained, it will
Each element of transition matrix C0 is multiplied by vector 1L, a new Matrix C 1 is obtained, C1 is known as resource allocation constraint square
Battle array C1.
Step 5, according to user's set l to be paired and receiving antenna number Nr, optional user pair set G is generated.
5a) generate an empty initial optional user pair set set G0；
1 user 5b) is chosen in user's set l to be paired, is put into G for the number of this user as an element0
In；
2 users 5c) are chosen in user's set l to be paired, are put into the number of this user as another element
G0In；
3 users 5d) are chosen in user's set l to be paired, are put into the number of this user as another element
G0In；
4 users 5e) are chosen in user's set l to be paired, are put into the number of this user as another element
G0In；
5f) repeat step 5b), 5c), 5d) and 5e) until choosing N in user's set l to be pairedr=4 users, will
Initial optional user pair set G after assignment0As final optional user pair set G.
Step 6, according to optional user pair set G, user's pairing mode matrix B is generated.
A Nu row, Na column 6a) are generated, and element is 0 initial user pairing mode matrix B0, wherein Na is equal to
The number of element in optional user pair set G；
Whether 6b) judge in p-th of element of optional user pair set G comprising numbering equal to liUser, if so, enable
User's pairing mode matrix B0LiThe element that row, pth arrange is equal to 1, otherwise, it is enabled to be equal to 0；
6c) the initial user pairing mode matrix B that will possess element value0As final user's pairing mode matrix B.
Step 7, it according to user's pairing mode matrix B, obtains user and matches constraint matrix C2:
Wherein 1LWith 1PIt is identical as number of cells L and optional resource block distribution set P to respectively indicate length, and element value
It is equal to 1 vector.
Step 8, set P and user pair set G is distributed according to resource block, number of cells L=4 obtains cell assignment constraints
Matrix:
Wherein 1LIndicate that length is identical as number of cells L, element value is equal to 1 vector, ILIt is unit matrix, 1P×|G|
Expression length be P × | G |, and element value is equal to 1 vector；
Step 9, according to the distance between each community user to each base station, decay factor is calculated, and then calculate channel
Actual gain, β refers to disturbing factor caused by path loss and shadow fading namely decay factor:
dk,l,jBe in cell k i-th of user terminal to the base station cell j distance,It is distributed across all of each cell
Average distance of the user to this cell base station；γ is damped expoential, and general value is 2 here；Z is lognormal stochastic variable,
That is 10log10It is 0 that the value of z, which submits to mean value, standard deviation σshadThe Gaussian Profile of=8dB, Hi,j,hExpression is not considering
In the case where decaying, i-th of user is to the channel gain to j-th of base station on h-th of resource block, when consideration decay factor
βk,i,jIn the case where, new channel gain matrix can be obtained
Step 10, by grey iterative generation size be N*Nu row, Na arrange user order of modulation matrix M and size be N row,
The user of Na column is to capacity matrix ψ, and wherein Na is numerically equal to the element number in optional user pair set G.
I=1, h=1 10a) are enabled, generating a size is the initial user modulation that N*Nu row, Na column, and element are equal to 0
Order matrix M0；Size is generated simultaneously and is that N row, Na are arranged, and element is equal to 0 initial user to capacity matrix ψ0；
K=1 10b) is enabled, selects i-th of user couple from optional user pair set G；
10c) according to the following formula, it calculates on h-th of resource block, the Signal to Interference plus Noise Ratio of q-th of user in i-th of user couple
Value SINRu,k,h:
Wherein, EqIndicate the transmission power of q-th of user, σ2Indicate the channel noise power of current time slots, ζi,j,hIt indicates
I-th of user is to the channel matrix to j-th of base station on h-th of resource block, InExpression size is the unit square of n row, n column
Battle array, n indicate i-th of user to comprising user's number, ()HIndicate the operation of Hermitian transposition, ()-1Expression takes inverse operation,
[·]q,qThe element of representing matrix q row, q column；
10d) in the case where given bit error rate threshold value b, according to the following formula, k-th of user in u-th of user couple is calculated
Order of modulation on h-th of resource blockAnd it shouldIt is put into matrix M0(h-1) * Nu+lkRow, v1Column,
In, v1Numerically equal to u, lkIndicate the number of k-th of user；
Wherein, b is preset system bit error rate threshold value, and floor () indicates downward floor operation, log2() table
Show the log operations taken with 2 bottom of for, ln () expression is derived from right log operations；
10e) judge whether k is equal to the number n of the user in i-th of user couple included, if so, executing 10f), otherwise,
K=k+1 is enabled, 10c is returned)；
The order of modulation of each user in i-th of user couple 10f) is judged whether not equal to 0, if so, i-th is used
The order of modulation of all users of family centering is added, and obtains the capacity of i-th of user couple；Otherwise, the capacity etc. of i-th of user couple is enabled
In 0；The capability value of u-th obtained of user couple is put into matrix ψ again0V2Row, v3Column, wherein v2Numerically equal to h,
v3Numerically equal to k executes 10g)；
10g) judge whether k is equal to Na, if so, executing 10h)；Otherwise, k=k+1 is enabled, 10b is returned)；
10h) judge whether h is equal to N, if so, the initial user order of modulation matrix M that will possess element value0As most
Whole user order of modulation matrix M, and the initial user capacity matrix ψ that will possess element value0As final user capacity square
Battle array ψ, end loop；Otherwise, h=h+1, k=1 are enabled, 10b is returned).
Step 11, the user that the resource block allocation model matrix T and step 10 obtained according to step 3 is obtained is to capacity matrix
ψ obtains capacity vector η.
11a) enable τ=1,And generating length is Na*Z, initial capacity vector η of the element all equal to 00；
11b) by the of the row vector obtained after the τ column data transposition of user capacity matrix ψ and resource assignment matrix T
Column data is multiplied, and the product is assigned to initial capacity vector η0InA element；
11c) judge whether τ is equal to Na, if so, executing 11d)；Otherwise, then τ=τ+1 is enabled, 11b is returned)；
11d) judgeWhether Z is equal to, if so, by the initial capacity vector η after assignment0As user capacity vector η；
Otherwise, it enablesτ=1 returns to 11b).
Step 12, the user that the resource allocation constraint matrix C1 that is obtained with step 4, step 7 obtain match constraint matrix C2,
The user pairing constraint matrix C3 that step 8 the obtains and capacity vector η that step 11 obtains is parameter, building user pairing and resource
Distribution model:
s.t.C1x≤1N
C3x≤1L
Wherein, x indicates the instruction vector of user's pairing and resource allocation, ηTX expression power system capacity value, 1NIndicate that length is N
And vector of the element all equal to 1,Indicate that length is NuAnd vector of the element all equal to 1,1LIndicate that length is L and element
Vector all equal to 1, ()TIndicate transposition operation,Expression finds out the operation so that the maximum x of value in bracket.
Step 13, using model obtained in business software MATLAB solution procedure 9, user's pairing and resource point are solved
The instruction vector x matched, wherein the form of the instruction vector x of the user's pairing and resource allocation that solve is as follows:
X=[x1,1,1,…,xJ,1,1,…,xj,q,1,…,xJ,|G|,1,…,xj,q,l,…,x1,1,L,…,xJ,1,L,…,
xj,q,L,…,xJ,|G|,L]T,
Wherein, xJ,q,LIt indicates q-th of user couple, whether base station L is under j-th resource allocation mode, if xJ,q,L
=1, then it represents that q-th of user couple is under j-th resource allocation mode base station L, if xJ,q,L=0, then it represents that q-th
User couple is not under j-th resource allocation mode base station L.
Step 14, according to the instruction vector x of user's pairing and resource allocation, the result of user's pairing and resource allocation is obtained
Vector U.
α=1 14a) is enabled, and generates a length as Nr*N, and initial results vector U of the element all equal to 00；
The positional value for 14b) determining the α elements equal to 1 in the instruction vector x of user's pairing and resource allocation, with this
Positional value obtains quotient c1 and remainder c2 divided by Na；
14c) according to remainder c2, the column identical with remainder c2 numerical value of user's pairing mode matrix B are found, are obtained in the column
It is all be equal to 1 element line number, then by these line numbers by from small to large sequence arrange, if the inadequate Nr of the number of these line numbers
It is a, then in these line number trailing zeros, user is obtained to vector
C3 14d) is obtained to the quotient c1 operation that rounds up, find resource allocation mode matrix T with remainder c3 numerical value phase
With column, obtain in the column it is all be equal to 1 element line number, these line numbers are rearranged into vector by sequence from small to large
Y=(y1,y2,…yβ,…,yN), wherein yjIndicate the line number of the β elements equal to 1, β ∈ [1, N]；
β=1 14e) is enabled, by user to vectorIn element be stored in initial results vector U respectively0(yβ-1)*N+1
To (yβ- 1) in * N+Nr element；
14f) judge whether β is equal to N, if so, executing 14g)；Otherwise, β=β+1 is enabled, and returns to 14e)；
14g) judge whether α is equal to of element of the size equal to 1 in the instruction vector x of user's pairing and resource allocation
Number, if so, by the initial results vector U after assignment0As final user's pairing and resource allocation result vector U；Otherwise,
α=α+1 is enabled, 14b is returned).
Step 15, the user's order of modulation matrix obtained according to the result vector U and step 8 of user's pairing and resource allocation
M, the information carried to each user are modulated, then by the modulated information of each user money assigned by this user
Signal receiver is sent in source block, the user's pairing for completing this time slot user stream and resource allocation.
15a) enable δ=1；
15b) take out (δ -1) * Nr+1 to (δ -1) * Nr+Nr member of the result vector U of user's pairing and resource allocation
It is not equal to 0 element in element, and sets them as u1,u2,…,uγ,…,ud, wherein uγIndicate user's pairing and resource allocation
The γ elements not equal to 0 in (δ -1) * Nr+1 to (δ -1) * Nr+Nr element of result vector U, γ ∈ [1, d], d etc.
It is not equal to 0 member in (δ -1) * Nr+1 to (δ -1) * Nr+Nr element of user's pairing and the result vector U of resource allocation
The total number of element；
15c) according to u1,u2,…,uγ,…,ud, according to the following formula, calculate the number w of user couple:
Wherein, C expression takes number of combinations to operate；
15d) enable γ=1；
15e) take (δ -1) * Nu+u in the order of modulation matrix M of familyγRow, theThe element m of columnγIt is equal to as number
uγUser best order of modulation, to number be equal to ujUser carry data information carry out mγThe quadrature amplitude tune of rank
System, whereinThe numerically equal to number w of user couple；
15f) judge whether γ is equal to d, if so, executing 15g), otherwise, enable γ=γ+1, return to 15g)；
15g) judge whether δ is equal to N, if so, end loop；Otherwise, δ=δ+1 is enabled, 15b is returned).
Step 16, the user's stream for judging whether there is next time slot returns to step if so, the user of next time slot is selected to flow
Rapid 1；Otherwise, the user's pairing and resource allocation of all user's streams are completed.
Effect of the invention can pass through following emulation further instruction.
Embodiment 11
Joint virtual MIMO resource allocation methods based on dynamic multiple cell user pairing are the same as embodiment 1-10.
1. simulated conditions:
Emulation of the invention carries out in the wireless communication scene of multiple base stations, if number of users to be paired is 32, receives day
Line number is 4, and cell number is 4, and resource block number is 6, and the threshold value of system bit error rate is 10-5, and emulation experiment of the present invention
The detection mode of setting signal receiver is minimum mean-squared error algorithm, and assumes that channel matrix is constant in single time slot
's.By existing user pairing and resource allocation techniques and method of the invention in system spectrum utilization rate, averagely match user
The performance of several and average this 3 aspects of order of modulation compares.
2. emulation content and interpretation of result:
Emulation 1, according to above-mentioned simulated conditions, using being with method proposed by the present invention and existing method respectively
The availability of frequency spectrum of system emulates, as a result such as Fig. 2.
As can be seen from Figure 2: being apparently higher than existing method with the availability of frequency spectrum that the method for the present invention obtains.Signal-to-noise ratio is small
It is almost 0 using the availability of frequency spectrum that existing method obtains when 4dB, and the availability of frequency spectrum that the method for the present invention obtains is 1 left
It is right；In high noise, the spectrum efficiency that the method for the present invention obtains is become apparent from higher than existing method.This explanation uses side of the invention
Method can maximize the availability of frequency spectrum of system.
Embodiment 12
Joint virtual MIMO resource allocation methods based on dynamic multiple cell user pairing are the same as embodiment 1-10, simulated conditions
And emulation content, with embodiment 11, when number of users is more, number of users to be paired is 32, when number of users is less, use to be paired
Amount is 16, and simulation result is referring to Fig. 3
Emulation 2, according to above-mentioned simulated conditions, carries out system with method proposed by the present invention and existing method respectively
Availability of frequency spectrum emulation, as a result such as Fig. 3.
As can be seen from Figure 3: being apparently higher than existing method with the availability of frequency spectrum that the method for the present invention obtains.In number of users
When mesh is more and less, the spectrum efficiency that the method for the present invention obtains all is apparently higher than existing method, also, is based on identical side
Method, when number of users is more, the availability of frequency spectrum of the method for the present invention can be higher.This explanation is using method of the invention in user
Number can further maximize the availability of frequency spectrum of system when very much.
In conclusion the joint based on dynamic multiple cell user pairing in a kind of wireless communication field disclosed by the invention is empty
Quasi- MIMO resource allocation methods.Mainly solve the prior art can not dynamic debugging system multiple cell user pairing and resource allocation
And cause the availability of frequency spectrum low and the problem of communication quality difference.Its technical solution is: being matched with resource assignment constraints matrix, user
Constraint matrix, cell assignment constraints matrix and user are parameter, building multiple cell user pairing and resource allocation to capacity vector
Model and solution, obtain optimal user pairing and resource allocation result vector；According to the result vector and user's modulation matrix
The data information carried to each user is modulated；Modulated data information is sent on the resource block that user is assigned to
To signal receiver.The present invention can efficiently carry out dynamic multi-user's pairing, resource allocation and cell distribution, can will be how small
Area's user's marriage problem and resource allocation problem join together to consider simultaneously, efficiently carries out dynamic multi-user's pairing simultaneously,
Resource allocation and cell distribution, maximize the frequency efficiency of system, improve the communication quality of system.Meeting system communication matter
Amount maximizes the availability of frequency spectrum of communication system in the case where requiring.It can be used for carrying out the mobile phone user in virtual MIMO system
Multiple cell user pairing and resource allocation.
Claims (2)
1. a kind of joint virtual MIMO resource allocation methods based on dynamic multiple cell user pairing, which is characterized in that include
Following steps,
(1) base station obtains basic parameter
User's set l to be paired, the single N of base station acquisition current time slotsuCell number of users N to be pairedu, number of cells L, resource
Set of blocks r, resource block number N, receiving antenna number NrAnd each user is to the distance d of each cell base station；
(2) resource allocation constraint matrix is constructed
According to resource set of blocks r and resource block number N, optional resource block distribution set P is formed, is comprised the following steps that
It 2a) generates an empty initial optional resource block and distributes set P0；
2b) in resource set of blocks r={ r1,r2,…,rj,…,rN, 1 resource block of middle selection makees the number of this resource block
P is put into for an element0In；
2 continuous resource blocks 2c) are chosen in resource set of blocks r, regard 2 numbers of this 2 continuous resource blocks as one
Element is put into P0In；
3 continuous resource blocks 2d) are chosen in resource set of blocks r, regard 3 numbers of this 3 continuous resource blocks as one again
A element is put into P0In, the element being put into every time exists independently of each other, and so on carry out resource block selection；
N-1 continuous resource blocks 2e) are chosen in resource set of blocks r, and the N-1 number of this N-1 continuous resource blocks is made
P is put into for an element0In；
N number of continuous resource block 2f) is chosen in resource set of blocks r, using N number of number of this N number of continuous resource blocks as one
Element is put into P0In；
2g) repeat step 2b), 2c), 2d), 2e) and 2f) until resource set of blocks r include all possible continuous resource blocks
And mutual unduplicated combined situation, distribute the initial optional resource block after assignment to set P0As optional resource block allocation set
Close P；
Set P is distributed according to the optional resource block, resource block allocation model matrix T is generated, comprises the following steps that
A N row, Z column 2h) are generated, and element is 0 initial resource block allocation model matrix T0, wherein Z is equal to optional resource
Block distributes the total number of element in set P；
2i) judge in optional resource block distribution set P in q-th of element whether comprising number equal to rjResource block, if so,
Enable T0In rjThe element that row, q are arranged is equal to 1；Otherwise, it is enabled to be equal to 0；
2j) the initial resource block allocation model matrix T that will possess element value0As final resource block allocation model matrix, generate
Resource block allocation model matrix T；
Obtain resource allocation constraint matrix:1GWith 1LUnit vector is indicated, wherein 1GFor length with can
Select the element number of user pair set G | G | identical unit vector, 1LFor length unit vector identical with number of cells L,
The operation of Kronecker product is asked in expression；
(3) building user matches constraint matrix
According to user's set l to be paired and receiving antenna number Nr, optional user pair set G is generated, is carried out as follows:
3a) generate an empty initial optional user pair set set G0；
3b) gather in user to be paired1 user of middle selection, using the number of this user as one
A element is put into G0In；
2 users 3c) are chosen in user's set l to be paired, 2 numbers of this 2 users are put into G as an element0
In；
3d) N is chosen in user's set l to be pairedr- 1 user, by this NrThe N of -1 userr- 1 number is used as a member
Element is put into G0In；
3e) N is chosen in user's set l to be pairedrA user, by this NrThe N of a userrA number is put into G as an element0
In；
3f) repeat step 3b), 3c), 3d) and 3e) until choosing N in user's set l to be pairedrA user, after assignment
Initial optional user pair set G0As final optional user pair set G；
According to optional user pair set G, user's pairing mode matrix B is generated, is comprised the following steps that
3g) generate a L × NuRow, Na column, and element is 0 initial user pairing mode matrix B0, wherein Na is equal to can
Select the number of element in user pair set G；
Whether 3h) judge in p-th of element of optional user pair set G comprising numbering equal to liUser, if so, enabling user
Pairing mode matrix B0LiThe element that row, pth arrange is equal to 1, otherwise, it is enabled to be equal to 0；
3i) the initial user pairing mode matrix B that will possess element value0As final user's pairing mode matrix, user is generated
Pairing mode matrix B；
It obtains user and matches constraint matrix:1LWith 1PUnit vector is indicated, wherein 1LFor length with it is small
The identical unit vector of area number L, 1PFor length and single cell number of users N to be paireduIdentical unit vector；
(4) cell assignment constraints matrix is constructed
Set P, user pair set G, number of cells L are distributed according to obtained resource block, obtains cell assignment constraints matrix:Wherein 1LIndicate that length is identical as number of cells L, ILIt is unit matrix, 1P×GExpression length be P ×
| G | unit vector；
(5) decay factor is calculated, generates user's order of modulation matrix and user to capacity matrix
β refers to disturbing factor caused by path loss and shadow fading, according to each user to the distance of each cell base station,
Each user is calculated to the relative attenuation factor of each cell base station, specifically, β, which refers to, is made path loss and shadow fading
At disturbing factor namely decay factor:
dk,i,jBe in cell k i-th of user terminal to the base station cell j distance,It is distributed across all users of each cell
To the average distance of this cell base station；γ is damped expoential, and general value is 2 here；Z is lognormal stochastic variable, also
It is to say 10log10It is 0 that the value of z, which submits to mean value, standard deviation σshadThe Gaussian Profile of=8dB, Hi,j,hExpression is not considering to decay
In the case where, i-th of user is to the channel gain to j-th of base station on h-th of resource block, as consideration decay factor βk,i,j's
In the case of, new channel gain matrix can be obtained
It is N*L*N further according to number of cells L grey iterative generation sizeuRow, Na column user order of modulation matrix M and size be N row,
The user of Na column carries out undamped capacity matrix ψ as follows:
I=1, h=1 5a) are enabled, generating a size is N*L*Nu row, and Na is arranged, and element is equal to 0 initial user modulation order
Matrix number M0；Size is generated simultaneously and is that N row, Na are arranged, and element is equal to 0 initial user to capacity matrix ψ0；
The user's number in user capacity calculated required for 5b) enabling g=1, g indicate, g maximum are no more than receiving antenna number Nr, from
I-th of user couple is selected in optional user pair set G；
5c) according to the following formula, the value of the Signal to Interference plus Noise Ratio of q-th of user in i-th of user couple on h-th of resource block is calculated
SINRi,q,h:
Wherein, EqIndicate the transmission power of q-th of user, σ2Indicate that the channel noise power of current time slots, ζ i, j, h indicate i-th
A user is to the channel matrix to j-th of base station on h-th of resource block, InExpression size is the unit matrix of n row, n column, n
Indicate i-th of user to comprising user's number, ()HIndicate the operation of Hermitian transposition, ()-1Expression takes inverse operation, []q,q
The element of representing matrix q row, q column；
5d) in the case where given bit error rate threshold value b, according to the following formula, q-th of user is in h in i-th of user couple of calculating
Order of modulation on a resource blockAnd it shouldIt is put into matrix M0(h-1) * Nu+pqRow, v1Column, wherein v1Number
It is equal to i, p in valueqIndicate the number of q-th of user；
Wherein, b is preset system bit error rate threshold value, and floor () indicates downward floor operation, log2() expression takes
With 2 for bottom log operations, ln () expression be derived from right log operations；
5e) judge whether g is equal to the number n of the user in i-th of user couple included, if so, executing 5f), otherwise, enable g=g+
1, return to 5c)；
The order of modulation of each user in i-th of user couple 5f) is judged whether not equal to 0, if so, by i-th of user couple
In all users order of modulation be added, obtain the capacity of i-th of user couple；Otherwise, the capacity of i-th of user couple is enabled to be equal to 0；
The capability value of i-th obtained of user couple is put into matrix ψ again0V2Row, v3Column, wherein v2Numerically equal to h, v3Number
It is equal to g in value, executes 5g)；
5g) judge whether u is equal to the number Na of element in optional user pair set G, if so, executing 5h)；Otherwise, g=g+ is enabled
1, return to 5b)；
5h) judge whether h is equal to N, if so, the initial user order of modulation matrix M that will possess element value0As final use
Family order of modulation matrix M, and the initial user capacity matrix ψ that will possess element value0As final user capacity matrix ψ, knot
Beam；Otherwise, h=h+1, g=1 are enabled, 5b is returned), wherein h indicates the resource block for participating in calculating, and N is the sum of resource block；
Wherein, Na is numerically equal to the element number in optional user pair set G, then, is declined by decay factor β and user to nothing
Volume reduction moment matrix ψ obtains actual user to capacity matrix ζ；
(6) user capacity vector is calculated
According to resource block allocation model matrix T and user to capacity matrix ψ, capacity vector η is calculated using channel capacity, is pressed
Following steps carry out:
6a) enable τ=1,And generating length is Na*Z, initial capacity vector η of the element all equal to 00, wherein τ,It indicates
Capacity vector η0Row and column；
6b) by the of the row vector obtained after the τ column data transposition of user capacity matrix ψ and resource assignment matrix TColumn data
It is multiplied, and the product is assigned to initial capacity vector η0InA element；
6c) judge whether τ is equal to Na, if so, executing 6d)；Otherwise, then τ=τ+1 is enabled, 6b is returned)；
6d) judgeWhether Z is equal to, if so, by the initial capacity vector η after assignment0As user capacity vector η；Otherwise,
It enablesτ=1 returns to 6b)；
(7) it constructs and solves dynamic multiple cell user and match joint virtual MIMO resource allocator model
(7.1) construction dynamic multiple cell user matches joint virtual MIMO resource allocator model
Matching constraint matrix C2, cell assignment constraints Matrix C 3 and capacity vector η with resource assignment constraints Matrix C 1, user is ginseng
Number, building user pairing and resource allocator model realize that, in number of users, resource block number, number of cells three constrains jointly
Maximum system capacity；
s.t.C1x≤1N
C3x≤1L
Wherein, x indicates user's pairing, the instruction vector of resource allocation and cell distribution, ηTX expression power system capacity value, 1NIndicate length
Degree is the vector of N and element all equal to 1,Indicate that length is NuAnd vector of the element all equal to 1,1LIndicate that length is L
And vector of the element all equal to 1, ()TIndicate transposition operation,It indicates to find out so that the maximum x of value in bracket
Operation；
(7.2) it solves dynamic multiple cell user and matches joint virtual MIMO resource allocator model using business software MATLAB solution
Dynamic multiple cell user matches joint virtual MIMO resource allocator model, is the knot that user's pairing and resource allocation is obtained according to x
Fruit vector U, comprises the following steps that
α=1 7.2a) is enabled, and generates a length as Nr*N, and initial results vector U of the element all equal to 00；
The positional value for 7.2b) determining the α elements equal to 1 in x, with the positional value divided by element in optional user pair set G
Number Na, obtain quotient c1 and remainder c2；
7.2c) according to remainder c2, the column identical with remainder c2 numerical value of user's pairing mode matrix B are found, institute in the column is obtained
There is the line number of the element equal to 1, then these line numbers are arranged by sequence from small to large, if the inadequate Nr of the number of these line numbers
It is a, then in these line number trailing zeros, user is obtained to vector
C3 7.2d) is obtained to the quotient c1 operation that rounds up, finds the column identical with c3 numerical value of resource allocation mode matrix T,
Obtain in the column it is all be equal to 1 element line number, these line numbers are rearranged into vector by sequence from small to largeWherein yjIndicate theIt is a be equal to 1 element line number,
7.2e) enableBy user to vectorIn element be stored in initial results vector U respectively0?It arrivesIn a element；
7.2f) judgeWhether N is equal to, if so, executing 7.2g)；Otherwise, it enablesAnd return to 7.2e)；
7.2g) judge whether α is equal to the number of element of the size equal to 1 in x, if so, by the initial results vector U after assignment0
It is matched as final user, resource allocation and cell allocation result vector U；Otherwise, enable α=α+1, return to 7.2b) again into
Row selection is to determine user and resource block；
User's pairing, the instruction vector x of resource allocation and cell distribution are solved, instruction vector x carries multiple cell dynamic and uses
The data information serviced required for family；
(8) data information of service required for the multiple cell dynamic subscriber carried to user is modulated matches according to specific user
It is right, the user order of modulation matrix M of the data result vector U sum of resource allocation and cell distribution, the number that each user is carried
It is believed that breath is modulated, carry out as follows:
δ=1, δ 8a) is enabled to indicate the resource block of selection；
It 8b) takes out in (δ -1) * Nr+1 to (δ -1) * Nr+Nr element of the result vector U of user's pairing and resource allocation not
Element equal to 0, and set these not equal to 0 element as u1,u2,…,uγ,…,ud, wherein uγIndicate user's pairing and resource
The γ elements not equal to 0 in (δ -1) * Nr+1 to (δ -1) * Nr+Nr element of the result vector U of distribution, γ ∈ [1,
D], d, which is equal in (δ -1) * Nr+1 to (δ -1) * Nr+Nr element of the result vector U of user's pairing and resource allocation, to be differed
In the total number of 0 element；
8c) according to the element u for being not equal to 01,u2,…,uγ,…,ud, according to the following formula, calculate the number w of user couple:
Wherein, C expression takes number of combinations to operate；
8d) enabling γ=1, γ indicate is not 0 element；
8e) take (δ -1) * Nu+u in the order of modulation matrix M of familyγRow, theThe element m of columnγIt is equal to u as numberγUse
The best order of modulation at family is equal to u to numberjUser carry data information carry out mγThe quadrature amplitude modulation of rank, wherein
The numerically equal to number w of user couple；
8f) judge whether γ is equal to d, if so, executing 8g), otherwise, enable γ=γ+1, return to 8g)；
8g) judge whether δ is equal to N, if so, end loop；Otherwise, δ=δ+1 is enabled, 8b is returned)；
The above operation, the data for completing user's carrying to selection are modulated, and the best order of modulation of each user are obtained, to protect
Demonstrate,prove user's pairing that power system capacity is maximum, completes this time slot user stream, resource allocation and cell distribution；
(9) continue the dispatching distribution of next time slot
The user's stream for judging whether there is next time slot, if so, the user of next time slot is selected to flow, return step (1) continue into
Row；Otherwise, user's pairing of all user's streams, resource allocation and cell distribution are completed.
2. the joint virtual MIMO resource allocation methods according to claim 1 based on dynamic multiple cell user pairing,
It is characterized in that, building cell assignment constraints matrix described in step (4) is to distribute set P, user pair set according to resource block
G, number of cells L obtain cell assignment constraints matrix: by dimension be P × | G | single community user pairing and resource allocation combine
Matrix carries out multiple cell duplication, i.e. progress Kronecker product operation obtains under multiple cell, user's pairing and resource assignment matrix.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611065970.5A CN106793111B (en) | 2016-11-28 | 2016-11-28 | Joint virtual MIMO resource allocation methods are matched based on dynamic multiple cell user |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611065970.5A CN106793111B (en) | 2016-11-28 | 2016-11-28 | Joint virtual MIMO resource allocation methods are matched based on dynamic multiple cell user |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106793111A CN106793111A (en) | 2017-05-31 |
| CN106793111B true CN106793111B (en) | 2019-10-08 |
Family
ID=58902031
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611065970.5A Active CN106793111B (en) | 2016-11-28 | 2016-11-28 | Joint virtual MIMO resource allocation methods are matched based on dynamic multiple cell user |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106793111B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109348538B (en) * | 2018-11-29 | 2021-05-14 | 西安电子科技大学 | Wireless resource virtualization method based on Gaussian fitting |
| CN112243251B (en) * | 2019-12-27 | 2022-08-02 | 新疆大学 | Cognitive MIMO system energy efficiency optimization method based on SCMA |
| CN111867103B (en) * | 2020-06-28 | 2023-06-16 | 国网浙江省电力有限公司嘉兴供电公司 | Joint user pairing method, device, equipment and storage medium |
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-11-28 CN CN201611065970.5A patent/CN106793111B/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用户配对算法研究;张立;《西安电子科技大学学位论文》;20150415;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106793111A (en) | 2017-05-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Leshem et al. | Game theory and the frequency selective interference channel | |
| CN101557611B (en) | Downlink multiuser selection method used for multi-aerial system | |
| CN105429741B (en) | Joint virtual MIMO resource allocation methods based on dynamic subscriber's pairing | |
| CN104702326B (en) | Virtual MIMO user pairing and resource allocation methods based on MSE | |
| CN102917442B (en) | Comprehensive relay node selection method based on multiple factors in two-hop system with multiple relays | |
| CN106793111B (en) | Joint virtual MIMO resource allocation methods are matched based on dynamic multiple cell user | |
| CN101925070B (en) | Resource allocation method for cognitive system based on space multiplexing | |
| CN105007129A (en) | Multi-beam satellite mobile communication system traversal capacity estimation and user scheduling | |
| CN101499837B (en) | Low complexity user selecting method in multi-user MIMO broadcast channel | |
| CN107135544A (en) | A kind of efficiency resource allocation methods updated based on interference dynamic | |
| CN105450274A (en) | Optimal energy efficiency-based user number optimization method for large-scale and multi-antenna relay system | |
| CN101174870B (en) | Accidental beam shaping and transmitting method based on beam collection selection | |
| CN108924934A (en) | Heterogeneous network interference management method based on multi dimensional resource distribution | |
| CN105162504B (en) | A kind of quick mimo system transmitting terminal method for precoding | |
| CN106793120B (en) | Splitting number-based rapid joint resource allocation method in virtual MIMO system | |
| CN106209191A (en) | A kind of MU mimo system true environment low complex degree user choosing method | |
| CN102006146A (en) | User scheduling method for multiple-user multiple input multiple output (MU-MIMO) system downlink | |
| CN115967596A (en) | Signal processing method, device and storage medium | |
| CN101646211B (en) | Vertical-switching control method based on frequency spectrum mapping | |
| CN104811947B (en) | A kind of heterogeneous network capacity estimation method and system | |
| CN108471621B (en) | Communication method based on electromagnetic wave energy supply | |
| CN103354664B (en) | Method and apparatus for scheduling user | |
| CN102573092B (en) | Improved proportional fairness scheduling algorithm based on multiuser eigenmode transmission (MET) precoding technology | |
| CN112291828A (en) | Multi-user grouping method and system in multi-carrier NOMA system | |
| Sun et al. | Random beamforming for multiuser multiplexing in downlink correlated Rician channel |
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 |