Disclosure of Invention
The technical problems to be solved by the invention are that the interference among all user groups is large and the transmission efficiency in the group is low in the prior art. The method has the characteristics of high orthogonality of users among groups, small interference, high transmission efficiency after dimension reduction, high correlation of users in the groups and convenience in transmission.
In order to solve the technical problems, the technical scheme is as follows:
a multi-user mixed linear nonlinear precoding method is used for a large-scale MIMO system, a base station in the large-scale MIMO system is a large-scale linear antenna array, and the multi-user mixed linear nonlinear precoding method comprises the following steps:
step 1, each user terminal estimates a downlink channel matrix of the user terminal, calculates a correlation matrix, and feeds back the correlation matrix of the downlink channel to a base station for a long time;
step 2, the base station defines standard correlation and standard orthogonality according to the received correlation matrix sent by each user side, and carries out user grouping, wherein the user sides with the correlation larger than the standard correlation are gathered into a user group, and the user sides with the orthogonality larger than the standard orthogonality are not in the same user group;
step 3, performing channel dimensionality reduction between different user groups through block diagonalized first-layer linear precoding;
and 4, scheduling a plurality of users in the same user group to perform second-layer nonlinear precoding, so as to realize multi-user downlink transmission.
In the above scheme, for optimization, further, the downlink channel matrix of user k in step 1 is
The correlation matrix for user k is
Where user k has only one antenna, NtThe number of antenna elements of the large-scale linear antenna array; h islFor the channel response between the first antenna of the base station and the antenna of user K, l is 1,2, K, NtK is the number of users, K is more than or equal to 1 and less than or equal to K, (. DEG)HIndicating that the matrix is conjugate transformed.
Further, step 2 further comprises:
step A, defining the number of user groups as G, optionally selecting G users from K users, and taking the G users to send related matrixes as an initial group center matrix V1,V2,...,VG;
Step B, calculating a correlation matrix R of the user kkGroup center matrix V from the g-th groupgThe distance between the users k and the g group of users is measured, and the correlation is as follows:
wherein R isk=UkΛkUkFor eigenvalue decomposition, | | | | | non-calculationFIs F norm, G is more than or equal to 1 and less than or equal to G;
and C, repeating the step B, adding the user k into the user group with the maximum correlation, and adding all the users into the user group:
d, updating the group center matrix of each group according to the divided user group result; according to the average correlation matrix R of users in the g groupgUpdating the central matrix of the g-th group with the feature vectors and the feature values:
step E, executing step B until the grouping results of the two times are consistent;
wherein, KgIs the number of users in the g-th group.
Further, the first layer linear dimension reduction precoding method includes:
step A, dividing the G user groups in step 3 into 2 subsets, including:
(i) SVD is carried out on the group center matrix of the g user group, and right singular vectors corresponding to non-zero singular values are taken to form a main singular vector set of the g user group
(ii) Calculate the arbitrary g1Group and g2Chordal distance between groups:
wherein g is1,g21,2, G, and G1≠g2;
(iii) The sum of two groups of minimum chord distances is maximized by averagely dividing the G groups into two subsets1And2:
s.t.|1|=|2|=G/2,1∩2=φ;
and step B, carrying out approximate block diagonalization precoding on the two subsets.
Further, the approximate block diagonalization precoding includes:
(i) definition of
Set of interference singular vectors of g-th group, pair xi
gPerforming SVD with left singular matrix of
Wherein
Is a singular vector set corresponding to a zero singular value;
(ii) definition of
To pair
Performing EVD decomposition with a feature matrix of
Wherein
Is that
The characteristic vector set corresponding to the non-zero characteristic value;
(iii) the approximate block diagonalized precoding matrix of the g-th group is
Further, the nonlinear precoding method in the second layer group is as follows:
step A, calculating the signal-to-interference ratio of a g group of users k:
selecting users according to the signal-to-interference ratio in the g-th group, arranging the users in the group according to the descending order of the signal-to-interference ratio, and selecting the front LgThe individual users are used as service users of the g group;
wherein L isg=min(Kg,bg),KgIs the number of users of the g-th group, bgIs a dimension reduction matrix BgThe number of columns;
step B, within the g-th group, for the top L selected in step 5agCarrying out THP precoding on each user;
step C, calculating the signals finally received by the users in the group g as:
wherein P is the total transmitting power of the base station, L is the number of scheduled users,
the group g is subjected to THP precoding to obtain a transmission vector, pi
gIs a weighting matrix obtained in THP precoding, n
gThe noise vector of the user is served for the g-th group.
Further, the THP precoding includes:
(i) and (3) calculating the equivalent channel matrix of the selected user k in the group g:
Hg,k=Hg,kBg
feeding back the equivalent channel matrix after dimension reduction to a base station end;
(ii) the equivalent channel matrix of the users in the g-th group is
To pair
Carrying out QR decomposition:
then there is a weighting matrix
Wherein r is
11,K,
Is an element on the main diagonal of the matrix R, the feedback matrix phi
g=Π
gR
g(:,1:L
g)
HFeed forward matrix F
g=Q
g;
(iii) Original data signal
The sending signals obtained after the modulus taking and the continuous interference elimination are as follows:
(iv) the transmission vector obtained by THP precoding is:
the invention has the beneficial effects that:
the method has the advantages that the multi-user mixed linear nonlinear precoding is adopted, so that the orthogonality of users among groups and the correlation of users in the groups are improved while the users are ensured to access at any time, and the high-efficiency transmission is realized while the interference is reduced;
compared with the existing situation that the number of the antennas is more than the number of the users, the number of the users is consistent with the number of the antennas, and the cost is low.
Example 1
The embodiment provides a multi-user hybrid linear nonlinear precoding method, which is used in a large-scale MIMO system, where a base station in the large-scale MIMO system is a large-scale linear antenna array, as shown in fig. 1, the multi-user hybrid linear nonlinear precoding method includes:
step 1, each user terminal estimates a downlink channel matrix of the user terminal, calculates a correlation matrix, and feeds back the correlation matrix of the downlink channel to a base station for a long time;
the downlink channel matrix of user k is
The correlation matrix for user k is
Where user k has only one antenna, NtThe number of antenna elements of the large-scale linear antenna array; h islFor the channel response between the first antenna of the base station and the antenna of user K, l is 1,2, K, NtK is the number of users, K is more than or equal to 1 and less than or equal to K, (. DEG)HRepresenting conjugate transformation of the matrix;
step 2, the base station defines standard correlation and standard orthogonality according to the received correlation matrix sent by each user side, the user sides with the correlation larger than the standard correlation are collected into a user group, and the user sides with the orthogonality larger than the standard orthogonality are not in the same user group;
step A, defining the number of user groups as G, optionally selecting G users from K users, and taking the G users to send related matrixes as an initial group center matrix V1,V2,...,VG;
Step B, calculating a correlation matrix R of the user kkGroup center matrix V from the g-th groupgThe distance between the users k and the g group of users is measured, and the correlation is as follows:
wherein R isk=UkΛkUkFor eigenvalue decomposition, | | | | | non-calculationFIs F norm, G is more than or equal to 1 and less than or equal to G;
and C, repeating the step B, adding the user k into the user group with the maximum correlation, and adding all the users into the user group:
step D, according to the divided user groupsUpdating the group center matrix of each group as a result; according to the average correlation matrix R of users in the g groupgUpdating the central matrix of the g-th group with the feature vectors and the feature values:
step E, executing step B until the grouping results of the two times are consistent;
wherein, KgIs the number of users in the g-th group;
step 3, performing signal dimension reduction between different user groups through block diagonalized first-layer linear precoding;
the first layer linear dimension reduction precoding method comprises the following steps:
step A, dividing the G user groups in step 3 into 2 subsets, including:
(i) SVD is carried out on the group center matrix of the g user group, and right singular vectors corresponding to non-zero singular values are taken to form a main singular vector set of the g user group
(ii) Calculate the arbitrary g1Group and g2Chordal distance between groups:
wherein g is1,g21,2, G, and G1≠g2;
(iii) The sum of two groups of minimum chord distances is maximized by averagely dividing the G groups into two subsets1And2:
s.t.|1|=|2|=G/2,1∩2=φ;
and step B, carrying out approximate block diagonalization precoding on the two subsets, wherein the approximate block diagonalization precoding comprises the following steps:
(i) definition of
Set of interference singular vectors of g-th group, pair xi
gPerforming SVD with left singular matrix of
Wherein
Is a singular vector set corresponding to a zero singular value;
(ii) definition of
To pair
Performing EVD decomposition with a feature matrix of
Wherein
Is that
The characteristic vector set corresponding to the non-zero characteristic value;
(iii) the approximate block diagonalized precoding matrix of the g-th group is
Step 4, scheduling a plurality of users in the same user group to perform second layer nonlinear precoding, and realizing multi-user downlink transmission, wherein the nonlinear precoding method in the second layer group comprises the following steps:
step A, calculating the signal-to-interference ratio of a g group of users k:
selecting users according to the signal-to-interference ratio in the g-th group, arranging the users in the group according to the descending order of the signal-to-interference ratio, and selecting the front LgThe individual users are used as service users of the g group;
wherein L isg=min(Kg,bg),KgIs the number of users of the g-th group, bgIs a dimension reduction matrix BgThe number of columns;
step B, within the g-th group, for the top L selected in step 5agCarrying out THP precoding on each user; the THP precoding includes:
(i) and (3) calculating the equivalent channel matrix of the selected user k in the group g:
Hg,k=Hg,kBg
feeding back the equivalent channel matrix after dimension reduction to a base station end;
(ii) the equivalent channel matrix of the users in the g-th group is
To pair
Carrying out QR decomposition:
then there is a weighting matrix
Wherein r is
11,K,
Is an element on the main diagonal of the matrix R, the feedback matrix phi
g=Π
gR
g(:,1:L
g)
HFeed forward matrix F
g=Q
g;
(iii) Original data signal
The sending signals obtained after the modulus taking and the continuous interference elimination are as follows:
(iv) the transmission vector obtained by THP precoding is:
step C, calculating the signals finally received by the users in the group g as:
wherein P is the total transmitting power of the base station, L is the number of scheduled users,
n
gthe noise vector of the user is served for the g-th group.
Although the illustrative embodiments of the present invention have been described above to enable those skilled in the art to understand the present invention, the present invention is not limited to the scope of the embodiments, and it is apparent to those skilled in the art that all the inventive concepts using the present invention are protected as long as they can be changed within the spirit and scope of the present invention as defined and defined by the appended claims.