CN107947841A - Extensive MIMO non-orthogonal multiple system multiple antennas users are to dispatching method - Google Patents
Extensive MIMO non-orthogonal multiple system multiple antennas users are to dispatching method Download PDFInfo
- Publication number
- CN107947841A CN107947841A CN201711157364.0A CN201711157364A CN107947841A CN 107947841 A CN107947841 A CN 107947841A CN 201711157364 A CN201711157364 A CN 201711157364A CN 107947841 A CN107947841 A CN 107947841A
- Authority
- CN
- China
- Prior art keywords
- user
- msub
- group
- mrow
- couple
- 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
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
- H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
- H04B7/0413—MIMO systems
- H04B7/0452—Multi-user MIMO systems
Abstract
The invention belongs to wireless communication technology field, extensive MIMO non-orthogonal multiples system multiple antennas user is disclosed to dispatching method, base station obtains subscriber channel status matrix, and user carries out size sequence by channel state matrix norm size, and is divided into two user groups G and W；It is that each user group selects its first user from user group G that base station weights scheduling factor according to channel status, and according to the efficient channel state matrix norm of user, each user group selects its second user from user group W；Base station sends data to the user selected, carries out data transmission.The present invention is suitable for multiple antennas custom system, the present invention is suitable for the model of multi-user's pairing and multi-user to scheduling at the same time, and distributed by space resources and frequency spectrum resource, the system that can guarantee that obtains preferably and speed ability, the outage probability of user data transmission in reduction system.
Description
Technical field
The invention belongs to wireless communication technology field, more particularly to a kind of extensive MIMO non-orthogonal multiple system multiple antennas
User is to dispatching method.
Background technology
Non-orthogonal multiple NOMA (Non Orthogonal Multiple Access) is used as extensive MIMO (Multi-
Input Multi-output) system one of key technology, by the way that single bandwidth assignment is carried out data to multiple users
Transmission, is substantially improved system spectral efficiency.Base station according to and speed maximizes or outage probability minimum rule carries out user
Pairing, determines which user can share a frequency range, while needs to ensure that the channel of the internal user of user is easily distinguishable, is easy to
Different user is received in receiving terminal and decoded, and reduces the signal interference between the internal user of user.It is strong between user couple in order to eliminate
Interference, the original signal of transmission need to be transmitted again in base station end progress precoding, and then each user is receiving the letter
After number the data of oneself are obtained by merging vector decoding.A kind of user in extensive MIMO non-orthogonal multiple systems is to scheduling
Method, carries out day line options first, by the antenna selected and user to carrying out combined dispatching to select end user to coming
Carry out data transmission.The shortcoming of the present invention is just for single-antenna subscriber, can not be suitable for multiple antennas user, therefore more
In the system scenarios of antenna user, exist compared with big limitation.A kind of secondary user's in relay cooperative network carry out dispatching method
Secondary user's and primary user data transmission reliability in lifting system, by from multiple users to be selected select a user come
User's pairing is carried out with known primary user, while proposes the user under a variety of different channel condition information models to scheduling
Scheme.Shortcoming existing for the present invention is to be only applicable to single user pairing and single user in scheduling model, for more
Complicated multi-user is no longer applicable in scheduling problem, the present invention.
In conclusion problem existing in the prior art is：User in existing extensive MIMO non-orthogonal multiple systems
Have dispatching method just for single-antenna subscriber, multiple antennas user can not be suitable for, had compared with big limitation；It is only applicable to alone
Family is matched and single user is not in scheduling model, for increasingly complex multi-user to scheduling problem, applying to.
The content of the invention
In view of the problems of the existing technology, the present invention provides a kind of extensive MIMO non-orthogonal multiple system multiple antennas
User is to dispatching method.
The present invention is achieved in that a kind of extensive MIMO non-orthogonal multiples system multiple antennas user to dispatching method,
The multiple antennas user obtains dispatching method base station in subscriber channel status matrix, and user is big by channel state matrix norm
Small progress size sequence, and it is divided into two user groups G and W；Base station weights scheduling factor according to channel status
Each user group selects its first user, according to the efficient channel state matrix norm of user from user group W each user
Group selects its second user；Base station sends data to the user selected, carries out data transmission.
Further, the extensive MIMO non-orthogonal multiple system multiple antennas users comprise the following steps dispatching method：
Step 1, base station send training sequence known to user to user, and user estimates according to the training sequence received
Channel state information matrix, user is by information feedback to base station；
Step 2, is ranked up user；
Step 3, selects first user of all users couple in the first user group；
Step 4, constructs precoding vector；
Step 5, selects second user of all users couple from second user group；
Step 6, construction receive to merge vector；
Step 7, carries out data transmission.
Further, the step 2 specifically includes：
(1) base station takes F norms H to each subscriber channel state matrixFOperation；
(2) the channel state matrix norm of all users is carried out descending arrangement by base station, by the first half user after sequence
As the first user group, later half user is as second user group.
Further, the step 3 specifically includes：
(1) using the method for selection maximum channel state matrix norm user, first use of first user couple of selection
Family；
(2) using the method for selection maximum channel state weight scheduling factor user, select to remove first in the first user group
First user of other all users couple outside a user couple.
Further, the method for the selection maximum channel state matrix norm user described in described (1), selects first use
The step of first user at family pair, is as follows：
The first step, calculates the channel state matrix F norms of each user in the first user group
Second step, by channel state matrix normFirst user of the maximum user as first user couple；
The method of selection maximum channel state weight scheduling factor user in (2), selection is except first user is to it
The step of first user of outer all users couple, is as follows：
The first step, sets weighted factor λ and ν, wherein λ ＞ 0, ν ＞ 0, λ+ν=1；
Second step, according to the following formula, calculates each chordal distance between user and selected user in the first user group：
Wherein, CaRepresent the chordal distance between a-th of user and all selected users in the first user group,Expression takes arithmetic
Square root functions, M represent user antenna sum, and M >=2, tr represent to take trace of a matrix to operate,Represent in the first user group a-th
Channel state matrix after subscriber channel orthogonalization,Channel status before expression after the channel quadrature of all selected users
Matrix, H represent to take conjugate transposition operation；
3rd step, according to the following formula, calculates the channel status weighting scheduling factor of each user in the first user group：
Wherein, daRepresent the channel status weighting scheduling factor of a-th of user in the first user group, λ and ν represent to add respectively
Weight factor, CaRepresent the chordal distance between a-th of user and selected user in the first user group；
Channel status in first user group, is weighted the user of scheduling factor maximum, as active user's couple by the 4th step
First user；
5th step, judges active user to whether being equal to antenna for base station sum, if so, then obtaining the first of all users couple
A user, otherwise, will perform the 4th step after active user couple plus 1.
Further, the step 4 specifically includes：
(1) according to the following formula, first user of each user couple is docked the collection of letters number and is merged：
Wherein, w1,iRepresent that the receiving of first user in i-th of user couple merges vector,Expression make even root behaviour
Make, M represents user antenna sum, and T represents transposition operation；
(2) according to the following formula, the precoding vector of first user in each user couple is calculated：
Wherein, g1,iRepresent the efficient channel vector of first user in i-th of user couple, H represents transposition operation, × table
Show to take and multiply operation, piRepresent the precoding vector of first user in i-th of user couple.
Further, the step 5 specifically includes：
(1) according to the following formula, the reception for calculating each user in second user group merges vector：
Wherein, w2,iRepresent the singular vector of s-th of user in second user group, g2,sRepresent in second user group s-th
The efficient channel matrix of user, v2,sRepresent that the reception of s-th of user in second user group merges vector；
(2) using the method for the maximum active matrix norm user of selection, from second user group, all user groups are selected
Second user.
Further, the method for the maximum efficient channel norm of selection in described (2), selects second user of all user groups
The step of it is as follows：
The first step, i=1；
Second step, according to the following formula, calculates the efficient channel norm of each user in second user group：
Cf,s=| v2,sH2,spi|2；
Wherein, Cf,iRepresent the efficient channel norm of s-th of user in second user group, H2,sRepresent the in second user group
The channel state vector of s user, piRepresent the precoding vector of i-th of user group, first user, | | expression takes absolute value
Operation；
Second step, by the user of efficient channel norm maximum in second user group, second use as i-th of user couple
Family；
3rd step, judges whether i is equal to antenna for base station sum, if so, first user of all users couple is then obtained, it is no
Then, second step will be performed after i plus 1.
Further, scheduling d is weighted according to channel status in the slave user group G in the step 3wThe N number of use of selecting predictors
Family, carries out as follows：
The first step, selects a user of the norm maximum user f selected as first from user group1：
Meanwhile G=Gf1, represent to reject user f from set G1, while i=1；
Second step, by the channel state matrix H of all users in user group Gu, u ∈ G carry out Gauss orthogonalization be changed intoD is dispatched from user group G selection channel status weightings according to the factorwMaximum user is as next selected user
fi+1：
3rd step, repeats second step, until selecting N number of user from set G；
Each user is to selecting second user s=[s in the step 51,s2,…,sN], carry out as follows：
The first step, initialization, j=0；
Second step, filters out the user with having selected first user to meet respective channel conditions dictate from user group W：
J=j+1；
3rd step, collects for userIn each user design merge vectorEfficient channel in user group
Vector representation isTherefore vector vkIt must is fulfilled for following relational expression：
Singular value decomposition is carried out to the combinatorial matrix on the right of above formula and can obtain vectorial wk, while can obtain user's collection
In each user merging vector
4th step, second user in each user group is selected according to equation below：
The user in jth group is obtained to [fj,sj], while according to the reception of second user obtained in jth group merge to
Amount
5th step, returns to second step, until selecting N number of user；
6th step, obtains all users to U={ [f1,s1],[f2,s2],...,[fN,sN]}.Also owned at the same time
The receiving of second user of user couple merges vector.
Another object of the present invention is to provide one kind to use using the extensive MIMO non-orthogonal multiple systems multiple antennas
Multiple-input and multiple-output non-orthogonal multiple system of the family to dispatching method.
The present invention is suitable for multiple antennas custom system, while the present invention is suitable for multi-user's pairing and multi-user to scheduling
Model, and being distributed by space resources and frequency spectrum resource, the system that can guarantee that obtain preferably and speed ability, are used in reduction system
The outage probability of user data transmission.
Due to the present invention using user's pairing of substep and user to dispatching algorithm, the in each user couple is selected respectively
One user and second user, which make choice, can further increase system and speed；Using new interference elimination side
Case, can be used in the extensive MIMO non-orthogonal multiples system of user's multiple antennas, broken in traditional NOMA systems and disturbed
Technology for eliminating cannot apply to the bottleneck of multiple antennas user, and be effectively reduced the receiving interference of receiving terminal, reduce in user
Disconnected probability, the stability of lifting system；Speed ability and interruption performance are relatively low.
Brief description of the drawings
Fig. 1 is extensive MIMO non-orthogonal multiple system multiple antennas users provided in an embodiment of the present invention to dispatching method stream
Cheng Tu.
Fig. 2 is that extensive MIMO non-orthogonal multiples system multiple antennas user provided in an embodiment of the present invention is real to dispatching method
Existing flow chart.
Fig. 3 is the analogous diagram provided in an embodiment of the present invention to system after scheduling and speed ability.
Fig. 4 is the analogous diagram provided in an embodiment of the present invention to user data transmission outage probability in system after scheduling.
Embodiment
In order to make the purpose , technical scheme and advantage of the present invention be clearer, with reference to embodiments, to the present invention
It is further elaborated.It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, it is not used to
Limit the present invention.
The present invention can be realized in extensive MIMO-NOMA systems, according to the channel condition information CSI of user
(Channel State Information) dynamically user group pair in distribution system, while dispatched out from all users couple
Optimal user merges vector and effectively eliminates the signal that between user couple and user is internal to carrying out data transmission using receiving
Interference, effectively improves system and speed and Outage probability of distributed antenna.
The application principle of the present invention is explained in detail below in conjunction with the accompanying drawings.
As shown in Figure 1, extensive MIMO non-orthogonal multiples system multiple antennas user provided in an embodiment of the present invention is to scheduling
Method comprises the following steps：
S101：Base station obtains subscriber channel status matrix, and user carries out size by channel state matrix norm size
Sequence, and it is divided into two user groups G and W；
S102：It is that each user group selects its first from user group G that base station weights scheduling factor according to channel status
User, according to the efficient channel state matrix norm of user, each user group selects its second user from user group W；
S103：Base station sends data to the user selected, carries out data transmission.
The application principle of the present invention is further described below in conjunction with the accompanying drawings.
As shown in Fig. 2, extensive MIMO non-orthogonal multiples system multiple antennas user provided in an embodiment of the present invention is to scheduling
Method comprises the following steps：
Step 1, user is to its channel condition information of base station feedback：
Base station sends training sequence known to user to user, and user estimates channel status according to the training sequence received
Information matrix, user is by information feedback to base station；
Step 2, is ranked up user：
The first step, base station take F norms H to each subscriber channel state matrixFOperation；
Second step, the channel state matrix norm of all users is carried out descending arrangement by base station, by the first half after sequence
User is as the first user group G, and later half user is as second user group W；
Step 3, selects first user f=[f of all users couple from G1,f2,...,fM]；
The first step, calculates the channel state matrix F norms of each user in the first user group G
Second step, by channel state matrix normFirst user of the maximum user as first user couple
f1；
3rd step, if i=0；
4th step, makes i=i+1；
Weighted factor λ and ν are set, wherein λ ＞ 0, ν ＞ 0, λ+ν=1, according to the following formula, calculates and each used in the first user group
[f between family and selected user1,f2,...,fi] chordal distance：
Wherein, CaRepresent the chordal distance between a-th of user and all selected users in the first user group G,Expression takes calculation
Art square root functions, M represent user antenna sum, and M >=2, tr represent to take trace of a matrix to operate,Represent a in the first user group
Channel state matrix after a subscriber channel orthogonalization,Channel shape before expression after the channel quadrature of all selected users
State matrix, H represent to take conjugate transposition operation；
5th step, according to the following formula, calculates the channel status weighting scheduling factor of each user in the first user group：
Wherein, daRepresent the channel status weighting scheduling factor of a-th of user in the first user group G, λ and ν are represented respectively
Weighted factor, CaRepresent the chordal distance between a-th of user and selected user in the first user group G；
Channel status in first user group, is weighted the user of scheduling factor maximum, as active user's couple by the 6th step
First user fi；
7th step, judgement are selected whether amount is equal to antenna for base station sum, if so, then obtaining the first of all users couple
A user, otherwise, performs the 4th step；
Step 4, constructs precoding vector：
The first step, first user f of each user couplei, i=1,2 ..., the N docking collections of letters number merge：
Wherein, w1,iRepresent that the receiving of first user in i-th of user couple merges vector,Expression make even root behaviour
Make, M represents user antenna sum, and T represents transposition operation；
Second step, according to the following formula, calculates the precoding vector of first user in each user couple：
Wherein, g1,iRepresent the efficient channel vector of first user in i-th of user couple,H1,iFor user
fiChannel state matrix, H represents transposition operation, × represent to take and multiply operation, piRepresent in i-th of user couple first user's
Precoding vector；
3rd step, the precoding vector p of user in above formula is obtained according to singular value decompositioni；
Step 5, selects second user s=[s of all users couple from second user group W1,s2,...,sM]；
The first step, initialization, j=0；
Second step, filters out from user group W with having selected first user to meet respective channel conditions dictate in step 3
User：
J=j+1；
3rd step, according to the following formula, calculates second user groupIn the reception of each user merge vector：
Wherein, w2,iRepresent each user to siThe singular vector of a user, g2,iRepresent s in each user coupleiA use
The efficient channel matrix at family,piRepresent first user f in i-th of user coupleiPrecoding vector, each
Two users in user couple share a precoding vector；v2,iRepresent s in second user groupiThe reception of a user merges
Vector；
4th step, according to equation below fromSecond user s in the middle each user group of selectioni, i=1,2 ...,
M：
The user in jth group is obtained to [fi,si], while can obtain according to the 3rd step second user's in jth group
Receive and merge vector
5th step, returns to second step, until selecting M user, and obtains M user to value.
Step 6, carries out data transmission；
Data after carrying out precoding are transferred to all users couple by base station, and the user of all users couple arrives this after the receipt
After a little data, vector is merged according to the reception of construction and merges signal., receiving signal expression is：
Wherein, wn,lRepresent the merging vector of nth user in l-th of user couple, Hn,lRepresent n-th in l-th of user couple
The channel state vector of a user, plRepresent the precoding vector of first user in l-th of user couple, α1,lAnd α2,lTable respectively
Show the power allocation factor of the 1st and the 2nd user in l-th of user couple, s1,lAnd s2,lRepresent that base station is sent to l-th of user respectively
Centering the 1st and the symbol of the 2nd user.nn,lRepresent the noise that nth user undergoes in l-th of user couple.
The application effect of the present invention is explained in detail with reference to emulation.
1. simulated conditions：
The emulation of the present invention carries out in the wireless communication scene of single base station, and extensive antenna base station has 32 antennas,
There are 128 users in system, and each user there are 2 antennas.And according to extensive MIMO super-intensives network model, it is every in system
Being uniformly distributed for [1,10] is obeyed in the distance between a user and base station.Scheduling factor λ and ν are respectively equal to 0.8 and 0.2.Path
Fissipation factor is 3.
2. analysis of simulation result：
The simulation result of the present invention is as shown in Figure 3, Figure 4.Fig. 3 is after completing user's pairing and data transfer using the present invention
And velocity simulation figure, while also draw other respective algorithms to be compared therewith.Fig. 4 is to complete user using the present invention to match somebody with somebody
Pair and data-signal send after, the interruption of first user and second user are general in each user group in data transmission procedure
Rate analogous diagram.As can be seen from FIG. 3, user proposed by the present invention matches algorithm in two kinds of different 0.4 Hes of power allocation factor
0.25 time system and speed are better than traditional random groups pair and channel ranking method.Meanwhile according to the excellent of non-orthogonal multiple system
Gesture, so system and speed of the present invention program also superior to conventional orthogonal multi-address system.
It is general using the interruption for power allocation factor of the present invention as 0.4 second user of solid line square mark in Fig. 4
Rate.Using the outage probability for power allocation factor of the present invention as 0.25 second user of circular square mark in Fig. 4.Figure
Using the outage probability for power allocation factor of the present invention as 0.4 first user of dashed square mark in 4.Pass through Fig. 4
Understand, under different capacity distribution factor 0.4 and 0.25, the outage probability of second user of the invention is respectively less than random point of tradition
Group method and user's ranking method.But because user is allocated more power in orthogonal multiple access system, therefore second in orthogonal multiple access system
The outage probability of a user is less than the outage probability of second user in the present invention.Meanwhile when power allocation factor is 0.4,
In the method for dividision into groups that the outage probability of first user of the invention is also respectively less than the random packet of tradition and user sorts in first user
Disconnected probability.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the invention, all essences in the present invention
All any modification, equivalent and improvement made within refreshing and principle etc., should all be included in the protection scope of the present invention.
Claims (10)
1. a kind of extensive MIMO non-orthogonal multiple system multiple antennas users are to dispatching method, it is characterised in that described extensive
MIMO non-orthogonal multiples system multiple antennas user obtains subscriber channel status matrix to dispatching method base station, and user presses channel
State matrix norm size carries out size sequence, and is divided into two user groups G and W；Base station according to channel status weight scheduling because
Son from user group G is that each user group selects its first user, according to the efficient channel state matrix norm of user from
Each user group selects its second user in the group W of family；Base station sends data to the user selected, carries out data transmission.
2. extensive MIMO non-orthogonal multiples system multiple antennas user as claimed in claim 1 exists dispatching method, its feature
In the multiple antennas user comprises the following steps dispatching method：
Step 1, base station send training sequence known to user to user, and user estimates channel according to the training sequence received
State information matrix, user is by information feedback to base station；
Step 2, is ranked up user；
Step 3, selects first user of all users couple in the first user group；
Step 4, constructs precoding vector；
Step 5, selects second user of all users couple from second user group；
Step 6, construction receive to merge vector；
Step 7, carries out data transmission.
3. extensive MIMO non-orthogonal multiples system multiple antennas user as claimed in claim 2 exists dispatching method, its feature
In the step 2 specifically includes：
(1) base station takes F norms to each subscriber channel state matrix | | H | |FOperation；
(2) the channel state matrix norm of all users is carried out descending arrangement by base station, using the first half user after sequence as
First user group, later half user is as second user group.
4. extensive MIMO non-orthogonal multiples system multiple antennas user as claimed in claim 2 exists dispatching method, its feature
In the step 3 specifically includes：
(1) using the method for selection maximum channel state matrix norm user, first user of first user couple of selection；
(2) using the method for selection maximum channel state weight scheduling factor user, select to remove first use in the first user group
First user of other all users couple outside family pair.
5. extensive MIMO non-orthogonal multiples system multiple antennas user as claimed in claim 4 exists dispatching method, its feature
In, the method for the selection maximum channel state matrix norm user described in (1), first of first user couple of selection
The step of user, is as follows：
The first step, calculates the channel state matrix F norms of each user in the first user group
Second step, by channel state matrix normFirst user of the maximum user as first user couple；
The method of selection maximum channel state weight scheduling factor user, selects in addition to first user couple in (2)
The step of first user of all users couple, is as follows：
The first step, sets weighted factor λ and ν, wherein λ ＞ 0, ν ＞ 0, λ+ν=1；
Second step, according to the following formula, calculates each chordal distance between user and selected user in the first user group：
<mrow>
<msub>
<mi>C</mi>
<mi>a</mi>
</msub>
<mo>=</mo>
<msqrt>
<mrow>
<mi>M</mi>
<mo>-</mo>
<mi>t</mi>
<mi>r</mi>
<mrow>
<mo>(</mo>
<msub>
<mover>
<mi>H</mi>
<mo>~</mo>
</mover>
<mi>a</mi>
</msub>
<msubsup>
<mover>
<mi>H</mi>
<mo>~</mo>
</mover>
<mi>s</mi>
<mi>H</mi>
</msubsup>
<msub>
<mover>
<mi>H</mi>
<mo>~</mo>
</mover>
<mi>s</mi>
</msub>
<msubsup>
<mover>
<mi>H</mi>
<mo>~</mo>
</mover>
<mi>a</mi>
<mi>H</mi>
</msubsup>
<mo>)</mo>
</mrow>
</mrow>
</msqrt>
<mo>;</mo>
</mrow>
Wherein, CaRepresent the chordal distance between a-th of user and all selected users in the first user group,Expression takes arithmetic square
Root operates, and M represents user antenna sum, and M >=2, tr represent to take trace of a matrix to operate,Represent a-th of user in the first user group
Channel state matrix after channel quadrature,Channel status square before expression after the channel quadrature of all selected users
Battle array, H represent to take conjugate transposition operation；
3rd step, according to the following formula, calculates the channel status weighting scheduling factor of each user in the first user group：
<mrow>
<msub>
<mi>d</mi>
<mi>a</mi>
</msub>
<mo>=</mo>
<msub>
<mi>&lambda;C</mi>
<mi>a</mi>
</msub>
<mo>+</mo>
<mi>v</mi>
<mo>|</mo>
<mo>|</mo>
<msub>
<mi>H</mi>
<mi>a</mi>
</msub>
<mo>|</mo>
<msubsup>
<mo>|</mo>
<mi>F</mi>
<mn>2</mn>
</msubsup>
<mo>;</mo>
</mrow>
Wherein, daRepresent in the first user group the channel status weighting scheduling factor of a-th of user, λ and ν represent respectively weighting because
Son, CaRepresent the chordal distance between a-th of user and selected user in the first user group；
4th step, by the first user group channel status weighting scheduling factor maximum user, first as active user couple
A user；
5th step, judges active user to whether being equal to antenna for base station sum, if so, then obtaining first use of all users couple
Family, otherwise, will perform the 4th step after active user couple plus 1.
6. extensive MIMO non-orthogonal multiples system multiple antennas user as claimed in claim 2 exists dispatching method, its feature
In the step 4 specifically includes：
(1) according to the following formula, first user of each user couple is docked the collection of letters number and is merged：
Wherein, w1,iRepresent that the receiving of first user in i-th of user couple merges vector,Expression make even root operation, M tables
Show user antenna sum, T represents transposition operation；
(2) according to the following formula, the precoding vector of first user in each user couple is calculated：
Wherein, g1,iRepresenting the efficient channel vector of first user in i-th of user couple, H represents transposition operation, × represent to take
Multiply operation, piRepresent the precoding vector of first user in i-th of user couple.
7. extensive MIMO non-orthogonal multiples system multiple antennas user as claimed in claim 2 exists dispatching method, its feature
In the step 5 specifically includes：
(1) according to the following formula, the reception for calculating each user in second user group merges vector：
Wherein, w2,iRepresent the singular vector of s-th of user in second user group, g2,sRepresent s-th of user in second user group
Efficient channel matrix, v2,sRepresent that the reception of s-th of user in second user group merges vector；
(2) using the method for the maximum active matrix norm user of selection, from second user group, the second of all user groups are selected
A user.
8. extensive MIMO non-orthogonal multiples system multiple antennas user as claimed in claim 7 exists dispatching method, its feature
In, method of the maximum efficient channel norm of selection in (2), the step of selecting second user of all user groups, is as follows：
The first step, i=1；
Second step, according to the following formula, calculates the efficient channel norm of each user in second user group：
Cf,s=| v2, sH2,spi|2；
Wherein, Cf,iRepresent the efficient channel norm of s-th of user in second user group, H2,sRepresent in second user group s-th
The channel state vector of user, piRepresent the precoding vector of i-th of user group, first user, | | represent the behaviour that takes absolute value
Make；
Second step, by the user of efficient channel norm maximum in second user group, second user as i-th of user couple；
3rd step, judges whether i is equal to antenna for base station sum, if so, first user of all users couple is then obtained, otherwise,
Second step will be performed after i plus 1.
9. extensive MIMO non-orthogonal multiples system multiple antennas user as claimed in claim 2 exists dispatching method, its feature
According to channel status weighting scheduling d in the slave user group G in the step 3wThe N number of user of selecting predictors, as follows
Carry out：
The first step, selects a user of the norm maximum user f selected as first from user group1：
<mrow>
<msub>
<mi>C</mi>
<mi>k</mi>
</msub>
<mo>=</mo>
<mo>|</mo>
<mo>|</mo>
<msub>
<mi>H</mi>
<mi>k</mi>
</msub>
<mo>|</mo>
<msubsup>
<mo>|</mo>
<mi>F</mi>
<mn>2</mn>
</msubsup>
<mo>,</mo>
<mi>k</mi>
<mo>&Element;</mo>
<mi>G</mi>
<mo>,</mo>
<msub>
<mi>f</mi>
<mn>1</mn>
</msub>
<mo>=</mo>
<mi>argmax</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>C</mi>
<mi>k</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>;</mo>
</mrow>
Meanwhile G=G/f1, represent to reject user f from set G1, while i=1；
Second step, by the channel state matrix H of all users in user group Gu, u ∈ G carry out Gauss orthogonalization be changed into
D is dispatched from user group G selection channel status weightings according to the factorwMaximum user is as next selected user fi+1：
<mrow>
<msub>
<mi>f</mi>
<mrow>
<mi>i</mi>
<mo>+</mo>
<mn>1</mn>
</mrow>
</msub>
<mo>=</mo>
<mi>arg</mi>
<munder>
<mi>max</mi>
<mrow>
<msub>
<mi>f</mi>
<mi>i</mi>
</msub>
<mo>&Element;</mo>
<mi>G</mi>
</mrow>
</munder>
<mo>{</mo>
<mi>&lambda;</mi>
<msqrt>
<mrow>
<mi>M</mi>
<mo>-</mo>
<msub>
<mover>
<mi>H</mi>
<mo>~</mo>
</mover>
<msub>
<mi>f</mi>
<mi>i</mi>
</msub>
</msub>
<msubsup>
<mover>
<mi>H</mi>
<mo>~</mo>
</mover>
<mi>u</mi>
<mi>H</mi>
</msubsup>
<msub>
<mover>
<mi>H</mi>
<mo>~</mo>
</mover>
<mi>u</mi>
</msub>
<msubsup>
<mover>
<mi>H</mi>
<mo>~</mo>
</mover>
<msub>
<mi>f</mi>
<mi>i</mi>
</msub>
<mi>H</mi>
</msubsup>
</mrow>
</msqrt>
<mo>+</mo>
<mi>v</mi>
<mo>|</mo>
<mo>|</mo>
<msub>
<mi>H</mi>
<mi>u</mi>
</msub>
<mo>|</mo>
<msubsup>
<mo>|</mo>
<mi>F</mi>
<mn>2</mn>
</msubsup>
<mo>}</mo>
<mo>,</mo>
<mi>u</mi>
<mo>&Element;</mo>
<mi>G</mi>
<mo>,</mo>
<mi>i</mi>
<mo>=</mo>
<mi>i</mi>
<mo>+</mo>
<mn>1</mn>
<mo>;</mo>
</mrow>
3rd step, repeats second step, until selecting N number of user from set G；
Each user is to selecting second user s=[s in the step 51,s2,...,sN], carry out as follows：
The first step, initialization, j=0；
Second step, filters out the user with having selected first user to meet respective channel conditions dictate from user group W：
J=j+1；
<mrow>
<msub>
<mover>
<mi>W</mi>
<mo>~</mo>
</mover>
<mi>j</mi>
</msub>
<mo>=</mo>
<mo>{</mo>
<msub>
<mi>u</mi>
<mi>s</mi>
</msub>
<mo>|</mo>
<mn>10</mn>
<mi>lg</mi>
<mo>|</mo>
<mo>|</mo>
<msub>
<mi>H</mi>
<msub>
<mi>f</mi>
<mi>j</mi>
</msub>
</msub>
<mo>|</mo>
<msubsup>
<mo>|</mo>
<mi>F</mi>
<mn>2</mn>
</msubsup>
<mo>-</mo>
<mn>10</mn>
<mi>lg</mi>
<mo>|</mo>
<mo>|</mo>
<msub>
<mi>H</mi>
<msub>
<mi>u</mi>
<mi>s</mi>
</msub>
</msub>
<mo>|</mo>
<msubsup>
<mo>|</mo>
<mi>F</mi>
<mn>2</mn>
</msubsup>
<mo>&GreaterEqual;</mo>
<mn>3</mn>
<mi>d</mi>
<mi>B</mi>
<mo>,</mo>
<msub>
<mi>u</mi>
<mi>s</mi>
</msub>
<mo>&Element;</mo>
<msub>
<mi>W</mi>
<mi>j</mi>
</msub>
<mo>}</mo>
<mo>,</mo>
<msub>
<mi>W</mi>
<mn>1</mn>
</msub>
<mo>=</mo>
<mi>W</mi>
<mo>;</mo>
</mrow>
3rd step, collects for userIn each user design merge vectorEfficient channel vector in user group
It is expressed asTherefore vector vkIt must is fulfilled for following relational expression：
Singular value decomposition is carried out to the combinatorial matrix on the right of above formula and can obtain vectorial wk, while can obtain user's collectionIn
The merging vector of each user
4th step, second user in each user group is selected according to equation below：
<mrow>
<msub>
<mi>s</mi>
<mi>j</mi>
</msub>
<mo>=</mo>
<mi>arg</mi>
<munder>
<mi>max</mi>
<mrow>
<mi>k</mi>
<mo>&Element;</mo>
<msub>
<mi>w</mi>
<mi>j</mi>
</msub>
</mrow>
</munder>
<mo>{</mo>
<mo>|</mo>
<mo>|</mo>
<msubsup>
<mi>v</mi>
<mi>k</mi>
<mi>H</mi>
</msubsup>
<msub>
<mi>H</mi>
<mi>k</mi>
</msub>
<msub>
<mi>p</mi>
<msub>
<mi>f</mi>
<mi>j</mi>
</msub>
</msub>
<mo>|</mo>
<msup>
<mo>|</mo>
<mn>2</mn>
</msup>
<mo>,</mo>
<msub>
<mi>f</mi>
<mi>j</mi>
</msub>
<mo>&Element;</mo>
<mi>f</mi>
<mo>}</mo>
<mo>;</mo>
</mrow>
The user in jth group is obtained to [fj,sj], while vector is merged according to the reception of second user obtained in jth group
5th step, returns to second step, until selecting N number of user；
6th step, obtains all users to U={ [f1,s1],[f2,s2],...,[fN,sN]}；Obtain all users couple at the same time
Second user receiving merge vector.
10. one kind is exchanged using extensive MIMO non-orthogonal multiple system multiple antennas users described in claim 1~9 any one
The multiple-input and multiple-output non-orthogonal multiple system of degree method.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711157364.0A CN107947841B (en) | 2017-11-20 | 2017-11-20 | Multi-antenna user pair scheduling method for large-scale MIMO non-orthogonal multiple access system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711157364.0A CN107947841B (en) | 2017-11-20 | 2017-11-20 | Multi-antenna user pair scheduling method for large-scale MIMO non-orthogonal multiple access system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107947841A true CN107947841A (en) | 2018-04-20 |
| CN107947841B CN107947841B (en) | 2021-05-04 |
Family
ID=61930260
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711157364.0A Active CN107947841B (en) | 2017-11-20 | 2017-11-20 | Multi-antenna user pair scheduling method for large-scale MIMO non-orthogonal multiple access system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107947841B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110149127A (en) * | 2019-06-19 | 2019-08-20 | 南京邮电大学 | A kind of D2D communication system precoding vector optimization method based on NOMA technology |
| CN111147112A (en) * | 2019-12-30 | 2020-05-12 | 中国传媒大学 | Energy maximization collection method based on MIMO-NOMA system |
| CN112005516A (en) * | 2018-06-29 | 2020-11-27 | 谷歌有限责任公司 | Transport block communication as part of multiple access wireless communication |
| CN113141233A (en) * | 2021-03-11 | 2021-07-20 | 西安电子科技大学 | Channel matrix sequencing QR decomposition processing method and system |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100029288A1 (en) * | 2008-07-31 | 2010-02-04 | Motorola, Inc. | Uplink spatial division multiple access (sdma) user pairing and scheduling |
| CN102340336A (en) * | 2010-07-20 | 2012-02-01 | 普天信息技术研究院有限公司 | User pairing method of MU-MIMO based on SLNR |
| CN103402268A (en) * | 2013-08-21 | 2013-11-20 | 西安电子科技大学 | Downlink MU_COMP scheduling algorithm based on improved chordal distance |
| WO2016091008A1 (en) * | 2014-12-09 | 2016-06-16 | 中兴通讯股份有限公司 | Non-orthogonal user equipment interference processing and signaling notification method, device and storage medium |
| CN105992374A (en) * | 2014-12-09 | 2016-10-05 | 山东大学 | Multi-user MIMO system user scheduling method based on L2-Hausdorff distance |
| CN106028462A (en) * | 2016-05-23 | 2016-10-12 | 西安电子科技大学 | Large-scale MIMO collaborative user scheduling method |
| WO2016165092A1 (en) * | 2015-04-16 | 2016-10-20 | 富士通株式会社 | Feedback and receiving method, device and communication system for precoding matrix indicator |
-
2017
- 2017-11-20 CN CN201711157364.0A patent/CN107947841B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100029288A1 (en) * | 2008-07-31 | 2010-02-04 | Motorola, Inc. | Uplink spatial division multiple access (sdma) user pairing and scheduling |
| CN102340336A (en) * | 2010-07-20 | 2012-02-01 | 普天信息技术研究院有限公司 | User pairing method of MU-MIMO based on SLNR |
| CN103402268A (en) * | 2013-08-21 | 2013-11-20 | 西安电子科技大学 | Downlink MU_COMP scheduling algorithm based on improved chordal distance |
| WO2016091008A1 (en) * | 2014-12-09 | 2016-06-16 | 中兴通讯股份有限公司 | Non-orthogonal user equipment interference processing and signaling notification method, device and storage medium |
| CN105992374A (en) * | 2014-12-09 | 2016-10-05 | 山东大学 | Multi-user MIMO system user scheduling method based on L2-Hausdorff distance |
| WO2016165092A1 (en) * | 2015-04-16 | 2016-10-20 | 富士通株式会社 | Feedback and receiving method, device and communication system for precoding matrix indicator |
| CN106028462A (en) * | 2016-05-23 | 2016-10-12 | 西安电子科技大学 | Large-scale MIMO collaborative user scheduling method |
Non-Patent Citations (5)
| Title |
|---|
| HAN ZHANG ET AL: "User pairing algorithm with SIC in non-orthogonal multiple access system", 《2016 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS》 * |
| WEI WU, DANPU LIU: "Non-orthogonal multiple access based hybrid beamforming in 5G mmWave systems", 《2017 IEEE 28TH ANNUAL INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR, AND MOBILE RADIO COMMUNICATIONS》 * |
| ZHENGXUAN LIU ET AL: "Joint Beamforming and Power Optimization With Iterative User Clustering for MISO-NOMA Systems", 《IEEE ACCESS》 * |
| 李钊 等: "非正交多址接入下行链路用户匹配与功率优化算法", 《电子与信息学报》 * |
| 石兰洁，陈海华: "非正交多址接入系统中关于迫零波束的用户配对", 《电子技术应用》 * |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112005516A (en) * | 2018-06-29 | 2020-11-27 | 谷歌有限责任公司 | Transport block communication as part of multiple access wireless communication |
| CN112005516B (en) * | 2018-06-29 | 2023-07-18 | 谷歌有限责任公司 | Transport block communication as part of multiple access wireless communication |
| US11728939B2 (en) | 2018-06-29 | 2023-08-15 | Google Llc | Transport block communication as part of multiple access wireless communication |
| CN110149127A (en) * | 2019-06-19 | 2019-08-20 | 南京邮电大学 | A kind of D2D communication system precoding vector optimization method based on NOMA technology |
| CN111147112A (en) * | 2019-12-30 | 2020-05-12 | 中国传媒大学 | Energy maximization collection method based on MIMO-NOMA system |
| CN111147112B (en) * | 2019-12-30 | 2021-06-11 | 中国传媒大学 | Energy maximization collection method based on MIMO-NOMA system |
| CN113141233A (en) * | 2021-03-11 | 2021-07-20 | 西安电子科技大学 | Channel matrix sequencing QR decomposition processing method and system |
| CN113141233B (en) * | 2021-03-11 | 2022-08-26 | 西安电子科技大学 | Channel matrix sequencing QR decomposition processing method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107947841B (en) | 2021-05-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107947841A (en) | Extensive MIMO non-orthogonal multiple system multiple antennas users are to dispatching method | |
| CN101919200B (en) | Optimal user pairing for multiuser MIMO | |
| CN101925070B (en) | Resource allocation method for cognitive system based on space multiplexing | |
| CN102882570B (en) | Optimum transceiving combined processing method for communication among equipment in mobile communication network | |
| CN110365380A (en) | Method, communication device and the system of data transmission | |
| CN104702326B (en) | Virtual MIMO user pairing and resource allocation methods based on MSE | |
| CN102185683B (en) | Signal-to-leakage-and-noise ratio (SLNR) rule statistic-based MIMO (Multiple Input Multiple Output) multi-user downlink transmission method | |
| CN109845356A (en) | Method, radio network node and the radio terminal of transmission timing are assigned to radio terminal | |
| CN106231665B (en) | Resource allocation methods based on the switching of RRH dynamic mode in number energy integrated network | |
| CN105429741B (en) | Joint virtual MIMO resource allocation methods based on dynamic subscriber's pairing | |
| CN102291834B (en) | The resource regulating method of multiple-input and multiple-output and base station | |
| CN101877607B (en) | Method and device for configuring pre-coding weights in cells | |
| CN108924934A (en) | Heterogeneous network interference management method based on multi dimensional resource distribution | |
| CN106027214A (en) | Pilot distribution method of multi-cell large-scale MIMO system | |
| CN105991219A (en) | Sending signal processing method and device | |
| CN103929224B (en) | Disturbance restraining method and device in cellular network | |
| CN103118436B (en) | A kind of MU-MIMO down link is based on the user scheduling algorithm of interference Pre-Evaluation | |
| CN106507391B (en) | Interference guidance method in WLAN | |
| CN104901732A (en) | Pilot frequency multiplexing method in dense node configuration system | |
| CN106131966B (en) | User scheduling method based on dense distribution formula wireless network dynamic clustering | |
| CN102006146B (en) | User scheduling method for multiple-user multiple input multiple output (MU-MIMO) system downlink | |
| CN107172709A (en) | A kind of wireless dummy resource management and allocation method based on junction network | |
| CN102647247B (en) | One transmits preliminary treatment sending method and device | |
| CN103716079B (en) | Method and apparatus for coordinated multipoint downlink transmission between two cells | |
| CN103580811B (en) | A kind of interference alignment schemes, relevant apparatus and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |