2011
DOI: 10.1109/tit.2011.2142270
|View full text |Cite
|
Sign up to set email alerts
|

A Distributed Numerical Approach to Interference Alignment and Applications to Wireless Interference Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

4
1,055
0
5

Year Published

2014
2014
2024
2024

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 821 publications
(1,094 citation statements)
references
References 27 publications
4
1,055
0
5
Order By: Relevance
“…Then, we show that the proposed method indeed achieves the optimal multiuser diversity gain KM log(SNR log N) provided that the two thresholds are properly determined and the number of per-cell MSs, N, is greater than a certain level SNR KM−L 1− for a small constant > 0, where SNR denotes the signal-to-noise ratio (SNR). Note that the the multiuser diversity can be achieved in the presence of intra-cell and inter-cell interference in a distributed manner, operating based on local CSI at each MS as in [10]. Simulation results show that the proposed method outperforms two distributed baseline schemes in terms of sum-rates under practical network environments.…”
Section: Contributionsmentioning
confidence: 99%
See 1 more Smart Citation
“…Then, we show that the proposed method indeed achieves the optimal multiuser diversity gain KM log(SNR log N) provided that the two thresholds are properly determined and the number of per-cell MSs, N, is greater than a certain level SNR KM−L 1− for a small constant > 0, where SNR denotes the signal-to-noise ratio (SNR). Note that the the multiuser diversity can be achieved in the presence of intra-cell and inter-cell interference in a distributed manner, operating based on local CSI at each MS as in [10]. Simulation results show that the proposed method outperforms two distributed baseline schemes in terms of sum-rates under practical network environments.…”
Section: Contributionsmentioning
confidence: 99%
“…This is because network coordination is difficult in practical systems assuming not only no information exchange among BSs but also local channel state information (CSI) at the transmitters. In [10], a distributed interference alignment (IA) technique was proposed for the K-user MIMO interference channel, where each transmitter adopts the beamforming vector such that the generating interference to other receivers is minimized except for its own receiver and each receiver adopts the beamforming vector such that the received interference from other transmitters is minimized except for its own transmitter. However, the distributed IA technique requires an iterative beamformer optimization for data transmission.…”
Section: Previous Workmentioning
confidence: 99%
“…IA algorithms used for estimating the precoding/decoding vectors (e.g., [8], [9]) are compute intensive as they involve multiple eigen-vector calculations and matrix multiplications. These calculations need to be performed in a fraction of the channel coherence time T c (defined as the duration over which the impulse response is considered to be time invariant) so that the estimated precoding/decoding vectors are reusable for the remaining time of the coherence time.…”
Section: Computational Complexity and Communication Delaymentioning
confidence: 99%
“…Distributed IA Algorithm: We now present an iterative IA algorithm [8] for which our framework provides computing infrastructure to support its distributed capabilities. This algorithm is computationally intensive as it involves multiple matrix and eigen-vector calculations.…”
Section: Distributed Computing Frameworkmentioning
confidence: 99%
“…Several iterative algorithms in the literature have focused on finding the alignment solutions numerically. The motivation for an iterative approach in [22] is to achieve IA with only local channel knowledge, by exploiting the two way nature of communication and the reciprocal nature of the physical propagation medium. The alternating minimization approach proposed in [49] uses similar distributed IA but does not explicitly assume channel reciprocity.…”
Section: Classification Of Ia Techniquesmentioning
confidence: 99%