CN103023544A - Low-complexity interference alignment method of multiple input multiple output (MIMO)interference channel system - Google Patents
Low-complexity interference alignment method of multiple input multiple output (MIMO)interference channel system Download PDFInfo
- Publication number
- CN103023544A CN103023544A CN201210562491XA CN201210562491A CN103023544A CN 103023544 A CN103023544 A CN 103023544A CN 201210562491X A CN201210562491X A CN 201210562491XA CN 201210562491 A CN201210562491 A CN 201210562491A CN 103023544 A CN103023544 A CN 103023544A
- Authority
- CN
- China
- Prior art keywords
- matrix
- interference
- orthogonal basis
- coding matrix
- convergence
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a low-complexity interference alignment method of a multiple input multiple output (MIMO)interference channel system. The low-complexity interference alignment method includes: firstly, obtaining an interference channel matrix from other community base stations to local community users, and randomly initializing a pre-code matrix of base stations; secondly, obtaining an interference covariance matrix of users according to the pre-code matrix and the interference channel matrix, and then obtaining an orthogonal basis of an interference receiving subspace; thirdly, updating the pre-code matrix according to the orthogonal basis of the interference receiving subspace, and when an updated pre-code matrix dissatisfies conditions of convergence, recalculating the orthogonal basis of the interference receiving subspace, and if not, obtaining a final orthogonal basis of the interference receiving subspace according to the updated pre-code matrix which satisfies the conditions of the convergence; fourthly, obtaining a post-processing matrix according to the final orthogonal basis of the interference receiving subspace; and finally, performing zero forcing processing on a signal according to the post-processing matrix to obtain a signal with interference eliminated. The low-complexity interference alignment method of the MIMO interference channel system is simple in process and high in accuracy rate, and can reduce computation complexity on the premise of keeping system data throughout capacity.
Description
Technical field
The present invention relates to communication technical field, the low complex degree that relates in particular to MIMO interference channel system disturbs alignment schemes.
Background technology
To high transfer rate more and more the pursuit of spectral efficient be the topic of a permanency of wireless communication field.Multi-antenna technology (Multiple Input Multiple Output, MIMO) is by at many antennas of transmitting terminal and receiving terminal configuration, for radio communication has been introduced the additional space degree of freedom, thereby greatly improved the availability of frequency spectrum and the throughput of system.In the wireless network, except noise and decline factor, disturb the impact for communication day by day to highlight.Now, the basic framework of 4G is established.Because its basic multi-access mode is based on OFDMA(OFDM access) frequency division multiple access, so the multi-user in the residential quarter no longer becomes research emphasis.And because neighbor cell subcarrier multiplexing, the interference of presence of intercell interference, particularly edge customer becomes outstanding problem.How effectively to eliminate interference effect and become important research topic.When introducing multi-antenna technology in the next generation communication system, and expect that generally the multiplexing factor of proportion is that 1 mode is carried out networking, inevitably can produce common-channel interference (Co-Channel Interference, CCI), the user of cell edge particularly, seriously weakened the spectral efficient that multi-antenna technology brings, existing interference mitigation technology, such as interference randomization, interference delete, interference management etc., can't address this problem well, the more advanced interference mitigation technology of an urgent demand research is in order to further promote spectrum efficiency.In LTE-Advanced, introduce cooperative multipoint transmission (Coordinated Multi Point, CoMP) technology, it suppresses the interference of minizone multiaerial system by the cooperation between each base station and the user, and interference alignment (Interference Alignment, IA) as in the COMP technology to a jamproof effective means, relatively traditional interference mitigation technology has demonstrated huge advantage and research potential.
Yet the channel condition information that traditional interference alignment techniques requires transmitting terminal to have the overall situation, and the needs that too do not gear to actual circumstances in theorizing; The channel condition information of imperfectization will make systematic function significantly descend, and can not reach the effect of reduce disturbance simultaneously.The defective of interference alignment techniques inherence is encouraging the development of the technology of some needs that more gear to actual circumstances.Reduce so as far as possible the computation complexity of real system, as disturbing alignment techniques research and development direction future.
The interference alignment problem of MIMO Gauss interference channel ascribes the formula of finding the solution in fact to, obtains one group of base station precoding and user's reprocessing matrix.Regrettably, solving equation group how
Remain academia's an open question.But, if having to take the second best, do not pursue accurately closed solutions, but seek a numerical solution that approaches very much, there is way to try to achieve.Numerical solution of distributed interference alignment schemes (EVD-IA method) random initializtion, utilize the reciprocity of communication system channel under the tdd mode, along with iteration between base station and the user is upgraded pre-coding matrix and reprocessing matrix, make numerical solution approach gradually accurately closed solutions, so that interference power reaches minimum, but this Technology Restriction is in 1) channel reciprocity of system, can only be operated in the communication system under the tdd mode, 2) used the Eigenvalues Decomposition algorithm of second order, made the computation complexity of whole system higher.Shortcoming for the EVD-IA method, propose alternating minimization and disturbed alignment schemes (AM-IA method), do not need to utilize the reciprocity of channel, utilize the distance between subspace-based and the matrix to be knowwhy, alternately iteration is upgraded transmitting terminal pre-coding matrix and user's interference space, so that the interference signal matrix must be aligned in interference space as far as possible, but this technical disadvantages is to have used the Eigenvalues Decomposition algorithm of second order, make the computation complexity of whole system higher, be unfavorable for that application and the hardware in real system is realized.
Summary of the invention
The technical problem that (one) will solve
The technical problem to be solved in the present invention is how in the keeping system throughput, to reduce the system-computed complexity in MIMO interference channel system.
(2) technical scheme
For solving the problems of the technologies described above, technical scheme of the present invention provides the low complex degree of a kind of MIMO interference channel system to disturb alignment schemes, it is characterized in that the method comprises:
S1: obtain other cell base stations to the interference channel matrix of this community user, and the pre-coding matrix of random initializtion base station;
S2: get user's interference covariance matrix according to described pre-coding matrix and interference channel Matrix Calculating, and then obtain receiving the orthogonal basis of interference space;
S3: the orthogonal basis according to described reception interference space upgrades pre-coding matrix, when the pre-coding matrix after upgrading does not satisfy the condition of convergence, returns step S2; Otherwise, obtain the orthogonal basis of final reception interference space according to the pre-coding matrix after the renewal of satisfying the condition of convergence;
S4: the orthogonal basis according to final reception interference space obtains the reprocessing matrix;
S5: by the reprocessing matrix signal is carried out ZF and process, the signal after the interference that is eliminated.
Described step S2 specifically comprises:
S21: the interference covariance matrix that obtains each user according to described pre-coding matrix and described interference channel matrix computations;
S22: described interference covariance matrix is decomposed, obtain the first unitary matrice;
S23: the orthogonal basis that receives interference space is classified in the appointment of choosing the first unitary matrice as.
Described step S3 specifically comprises:
S31: calculate the distance matrix between the orthogonal basis of described interference channel matrix and described reception interference space;
S32: described distance matrix is decomposed, obtain the second unitary matrice;
S33: the pre-coding matrix after the renewal is classified in the setting of choosing the second unitary matrice as;
S34: whether the pre-coding matrix that calculates after the described renewal satisfies the condition of convergence, when not satisfying the condition of convergence, replaces described pre-coding matrix with the pre-coding matrix after upgrading, and returns step S2; Otherwise, obtain the orthogonal basis of final reception interference space according to the pre-coding matrix after upgrading.
The computing formula of described interference covariance matrix is:
Wherein:
V
kBe pre-coding matrix;
K is total number of base;
K is k base station;
k
uBe k
uIndividual user.
The described condition of convergence is:
Poor matrix between pre-coding matrix after the described renewal and the described pre-coding matrix is less than setting matrix.
The computing formula of described reprocessing matrix is:
Wherein:
Be the reprocessing matrix;
d
kNumber of data streams for base station k emission.
(3) beneficial effect
The present invention has adopted according to the ordering QR decomposition algorithm based on the Gram-Schmidt method of revising and has approached Eigenvalues Decomposition algorithm in the AM-IA algorithm, and adopted loop iteration base station pre-coding matrix and received the mode of reprocessing matrix, seek one very near the numerical solution of closed solutions.At first by channel estimating, obtain this cell base station to the channel information of this community user, and other residential quarters user's in this residential quarter interference channel matrix information, and the pre-coding matrix of each base station of random initializtion; The interference channel matrix information of user in this residential quarter is arrived in pre-coding matrix and other residential quarters according to each base station, obtains each user's interference covariance matrix; Afterwards, according to each user's interference covariance matrix, according to use ordering QR decomposition algorithm based on the Gram-Schmidt method of revising, obtain the upper triangular matrix that unitary matrice and diagonal entry increase progressively; According to unitary matrice, choose the most front
Classify the orthogonal basis that receives interference space as; According to minimizing Euclid distance criterion, according to other residential quarters user's in this residential quarter interference channel matrix information with receive interference space, obtain the distance of the orthogonal basis of the interference channel matrix of each base station and interference space; Afterwards, the distance according to the orthogonal basis of the interference channel matrix of each base station and interference space according to use ordering QR decomposition algorithm based on the Gram-Schmidt method of revising, obtains the upper triangular matrix that unitary matrice and diagonal entry increase progressively; According to unitary matrice, choose last d
kClassify each new base station pre-coding matrix as; Until convergence is final, according to the orthogonal basis that receives interference space, obtain user's reprocessing matrix.Owing to used the ordering QR decomposition algorithm based on the Gram-Schmidt method of revising, the process of search order is circulated in the calculating interference channel Matrix QR Decomposition process, before orthogonalizing process each time, row to channel matrix are arranged, the criterion of choosing is exactly that the column vector of column vector Norm minimum is carried out at first QR and decomposed, therefore reduced the dimension of each subscriber channel matrix of system, thereby the SQRD-IA scheme is calculated under low dimension, effectively reduced the computation complexity of traditional AM-IA scheme.In the increase along with iterations, further increased throughput of system and receive to disturb to have significantly and reduce, and the iteration effect that substantially is consistent with traditional AM-IA scheme, thereby promoted the method feasibility in actual applications.
Description of drawings
Fig. 1 is the flow chart that the low complex degree of MIMO interference channel of the present invention system disturbs alignment schemes;
Fig. 2 is the transmission schematic diagram that the low complex degree of MIMO interference channel of the present invention system disturbs the embodiment of alignment schemes;
Fig. 3 provided system and respectively held antenna configuration (8,8,3), and K=4 is under the different signal to noise ratio conditions, based on SQRD-IA method of the present invention and the AM-IA scheme comparative graph in power system capacity;
Embodiment
For making purpose of the present invention, content and advantage clearer, embodiment of the present invention is described further in detail below in conjunction with accompanying drawing.
The low complex degree of the MIMO interference channel system that the present invention proposes disturbs alignment schemes, is described as follows in conjunction with the accompanying drawings and embodiments:
As shown in Figure 1, the present invention includes following steps:
S1: by channel estimating, obtain this cell base station to the channel matrix of this community user, and other residential quarters user's in this residential quarter interference channel matrix, and the pre-coding matrix of random initializtion base station;
The turnkey of setting up departments is drawn together K base station and K
uIndividual user, k base station transmit antennas number is M
k, the number of data streams of k base station emission is d
k, k
uIndividual user's reception antenna number is
System configuration is
K base station is to k in the system
uIndividual user's channel matrix is
K=1 ..., K; k
u=1 ..., K
u, the noise factor of system is σ, base station k transmitted signal S
k
By channel estimating, obtain this cell base station to the channel information of this community user
K=1 ..., K; k
u=1 ..., K
u; K=k
u, and the interference channel matrix information of user in this residential quarter is arrived in other residential quarters
K=1 ..., K; k
u=1 ..., K
u; K ≠ k
u, and the pre-coding matrix of each base station of random initializtion
K
uIndividual user's reception signal is
S2: get user's interference covariance matrix according to described pre-coding matrix and interference channel Matrix Calculating, and then obtain receiving the orthogonal basis of interference space;
S21: the interference covariance matrix that obtains each user according to described pre-coding matrix and described interference channel matrix computations;
Pre-coding matrix V according to each base station
kArrive the interference channel matrix information of user in this residential quarter with other residential quarters
K=1 ..., K; k
u=1 ..., K
u; K ≠ k
u, obtain each user's interference covariance matrix:
Wherein:
Be interference covariance matrix;
V
kBe pre-coding matrix;
K is total number of base;
K is k base station;
k
uBe k
uIndividual user.
S22: described interference covariance matrix is decomposed, obtain the first unitary matrice;
Interference covariance matrix according to each user
According to use ordering QR decomposition algorithm based on the Gram-Schmidt method of revising, obtain the first unitary matrice
The first upper triangular matrix that increases progressively with diagonal entry
The process of decomposing based on the ordering QR of the Gram-Schmidt method of revising comprises: based on the determinant criterion column vector in the interference covariance matrix is rearranged, allow the column vector of Norm minimum carry out at first the QR decomposition, and the Gram-Schmidt method of revising is carried out the QR decomposition to the interference covariance matrix after resequencing; Finally obtain the first unitary matrice
The first upper triangular matrix that increases progressively with diagonal entry
Program circuit based on the ordering QR decomposition algorithm of the Gram-Schmidt method of revising is:
Initialization: R=0,
Wherein:
M
kIt is the number of transmit antennas of k base station;
r
μ, μBe matrix q
μNorm;
q
μBe the remaining μ row of Q;
r
μ, vBe projection matrix;
k
μ, q
v, v and the μ intermediate variable for setting.
S23: the orthogonal basis that receives interference space is classified in the appointment of choosing the first unitary matrice as.
Because the data flow that the base station sends is d
k, for the desired signal that makes user side separates as much as possible with interference signal, user k
uInterference signal be aligned in a dimension and be at most
Linear subspaces in, choose again the first unitary matrice
The most front
Classify as and receive the orthogonal basis that disturbs linear subspaces
S3: the orthogonal basis according to described reception interference space upgrades pre-coding matrix, when the pre-coding matrix after upgrading does not satisfy the condition of convergence, returns step S2; Otherwise, obtain the orthogonal basis of final reception interference space according to the pre-coding matrix after the renewal of satisfying the condition of convergence;
S31: calculate the distance matrix between the orthogonal basis of described interference channel matrix and described reception interference space;
According to minimizing Euclid distance criterion, arrive the interference channel matrix information of user in this residential quarter according to other residential quarters
K=1 ..., K; k
u=1 ..., K
u; K ≠ k
uWith the orthogonal basis that receives the interference linear subspaces
Obtain the distance matrix of the orthogonal basis of the interference channel matrix of each base station and interference space
S32: described distance matrix is decomposed, obtain the second unitary matrice;
Distance matrix according to the orthogonal basis of the interference channel matrix of each base station and interference space
According to use ordering QR decomposition algorithm based on the Gram-Schmidt method of revising, obtain the second unitary matrice Q
kThe the second upper triangular matrix R that increases progressively with diagonal entry
k
S33: the pre-coding matrix after the renewal is classified in the setting of choosing the second unitary matrice as;
Then, be d owing to desired signal occupies reception subspace dimension
k, according to the second unitary matrice Q
k, choose the pre-coding matrix V after last dk classifies renewal as
k, computing formula is
S34: whether the pre-coding matrix that calculates after the described renewal satisfies the condition of convergence, when not satisfying the condition of convergence, replaces described pre-coding matrix with the pre-coding matrix after upgrading, and returns step S2; Otherwise, obtain the orthogonal basis of final reception interference space according to the pre-coding matrix after upgrading.
The condition of convergence is that pre-coding matrix after the described renewal and the poor matrix between the described pre-coding matrix are less than setting matrix.Set matrix and set flexibly according to actual conditions, reveal as long as satisfy to disturb
Less than 10
-8Get final product.
S4: the orthogonal basis according to final reception interference space obtains the reprocessing matrix;
Orthogonal basis according to the reception interference space after the convergence
Obtain user's reprocessing matrix:
Wherein:
d
kNumber of data streams for base station k emission.
S5: by the reprocessing matrix signal is carried out ZF and process, the signal after the interference that is eliminated.
Reach the condition of disturbing alignment by the reprocessing matrix:
The signal of eliminating after disturbing is:
So far finished the work of disturbing alignment optimizes.
In sum, the present invention proposes that low complex degree disturbs alignment schemes in a kind of MIMO interference channel system, have the advantage of low complex degree, all applicable for the system of any antenna configuration, number of users.Owing to used the ordering QR decomposition algorithm based on the Gram-Schmidt method of revising, the process of search order is circulated in the calculating interference channel Matrix QR Decomposition process, before orthogonalizing process each time, row to channel matrix are arranged, the criterion of choosing is exactly that the column vector of column vector Norm minimum is carried out at first QR and decomposed, therefore reduce the dimension of each subscriber channel matrix of system, effectively reduced the computation complexity that disturbs alignment techniques.
The below will provide the comparison of SQRD-IA scheme of the present invention and AM-IA scheme, so that advantage of the present invention and feature are more obvious.
For easy, can be similar to and think that the complexity of complex matrix operation is 6 times of real number matrix corresponding operating complexity.Wherein 1 flop is expressed as a floating-point operation.Be the real matrix of m * n to size
, the computation complexity of matrix sum operation is: 2mn (flops) is 2mnp (flops) to the computation complexity of m * n and n * p matrix multiplication, matrix norm || G||
FThe computation complexity of computing is: 4mn (flop), and for m * m be matrix, the computation complexity of the Eigenvalues Decomposition of broad sense is 4m
3/ 3+17m
3(flops), the computation complexity of QR decomposition algorithm is: 2m
3(flops), wherein, with respect to the QR decomposition method of broad sense, the row ordering of matrix Q that the operand of this algorithm is only many.Be 2m based on the computation complexity of the ordering QR decomposition algorithm of the Gram-Schmidt method of revising a little more than the QR decomposition algorithm of broad sense
3+ m (m-1)/2 (flops).
The below is more as shown in table 1 to the computation complexity of SQRD-IA scheme and AM-IA scheme.
The computation complexity of two kinds of algorithms of table 1 relatively
As shown in Table 1, compare with the interference alignment schemes of AM-IA scheme, the computation complexity of SQRD-IA scheme of the present invention has reduced by 51%, and this will be conducive to the application of method of the present invention in practical communication system.
In addition, as shown in Figure 3, at system configuration (M
k, N
k, d
k)=(8,8,3), K=4, under different signal to noise ratio conditions, the comparative graph of the power system capacity of SQRD-IA scheme of the present invention and AM-IA scheme; As can be seen from Figure, SQRD-IA scheme of the present invention is compared with the AM-IA scheme, descends slightly to some extent under the power system capacity.
As shown in Figure 4, at system configuration (M
k, N
k, d
k)=(8,8,3), K=4, under different signal to noise ratios and the condition of iterations, the system iterative convergence rate comparative graph of SQRD-IA scheme of the present invention and AM-IA scheme; As can be seen from Figure, SQRD-IA scheme of the present invention is compared with the AM-IA scheme, and two kinds of algorithmic statement speed decrease slightly before 500 iteration, and two kinds of algorithms reach convergence when 500 iteration, and performance tends towards stability and substantially is consistent;
The above only is preferred implementation of the present invention, for the those of ordinary skill of present technique, under the prerequisite that does not break away from the technology of the present invention principle, can also make some improvement and distortion, and these improvement and distortion also should be considered as protection scope of the present invention.
Claims (6)
1.MIMO the low complex degree of interference channel system disturbs alignment schemes, it is characterized in that the method comprises:
S1: obtain other cell base stations to the interference channel matrix of this community user, and the pre-coding matrix of random initializtion base station;
S2: get user's interference covariance matrix according to described pre-coding matrix and interference channel Matrix Calculating, and then obtain receiving the orthogonal basis of interference space;
S3: the orthogonal basis according to described reception interference space upgrades pre-coding matrix, when the pre-coding matrix after upgrading does not satisfy the condition of convergence, returns step S2; Otherwise, obtain the orthogonal basis of final reception interference space according to the pre-coding matrix after the renewal of satisfying the condition of convergence;
S4: the orthogonal basis according to final reception interference space obtains the reprocessing matrix;
S5: by the reprocessing matrix signal is carried out ZF and process, the signal after the interference that is eliminated.
2. method according to claim 1 is characterized in that, described step S2 specifically comprises:
S21: the interference covariance matrix that obtains each user according to described pre-coding matrix and described interference channel matrix computations;
S22: described interference covariance matrix is decomposed, obtain the first unitary matrice;
S23: the orthogonal basis that receives interference space is classified in the appointment of choosing the first unitary matrice as.
3. method according to claim 2 is characterized in that, described step S3 specifically comprises:
S31: calculate the distance matrix between the orthogonal basis of described interference channel matrix and described reception interference space;
S32: described distance matrix is decomposed, obtain the second unitary matrice;
S33: the pre-coding matrix after the renewal is classified in the setting of choosing the second unitary matrice as;
S34: whether the pre-coding matrix that calculates after the described renewal satisfies the condition of convergence, when not satisfying the condition of convergence, replaces described pre-coding matrix with the pre-coding matrix after upgrading, and returns step S2; Otherwise, obtain the orthogonal basis of final reception interference space according to the pre-coding matrix after upgrading.
4. method according to claim 2 is characterized in that, the computing formula of described interference covariance matrix is:
Wherein:
V
kBe pre-coding matrix;
K is total number of base;
K is k base station;
k
uBe k
uIndividual user.
5. method according to claim 2 is characterized in that, the described condition of convergence is:
Poor matrix between pre-coding matrix after the described renewal and the described pre-coding matrix is less than setting matrix.
6. method according to claim 2 is characterized in that, the computing formula of described reprocessing matrix is:
Wherein:
Number for reception antenna;
d
kNumber of data streams for base station k emission.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201210562491.XA CN103023544B (en) | 2012-12-21 | 2012-12-21 | Low-complexity interference alignment method of multiple input multiple output (MIMO)interference channel system |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201210562491.XA CN103023544B (en) | 2012-12-21 | 2012-12-21 | Low-complexity interference alignment method of multiple input multiple output (MIMO)interference channel system |
Publications (2)
Publication Number | Publication Date |
---|---|
CN103023544A true CN103023544A (en) | 2013-04-03 |
CN103023544B CN103023544B (en) | 2014-11-19 |
Family
ID=47971719
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201210562491.XA Expired - Fee Related CN103023544B (en) | 2012-12-21 | 2012-12-21 | Low-complexity interference alignment method of multiple input multiple output (MIMO)interference channel system |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN103023544B (en) |
Cited By (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103580745A (en) * | 2013-10-10 | 2014-02-12 | 电子科技大学 | Iteration interference alignment method |
CN103607232A (en) * | 2013-12-04 | 2014-02-26 | 西安电子科技大学 | Pre-coding optimization selection method based on interference alignment algorithm |
CN104717033A (en) * | 2013-12-13 | 2015-06-17 | 中兴通讯股份有限公司 | Precoding system and method based on interference alignment |
CN105375960A (en) * | 2015-10-30 | 2016-03-02 | 哈尔滨工程大学 | Interference alignment pre-coding method based on global projection distance |
CN106656901A (en) * | 2015-10-30 | 2017-05-10 | 展讯通信(上海)有限公司 | Anti-interference demodulation method, receiver, and mobile terminal |
CN106850020A (en) * | 2017-01-09 | 2017-06-13 | 南京邮电大学 | Combined interference alignment schemes are based under imperfect channel state in mimo system |
CN113132277A (en) * | 2019-12-31 | 2021-07-16 | 中国移动通信集团山东有限公司 | Alignment iterative calculation method and device, storage medium and computer equipment |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101877608A (en) * | 2010-06-30 | 2010-11-03 | 中兴通讯股份有限公司 | Optimized weighted CSI feeding back method and device for cooperative beam forming |
CN102388589A (en) * | 2009-06-23 | 2012-03-21 | 上海贝尔股份有限公司 | Method and apparatus for adjusting uplink and downlink reciprocity error in tdd system |
US20120087435A1 (en) * | 2010-10-06 | 2012-04-12 | Krishna Srikanth Gomadam | Enhanced channel feedback for multi-user mimo |
-
2012
- 2012-12-21 CN CN201210562491.XA patent/CN103023544B/en not_active Expired - Fee Related
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102388589A (en) * | 2009-06-23 | 2012-03-21 | 上海贝尔股份有限公司 | Method and apparatus for adjusting uplink and downlink reciprocity error in tdd system |
CN101877608A (en) * | 2010-06-30 | 2010-11-03 | 中兴通讯股份有限公司 | Optimized weighted CSI feeding back method and device for cooperative beam forming |
US20120087435A1 (en) * | 2010-10-06 | 2012-04-12 | Krishna Srikanth Gomadam | Enhanced channel feedback for multi-user mimo |
Cited By (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103580745A (en) * | 2013-10-10 | 2014-02-12 | 电子科技大学 | Iteration interference alignment method |
CN103580745B (en) * | 2013-10-10 | 2017-12-19 | 电子科技大学 | A kind of iteration interference alignment method |
CN103607232A (en) * | 2013-12-04 | 2014-02-26 | 西安电子科技大学 | Pre-coding optimization selection method based on interference alignment algorithm |
CN103607232B (en) * | 2013-12-04 | 2016-06-29 | 西安电子科技大学 | Precoding optimized choice method based on interference alignment algorithm |
CN104717033A (en) * | 2013-12-13 | 2015-06-17 | 中兴通讯股份有限公司 | Precoding system and method based on interference alignment |
CN105375960A (en) * | 2015-10-30 | 2016-03-02 | 哈尔滨工程大学 | Interference alignment pre-coding method based on global projection distance |
CN106656901A (en) * | 2015-10-30 | 2017-05-10 | 展讯通信(上海)有限公司 | Anti-interference demodulation method, receiver, and mobile terminal |
CN106656901B (en) * | 2015-10-30 | 2020-04-24 | 展讯通信(上海)有限公司 | Anti-interference demodulation method, receiver and mobile terminal |
CN106850020A (en) * | 2017-01-09 | 2017-06-13 | 南京邮电大学 | Combined interference alignment schemes are based under imperfect channel state in mimo system |
CN106850020B (en) * | 2017-01-09 | 2020-11-24 | 南京邮电大学 | Combined interference alignment method in MIMO system under non-ideal channel state |
CN113132277A (en) * | 2019-12-31 | 2021-07-16 | 中国移动通信集团山东有限公司 | Alignment iterative calculation method and device, storage medium and computer equipment |
CN113132277B (en) * | 2019-12-31 | 2022-06-28 | 中国移动通信集团山东有限公司 | Alignment iterative computation method, device, storage medium and computer equipment |
Also Published As
Publication number | Publication date |
---|---|
CN103023544B (en) | 2014-11-19 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN103023544B (en) | Low-complexity interference alignment method of multiple input multiple output (MIMO)interference channel system | |
CN105827273B (en) | The extensive mimo system user double antenna Pilot Interference removing method of multiple cell | |
CN103997775B (en) | Frequency division multiplexing multiuser MIMO efficiency optimization methods | |
CN108777855B (en) | Power distribution method and device applied to DAS and computer readable storage medium | |
EP3369187B1 (en) | Lattice reduction-aided symbol detection | |
Patcharamaneepakorn et al. | Coordinated beamforming schemes based on modified signal‐to‐leakage‐plus‐noise ratio precoding designs | |
US9807702B2 (en) | Precoding method and apparatus for heterogeneous network coordinated multi-point transmission | |
CN104168574A (en) | Uplink transmission method based on adaptable interference selection in mixed cellular system | |
Banoori et al. | Pilot contamination mitigation under smart pilot allocation strategies within massive MIMO-5G system | |
CN108012272B (en) | Interference alignment method based on dynamic power distribution in cognitive network | |
CN104506226A (en) | Cooperative femtocell-based interference suppressing precoding method in double-layer heterogeneous network | |
CN109818887A (en) | Half-blind channel estimating method based on EVD-ILSP | |
Guo et al. | Hybrid MRT and ZF Learning for Energy-Efficient Transmission in Multi-RIS-Assisted Networks | |
CN111010220B (en) | Multi-user multi-stream downlink hybrid precoding method and system based on energy efficiency | |
CN104936299A (en) | Method And Device For Processing Resource Blocks | |
CN104954055A (en) | Low-complexity efficiency optimization method of multi-user simultaneous information and power transfer system | |
CN105262526B (en) | A kind of interference alignment schemes based on minimum interference projection matrix nuclear norm | |
CN104010372A (en) | Large-scale MU-MISO system low-complexity user scheduling method | |
Zhu et al. | Subspace optimisation-based iterative interference alignment algorithm on the Grassmann manifold | |
CN114928385B (en) | Spectrum efficiency improving method based on simultaneous same-frequency full duplex D2D communication | |
CN109510650A (en) | A kind of joint method for precoding of the two-way AF MIMO relay system of multi-user | |
Zhu et al. | Interference alignment for MIMO cognitive networks: a complex FDPM-based subspace tracking approach | |
Chen | A channel estimation algorithm for large-scale MIMO system using block sparsity adaptive matching pursuit | |
Wang et al. | Joint interference mitigation approach using space‐time pilot design in large‐scale antenna systems | |
CN102891711A (en) | User selection method in multipoint coordination scene |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
C14 | Grant of patent or utility model | ||
GR01 | Patent grant | ||
CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20141119 Termination date: 20211221 |
|
CF01 | Termination of patent right due to non-payment of annual fee |