2011 IEEE International Symposium on Information Theory Proceedings 2011
DOI: 10.1109/isit.2011.6034148
|View full text |Cite
|
Sign up to set email alerts
|

Degrees of freedom region for an interference network with general message demands

Abstract: We consider a single hop interference network with K transmitters and J receivers, all having M antennas. Each transmitter emits an independent message and each receiver requests an arbitrary subset of the messages. This generalizes the well-known K-user M -antenna interference channel, where each message is requested by a unique receiver. For our setup, we derive the degrees of freedom (DoF) region. The achievability scheme generalizes the interference alignment schemes proposed by Cadambe and Jafar. In parti… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
18
0

Year Published

2012
2012
2017
2017

Publication Types

Select...
5
4

Relationship

1
8

Authors

Journals

citations
Cited by 17 publications
(18 citation statements)
references
References 32 publications
0
18
0
Order By: Relevance
“…The concept of this signal space alignment has been successfully adapted to various network environments, e.g., see [10], [12]- [18] and the references therein. It was shown in [19], [20] that interference alignment can also be attained on fixed (not time-varying) interference channels.…”
Section: A Related Work 1) Degrees Of Freedommentioning
confidence: 99%
See 1 more Smart Citation
“…The concept of this signal space alignment has been successfully adapted to various network environments, e.g., see [10], [12]- [18] and the references therein. It was shown in [19], [20] that interference alignment can also be attained on fixed (not time-varying) interference channels.…”
Section: A Related Work 1) Degrees Of Freedommentioning
confidence: 99%
“…Figure 7 illustrates the channel space partitioning with respect to h i,j ∈ C. We can define Q 2 and A 2 (Q) for the second hop as the same manner in (18) and (19) by substituting A ∈ ∆(Z 2×2M + Z 2×2M ) and A ∈ C 2×2M , respectively. We will only use the first-hop channel instances in ∪ Q∈Q1 A 1 (Q) and the second-hop channel instances in ∪ Q∈Q2 A 2 (Q) for transmission.…”
Section: ) Partitioning and Pairing Of Channel Spacementioning
confidence: 99%
“…The concept of this signal space alignment has been successfully adapted to various network environments, e.g., see [11]- [13], [21]- [25] and the references therein. It was shown in [26], [27] that IA can also be attained on fixed (not time-varying) channel coefficients.…”
Section: B Previous Workmentioning
confidence: 99%
“…As it turns out, joint processing at one end, e.g., at the receivers in a SIMO X network, allows a larger space within which the desired signals can be resolved more efficiently from the interference. The use of the CJ scheme for achievability is significant because the same scheme often translates into the rational dimensions framework to establish corresponding DoF results in static settings (see, e.g., [3,12,13]). Indeed, the DoF results of this paper have been recently extended to constant settings by Zamanighomi and Wang in [14].…”
Section: Summary Of Contributionmentioning
confidence: 99%