CN113747558B - Power control method of MISO-NOMA uplink channel - Google Patents

Power control method of MISO-NOMA uplink channel Download PDF

Info

Publication number
CN113747558B
CN113747558B CN202110973495.6A CN202110973495A CN113747558B CN 113747558 B CN113747558 B CN 113747558B CN 202110973495 A CN202110973495 A CN 202110973495A CN 113747558 B CN113747558 B CN 113747558B
Authority
CN
China
Prior art keywords
user
group
users
base station
channel
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202110973495.6A
Other languages
Chinese (zh)
Other versions
CN113747558A (en
Inventor
刘铭
张军霞
熊轲
程慈航
张天壮
王鑫
徐宇轩
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Jiaotong University
Original Assignee
Beijing Jiaotong University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Jiaotong University filed Critical Beijing Jiaotong University
Priority to CN202110973495.6A priority Critical patent/CN113747558B/en
Publication of CN113747558A publication Critical patent/CN113747558A/en
Application granted granted Critical
Publication of CN113747558B publication Critical patent/CN113747558B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W52/00Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/04TPC
    • H04W52/06TPC algorithms
    • H04W52/14Separate analysis of uplink or downlink
    • H04W52/146Uplink power control
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W52/00Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/04TPC
    • H04W52/18TPC being performed according to specific parameters
    • H04W52/24TPC being performed according to specific parameters using SIR [Signal to Interference Ratio] or other wireless path parameters
    • H04W52/241TPC being performed according to specific parameters using SIR [Signal to Interference Ratio] or other wireless path parameters taking into account channel quality metrics, e.g. SIR, SNR, CIR, Eb/lo
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W52/00Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/04TPC
    • H04W52/18TPC being performed according to specific parameters
    • H04W52/24TPC being performed according to specific parameters using SIR [Signal to Interference Ratio] or other wireless path parameters
    • H04W52/243TPC being performed according to specific parameters using SIR [Signal to Interference Ratio] or other wireless path parameters taking into account interferences
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W52/00Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/04TPC
    • H04W52/18TPC being performed according to specific parameters
    • H04W52/28TPC being performed according to specific parameters using user profile, e.g. mobile speed, priority or network state, e.g. standby, idle or non transmission
    • H04W52/282TPC being performed according to specific parameters using user profile, e.g. mobile speed, priority or network state, e.g. standby, idle or non transmission taking into account the speed of the mobile
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W52/00Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/04TPC
    • H04W52/30TPC using constraints in the total amount of available transmission power
    • H04W52/36TPC using constraints in the total amount of available transmission power with a discrete range or set of values, e.g. step size, ramping or offsets
    • H04W52/367Power values between minimum and maximum limits, e.g. dynamic range

Landscapes

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

Abstract

The invention relates to a power control method of a MISO-NOMA uplink channel, which comprises the following steps: step 1: establishing an uplink transmission scene containing intra-group and inter-group interference in the MISO-NOMA system; step 2: the base station performs equalization processing on the received signals; and step 3: an uplink NOMA user grouping scheme based on K-means is formulated; and 4, step 4: after NOMA user grouping is completed, a user demodulation sequence capable of minimizing the transmission power and the minimum uplink transmission power is given by considering the minimum uplink transmission power closed-form solution of users in a group constrained by the minimum data rate; and 5: carrying out user demodulation in the same NOMA transmission group by using SIC; step 6: after the minimum transmitting power of the users in the group and the user demodulation sequence are obtained, the iterative power control method for calculating the inter-group power based on the strength of inter-group interference realizes the minimization of the total transmitting power of the system under the condition of determining the NOMA transmission group.

Description

Power control method of MISO-NOMA uplink channel
Technical Field
The invention belongs to the technical field of wireless communication, and particularly relates to a power control method of a MISO-NOMA uplink channel.
Background
In the current wireless network development, the contradiction between the massive access requirements and the limited spectrum resources is more and more prominent. How to support large-scale access requirements with limited resources has become an urgent problem to be solved in mobile communication networks. On the other hand, a more reasonable resource control method needs to be designed to reduce the energy consumption of the wireless network. As shown in fig. 1 and fig. 2, a Non-Orthogonal Multiple Access (NOMA) technique of power multiplexing is adopted, and by transmitting end multi-user superposition transmission and receiving end Serial Interference Cancellation (SIC), multiplexing of time-frequency resources can be realized to meet the requirement of large-scale wireless Access. In addition, a large-scale Multiple-Input Multiple-Output (MIMO) technology introduces wider spatial freedom through the deployment of a large number of antennas, reduces inter-user interference, and further improves the utilization efficiency of frequency spectrum resources, the system capacity and the signal transmission reliability. Therefore, it is an effective means to support access to a large number of users in the uplink communication link by using an access technology combining massive MIMO with NOMA and realizing efficient utilization of time-frequency resources.
The NOMA technology realizes multi-user superposition transmission, which effectively improves the utilization rate of wireless resources, but simultaneously causes the increase of interference in the NOMA system. The level of interference limits the performance of the overall system. Power control is an effective way to solve the problem of interference in NOMA systems. Meanwhile, through reasonable adjustment of the transmission power of the user equipment, when the user signals using the wireless resources on the same time-frequency reach the receiver, a remarkable power difference can be formed. Furthermore, the receiver can demodulate different user signals one by a Successive Interference Cancellation (SIC) method, thereby implementing multi-user detection. Therefore, the reasonable power control in the NOMA system can realize the effective multiplexing of radio resources and the reliable demodulation of a plurality of user signals.
The invention provides an uplink transmission power control technology of a MISO-NOMA system aiming at the application requirements of a future wireless network and aiming at improving the user access quantity and reducing the energy consumption. Unlike the prior art, the present invention considers both intra-group interference and inter-group interference. First, a user grouping scheme capable of reducing inter-group interference is proposed using antenna correlation characteristics of the MIMO system. Secondly, an iterative NOMA transmission group power control algorithm is provided, so that the minimization of the total transmission power of the system based on the user grouping result is realized, and the total power consumption of the system is reduced.
Disclosure of Invention
In most existing researches related to uplink resource optimization of the MISO-NOMA system, the transmission rate under the condition of maximizing unit energy consumption is generally considered, and the minimum transmission rate requirement of a user is ignored. In practice, especially under a massive uplink access scenario oriented to future mobile communication, how to reduce energy consumption as much as possible while meeting a user rate requirement is still a problem to be solved urgently. Secondly, in a multi-user NOMA system, a user is interfered by not only other users in the same NOMA transmission group (referred to as intra-group interference for short), but also users in other NOMA transmission groups (referred to as inter-group interference for short). Most of the current studies only consider reducing intra-group interference, and neglect the study of inter-group interference suppression methods. Research shows that inter-group interference has certain influence on user power control, which results in limited performance improvement of uplink transmission.
Aiming at the defects in the prior art, the invention aims to provide a power control method of an MISO-NOMA uplink channel.
In order to achieve the purpose, the invention adopts the technical scheme that:
a power control method of MISO-NOMA uplink channel includes the following steps:
step 1: establishing an uplink transmission scene of the MISO-NOMA system to obtain a signal y received by the base station;
and 2, step: the base station performs equalization processing on the received signal y through maximum ratio combination, optimizes a user grouping mode in order to reduce the interference among groups, reduces the correlation degree among channel vectors of different groups of users, and obtains
Figure BDA0003226537100000021
Figure BDA0003226537100000022
Indicating the ith group to be demodulatedThe sum of the inter-group interference plus noise experienced by the user;
and step 3: an uplink NOMA user grouping scheme based on K-means is formulated, and NOMA user grouping is completed;
and 4, step 4: obtaining a minimum uplink transmitting power closed-form solution required by any user i in the group by considering the minimum data rate constraint of the users in the group;
and 5: obtaining an optimal demodulation sequence, and demodulating users in the same NOMA transmission group by adopting serial interference elimination;
step 6: after the minimum uplink transmission power and the optimal demodulation sequence required by any user i are obtained, the iterative power control method for calculating the inter-group power based on the strength of inter-group interference realizes the minimization of the total transmission power of the system under the condition of determining the NOMA transmission group.
On the basis of the scheme, the step 1 specifically comprises the following steps:
step 1.1: establishing an uplink transmission scene of a single-cell MISO-NOMA system, wherein a base station simultaneously provides service for K users, K represents user serial number, K =1,2, \8230, K is provided with N antennas, N represents antenna serial number of the base station, N =1,2, \8230, N is provided with one antenna for each user, and assuming that all users in a cell are divided into L NOMA transmission groups, L represents serial number of the NOMA transmission group, L =1,2, \8230, L is less than N; defining a correlation matrix G with the size of K multiplied by K, which is used for expressing the correlation of channel vectors between a base station and K users;
step 1.2: performing Cholesky decomposition on the correlation matrix G to obtain:
Figure BDA0003226537100000023
wherein,
Figure BDA0003226537100000024
representing a conjugate transpose for a triangular matrix obtained after Cholesky decomposition;
establishing a channel matrix H, H = [ H ] between a base station and a user 1 ,h 2 ,…,h K ] T The size is K N, H is expressed as:
Figure BDA0003226537100000031
wherein, V is a matrix with the size of K multiplied by N, and comprises wireless channel vectors between K users and N base station antennas;
the channel vectors corresponding to different users are independent of each other, and each element V in the matrix V k,n Can be decomposed into path loss beta k,n And small scale fading ξ k,n Where k and n are subscripts of the element in the matrix V, in particular V k,n Expressed as:
Figure BDA0003226537100000032
due to the close distance between different base station antennas, the path loss beta experienced by the signal of the same user reaching different base station antennas can be considered k,n Equal, small scale fading ξ k,n Are independently and identically distributed;
the correlation matrix G is a symmetric matrix satisfying:
Figure BDA0003226537100000033
wherein for the element g of the ith row and the jth column in the matrix i,j And element g of jth row and ith column j,i Has g i,j =g j,i And when i = j, g i,j =1。
Each element G of the correlation matrix G i,j The correlation between the channels of the user i and the user j is represented, and is calculated by an equation (5):
Figure BDA0003226537100000034
wherein (x) i ,y i ) And (x) j ,y j ) The representation being the position coordinates of two users, λ c Denotes the correlation distance, λ c The smaller the value of (c), the stronger the correlation between users in the cell.
The radio channel vector between the base station and the kth user is represented as:
h k =[h k,1 ,h k,2 ,...,h k,n ,...h k,N ] T (6)
wherein the base station is provided with N antennas, so that h is used k,n Corresponding to a channel vector between the kth user and the nth antenna of the base station;
let p be k Representing the uplink transmit power, s, of the k-th user k Is the complex value data symbol sent by the kth user, z is the complex value vector of nx 1, representing additive white gaussian noise, the signal received by the base station is:
Figure BDA0003226537100000041
on the basis of the scheme, the step 2 specifically comprises the following steps:
step 2.1: the base station performs equalization of signals through maximum ratio combining, and an equalization matrix is expressed as:
W=H * (8)
wherein, H is a channel matrix between the base station and the user;
the signal after maximum ratio combining equalization is expressed as:
Figure BDA0003226537100000042
wherein, the integral and the | | respectively represent the conjugate transpose and the vector norm; n is the number of antennas of the base station,
Figure BDA0003226537100000043
is a channel vector h k The conjugate transpose of (1); y isA signal received by a base station;
Figure BDA0003226537100000044
is the k-th user signal weighted by a real-valued factor, where p k Is the uplink transmit power, h, of the kth user k Is a wireless channel vector between the base station and the kth user; s is k A complex-valued data symbol transmitted for the kth user;
Figure BDA0003226537100000045
including intra-group interference and inter-group interference, k' is a subscript index indicating users other than the k-th user;
Figure BDA0003226537100000046
is the noise component after equalization, z is additive white gaussian noise;
step 2.2: in order to reduce the inter-group interference, it is necessary to optimize the user grouping method and reduce the correlation between the channel vectors of different groups of users, assuming that there is M in the ith group l Individual users, defining a vector pi l =[π l (1),π l (2),…,π l (M l )]For the base station demodulation order of the user signals of the l-th group, where l (i) Denotes an index of the i-th demodulated user when demodulating the l-th group of user signals of the signal by using the SIC.
Step 2.3: the base station firstly demodulates the subscript pi in the first group l (1) To pi l (i-1), then removing these signal components from the received signal, and then demodulating the signal indexed by π l (i) When the index in the l-th group is pi l (i + 1) to π l (M l ) Is an interference component.
Use of
Figure BDA0003226537100000047
Represents the sum of the intergroup interference plus noise experienced by the ith demodulated user in the ith group:
Figure BDA0003226537100000051
wherein M is l' The number of users in the l' th group;
Figure BDA0003226537100000052
the uplink transmission power of the kth user in the ith user group is obtained;
Figure BDA0003226537100000053
the conjugate transpose of the channel vector for the ith demodulation user in the ith group;
Figure BDA0003226537100000054
channel vectors for the kth 'demodulated user in the l' user group;
Figure BDA0003226537100000055
for the index in the ith user group of pi l (i) The noise received by the user; and N is the number of antennas of the base station.
On the basis of the scheme, the step 3 specifically comprises the following steps:
step 3.1: based on the optimal grouping number of SUS and the selection algorithm of the clustering center, the optimal grouping number L and the initial clustering center C corresponding to each group are calculated 0
Step 3.2: and sequentially calculating the distance between each user to be grouped and each group of initial clustering centers, dividing the users into L groups, updating the clustering centers, and regrouping until the clustering centers are not changed any more.
On the basis of the above scheme, step 3.1 specifically includes:
the SUS-based optimal grouping number and clustering center selection algorithm specifically comprises the following steps:
step 3.1.1: according to the user channel matrix H = [ H = 1 ,h 2 ,…,h K ] T Setting a semi-orthogonality factor alpha, wherein alpha is a constant between 0 and 1 and represents orthogonality among users;
step 3.1.2: initializing a candidate user set gamma, gamma = {1, \8230;, K }, wherein the candidate user set gamma represents all users which are not selected into the cluster center set, and making the cluster center set C as an empty set, the optimal grouping number L equal to 1 and the iteration index i equal to 1.
Step 3.1.3: calculating a projection vector of each user k in the candidate user set gamma to a null space of a selected clustering center, wherein the projection vector of the user k to the null space of the selected clustering center is expressed as:
Figure BDA0003226537100000056
wherein h is k Representing a radio channel vector between the base station and the kth user;
step 3.1.4: performing N iterations, traversing the candidate user set in each iteration, and calculating g of each user k And according to g k The maximum principle identifies the index of the cluster center:
Figure BDA0003226537100000057
wherein,
Figure BDA0003226537100000058
selecting subscript index corresponding to the clustering center;
step 3.1.5: updating a clustering center set S:
Figure BDA0003226537100000061
step 3.1.6: updating the candidate user set according to the semi-orthogonality of the users in the candidate user set gamma and the clustering center set S so as to ensure that the users in the candidate user set are semi-orthogonal to the clustering center set, wherein the semi-orthogonality is determined by alpha:
Figure BDA0003226537100000062
users which do not meet the semi-orthogonal requirement in the candidate user set gamma are directly discarded;
step 3.1.7: updating the optimal group number sum and the iteration index obtained by the current iteration round number, L ← L +1, i ← i + 1';
step 3.1.8: repeating the step 3.1.3-3.1.7 until the current iteration index value i is more than or equal to N or the candidate user set is an empty set;
step 3.1.9: finally, the initial clustering center C is obtained 0
Figure BDA0003226537100000063
And an optimal number of packets L.
On the basis of the above scheme, step 3.2 specifically includes:
step 3.2.1: according to the user channel matrix H = [ H = 1 ,h 2 ,…,h K ] T Setting a weight factor epsilon and a balance factor lambda; the weight factor epsilon is a weighted value of each distance item in the total distance weight calculated in the grouping process, and the balance factor lambda is a penalty value for balancing the distance between a certain group and a user when the group of users is excessive.
Step 3.2.2: initializing cluster center set C 0 Make the cluster center set C 0 Is an empty set, and makes a packet matrix mu = mu 1 ∪μ 2 …∪μ L T =0, the current iteration round number t is 0;
step 3.2.3: obtaining the initial clustering center calculation C obtained in the step 3.1.9 0 And the optimal number of packets L;
step 3.2.4: traversing each user in the candidate user set, and calculating the similarity between the user and each cluster center channel vector and the minimum channel gain difference between the user and each group;
using two channel vectors h i And h j By the cosine of (c) h i And h j The correlation of (a):
Figure BDA0003226537100000064
where | represents the modulus of the complex number and | represents the norm of the vector.
The squared difference of the normalized channel vectors is used to measure the channel gain difference between users, and the minimum gain difference within a group is used to measure the channel gain difference between user i and the l-th group:
Figure BDA0003226537100000065
wherein, let | h max | | is the largest channel gain value among the cell users,
Figure BDA0003226537100000071
and
Figure BDA0003226537100000072
respectively normalizing the energy of the channel vectors corresponding to the ith and ith' users; omega l A subscript set for users included in the l-th group;
step 3.2.5: on the basis of the formula (14) and the formula (15), in consideration of the grouping balance, a distance function is established for calculating the distance Dist from each user k to the l-th group k,l As shown in equation (16):
Figure BDA0003226537100000073
wherein ε ∈ (0, 1) represents a weighting factor, when the total number of users in the l-th group M l When the distance between the subsequent ungrouped user and the cluster center of the group is calculated when a certain threshold value is exceeded, adding a balance factor lambda, wherein lambda > 1; the distance between the subsequent users and the group is increased, and the possibility that the group is divided into more users is reduced, so that the number of users in different groups is balanced;
step 3.2.6: the group to which the user k belongs is selected,
Figure BDA0003226537100000074
wherein
Figure BDA0003226537100000075
Represents the index of the grouping closest to user k;
step 3.2.7: after the t-th round of clustering, the cluster center of each group is updated by equation (17):
Figure BDA0003226537100000076
wherein M is l The number of users in the ith group is represented, and j represents the index of the subscript of other users except i in the ith group.
Step 3.2.8: update iteration index value, t ← t +1.
Step 3.2.9: repeating the steps 3.2.3-3.2.8, updating the users in the group until new C t No change occurs;
step 3.2.10: and outputting the user grouping matrix mu.
On the basis of the above scheme, step 4 specifically includes:
step 4.1: assuming that there are M users in a group, given a demodulation order π l =[π l (1),π l (2),…,π l (M)]Assuming that the data rate constraints of all users in the ith group are equal and satisfy the minimum data rate constraint r:
Figure BDA0003226537100000077
wherein,
Figure BDA0003226537100000081
the achievable data rate for the ith demodulated user in the ith group;
defining the target signal to interference plus noise ratio requirement needed to be met by a user to meet the minimum data rate constraint r as gamma:
Figure BDA0003226537100000082
wherein r is a minimum data rate constraint and W is a system bandwidth;
and calculating the minimum uplink transmission power sum in the group through analysis and derivation based on the minimum data rate constraint r.
Step 4.2: analysing last demodulated user pi l (M) the minimum data rate constraint to be satisfied is:
Figure BDA0003226537100000083
wherein,
Figure BDA0003226537100000084
are respectively the pi-th group l The sum of the (M) demodulated users' uplink transmit power, channel vector, and inter-group interference plus noise.
Obviously, the user power will be minimized when the constraint in equation (21) reaches the equality condition, so that
Figure BDA0003226537100000085
Denotes the pi-th group in the l-th group l The minimum uplink transmitting power of (M) demodulation users is obtained:
Figure BDA0003226537100000086
wherein, gamma is the target signal-to-interference-and-noise ratio requirement, N is the number of antennas of the base station, l, pi l (M) is the index of the mth demodulation user of the ith group after grouping,
Figure BDA0003226537100000087
respectively represent the ith group pi l (M) channel vectors of demodulated users and inter-group interference plus noise sums,
Figure BDA0003226537100000088
is a constant related to the target sir requirement, the number of antennas at the base station and the user channels in the group.
Step 4.3: solving in the same way
Figure BDA0003226537100000089
And will beSubstituting the formula (22) to obtain the minimum uplink transmission power of the M-1 user as:
Figure BDA00032265371000000810
step 4.4: the process is repeated continuously, and according to the calculation result, the minimum uplink transmission power required by any user i is obtained, as follows:
Figure BDA0003226537100000091
wherein,
Figure BDA0003226537100000092
channels of users corresponding to respective demodulation orders
Figure BDA00032265371000000914
Figure BDA0003226537100000093
And conjugate transpose thereof
Figure BDA0003226537100000094
And a constant related to the target SINR signal-to-interference-and-noise ratio gamma, k represents the index of the first j-1 demodulation orders, and k' is the order of the 1 st to the kth demodulation.
On the basis of the above scheme, step 5 specifically includes:
after the minimum uplink transmission power in each group is obtained, the optimal demodulation sequence of the users in the group is given
Figure BDA0003226537100000095
In comparison to other demodulation sequences,
Figure BDA0003226537100000096
lower power consumption values can be achieved.
For an arbitrary NOMA transmission group, it is assumed that all users within the group have the same purposeMarking data rate, order
Figure BDA0003226537100000097
Indicating the user demodulation order. If and only if the user satisfies
Figure BDA0003226537100000098
The sum of the transmission powers of the groups is minimal, i.e. the demodulation order is then the case, when the users with higher interference demodulate first
Figure BDA0003226537100000099
For an optimal demodulation order.
On the basis of the above scheme, step 6 specifically includes:
step 6.1: according to the user channel matrix H = [ H = 1 ,h 2 ,…,h K ] T And the number of users K, the number of antennas N, and the minimum data rate constraint r for the users.
Step 6.2: initializing power sum vectors q for groups 0 Power vector p for each user 0 The maximum iteration number maxter of the algorithm, and the current iteration round number t.
Step 6.3: in each iteration, sequentially traversing the users of each group to obtain the number M of users of the first group l And obtaining the optimal demodulation sequence obtained in step 5
Figure BDA00032265371000000910
Step 6.4: from the last demodulation, i.e. Mth l The demodulation users start to calculate in sequence, firstly obtaining
Figure BDA00032265371000000911
And
Figure BDA00032265371000000912
wherein
Figure BDA00032265371000000913
Is in the optimal demodulation order
Figure BDA0003226537100000101
Next, index of current ith demodulation user in current ith group,
Figure BDA0003226537100000102
is the index of the j demodulation user that demodulates thereafter.
Step 6.5: calculating the current NOMA transmission group of all users according to formula (27)
Figure BDA0003226537100000103
And
Figure BDA0003226537100000104
wherein,
Figure BDA0003226537100000105
represents the sum of the intergroup interference plus noise of the current ith group of demodulated users,
Figure BDA0003226537100000106
represents the sum of intergroup interference plus noise of the j-th demodulated user demodulated after i;
Figure BDA0003226537100000107
wherein,
Figure BDA0003226537100000108
is a constant related to the target sir requirement, the number of antennas at the base station and the user channels in the group.
Figure BDA0003226537100000109
Channels of users corresponding to respective demodulation orders
Figure BDA00032265371000001010
Figure BDA00032265371000001011
And together therewithYoke transpose
Figure BDA00032265371000001012
And a constant related to the target SINR signal-to-interference-and-noise ratio gamma, wherein k represents the index of the first j-1 demodulation sequences, and k' is the sequence from 1 st to k th demodulation;
Figure BDA00032265371000001013
and
Figure BDA00032265371000001014
is the sum of the interference plus noise between the current ith group of demodulated users and the jth user demodulated thereafter, and the value of the sum is equal to the power q of other groups -l And (6) correlating.
Step 6.6: further, in the current iteration round number, the minimum transmitting power sum q of the l group in the t +1 round iteration is calculated according to the formula (28) l (t+1)
Figure BDA00032265371000001015
Wherein q is l (t+1) Refers to the minimum sum of transmit power, M, of the l-th group in the t +1 th iteration l Indicating the number of users of the group.
Step 6.7: sequentially calculating the minimum uplink transmitting power of each user i in the ith group in the t +1 th iteration according to a formula (29)
Figure BDA00032265371000001016
Figure BDA00032265371000001017
Wherein,
Figure BDA0003226537100000111
represents the minimum uplink transmission power of the ith demodulated user in the ith group in the t +1 round iteration,
Figure BDA0003226537100000112
is a constant related to the target sir requirement, the number of antennas in the bs and the user channels in the group.
Step 6.8: update the iteration index value, t ← t +1.
Step 6.9: and 6.3-6.8, and updating the power value of each group and each user in the group until t = MaxIter.
Step 6.10: outputting power sum vector of each group
Figure BDA0003226537100000113
And minimum uplink transmission power vector of each user
Figure BDA0003226537100000114
The invention has the beneficial effects that:
1. the invention considers the interference between groups when carrying out user grouping and power control in the groups, and can achieve better power consumption and energy efficiency compared with the traditional scheme;
2. the two-step power control scheme provided by the invention solves the problem of non-convex NOMA power control which is difficult to solve by the traditional mathematical method.
3. The grouping iteration power optimization algorithm provided by the invention realizes the minimization of the system power under the condition of considering the interference.
4. The invention can achieve the effect close to the optimal effect under the lower complexity cost.
Drawings
The invention has the following drawings:
fig. 1 is a schematic diagram of the transmission process of user signals in a transmission group in a MISO-NOMA system.
Fig. 2 is a schematic diagram of a NOMA packet SIC process at a receiving end of a base station.
Fig. 3 is a schematic diagram of a multi-user upstream NOMA system with multiple groups.
Fig. 4 is a schematic diagram of a power consumption variation curve of each method under different user numbers, wherein r =5Mbits/s.
Fig. 5 is a schematic diagram of an energy efficiency change curve of each method under different user numbers, wherein r =5Mbits/s.
Fig. 6 is a schematic diagram of a variation curve of the outage probability under different data rate constraints of the methods, where K =10.
Detailed Description
The present invention will be described in further detail with reference to FIGS. 3 to 6.
A power control method of MISO-NOMA uplink channel includes the following steps:
step 1: uplink transmission scene for establishing MISO-NOMA system
Step 1.1: consider the uplink transmission scenario of a single cell MISO-NOMA system, as shown in fig. 3. The base station provides service for K users simultaneously, wherein K represents the serial number of the user, K =1,2, \ 8230, K, the base station is provided with N antennas, N represents the serial number of the antenna of the base station, N =1,2, \ 8230, N, each user is provided with one antenna, all users in a cell are assumed to be divided into L NOMA transmission groups, L represents the serial number of the NOMA transmission group, and L =1,2, \ 8230, L is less than N; defining a correlation matrix G with the size of K multiplied by K, which is used for expressing the correlation of channel vectors between a base station and K users;
step 1.2: performing Cholesky decomposition on the correlation matrix G to obtain:
Figure BDA0003226537100000121
wherein,
Figure BDA0003226537100000122
for the triangular matrix obtained after Cholesky decomposition, the conjugate transpose of the matrix is represented.
Establishing a channel matrix H, H = [ H ] between a base station and a user 1 ,h 2 ,…,h K ] T The size is K N, H is expressed as:
Figure BDA0003226537100000123
wherein, V is a matrix with the size of K multiplied by N, and comprises wireless channel vectors between K users and N base station antennas;
the channel vectors corresponding to different users are independent of each other, and each element V in the matrix V k,n Can be decomposed into path loss beta k,n And small scale fading ξ k,n Where k and n are subscripts of the element in the matrix V. In particular, v k,n Expressed as:
Figure BDA0003226537100000124
due to the close distance between different base station antennas, the path loss beta experienced by the signal of the same user reaching different base station antennas can be considered k,n Equal, small scale fading ξ k,n Are independently and identically distributed;
the correlation matrix G is a symmetric matrix satisfying:
Figure BDA0003226537100000125
wherein, for the element g of the ith row and the jth column in the matrix i,j And element g of jth row and ith column j,i Has g i,j =g j,i And when i = j, g i,j =1。
Each element G in the correlation matrix G i,j The correlation between the channels of the user i and the user j is represented, and the correlation between the channels of the user i and the user j is calculated by an equation (5):
Figure BDA0003226537100000131
wherein (x) i ,y i ) And (x) j ,y j ) The representation being the position coordinates of two users, λ c Denotes the correlation distance, λ c The smaller the value of (c), the stronger the correlation between users in the cell.
The radio channel vector between the base station and the kth user is represented as:
h k =[h k,1 ,h k,2 ,...,h k,n ,...h k,N ] T (6)
wherein the base station is provided with N antennas, so that h is used k,n Corresponding to the channel vector from the kth user to the nth antenna of the base station.
Let p be k Represents the uplink transmit power, s, of the kth user k Is the complex value data symbol sent by the kth user, z is the complex value vector of nx 1, representing additive white gaussian noise, the signal received by the base station is:
Figure BDA0003226537100000132
and 2, step: NOMA signal equalization
And (2) establishing an uplink transmission scene of the MISO-NOMA system based on the step 1, and carrying out equalization processing on the received signals by the base station.
Step 2.1: the base station performs equalization of signals by Maximum Ratio Combining (MRC), and the equalization matrix is expressed as:
W=H * (8)
wherein H is a channel matrix between the base station and the user.
Under the condition of existing channel estimation, the base station utilizes the equalization method to realize the enhancement of a target signal and the weakening of an interference signal.
The signal after this Maximum Ratio Combining (MRC) equalization is expressed as:
Figure BDA0003226537100000133
wherein, the x and | | | | respectively represent the conjugate transpose and the vector norm; n is the number of antennas of the base station,
Figure BDA0003226537100000134
for the channel vector h k The conjugate transpose of (1); y is a signal received by the base station;
Figure BDA0003226537100000135
is a k-th user signal weighted by a real-valued factor, where p k Is the uplink transmit power, h, of the kth user k A wireless channel vector between the base station and the k user; s k Complex-valued data symbols sent for the kth user;
Figure BDA0003226537100000136
including intra-group interference and inter-group interference, k' is a subscript index representing users other than the k-th user;
Figure BDA0003226537100000141
is the noise component after equalization and z is additive white gaussian noise.
The maximum ratio combination can utilize the advantages of large-scale antennas, realize better balance performance under lower complexity, effectively reduce interference among users and improve the uplink transmission quality of user signals. By controlling the uplink transmit power of different users in a group, the interference between groups can be eliminated by the successive interference.
Step 2.2: in order to reduce the inter-group interference, it is necessary to optimize the user grouping method and reduce the correlation between the channel vectors of different groups of users. Suppose there is M in the first group l A user, defining a vector pi l =[π l (1),π l (2),…,π l (M l )]For the base station to the order of demodulation of the user signals of the l-th group, where l (i) Subscript indicating the i-th demodulated user when the l-th group of user signals of the signal is demodulated by using the SIC.
Step 2.3: the base station firstly demodulates the subscript pi in the first group l (1) To pi l (i-1) and then removing these signal components from the received signal and demodulating the signal indexed by π l (i) When the index in the l-th group is pi l (i + 1) to π l (M l ) Is an interference component.
Use of
Figure BDA0003226537100000142
Represents the sum of the intergroup interference plus noise experienced by the ith demodulated user in the ith group:
Figure BDA0003226537100000143
wherein, M l' Is the number of users in the l' group;
Figure BDA0003226537100000144
the uplink transmission power of the kth user in the ith user group is obtained;
Figure BDA0003226537100000145
the conjugate transpose of the channel vector for the ith demodulation user in the ith group;
Figure BDA0003226537100000146
channel vectors for the kth 'demodulated user in the l' user group;
Figure BDA0003226537100000147
for the index in the ith user group of pi l (i) The noise received by the user; and N is the number of antennas of the base station.
And 3, step 3: NOMA user grouping method
In the uplink transmission process of users, it needs to determine which users reuse radio resources on the same time-frequency through grouping, i.e. belong to the same NOMA transmission group. Proper grouping can reduce inter-user interference and further save the total power consumption of the system.
The invention provides an uplink NOMA user grouping scheme based on K-means, which realizes effective grouping by utilizing the antenna correlation characteristic of a large-scale MIMO system and considering the channel difference characteristic among users in NOMA grouping.
The user grouping method comprises the following steps:
step 3.1: based on the optimal grouping number of SUS and the selection algorithm of the clustering center, the optimal grouping number L and the initial value corresponding to each group are calculatedClustering center C 0
Step 3.2: and sequentially calculating the distance between each user to be grouped and each group of initial clustering centers (the calculation mode of the distance will be described in detail later), dividing the users into L groups, updating the clustering centers, and regrouping until the clustering centers are not changed any more.
The core of the above steps is the calculation of each group of corresponding initial clustering centers in step 3.1 and the calculation of each user to be grouped and each group of clustering centers C in step 3.2 0 The distance of (2) is calculated.
The two core methods described above will be described next.
First, the present invention designs a method for identifying an optimal packet number L and an initial clustering center C using a Semi-Orthogonal User Selection (SUS) algorithm 0 The improvement of (1).
When the optimal number of packets L is designed, the too small number of packets may increase the demodulation interference signals associated with users in the group, which brings more challenges to the interference cancellation mechanism of the SIC. On the contrary, if the optimal number L of packets is too large, more interference will be generated between the transmission groups, which will affect the overall performance of the system. An appropriate optimal number L of packets should be as small as possible while at the same time distributing the least relevant users in different groups. If the initial clustering center can reflect this characteristic of the transport group, convergence of the grouping algorithm can be accelerated. The SUS algorithm can select users with better channel states and semi-orthogonal to each other by using the channel orthogonality degree between users, that is, the algorithm can calculate and find the least relevant user set in the group.
From this angle, an SUS algorithm is introduced to effectively find out the number of users that are least correlated in the group, that is, the optimal number of packets, and further determine an initial clustering center, thereby realizing effective grouping (capable of suppressing inter-group interference and reducing transmission power in subsequent power control).
The grouping characteristic of the NOMA transmission group and the channel characteristic of large-scale MIMO are fully utilized, the problem that K-means is sensitive to an initial clustering center is solved, and clustering convergence is accelerated.
The SUS-based optimal grouping number and clustering center selection algorithm specifically comprises the following steps:
step 3.1.1: according to the user channel matrix H = [ H = 1 ,h 2 ,…,h K ] T Setting a semi-orthogonality factor alpha, wherein alpha is a constant between 0 and 1 and represents orthogonality among users;
step 3.1.2: initializing a candidate user set gamma, gamma = {1, \8230;, K }, wherein the candidate user set gamma represents all users which are not selected into the cluster center set, the cluster center set C is made to be an empty set, the optimal grouping number L is equal to 1, and the iteration index i is equal to 1.
Step 3.1.3: calculating a projection vector of each user k to a selected clustering center null space in a candidate user set gamma, wherein the projection vector of the user k to the selected clustering center null space is expressed as:
Figure BDA0003226537100000151
wherein h is k Representing the radio channel vector between the base station and the k-th user.
Step 3.1.4: performing N iterations, traversing the candidate user set in each iteration, and calculating g of each user k And according to g k The maximum principle identifies the index of the cluster center:
Figure BDA0003226537100000152
wherein,
Figure BDA0003226537100000153
selecting subscript index corresponding to the clustering center;
step 3.1.5: updating a clustering center set S:
Figure BDA0003226537100000161
step 3.1.6: updating the candidate user set according to the semi-orthogonality of the users in the candidate user set gamma and the clustering center set S so as to ensure that the users in the candidate user set are semi-orthogonal to the clustering center set, wherein the semi-orthogonality is determined by alpha:
Figure BDA0003226537100000162
for the users which do not meet the semi-orthogonal requirement in the candidate user set gamma, the base station does not need to calculate the users in the subsequent iteration process, so the users can be directly abandoned in the updating step, and the complexity of the algorithm is reduced;
step 3.1.7: updating the optimal group number and the iteration index obtained by the current iteration round number, L ← L +1, i ← i +1;
step 3.1.8: repeating the step 3.1.3-3.1.7 until the current iteration index value i is more than or equal to N or the candidate user set is an empty set;
step 3.1.9: finally, the initial clustering center C is obtained 0
Figure BDA0003226537100000163
And an optimal number of packets L.
Figure BDA0003226537100000164
The algorithm effectively utilizes the diversity gain of multiple users, selects the clustering center with good channel quality and certain orthogonality, reduces the user interference among groups, and also improves the efficiency of subsequent user grouping.
Secondly, the invention provides a user grouping algorithm based on improved K-means, and the interference intensity after MRC equalization is reduced by reducing the channel correlation among different groups of users. The method specifically comprises the following steps:
step 3.2.1: according to the user channel matrix H = [ H = 1 ,h 2 ,…,h K ] T Setting a weight factor epsilon and a balance factor lambda; the weighting factor epsilon is the weight of the total distance weight calculated for each distance term during the grouping process,the balance factor λ is a penalty value for balancing the group-to-user distance when there are too many users in a group.
Step 3.2.2: initializing cluster center set C 0 Make the cluster center set C 0 Is empty set and makes grouping matrix mu = mu 1 ∪μ 2 …∪μ L T =0, the current iteration round number t is 0;
step 3.2.3: obtaining the initial clustering center calculation C obtained in the step 3.1.9 0 And the optimal number of packets L;
step 3.2.4: traversing each user in the candidate user set, and calculating the similarity of the user and each cluster center channel vector and the minimum channel gain difference of the user and each group;
more precisely, two channel vectors h are used i And h j By the cosine of (c) h i And h j The correlation of (c):
Figure BDA0003226537100000171
where | represents the modulus of the complex number and | represents the norm of the vector.
The squared difference of the normalized channel vectors is used to measure the channel gain difference between users, and the minimum gain difference within a group is used to measure the channel gain difference between user i and the l-th group:
Figure BDA0003226537100000172
wherein, let | h max | | is the largest channel gain value among the cell users,
Figure BDA0003226537100000173
and
Figure BDA0003226537100000174
respectively normalizing the energy of the channel vectors corresponding to the ith and ith' users; omega l Set of subscripts for users included in group I;
Step 3.2.5: on the basis of the formula (14) and the formula (15), a distance function is proposed for calculating the distance Dist from each user k to the l-th group in consideration of the group balance k,l As shown in equation (16):
Figure BDA0003226537100000175
wherein ε ∈ (0, 1) represents the weight factor, when the total number of users in the l-th group M l Above a certain threshold, e.g., 2K/L, a balancing factor λ is added when calculating the distance between the subsequent ungrouped users and the cluster center of the group, where λ > 1. The distance between the subsequent users and the group is increased, namely the possibility that the group is divided into more users is reduced, so that the number of users in different groups is balanced;
step 3.2.6: the group to which the user k belongs is selected,
Figure BDA0003226537100000181
wherein
Figure BDA0003226537100000182
Represents the index of the grouping closest to user k;
step 3.2.7: after the t-th round of clustering, the cluster center of each group is updated by formula (17):
Figure BDA0003226537100000183
wherein M is l The number of users in the ith group is represented, and j represents the index of the subscript of other users except i in the ith group.
Step 3.2.8: update the iteration index value, t ← t +1.
Step 3.2.9: repeating the steps 3.2.3-3.2.8, and updating the users in the group until the new C t No change occurs;
step 3.2.10: and outputting the user grouping matrix mu.
Figure BDA0003226537100000184
And 4, step 4: intra-group power control
After user grouping is completed, the invention provides a minimum uplink transmission power closed-form solution of users in a group considering minimum data rate constraint.
Step 4.1: taking an arbitrary group l in a cell as an example, assuming that there are M users in the group, a demodulation order pi is given l =[π l (1),π l (2),…,π l (M)]Assuming that the data rate constraints of all users in the ith group are equal and satisfy the minimum data rate constraint r:
Figure BDA0003226537100000191
wherein,
Figure BDA0003226537100000192
the achievable data rate for the ith demodulated user in the ith group;
to simplify the calculation, the target signal-to-interference-and-noise ratio (signal-to-interference-plus-noise ratio, SINR) requirement that the user needs to meet the minimum data rate constraint r is defined as γ:
Figure BDA0003226537100000193
wherein r is a minimum data rate constraint and W is a system bandwidth;
through analysis and derivation based on data rate constraints, the minimum uplink transmit power sum within the group can be calculated.
And 4.2: analysing the last demodulated user pi l (M) the minimum data rate constraint to be satisfied is:
Figure BDA0003226537100000194
wherein,
Figure BDA0003226537100000195
are respectively the pi-th group l The sum of uplink transmission power, channel vector, and intergroup interference plus noise of (M) demodulated users.
Obviously, the user power will be minimized when the constraint in equation (21) reaches the equality condition, so that
Figure BDA0003226537100000196
Denotes the pi-th group in the l-th group l The minimum uplink transmitting power of (M) demodulation users is obtained:
Figure BDA0003226537100000197
wherein, gamma is the target signal-to-interference-and-noise ratio requirement, N is the number of antennas of the base station, l, pi l (M) is the index of the mth demodulation user in the first group after grouping,
Figure BDA0003226537100000198
respectively represent the l-th group pi l (M) channel vectors of demodulated users and inter-group interference plus noise sums,
Figure BDA0003226537100000199
is a constant related to the target signal-to-interference-and-noise ratio requirement, the number of base station antennas and the user channels in the group.
Step 4.3: solving in the same way
Figure BDA00032265371000001910
And substituting the formula (22) to obtain the minimum uplink transmitting power of the M-1 user as follows:
Figure BDA0003226537100000201
step 4.4: the process is repeated continuously, and according to the calculation result, a general form of the minimum uplink transmission power required by any user i is derived and summarized as follows:
Figure BDA0003226537100000202
wherein,
Figure BDA0003226537100000203
channels of users corresponding to respective demodulation orders
Figure BDA00032265371000002011
Figure BDA0003226537100000204
And its conjugate transpose
Figure BDA0003226537100000205
And a constant related to the target SINR signal-to-interference-and-noise ratio gamma, k represents the index of the first j-1 demodulation orders, and k' is the order of the 1 st to the kth demodulation.
According to the theorem, the invention obtains the power and closed-form solutions of all users in the same NOMA transmission group, realizes the balance of user power control in a cell in the integral power expression, and ensures the fairness among the users.
And 5: optimal user demodulation order within a group
The present invention uses SIC to demodulate users in the same NOMA transmission group. After the minimum uplink transmitting power in each group is obtained, the optimal demodulation sequence of the users in the group is given
Figure BDA0003226537100000206
Compared with the other demodulation sequences,
Figure BDA0003226537100000207
lower power consumption values can be achieved.
For an arbitrary NOMA transmission group, it is assumed that all users in the group have the same target data rate, such that
Figure BDA0003226537100000208
Indicating the user demodulation order. If and only if the user satisfies
Figure BDA0003226537100000209
When the user with higher interference demodulates first, the sum of the transmission powers of the group is the minimum, i.e. the demodulation order at that time
Figure BDA00032265371000002010
For an optimal demodulation order.
The optimality of this demodulation sequence can be demonstrated by a counter-proof method.
Step 6: inter-group power control
On the basis of the step 4 and the step 5, the invention provides an iterative power control method for calculating the inter-group power based on the strength of the inter-group interference, which solves the problem of coupling in the solving process caused by the inter-group interference and realizes the minimization of the total transmission power of the system under the condition of a determined NOMA transmission group.
First, in the classical power control problem, the quality of service requirement of uplink transmission users can be uniformly described by the following vector inequality:
p≥I(p) (25)
where I (p) is referred to as the standard interference function, which represents the interference that the user needs to overcome. P is the minimum transmit power that a user needs to meet a particular quality of service requirement.
Further, according to this constraint, the corresponding power minimization problem can be solved by the following iterative power control algorithm:
p (t+1) =I(p (t) ) (26)
where t represents the current iteration round.
For all minimum transmit powers p ≧ 0, when the above-mentioned interference function I (p) satisfies the following three properties:
1) Nonnegativity: i (p) is not less than 0
2) Monotonicity: if p is not less than p ', I (p) > I (p')
3) Expandability: for all δ ≧ 1, δ I (p) ≧ I (δ p)
I (p) is "standard" and its corresponding power minimization problem is a standard power control problem, which can be solved by the iterative power control algorithm in equation (26).
Furthermore, if the problem has an optimal solution, the iterative power control algorithm (26) will converge to the optimal solution.
Definition of
Figure BDA0003226537100000211
Wherein each element represents each set of corresponding interference; according to the step 4, the minimum uplink transmission power sum of users in the group is calculated
Figure BDA0003226537100000212
And the optimal demodulation order given in step 5
Figure BDA0003226537100000213
Each set of interference function I l (q -l ) The expression of (a) is:
Figure BDA0003226537100000214
wherein,
Figure BDA0003226537100000215
is a constant related to the target sir requirement, the number of antennas at the base station and the user channels in the group.
Figure BDA0003226537100000216
Channels of users corresponding to respective demodulation orders
Figure BDA0003226537100000217
Figure BDA0003226537100000218
And conjugate transpose thereof
Figure BDA0003226537100000219
And a constant related to the target SINR signal-to-interference-and-noise ratio gamma, k represents the index of the first j-1 demodulation orders, and k' is the order of the 1 st to the kth demodulation;
Figure BDA00032265371000002110
and
Figure BDA00032265371000002111
is the sum of the interference plus noise between the current ith group of demodulated users and the jth user demodulated thereafter, and the value of the sum is equal to the power q of other groups -l And (4) correlating.
That is to say the interference function I l (q -l ) The minimum sum of transmit power of all users in the ith group to satisfy the minimum data rate constraint. And an interference function I is readily available l (q -l ) The three properties described above are satisfied, and therefore, we derive a "standard" interference function for each group based on the minimum transmit power sum of users in the optimal demodulation order within the group.
Furthermore, the power of each group can be solved through iteration, and the invention provides an iterative power control algorithm utilizing interference. According to the standard power control framework, given any non-null feasible power, the standard optimization problem in this region can converge to a unique optimal solution by an iterative method.
During each inter-group iteration, the transmit power sum of each target NOMA packet may be determined in turn:
Figure BDA0003226537100000221
wherein q is l (t+1) Refers to the minimum sum of transmit power, M, of the l-th group in the t +1 th iteration l Indicating the number of users of the group. The meaning of each component in the formula is the same as in formula (27).
The power of the other group l' ≠ l is fixed when calculating this group power. Determining power sum q of a group l (t+1) Then, the power of each user in the group is calculated.
Under the given constraints of demodulation sequence and data rate, the minimum uplink transmission power of a user can be uniquely determined as follows:
Figure BDA0003226537100000222
wherein,
Figure BDA0003226537100000223
represents the minimum uplink transmission power of the ith demodulated user in the ith group in the t +1 round iteration,
Figure BDA0003226537100000224
is a constant related to the target sir requirement, the number of antennas at the base station and the user channels in the group.
Through the analysis of the above power iteration strategy, the present invention summarizes the steps of the inter-group iteration power control algorithm in algorithm 3.
Step 6.1: according to the user channel matrix H = [ H = 1 ,h 2 ,…,h k ] T And the number of users K, the number of antennas N, and the minimum data rate constraint r for the users.
Step 6.2: initializing power sum vector q for each group 0 Power vector p for each user 0 The maximum iteration number maxter of the algorithm, and the current iteration round number t.
Step 6.3: in each iteration, sequentially traversing the users of each group to obtain the number M of users of the ith group l And obtaining the optimal demodulation sequence obtained in step 5
Figure BDA0003226537100000225
Step 6.4: from the last demodulation, i.e. Mth l The demodulation users start to calculate in sequence, and firstly obtain
Figure BDA0003226537100000231
And
Figure BDA0003226537100000232
wherein
Figure BDA0003226537100000233
In the optimal demodulation order
Figure BDA0003226537100000234
Next, index of current ith demodulation user in current ith group,
Figure BDA0003226537100000235
is the index of the j demodulation user that demodulates thereafter.
Step 6.5: calculating the current NOMA transmission group of all users according to formula (27)
Figure BDA0003226537100000236
And
Figure BDA0003226537100000237
wherein,
Figure BDA0003226537100000238
represents the sum of the intergroup interference plus noise of the current ith group of demodulated users,
Figure BDA0003226537100000239
represents the sum of the intergroup interference plus noise for the jth demodulated user demodulated after i.
Step 6.6: and then in the current iteration round number, calculating the minimum transmitting power sum q of the l group in the t +1 round iteration according to the formula (28) l (t+1)
Step 6.7: sequentially calculating the minimum uplink transmitting power of each user i in the l group in the t +1 round iteration according to a formula (29)
Figure BDA00032265371000002310
Step 6.8: update the iteration index value, t ← t +1.
Step 6.9: and 6.3-6.8, and updating the power value of each group and each user in the group until t = MaxIter.
Step 6.10: outputting power sum vector of each group
Figure BDA00032265371000002311
And minimum uplink transmission power vector of each user
Figure BDA00032265371000002312
The algorithm can gradually converge to a unique fixed point for each group and an optimal power value through a finite number of iterations
Figure BDA00032265371000002313
And obtaining a global optimal power value. Within the feasible region, given an arbitrary power minimization problem instance with feasible solution, and an arbitrary initial power vector q 0 Then, according to the power iteration rule given in the formula (26), all the power values can be converged to the fixed unique optimal power value
Figure BDA00032265371000002314
And the most optimization of the total power of the system is realized.
Figure BDA00032265371000002315
Figure BDA0003226537100000241
In the following, the present application demonstrates the improvement of the system performance by the above techniques by comparing the impact of different power control schemes on the power consumption, energy efficiency and outage probability of the uplink MISO-NOMA system.
Wherein, the power consumption refers to the total transmission power of all users in the system, and is expressed as:
Figure BDA0003226537100000242
wherein q is l Representing the sum of the transmit powers, mu, of the respective groups l,k Grouping strategy, p, representing the ith group of k users k And represents the uplink transmission power of the kth user.
The energy efficiency is calculated as follows:
Figure BDA0003226537100000243
wherein R is k Indicates the achievable data rate, p, of the k-th user k Representing the uplink transmission power of the kth user; the numerator represents the transmission data rate of all users in the system, and the denominator represents the total transmission power of all users in the system; the unit of energy efficiency is bits/J.
The system interrupt probability is calculated as the number of interrupt instances divided by the total number of simulation instances. And if the obtained user power consumption is larger than the maximum transmitting power, defining the user as an interrupt user. The presence of at least one interrupt user in the Monte Carlo simulation instance defines the instance as an interrupt instance.
The experimental results were obtained based on 5000 independently distributed channel instances randomly generated, with the cell radius set to 100 meters, and a total of K users evenly distributed within the cell. The system bandwidth W is 10MHz and the noise at the base station is set to-174 dBm/Hz. Fading channel models include small scale fading, distance dependent path loss and shadow fading. Specifically, small-scale fading follows a rayleigh distribution with a variance of 1; shadow fading follows a log normal model with a standard deviation of 10 dB; the path loss is 103.4+24.2log10 (d), where d is the Euclidean distance between the transmitting end and the base station.
In the simulation process, users in a cell are grouped through different schemes, and then the inter-group iterative power control algorithm provided by the invention is adopted to calculate the transmitting power based on a fixed clustering result. In the comparative experiment, the power control method proposed by the present invention was compared with a method combining user grouping and power control (hereinafter referred to as "Joint"), a Heuristic grouping method (hereinafter referred to as "heartbeat"), a Random grouping method (hereinafter referred to as "Random"), and a Non-grouped method (hereinafter referred to as "Non-clustered"), respectively.
In the Joint method, all the user grouping possibilities are traversed again in each iteration power control process to find the optimal grouping scheme until the total transmission power of the system converges to the minimum value. In the scheme, the global optimal solution can be found by the combined optimization of user grouping and power control. However, this method is extremely complicated and not practical in practice. In the Heuristic grouping method, users are firstly sequenced based on the channel gain, then the users are alternately distributed to each group based on the channel gain difference in the groups, and the sequence difference of the channel gain is formed in one NOMA group. Meanwhile, a random grouping scheme is also taken into consideration as a comparison algorithm. Meanwhile, in order to verify the effectiveness of the packet-based MISO-NOMA power control method, a comparison was also made with the Non-clustered power control method in which user grouping is not performed (each user is treated as an independent transmission group) in simulation experiments.
Fig. 4 compares the total power consumption and energy efficiency of the present invention with other methods in different user number scenarios, with the user data rate constraint set to 5Mbits/s. It can be seen that as the number of users increases, the power consumption difference between different methods increases gradually, and the method and the Joint method provided by the invention always maintain better and more stable performance than other methods when the number of users changes. In fig. 5, as the number of users increases, the energy efficiency difference between different methods gradually increases, and the method and the optimal Joint method according to the present invention achieve higher energy efficiency performance than other methods. At K =15, the proposed method can achieve 91%, 131%, and 225% energy efficiency improvements compared to the Heuristic, random, and Non-clustered methods. And achieves slightly lower performance than the method at a much lower complexity than the Joint scheme.
Fig. 6 shows the change of the outage probability under different data rate constraints for each method, and the number of users in a cell is set to 10. It can be seen that the duty cycle of the interrupt instance is almost zero when the data rate constraint is less than 5.5 Mbits/s. When the data rate constraint increases again, a user interruption begins to occur. When the data rate constraint reaches 7Mbits/s, 20% of users in the Non-shared method are in an interruption state, and the proportion of the number of interrupted users is 0.05% based on the method provided by the invention. With the increasing data rate constraint, the interruption probability of the method proposed by research and the Joint method is always lower than that of other methods.
Key words:
NOMA: non-Orthogonal Multiple Access
SIC: successive Interference Cancellation
MIMO: multiple-Input, multiple-Output, multiple-Input-Multiple-Output
MISO: multiple-Input, single-Output, multiple-Input-Single-Output
MRC: maximum Ratio combining, maximum Ratio combining
SUS: semi-Orthogonal User Selection
SINR: signal to noise ratio
QoS: quality of Service
Those not described in detail in this specification are well within the skill of the art.

Claims (9)

1. A power control method of MISO-NOMA uplink channel is characterized by comprising the following steps:
step 1: establishing an uplink transmission scene of the MISO-NOMA system to obtain a signal y received by the base station;
step 2: the base station performs equalization processing on the received signal y through maximum ratio combining, optimizes a user grouping mode in order to reduce the interference among groups, reduces the correlation degree among channel vectors of different groups of users, and obtains
Figure FDA0003226537090000011
Figure FDA0003226537090000012
Represents the sum of the intergroup interference plus noise suffered by the ith demodulated user in the ith group;
and step 3: an uplink NOMA user grouping scheme based on K-means is formulated, and NOMA user grouping is completed;
and 4, step 4: obtaining a minimum uplink transmission power closed-form solution required by any user i in the group by considering minimum data rate constraint of the users in the group;
and 5: obtaining an optimal demodulation sequence, and demodulating users in the same NOMA transmission group by adopting serial interference elimination;
step 6: after the minimum uplink transmitting power and the optimal demodulation sequence required by any user i are obtained, the iterative power control method for calculating the inter-group power based on the strength of the inter-group interference realizes the minimization of the total transmitting power of the system under the condition of determining the NOMA transmission group.
2. The MISO-NOMA uplink channel power control method according to claim 1, comprising the steps of:
the step 1 specifically comprises the following steps:
step 1.1: establishing an uplink transmission scene of a single-cell MISO-NOMA system, wherein a base station simultaneously provides service for K users, K represents user serial number, K =1,2, \ 8230, K is provided with N antennas, N represents antenna serial number of the base station, N =1,2, \ 8230, N is provided with one antenna for each user, and assuming that all users in a cell are divided into L NOMA transmission groups, L represents the serial number of the NOMA transmission group, L =1,2, \\ 8230, L is less than N; defining a correlation matrix G with the size of K multiplied by K, which is used for representing the correlation of channel vectors between a base station and K users;
step 1.2: performing Cholesky decomposition on the correlation matrix G to obtain:
Figure FDA0003226537090000013
wherein,
Figure FDA0003226537090000014
representing a conjugate transpose for a triangular matrix obtained after Cholesky decomposition;
establishing a channel matrix H between a base station and a user, H = [ H ] 1 ,h 2 ,…,h K ] T The size is kxn, H is expressed as:
Figure FDA0003226537090000015
wherein, V is a matrix with the size of K multiplied by N, and comprises wireless channel vectors between K users and N base station antennas;
the channel vectors corresponding to different users are independent of each other, and each element V in the matrix V k,n Can be decomposed into path loss beta k,n And small scale fading ξ k,n Where k and n are subscripts of the element in the matrix V, specifically V k,n Expressed as:
Figure FDA0003226537090000021
due to the close distance between different base station antennas, the path loss beta experienced by the signal of the same user reaching different base station antennas can be considered k,n Equal, small scale fading xi k,n Are independently and identically distributed;
the correlation matrix G is a symmetric matrix satisfying:
Figure FDA0003226537090000022
wherein, for the element g of the ith row and the jth column in the matrix i,j And element g of jth row and ith column j,i Has g of i,j =g j,i And when i = j, g i,j =1;
Each element G in the correlation matrix G i,j Representing the correlation between the channels of the user i and the user j, wherein the correlation between the channels of the user i and the user j is calculated by an equation (5):
Figure FDA0003226537090000023
wherein (x) i ,y i ) And (x) j ,y j ) The representation being the position coordinates of two users, λ c Denotes the correlation distance, λ c The smaller the value of (a), the stronger the correlation between users in the cell;
the radio channel vector between the base station and the kth user is represented as:
h k =[h k,1 ,h k,2 ,...,h k,n ,...h k,N ] T (6)
wherein the base station is provided with N antennas, so that h is used k,n Corresponding to a channel vector between the kth user and the nth antenna of the base station;
let p be k Represents the uplink transmit power, s, of the kth user k Is the complex-valued data symbol sent by the kth user, z is a complex-valued vector of nx 1, representing additive white gaussian noise, and the signal received by the base station is:
Figure FDA0003226537090000031
3. the method of power control for the MISO-NOMA uplink channel of claim 2, wherein step 2 comprises:
step 2.1: the base station performs equalization of signals through maximum ratio combining, and an equalization matrix is expressed as:
W=H * (8)
wherein, H is a channel matrix between the base station and the user;
the signal after maximum ratio combining equalization is represented as:
Figure FDA0003226537090000032
wherein, * and | | | | represents conjugate transpose and vector norm respectively; n is the number of antennas of the base station,
Figure FDA0003226537090000033
is a channel vector h k The conjugation transpose of (1); y is a signal received by the base station;
Figure FDA0003226537090000034
is a k-th user signal weighted by a real-valued factor, where p k Uplink transmit power, h, for the kth user k A wireless channel vector between the base station and the k user; s is k Complex-valued data symbols sent for the kth user;
Figure FDA0003226537090000035
including intra-group interference and inter-group interference, k' is a subscript index indicating users other than the k-th user;
Figure FDA0003226537090000036
is the noise component after equalization, z is additive white gaussian noise;
step 2.2: in order to reduce the inter-group interference, it is necessary to optimize the user grouping method and reduce the correlation between the channel vectors of different groups of users, assuming that there is M in the l-th group l Individual users, defining a vector pi l =[π l (1),π l (2),…,π l (M l )]For the base station demodulation order of the user signals of the l-th group, where l (i) Subscript representing the ith demodulated user when demodulating the ith group of user signals of the signal using SIC;
step 2.3: the base station firstly demodulates the subscript pi in the first group l (1) To pi l (i-1) and then removing these signals from the received signalDivide and then demodulate the subscript of pi l (i) When the index in the l-th group is pi l (i + 1) to π l (M l ) Is an interference component;
use of
Figure FDA0003226537090000037
Represents the sum of the intergroup interference plus noise experienced by the ith demodulated user in the ith group:
Figure FDA0003226537090000041
wherein M is l' The number of users in the l' th group;
Figure FDA0003226537090000042
the uplink transmission power of the kth user in the ith user group is obtained;
Figure FDA0003226537090000043
the conjugate transpose of the channel vector of the ith demodulation user in the ith group;
Figure FDA0003226537090000045
channel vectors for the kth demodulated user within the l' user group; z is a radical of l,πl(i) For the index in the ith user group of pi l (i) The noise received by the user; and N is the number of antennas of the base station.
4. The method of power control for the MISO-NOMA uplink channel of claim 3, wherein step 3 comprises:
step 3.1: based on the optimal grouping number of SUS and the selection algorithm of the clustering center, the optimal grouping number L and the initial clustering center C corresponding to each group are calculated 0
Step 3.2: and sequentially calculating the distance between each user to be grouped and each group of initial clustering centers, dividing the users into L groups, updating the clustering centers, and regrouping until the clustering centers are not changed any more.
5. The method of power control for the MISO-NOMA uplink channel of claim 4, wherein step 3.1 comprises:
the SUS-based optimal grouping number and clustering center selection algorithm specifically comprises the following steps:
step 3.1.1: according to the user channel matrix H = [ H = 1 ,h 2 ,…,h K ] T Setting a semi-orthogonality factor alpha, wherein alpha is a constant between 0 and 1 and represents orthogonality among users;
step 3.1.2: initializing a candidate user set gamma, gamma = {1, \8230;, K }, wherein the candidate user set gamma represents all users which are not selected into a cluster center set, the cluster center set C is made to be an empty set, the optimal grouping number L is equal to 1, and an iteration index i is equal to 1;
step 3.1.3: calculating a projection vector of each user k in the candidate user set gamma to a null space of a selected clustering center, wherein the projection vector of the user k to the null space of the selected clustering center is expressed as:
Figure FDA0003226537090000044
wherein h is k Representing a radio channel vector between the base station and the kth user;
step 3.1.4: performing N iterations, traversing the candidate user set in each iteration, and calculating g of each user k And according to g k The maximum principle identifies the index of the cluster center:
Figure FDA0003226537090000051
wherein,
Figure FDA0003226537090000052
selecting subscript index corresponding to the clustering center;
step 3.1.5:updating a clustering center set S:
Figure FDA0003226537090000053
step 3.1.6: updating the candidate user set according to the semi-orthogonality of the users in the candidate user set gamma and the clustering center set S to ensure that the users in the candidate user set are semi-orthogonal to the clustering center set, wherein the semi-orthogonality is determined by alpha:
Figure FDA0003226537090000054
users which do not meet the semi-orthogonal requirement in the candidate user set gamma are directly discarded;
step 3.1.7: updating the best group number and the iteration index obtained from the current iteration round number, L ← L +1, i ← i + 1';
step 3.1.8: repeating the step 3.1.3-3.1.7 until the current iteration index value i is more than or equal to N or the candidate user set is an empty set;
step 3.1.9: finally, the initial clustering center C is obtained 0
Figure FDA0003226537090000055
And an optimal number of packets L.
6. The MISO-NOMA uplink channel power control method of claim 5, wherein step 3.2 specifically comprises:
step 3.2.1: according to the user channel matrix H = [ H = 1 ,h 2 ,…,h K ] T Setting a weight factor epsilon and a balance factor lambda; the weighting factor epsilon is a weighted value of each distance item in the total distance weight calculated in the grouping process, and the balance factor lambda is a punishment value for balancing the distance between a certain group and a user when the group of users is too many;
step 3.2.2: initializing cluster center set C 0 Make the cluster center set C 0 Is an empty set and makes the grouping matrix mu = mu 1 ∪μ 2 …∪μ L T =0, whenThe number t of front iteration rounds is 0;
step 3.2.3: obtaining the initial clustering center calculation C obtained in the step 3.1.9 0 And the optimal number of packets L;
step 3.2.4: traversing each user in the candidate user set, and calculating the similarity of the user and each cluster center channel vector and the minimum channel gain difference of the user and each group;
using two channel vectors h i And h j Is measured by the cosine of i And h j The correlation of (a):
Figure FDA0003226537090000056
wherein, | | | represents the modulus of the complex number, and | | represents the norm of the vector;
the channel gain difference between users is measured using the squared difference of the normalized channel vectors, and the channel gain difference between user i and the l-th group is measured using the smallest gain difference within the group:
Figure FDA0003226537090000061
wherein, let | h max | | is the largest channel gain value among the cell users,
Figure FDA0003226537090000062
and
Figure FDA0003226537090000063
respectively normalizing the energy of the channel vectors corresponding to the ith and ith' users; omega l Subscript sets for users included in the l-th group;
step 3.2.5: on the basis of the formula (14) and the formula (15), in consideration of the grouping balance, a distance function is established for calculating the distance Dist from each user k to the l-th group k,l As shown in equation (16):
Figure FDA0003226537090000064
wherein ε ∈ (0, 1);
step 3.2.6: the group to which the user k belongs is selected,
Figure FDA0003226537090000065
wherein
Figure FDA0003226537090000066
Represents the index of the grouping closest to user k;
step 3.2.7: after the t-th round of clustering, the cluster center of each group is updated by equation (17):
Figure FDA0003226537090000067
wherein M is l The index of the users in the first group is represented by j;
step 3.2.8: updating an iteration index value, t ← t +1;
step 3.2.9: repeating the steps 3.2.3-3.2.8, and updating the users in the group until the new C t No change occurs;
step 3.2.10: and outputting the user grouping matrix mu.
7. The MISO-NOMA uplink channel power control method of claim 6, wherein step 4 specifically comprises:
step 4.1: assuming that there are M users in a group, given a demodulation order π l =[π l (1),π l (2),…,π l (M)]Assuming that the data rate constraints of all users in the ith group are equal and the minimum data rate constraint r is satisfied:
Figure FDA0003226537090000071
wherein,
Figure FDA0003226537090000072
the achievable data rate for the ith demodulated user in the ith group;
defining the target signal-to-interference-and-noise ratio requirement which needs to be met by a user to meet the minimum data rate constraint r as gamma:
Figure FDA0003226537090000073
wherein r is a minimum data rate constraint and W is a system bandwidth;
calculating the minimum uplink transmitting power sum in the group through analysis and derivation based on the minimum data rate constraint r;
step 4.2: analysing last demodulated user pi l (M) the minimum data rate constraint to be satisfied is:
Figure FDA0003226537090000074
wherein,
Figure FDA0003226537090000075
are respectively the pi-th group l (M) the sum of the uplink transmit power, channel vector, inter-group interference plus noise for the demodulation users;
obviously, the user power will be minimized when the constraint in equation (21) reaches the equality condition, so that
Figure FDA0003226537090000076
Denotes the pi-th group in the l-th group l The minimum uplink transmitting power of (M) demodulation users is obtained as follows:
Figure FDA0003226537090000077
wherein, gamma is the target signal-to-interference-and-noise ratio requirement, N is the number of antennas of the base station, and l, pi l (M) is the index of the mth demodulation user of the ith group after grouping,
Figure FDA0003226537090000078
respectively represent the l-th group pi l (M) channel vectors of demodulated users and the sum of inter-group interference plus noise,
Figure FDA0003226537090000079
is a constant related to the target signal to interference plus noise ratio requirement, the number of antennas of the base station and the user channels in the group;
step 4.3: solving in the same way
Figure FDA00032265370900000710
And substituting the formula (22) to obtain the minimum uplink transmitting power of the M-1 user as follows:
Figure FDA0003226537090000081
step 4.4: the process is repeated continuously, and according to the calculation result, the minimum uplink transmission power required by any user i is obtained, as follows:
Figure FDA0003226537090000082
wherein,
Figure FDA0003226537090000083
channels of users corresponding to respective demodulation orders
Figure FDA0003226537090000084
And conjugate transpose thereof
Figure FDA0003226537090000085
And a constant related to the target SINR signal-to-interference-and-noise ratio gamma, k represents the index of the first j-1 demodulation orders, and k' is the order of the 1 st to the kth demodulation.
8. The MISO-NOMA uplink channel power control method of claim 7, wherein step 5 specifically comprises:
after the minimum uplink transmitting power in each group is obtained, the optimal demodulation sequence of the users in the group is given
Figure FDA0003226537090000086
For an arbitrary NOMA transmission group, it is assumed that all users in the group have the same target data rate, such that
Figure FDA0003226537090000087
Indicating the user demodulation order, if and only if the user satisfies
Figure FDA0003226537090000088
When the user with higher interference demodulates first, the sum of the transmission power of the group is minimum, and the demodulation order is in this case
Figure FDA0003226537090000089
For an optimal demodulation order.
9. The method of power control for the MISO-NOMA uplink channel of claim 8, wherein step 6 comprises:
step 6.1: according to the user channel matrix H = [ H = 1 ,h 2 ,…,h K ] T And a user number K, an antenna number N and a minimum data rate constraint r of the user;
step 6.2: initializing power sum vectors q for groups 0 Power vector p for each user 0 The maximum iteration number MaxIter of the algorithm and the current iteration round number t;
step 6.3: in each iteration, each iteration is traversed in turnThe group user obtains the number M of users in the first group l And obtaining the optimal demodulation sequence obtained in step 5
Figure FDA00032265370900000810
Step 6.4: calculating in sequence from the first demodulation user to obtain
Figure FDA0003226537090000091
And
Figure FDA0003226537090000092
wherein
Figure FDA0003226537090000093
Is in the optimal demodulation order
Figure FDA0003226537090000094
Next, index of current ith demodulation user in current ith group,
Figure FDA0003226537090000095
is the index of the j demodulation user that demodulates thereafter;
step 6.5: calculating the values of all users in the current NOMA transmission group according to equation (27)
Figure FDA0003226537090000096
And
Figure FDA0003226537090000097
wherein,
Figure FDA0003226537090000098
representing the sum of the interclass interference plus noise for the current ith group of demodulated users,
Figure FDA0003226537090000099
inter-group interference representing the j demodulation user demodulating after iSum of disturbance plus noise;
Figure FDA00032265370900000910
wherein,
Figure FDA00032265370900000911
is a constant related to the target signal to interference and noise ratio requirement, the number of antennas of the base station and the user channel in the group;
Figure FDA00032265370900000912
channels of users corresponding to respective demodulation orders
Figure FDA00032265370900000913
And its conjugate transpose
Figure FDA00032265370900000914
And a constant related to the target SINR signal-to-interference-and-noise ratio gamma, wherein k represents the index of the first j-1 demodulation sequences, and k' is the sequence from 1 st to k th demodulation;
Figure FDA00032265370900000915
and
Figure FDA00032265370900000916
is the sum of the interference plus noise between the current ith group of demodulated users and the jth user demodulated thereafter, and the value of the sum is equal to the power q of other groups -l Correlation;
step 6.6: and then in the current iteration round number, calculating the minimum transmitting power sum q of the l group in the t +1 round iteration according to the formula (28) l (t+1)
Figure FDA00032265370900000917
Wherein q is l (t+1) Refers to the minimum sum of transmit power, M, of the l-th group in the t +1 th iteration l Representing the number of users of the group;
step 6.7: sequentially calculating the minimum uplink transmitting power of each user i in the ith group in the t +1 th iteration according to a formula (29)
Figure FDA0003226537090000101
Figure FDA0003226537090000102
Wherein,
Figure FDA0003226537090000103
represents the minimum uplink transmission power of the ith demodulated user in the ith group in the t +1 round iteration,
Figure FDA0003226537090000104
is a constant related to the target signal to interference plus noise ratio requirement, the number of antennas of the base station and the user channels in the group;
step 6.8: updating an iteration index value, t ← t +1;
step 6.9: repeating the steps 6.3-6.8, and updating the power values of all groups and all users in the groups until t = MaxIter;
step 6.10: outputting power sum vector of each group
Figure FDA0003226537090000105
And minimum uplink transmission power vector of each user
Figure FDA0003226537090000106
CN202110973495.6A 2021-08-24 2021-08-24 Power control method of MISO-NOMA uplink channel Active CN113747558B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110973495.6A CN113747558B (en) 2021-08-24 2021-08-24 Power control method of MISO-NOMA uplink channel

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110973495.6A CN113747558B (en) 2021-08-24 2021-08-24 Power control method of MISO-NOMA uplink channel

Publications (2)

Publication Number Publication Date
CN113747558A CN113747558A (en) 2021-12-03
CN113747558B true CN113747558B (en) 2022-12-06

Family

ID=78732476

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110973495.6A Active CN113747558B (en) 2021-08-24 2021-08-24 Power control method of MISO-NOMA uplink channel

Country Status (1)

Country Link
CN (1) CN113747558B (en)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110637485A (en) * 2017-05-15 2019-12-31 华为技术有限公司 System and method for wireless power control
CN112929068A (en) * 2021-02-04 2021-06-08 重庆邮电大学 SDR-based IRS-NOMA system beam forming optimization method

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110637485A (en) * 2017-05-15 2019-12-31 华为技术有限公司 System and method for wireless power control
CN112929068A (en) * 2021-02-04 2021-06-08 重庆邮电大学 SDR-based IRS-NOMA system beam forming optimization method

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
《Near-Optimal User Clustering and Power Control for Uplink MISO-NOMA Networks》;Junxia Zhang等;《2021 IEEE Global Communications Conference (GLOBECOM)》;20220202;全文 *
基于NOMA系统的用户分组和功率分配策略;金勇等;《计算机应用》(第03期);全文 *
基于非正交多址的认知MIMO网络次用户系统容量优化;廖晗等;《计算机应用》;20171210(第12期);全文 *

Also Published As

Publication number Publication date
CN113747558A (en) 2021-12-03

Similar Documents

Publication Publication Date Title
Al-Eryani et al. Multiple access in cell-free networks: Outage performance, dynamic clustering, and deep reinforcement learning-based design
Zhao et al. Coordinated multipoint transmission with limited backhaul data transfer
CN111132264B (en) User clustering method for downlink of multi-user MIMO-NOMA system
CN110190881B (en) Downlink MIMO-NOMA power distribution method with optimal weight rate
Nandan et al. Beamforming and power optimization for physical layer security of MIMO-NOMA based CRN over imperfect CSI
CN102055563B (en) Adaptive joint linear precoding method applicable to multi-base station coordination
CN107070520B (en) D2D communication interference alignment method based on cascade precoding and ESINR (orthogonal inverse Fourier transform) criterion
Liang et al. An efficiency-improved clustering algorithm based on KNN under ultra-dense network
Jayasinghe et al. Bi-directional beamformer training for dynamic TDD networks
Saatlou et al. Spectral efficiency maximization of a single cell massive MU-MIMO down-link TDD system by appropriate resource allocation
CN107994933A (en) Recognize the optimization method of time custom system capacity in MIMO networks
Mashdour et al. Multiuser scheduling with enhanced greedy techniques for multicell and cell-free massive MIMO systems
Chen et al. Hybrid beamforming and data stream allocation algorithms for power minimization in multi-user massive MIMO-OFDM systems
Braga et al. Decentralized joint pilot and data power control based on deep reinforcement learning for the uplink of cell-free systems
Sun et al. A joint iterative optimal resource allocation algorithm for non-orthogonal multi-user and multi-weight opportunistic beamforming systems
CN104010372B (en) Extensive MU MISO system low complex degree user scheduling methods
CN106230493B (en) A kind of selection of multiuser MIMO uplink antenna and user scheduling method
Hadi et al. Joint resource allocation, user clustering and 3-d location optimization in multi-uav-enabled mobile edge computing
CN113747558B (en) Power control method of MISO-NOMA uplink channel
CN101621357B (en) Mimo communication system and method thereof
Chen et al. M 3: A sub-millisecond scheduler for multi-cell mimo networks under c-ran architecture
Tien Ngoc et al. Harvested energy and spectral efficiency trade-offs in multicell MIMO wireless networks
Liu et al. A reinforcement learning approach for energy efficient beamforming in noma systems
Wang et al. A Rate-Splitting Empowered NOMA Network: Power Allocation and User Pairing
Feng et al. Random caching design for multi-user multi-antenna HetNets with interference nulling

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