The platform will undergo maintenance on Sep 14 at about 9:30 AM EST and will be unavailable for approximately 1 hour.
2009 IEEE/SP 15th Workshop on Statistical Signal Processing 2009
DOI: 10.1109/ssp.2009.5278586
|View full text |Cite
|
Sign up to set email alerts
|

On the achievability of interference alignment in the K-user constant MIMO interference channel

Abstract: Interference alignment in the K-user MIMO interference channel with constant channel coefficients is considered. A novel constructive method for finding the interference alignment solution is proposed for the case where the number of transmit antennas equals the number of receive antennas (NT = NR = N ), the number of transmitter-receiver pairs equals K = N + 1, and all interference alignment multiplexing gains are one. The core of the method consists of solving an eigenvalue problem that incorporates the chan… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

2
134
0

Year Published

2011
2011
2019
2019

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 114 publications
(137 citation statements)
references
References 5 publications
2
134
0
Order By: Relevance
“…For instance, in [5], all Rx have 2 antennas. In [6], all nodes have (K + 1) antennas. And in [7], there are only 2 Rxs in the network.…”
Section: Introductionmentioning
confidence: 99%
“…For instance, in [5], all Rx have 2 antennas. In [6], all nodes have (K + 1) antennas. And in [7], there are only 2 Rxs in the network.…”
Section: Introductionmentioning
confidence: 99%
“…This technique has been shown to achieve the DoFs for a range of interference channels [5,7,28]. Finding out the exact number of needed dimensions and the precoding vectors to achieve IA is a cumbersome task but a number of approaches have been presented in the literature for this purpose [21,66,75]. The IA technique was also investigated in the context of cellular networks, showing that it can effectively suppress cochannel interference [9,15,64,66].…”
Section: Classification Of Ia Techniquesmentioning
confidence: 99%
“…Finding out the exact number of needed dimensions and the precoding vectors to achieve IA is a cumbersome task but a number of approaches have been presented in the literature for this purpose [21,66,75]. The IA technique was also investigated in the context of cellular networks, showing that it can effectively suppress cochannel interference [9,15,64,66]. More specifically, the downlink of orthogonal frequency division multiple access (OFDMA) cellular network with clustered multicell processing is considered in [15], where IA is employed to suppress intracluster interference while intercluster interference has to be tolerated as noise.…”
Section: Classification Of Ia Techniquesmentioning
confidence: 99%
“…One must note that, by considering that the channel coefficients in H jk are identically and independently distributed, the existence of a solution for the above IA problem solely depends on the dimensions of the problem (|S|,N t ,N r ) as discussed in [12]. For instance, when the target multiplexing gain d i at the FUE is equal to one, a solution to the system (3) exists for the interference channel composed by |S| − 1 interfering transmissions plus the useful signal if and only if…”
Section: Introductionmentioning
confidence: 99%
“…Moreover, to find the precoding and interference suppression matrices one can use existing iterative algorithms such as in [13,Algorithm 1], [12]. Therefore, the interference from members of the same coalition can be suppressed, yielding, after projection, the following signal at receiver k:…”
Section: Introductionmentioning
confidence: 99%