CN107579763B - Inter-cluster interference elimination method based on spatial fine high-resolution beams - Google Patents

Inter-cluster interference elimination method based on spatial fine high-resolution beams Download PDF

Info

Publication number
CN107579763B
CN107579763B CN201710798786.XA CN201710798786A CN107579763B CN 107579763 B CN107579763 B CN 107579763B CN 201710798786 A CN201710798786 A CN 201710798786A CN 107579763 B CN107579763 B CN 107579763B
Authority
CN
China
Prior art keywords
base station
matrix
cluster
jth cluster
ith
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
CN201710798786.XA
Other languages
Chinese (zh)
Other versions
CN107579763A (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.)
Xidian University
Original Assignee
Xidian 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 Xidian University filed Critical Xidian University
Priority to CN201710798786.XA priority Critical patent/CN107579763B/en
Publication of CN107579763A publication Critical patent/CN107579763A/en
Application granted granted Critical
Publication of CN107579763B publication Critical patent/CN107579763B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

The invention discloses an inter-cluster interference elimination method based on spatial domain fine-degree high-resolution beams, which mainly solves the problem of poor service quality of cell edge users caused by ARSs (coverage areas) overlapping phenomenon and path loss in the prior art. The method comprises the following implementation steps: 1) selecting a cooperation area and calculating a spatial correlation matrix; 2) calculating a first-stage pre-beamforming matrix according to the spatial correlation matrix, and further calculating equivalent channel dimensions; 3) calculating the optimal spatial degree of freedom; 4) comparing the total degree of freedom with the maximum equivalent channel dimension, judging whether the user cluster is suitable for interference alignment, if so, calculating an interference alignment coding and decoding matrix of the second stage, otherwise, calculating a zero forcing precoding matrix of the second stage; 5) and calculating a two-stage precoding matrix by combining the first-stage coding and the second-stage coding. According to the invention, the intra-cluster interference is eliminated by the edge cluster through interference alignment, and the intra-cluster interference is eliminated by the center cluster through zero-forcing precoding, so that the system throughput is effectively improved, and the method can be used for a large-scale MIMO cellular network.

Description

Inter-cluster interference elimination method based on spatial fine high-resolution beams
Technical Field
The invention belongs to the technical field of wireless communication, and particularly relates to an inter-cluster interference elimination method which can be used in a large-scale MIMO cellular network system.
Background
at present, in the fifth generation cellular network 5G, in order to meet the wireless service rate 1000 times higher than that of the long term evolution standard L TE-a, the large-scale MIMO technology has been widely used, and the frequency spectrum of the millimeter wave covers the range of 30GHz to 300GHz, so that the application of the millimeter wave frequency band transmission becomes a feasible method for increasing the network capacity.
In a large-scale MIMO network structure, in order to effectively complete downlink precoding and uplink detection, a base station needs to acquire sufficiently accurate channel state information. For a time division duplex system, the detection of the channel information of the base station end can be completed by the uplink training by fully utilizing the uplink and downlink reciprocity characteristics of a channel link. In this scenario, the required length of the channel training sequence is proportional to the number of antennas at the user end. However, in the frequency division duplex mode, the reciprocity of the uplink and downlink of the link will not hold. The base station can only sense the downlink channel state information through three continuous processes of downlink channel training frame transmission, user side channel estimation and uplink channel feedback. In such a scenario, the length of the downlink training symbols and the amount of information of the uplink feedback channel are in direct proportion to the number of antennas at the base station, and therefore, a large system overhead is generated, especially when the number of antennas at the base station is large. To overcome this bottleneck, several low complexity precoding methods have been proposed in succession, typically the following:
1. The two-stage precoding method, i.e. "joint spatial diversity and multiplexing transmission". The core idea of two-stage precoding can be summarized as: firstly, clustering users according to the covariance characteristics of respective user channels, wherein each user in the same cluster has approximately the same channel covariance characteristics; then, the downlink precoding transmission process is divided into two stages, namely an outer layer precoding stage and an inner layer precoding stage;
2. Three improved two-stage precoding methods:
The first modified type is essentially in low-overhead random user selection and outer layer precoding design with the maximum achievable rate;
The second modified type is characterized in that the outer precoding design which is based on phase rotation and takes the maximum minimum user average speed as the direction;
The improved nature of the third improvement lies in low complexity on-line outer layer precoding tracking.
By the methods, when the electromagnetic scattering angle extension ranges ASR of different user clusters are not overlapped, orthogonal access can be realized. However, in an actual scenario, users are deployed randomly in a limited geographic space, ASR clustered by different users will overlap with a high probability, and interference among user clusters is introduced, which may reduce the performance of the above precoding algorithms. The influence of ASR overlapping on the cell edge user cluster is particularly serious, and the transmission rate of the edge cluster is greatly limited.
Disclosure of Invention
The invention aims to provide a method for eliminating inter-cluster interference based on spatial domain fine high-resolution beams, aiming at overcoming the defects of the prior art, so as to reduce the influence of ASR (access router) overlapping on a cell edge user cluster and improve the transmission rate of the cell edge cluster.
In order to achieve the purpose, the technical scheme of the invention comprises the following steps:
(1) Selecting a cooperation area consisting of 3 adjacent base stations in the cellular network, and calculating a spatial correlation matrix from the ith base station to the jth cluster in the cooperation area
Figure BDA0001400984730000021
Wherein, i ═ {1,2,3}, J ═ 1,2,. and J }, J is the number of clusters;
(2) Computing a pre-beamforming matrix for the first stage:
(2.1) correlating the spatial correlation matrix
Figure BDA0001400984730000022
Feature decomposition into
Figure BDA0001400984730000023
Wherein the content of the first and second substances,
Figure BDA0001400984730000024
Is composed of
Figure BDA0001400984730000025
A diagonal matrix of non-zero eigenvalues of,
Figure BDA0001400984730000026
Is composed of
Figure BDA0001400984730000027
Feature vector corresponding to the non-zero eigenvalue of A matrix of compositions, () HIs a conjugate transpose of the matrix;
(2.2) calculation of
Figure BDA0001400984730000028
The column index set of the column in the unit discrete Fourier transform DFT matrix is recorded as
Figure BDA0001400984730000029
(2.3) aggregation according to the index
Figure BDA00014009847300000210
Computing pre-beamforming matrices for the ith base station to the jth cluster
Figure BDA00014009847300000211
(3) The ith base station forms the matrix according to the pre-beam
Figure BDA00014009847300000212
Calculate its equivalent channel dimension to the jth cluster
Figure BDA00014009847300000213
(4) Calculating the optimal spatial freedom from 3 base stations to the jth cluster
Figure BDA00014009847300000214
(5) Comparing the total degree of freedom from all base stations to the jth cluster with the maximum equivalent channel dimension:
If it is
Figure BDA00014009847300000215
Executing the step (6), otherwise, executing the step (7);
(6) Selecting 3 users in the jth cluster to perform interference alignment transmission with 3 base stations in a cooperation area, and calculating a second stage interference alignment coding and decoding matrix:
(6.1) each base station sends a downlink channel training frame subjected to pre-beamforming to a user;
(6.2) performing channel estimation on 3 users selected from the jth cluster to obtain the equivalent channel of the kth user performing interference alignment from the ith base station to the jth cluster
Figure BDA00014009847300000216
And will be
Figure BDA00014009847300000217
Feeding the uplink to a base station end, wherein k is {1,2,3 };
(6.3) the base station end calculates the interference alignment coding matrix from 3 base stations to the jth cluster and the decoding matrix of 3 users performing interference alignment in the jth cluster by using the equivalent channel information, and records the interference alignment coding matrix from the ith base station to the jth cluster as
Figure BDA0001400984730000031
The decoding matrix of the k user for interference alignment in the jth cluster is U j,k
(7) Selecting equivalent channel dimensions
Figure BDA0001400984730000032
Maximum ith *Each base station serves the jth cluster,
Figure BDA0001400984730000033
And computing a second stage zero-forcing coding matrix:
(7.1) th i *The base station sends a downlink channel training frame which is subjected to pre-beam forming to a user;
(7.2) performing channel estimation on the user in the jth cluster to obtain the ith cluster *Equivalent channel from base station to jth cluster
Figure BDA0001400984730000034
And will be
Figure BDA0001400984730000035
Uplink feedback to ith *A base station;
(7.3) th i *A base station using equivalent channel information
Figure BDA0001400984730000036
Computing a zero forcing coding matrix to the jth cluster
Figure BDA0001400984730000037
(8) Computing a two-stage joint precoding matrix
Figure BDA0001400984730000038
Compared with the prior art, the invention has the following technical effects:
Several existing two-stage precoding techniques simply process all clusters together, but they do not distinguish between cell edge clusters and center clusters, and the ASRs overlap phenomenon and severe path loss cause low transmission rate of the cell edge clusters. According to the invention, the edge clusters and the center cluster are distinguished, the intra-cluster interference of the edge clusters is eliminated through interference alignment, and the intra-cluster interference of the center cluster is eliminated through zero-forcing precoding, so that the transmission rate of the edge clusters is effectively improved, and the throughput of a network is increased.
Drawings
FIG. 1 is a diagram of an application scenario of the present invention;
FIG. 2 is a diagram of a collaboration zone selected from FIG. 1 in accordance with the present invention;
Fig. 3 is a flow chart of an implementation of the present invention.
Detailed Description
The invention is further described below with reference to the accompanying drawings.
As shown in fig. 1, the present invention is applicable to a multi-cell cellular network scenario, where 1 base station is configured at the center of each cell, and every 3 adjacent base stations form a cooperation area. As shown in fig. 2, a triangular cooperation area commonly served by 3 neighboring base stations is selected, wherein a base station is configured at the center of each cell and is marked as BS iI ═ 1,2,3, and N is installed per base station tAntennas with uniformly distributed roots, N t>>1,The antenna element spacing is τ. There are 5 users clustered in the region, denoted as C iJ ═ {1,2,3,4,5}, with 4 mounts N in each cluster rUsers of the root antenna. The jth cluster has a radius of R jThe distance from the ith base station to the jth cluster is
Figure BDA0001400984730000039
Referring to fig. 2 and 3, the implementation steps of the invention are as follows:
Step 1, calculating a spatial correlation matrix from a base station to a cluster.
Selecting a cooperation area consisting of 3 adjacent base stations, and calculating a spatial correlation matrix from the ith base station to the jth cluster in the cooperation area
Figure BDA0001400984730000041
Figure BDA0001400984730000042
Wherein the content of the first and second substances,
Figure BDA0001400984730000043
Is N t×NtMatrix of N tFor the number of base station antennas, p, q are the row and column indices, respectively, and p ═ 1,2 t},q={1,2,...,Nt},
Figure BDA0001400984730000044
For the azimuth from the ith base station to the jth cluster,
Figure BDA0001400984730000045
For the angular spread of the ith base station to the jth cluster,
Figure BDA0001400984730000046
RjIs the radius of the jth cluster,
Figure BDA0001400984730000047
Is the distance from the ith base station to the jth cluster, and tau is the base station antenna unit spacing 。
And 2, calculating a pre-beamforming matrix in the first stage.
(2.1) correlating the spatial correlation matrix
Figure BDA0001400984730000048
Feature decomposition into
Figure BDA0001400984730000049
Wherein the content of the first and second substances,
Figure BDA00014009847300000410
Is composed of
Figure BDA00014009847300000411
A diagonal matrix of non-zero eigenvalues of,
Figure BDA00014009847300000412
Is composed of
Figure BDA00014009847300000413
Is used for generating a matrix of eigenvectors corresponding to the non-zero eigenvalues of (c) () HIs a conjugate transpose of the matrix;
(2.2) calculation of
Figure BDA00014009847300000414
Column index set in the unit discrete fourier transform DFT matrix:
Index set of column labels from ith base station to jth cluster
Figure BDA00014009847300000415
Is represented as follows:
Figure BDA00014009847300000416
Wherein λ is a carrier wavelength;
(2.3) aggregation according to the index
Figure BDA00014009847300000417
Calculating the ith base station Pre-beamforming matrix to jth cluster
Figure BDA00014009847300000418
Figure BDA00014009847300000419
Wherein f is n∪ is ∪ the ∪ nth ∪ column ∪ of ∪ the ∪ DFT ∪ matrix ∪, ∪ is ∪ the ∪ union ∪ of ∪ the ∪ solved ∪ sets ∪, ∪
Figure BDA00014009847300000420
For the column index set of the ith base station to the jth cluster, j '═ {1,2,3,4,5} and j' ≠ j.
And 3, calculating the equivalent channel dimension from the base station to the cluster.
The ith base station forms the matrix according to the pre-beam
Figure BDA00014009847300000421
Calculate its equivalent channel dimension to the jth cluster
Figure BDA00014009847300000422
Figure BDA0001400984730000051
Wherein rank { } is the rank of the matrix, and | is the number of elements in the set.
And 4, calculating the optimal spatial freedom from the base station to the cluster.
Calculating the optimal spatial degrees of freedom from 3 base stations to the jth cluster by solving the following optimization problem
Figure BDA0001400984730000052
The objective function of the optimization problem is as follows:
Figure BDA0001400984730000053
The constraints are as follows:
Figure BDA0001400984730000054
Figure BDA0001400984730000055
Figure BDA0001400984730000056
Wherein the content of the first and second substances,
Figure BDA0001400984730000057
Number of data streams sent to jth cluster for ith base station, N rMax (. lamda.) is the maximum value and min (. lamda.) is the minimum value for the number of user antennas.
And 5, judging whether the user cluster is suitable for interference alignment transmission with the base station.
(5.1) adding the degrees of freedom from 3 base stations to the jth cluster to obtain the total degree of freedom, i.e.
Figure BDA0001400984730000058
(5.2) take the maximum equivalent channel dimension from 3 base stations to the jth cluster, i.e.
Figure BDA0001400984730000059
(5.3) comparing the total degree of freedom from 3 base stations to the jth cluster with the maximum equivalent channel dimension:
If it is
Figure BDA00014009847300000510
Step 6 is performed, otherwise step 7 is performed.
And 6, selecting 3 users in the jth cluster to perform interference alignment transmission with 3 base stations in a cooperation area, and calculating a second-stage interference alignment coding and decoding matrix.
(6.1) each base station sends a downlink channel training frame which is subjected to pre-beam forming to a user:
First, a pilot sequence X is generated by the ith base station i(ii) a Then to X iPerforming pre-beamforming coding, i.e.
Figure BDA00014009847300000511
Finally, encoding
Figure BDA00014009847300000512
Sending the information to the users in the jth cluster;
(6.2) performing channel estimation on 3 users selected from the jth cluster to obtain the equivalent channel of the kth user performing interference alignment from the ith base station to the jth cluster
Figure BDA0001400984730000061
And will be
Figure BDA0001400984730000062
Feeding back to the base station end, wherein,
Figure BDA0001400984730000063
Figure BDA0001400984730000064
For the channel from the ith base station to the kth user in the jth cluster, k is {1,2,3 };
(6.3) the base station uses the equivalent channel information
Figure BDA0001400984730000065
Calculating interference alignment coding matrixes from 3 base stations to the jth cluster and decoding matrixes of 3 users performing interference alignment in the jth cluster, wherein:
Interference alignment coding matrix from 1 st base station to j th cluster
Figure BDA0001400984730000066
Is represented as follows:
Figure BDA0001400984730000067
2 nd base station Interference aligned coding matrix to jth cluster
Figure BDA0001400984730000068
Is represented as follows:
Figure BDA0001400984730000069
Interference alignment coding matrix from 3 rd base station to j th cluster
Figure BDA00014009847300000610
Is represented as follows:
Figure BDA00014009847300000611
Decoding matrix U of 1 st user for interference alignment in jth cluster j,1Expressed as follows:
Figure BDA00014009847300000612
Decoding matrix U of 2 nd user for interference alignment in jth cluster j,2Expressed as follows:
Figure BDA00014009847300000613
Decoding matrix U of 3 rd user for interference alignment in jth cluster j,3Expressed as follows:
Figure BDA00014009847300000614
wherein vig { } is the eigenvector of the matrix, and NU LL { } is the null space of the matrix.
Step 7, selecting equivalent channel dimension
Figure BDA00014009847300000615
Maximum ith *Each base station serves the jth cluster,
Figure BDA00014009847300000616
And computes a second stage zero-forcing coding matrix.
(7.1) th i *The base station sends a downlink channel training frame which is subjected to pre-beam forming to a user;
(7.2) performing channel estimation on the user in the jth cluster to obtain the ith cluster *Equivalent channel from base station to jth cluster
Figure BDA00014009847300000617
And will be
Figure BDA00014009847300000618
Is fed back to the ith *A base station, wherein,
Figure BDA0001400984730000071
Figure BDA0001400984730000072
Is the ith *Channels from base station to jth cluster;
(7.3) th i *A base station using equivalent channel information
Figure BDA0001400984730000073
Computing a zero forcing coding matrix to the jth cluster
Figure BDA0001400984730000074
Figure BDA0001400984730000075
Wherein the content of the first and second substances,
Figure BDA0001400984730000076
In order to normalize the factors, the method comprises the steps of,
Figure BDA0001400984730000077
tr () is trace of matrix
Step 8, according to the first order from the ith base station to the jth cluster Segment pre-beamforming matrix
Figure BDA0001400984730000078
And a second stage encoding matrix
Figure BDA0001400984730000079
Calculating a two-stage precoding matrix from the ith base station to the jth cluster:
Figure BDA00014009847300000710
And completing the two-stage joint coding.
The above is a detailed description of an example of the invention and is not to be construed as limiting the invention in any way, it being obvious that various changes may be made within the spirit and scope of the invention, which is encompassed by the protection of the present invention.

Claims (10)

1. A method for eliminating inter-cluster interference based on spatial fine high-resolution beams comprises the following steps:
(1) Selecting a cooperation area consisting of 3 adjacent base stations in the cellular network, and calculating a spatial correlation matrix from the ith base station to the jth cluster in the cooperation area
Figure FDA0002499473310000011
Wherein, i ═ {1,2,3}, J ═ 1,2,. and J }, J is the number of clusters;
(2) Computing a pre-beamforming matrix for the first stage:
(2.1) correlating the spatial correlation matrix
Figure FDA0002499473310000012
Feature decomposition into
Figure FDA0002499473310000013
Wherein the content of the first and second substances,
Figure FDA0002499473310000014
Is composed of
Figure FDA0002499473310000015
A diagonal matrix of non-zero eigenvalues of,
Figure FDA0002499473310000016
Is composed of
Figure FDA0002499473310000017
Is used for generating a matrix of eigenvectors corresponding to the non-zero eigenvalues of (c) () HIs a conjugate transpose of the matrix;
(2.2) calculation of
Figure FDA0002499473310000018
The column index set of the column in the unit discrete Fourier transform DFT matrix is recorded as
Figure FDA0002499473310000019
(2.3) aggregation according to the index
Figure FDA00024994733100000110
Computing pre-beamforming matrices for the ith base station to the jth cluster
Figure FDA00024994733100000111
(3) The ith base station forms the matrix according to the pre-beam
Figure FDA00024994733100000112
Calculate its equivalent channel dimension to the jth cluster
Figure FDA00024994733100000113
(4) Calculating the optimal spatial freedom from 3 base stations to the jth cluster
Figure FDA00024994733100000114
(5) Comparing the total degree of freedom from all base stations to the jth cluster with the maximum equivalent channel dimension:
If it is
Figure FDA00024994733100000115
Executing the step (6), otherwise, executing the step (7);
(6) Selecting 3 users in the jth cluster to perform interference alignment transmission with 3 base stations in a cooperation area, and calculating a second stage interference alignment coding and decoding matrix:
(6.1) each base station sends a downlink channel training frame subjected to pre-beamforming to a user;
(6.2) performing channel estimation on 3 users selected from the jth cluster to obtain the equivalent channel of the kth user performing interference alignment from the ith base station to the jth cluster
Figure FDA00024994733100000116
And will be
Figure FDA00024994733100000117
Feeding the uplink to a base station end, wherein k is {1,2,3 };
(6.3) the base station end calculates the interference alignment coding matrix from 3 base stations to the jth cluster and the decoding matrix of 3 users performing interference alignment in the jth cluster by using the equivalent channel information, and records the interference alignment coding matrix from the ith base station to the jth cluster as
Figure FDA00024994733100000118
The decoding matrix of the k user for interference alignment in the jth cluster is U j,k
(7) Selecting equivalent channel dimensions
Figure FDA0002499473310000021
Maximum ith *Each base station serves the jth cluster,
Figure FDA0002499473310000022
And computing a second stage zero-forcing coding matrix:
(7.1) th i *A base station Sending a downlink channel training frame subjected to pre-beamforming to a user;
(7.2) performing channel estimation on the user in the jth cluster to obtain the ith cluster *Equivalent channel from base station to jth cluster
Figure FDA0002499473310000023
And will be
Figure FDA0002499473310000024
Uplink feedback to ith *A base station;
(7.3) th i *A base station using equivalent channel information
Figure FDA0002499473310000025
Computing a zero forcing coding matrix to the jth cluster
Figure FDA0002499473310000026
(8) Computing a two-stage joint precoding matrix
Figure FDA0002499473310000027
2. The method of claim 1, wherein the spatial correlation matrix in step (1)
Figure FDA0002499473310000028
Calculated according to the following formula:
Figure FDA0002499473310000029
Wherein the content of the first and second substances,
Figure FDA00024994733100000210
Is N t×NtMatrix of N tFor the number of base station antennas, p, q are the row and column indices, respectively, and p ═ 1,2 t},q={1,2,...,Nt},
Figure FDA00024994733100000211
For the azimuth from the ith base station to the jth cluster,
Figure FDA00024994733100000212
For the angular spread of the ith base station to the jth cluster,
Figure FDA00024994733100000213
RjIs the radius of the jth cluster,
Figure FDA00024994733100000214
And tau is the distance from the ith base station to the jth cluster, and tau is the base station antenna unit distance.
3. The method of claim 1, wherein the set of column index indices from the ith base station to the jth cluster in step (2.2)
Figure FDA00024994733100000215
Calculated according to the following formula:
Figure FDA00024994733100000216
Wherein N is tIs the number of base station antennas, lambda is the carrier wavelength,
Figure FDA00024994733100000217
For the azimuth from the ith base station to the jth cluster,
Figure FDA00024994733100000218
For the angular spread of the ith base station to the jth cluster,
Figure FDA00024994733100000219
RjIs the radius of the jth cluster,
Figure FDA00024994733100000220
And tau is the distance from the ith base station to the jth cluster, and tau is the base station antenna unit distance.
4. The method of claim 1, wherein the pre-beamforming matrix in step (2.3)
Figure FDA0002499473310000031
Calculated according to the following formula:
Figure FDA0002499473310000032
Wherein f is n∪ is ∪ the ∪ nth ∪ column ∪ of ∪ the ∪ DFT ∪ matrix ∪, ∪ is ∪ the ∪ union ∪ of ∪ the ∪ solved ∪ sets ∪, ∪
Figure FDA0002499473310000033
Index sets are labeled for the columns from the ith base station to the jth cluster.
5. The method of claim 1, wherein the equivalent channel dimension from the ith base station to the jth cluster in step (3)
Figure FDA0002499473310000034
Calculated according to the following formula:
Figure FDA0002499473310000035
wherein rank { } is the rank of the solution matrix, | - | is the number of elements in the solution, and U is the union of the solutions,
Figure FDA0002499473310000036
Index sets are labeled for the columns from the ith base station to the jth cluster.
6. The method of claim 1, wherein 3 base stations in step (4) Optimal spatial degree of freedom to jth cluster
Figure FDA0002499473310000037
Obtained by solving the following optimization problem:
The objective function of the optimization problem is as follows:
Figure FDA0002499473310000038
The constraints are as follows:
Figure FDA0002499473310000039
Figure FDA00024994733100000310
Figure FDA00024994733100000311
Wherein the content of the first and second substances,
Figure FDA00024994733100000312
Number of data streams sent to jth cluster for ith base station, N rMax (. lamda.) is the maximum value and min (. lamda.) is the minimum value for the number of user antennas.
7. The method of claim 1, wherein the step (6.1) of sending the downlink channel training frame first requires the ith base station to generate the pilot sequence X i(ii) a Then to X iPerforming pre-beamforming coding, i.e.
Figure FDA0002499473310000041
Finally will be
Figure FDA0002499473310000042
And sending to the user of the jth cluster.
8. The method of claim 1, wherein the step (6.2) comprises estimating an equivalent channel for the interference-aligned kth user in the jth cluster
Figure FDA0002499473310000043
Is represented as follows:
Figure FDA0002499473310000044
Wherein the content of the first and second substances,
Figure FDA0002499473310000045
The channel from the ith base station to the kth user in the jth cluster.
9. The method of claim 1, wherein the interference alignment coding matrix of 3 base stations to the jth cluster in step (6.3)
Figure FDA0002499473310000046
And decoding matrix U of 3 users making interference alignment in jth cluster j,kCalculated according to the following formula:
Figure FDA0002499473310000047
Figure FDA0002499473310000048
Figure FDA0002499473310000049
Figure FDA00024994733100000410
Figure FDA00024994733100000411
Figure FDA00024994733100000412
vig { } is an eigenvector of the matrix, and NU LL { } is a null space of the matrix.
10. The method of claim 1, wherein step (7.3) comprises base station i *Coding matrix to cluster j
Figure FDA00024994733100000413
Calculated according to the following formula:
Figure FDA00024994733100000414
Wherein the content of the first and second substances,
Figure FDA0002499473310000051
In order to normalize the factors, the method comprises the steps of,
Figure FDA0002499473310000052
tr () is the trace of the matrix.
CN201710798786.XA 2017-09-07 2017-09-07 Inter-cluster interference elimination method based on spatial fine high-resolution beams Active CN107579763B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710798786.XA CN107579763B (en) 2017-09-07 2017-09-07 Inter-cluster interference elimination method based on spatial fine high-resolution beams

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710798786.XA CN107579763B (en) 2017-09-07 2017-09-07 Inter-cluster interference elimination method based on spatial fine high-resolution beams

Publications (2)

Publication Number Publication Date
CN107579763A CN107579763A (en) 2018-01-12
CN107579763B true CN107579763B (en) 2020-07-10

Family

ID=61031195

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710798786.XA Active CN107579763B (en) 2017-09-07 2017-09-07 Inter-cluster interference elimination method based on spatial fine high-resolution beams

Country Status (1)

Country Link
CN (1) CN107579763B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108880643B (en) * 2018-05-30 2021-03-23 哈尔滨工业大学深圳研究生院 Large-scale MIMO-NOMA downlink interference elimination method based on oblique projection
CN108924067B (en) * 2018-07-03 2020-09-22 西北工业大学 Time division method for training sequence and data symbol in interference alignment network
CN110445519B (en) * 2019-07-24 2022-07-26 南京邮电大学 Method and device for resisting inter-group interference based on signal-to-interference-and-noise ratio constraint

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2011085549A1 (en) * 2010-01-13 2011-07-21 上海贝尔股份有限公司 Method and apparatus for channel information feedback and precoding
CN106972907A (en) * 2017-03-23 2017-07-21 北京工业大学 Extensive antenna system channel training and transmitting procedure inter-cell interference cancellation method

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101922597B1 (en) * 2011-12-27 2019-02-21 삼성전자주식회사 Method and apparatus for transmitting and receiving channel state information reference signal for massive multi input multi output system based wireless communication systems

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2011085549A1 (en) * 2010-01-13 2011-07-21 上海贝尔股份有限公司 Method and apparatus for channel information feedback and precoding
CN106972907A (en) * 2017-03-23 2017-07-21 北京工业大学 Extensive antenna system channel training and transmitting procedure inter-cell interference cancellation method

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
Mlh40系统中利用空间相关性的同信道干扰消除算法;赵慧等;《电子科技大学学报》;20080331;第37卷(第2期);全文 *

Also Published As

Publication number Publication date
CN107579763A (en) 2018-01-12

Similar Documents

Publication Publication Date Title
US20220224464A1 (en) Fractional cooperative multipoint network operation
US9680549B2 (en) User scheduling and beamformer design method, apparatus, and storage medium based on two-stage beamformer for massive MIMO downlink
CN104052535A (en) Millimeter wave large-scale MIMO system multi-user transmission method based on space division multiple access and interference suppression
US20200204226A1 (en) Massive mimo robust precoding transmission method
US20170279504A1 (en) Method and system for processing downlink pilot signal
CN107579763B (en) Inter-cluster interference elimination method based on spatial fine high-resolution beams
CN113411107B (en) Millimeter wave large-scale MIMO system broadband channel estimation method based on beam
CN104871437A (en) Channel reciprocity compensating method and device in FDD system
Rebato et al. Performance assessment of MIMO precoding on realistic mmWave channels
Yan et al. Wideband channel tracking for mmWave MIMO system with hybrid beamforming architecture
CN104506256B (en) Performance evaluation method for MIMO (Multiple Input Multiple Output) multi-antenna system and multi-antenna system
CN101615943B (en) Method for estimating elevation angle of intelligent antenna multi-subarray system
Yi et al. A novel NE-DFT channel estimation scheme for millimeter-wave massive MIMO vehicular communications
CN112769462B (en) Millimeter wave MIMO broadband channel estimation method based on joint parameter learning
Xu et al. Fast beam training for FDD multi-user massive MIMO systems with finite phase shifter resolution
WO2017118079A1 (en) Method and device for dual-stream beamforming, and base station
Yan et al. Multiple RF chains assisted parallel beam search for mmWave hybrid beamforming systems
Schwarz Robust full-dimension MIMO transmission based on limited feedback angular-domain CSIT
US20240063858A1 (en) Transceiver method between receiver (Rx) and transmitter (Tx) in an overloaded communication channel
Peng et al. Wideband hybrid precoder design in MU-MIMO based on channel angular information
Chen-Hu et al. Non-coherent modulation for RIS-empowered multi-antenna OFDM communications
Chen et al. Joint IWMMSE-Based Channel Estimation and Finsler-Manifold-Based Codebook for the Design of V2X FDD Massive MIMO Systems
CN110445519B (en) Method and device for resisting inter-group interference based on signal-to-interference-and-noise ratio constraint
CN109194375B (en) FD-MIMO multi-cell downlink interference coordination method
Han et al. Joint transmission using global codeword and codebook design for coordinated multipoint processing (CoMP)

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