Interference, cooperation and connectivity &amp;#x2014; A degrees of freedom perspective

Wang, Chenwei; Jafar, Syed A.; Shamai, Shlomo; Wigger, Michèle

doi:10.1109/isit.2011.6034162

Cited by 11 publications

(11 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Combining (24) and (25) establishes the desired lemma. The Cognitive MAC is obtained from the original network by revealing the genie-information V 0 , .…”

Section: Then the Multiplexing Gain Of The Network Is Upper Bounded Asmentioning

confidence: 63%

Cognitive Wyner Networks With Clustered Decoding

Lapidoth

Levy

Shamai

et al. 2014

IEEE Trans. Inform. Theory

Self Cite

View full text Add to dashboard Cite

We study an interference network where equally-numbered transmitters and receivers lie on two parallel lines, each transmitter opposite its intended receiver. We consider two short-range interference models: the "asymmetric network," where the signal sent by each transmitter is interfered only by the signal sent by its left neighbor (if present), and a "symmetric network," where it is interefered by both its left and its right neighbors. Each transmitter is cognizant of its own message, the messages of the t ℓ transmitters to its left, and the messages of the t r transmitters to its right. Each receiver decodes its message based on the signals received at its own antenna, at the r ℓ receive antennas to its left, and the r r receive antennas to its right.For such networks we provide upper and lower bounds on the multiplexing gain, i.e., on the high-SNR asymptotic logarithmic growth of the sum-rate capacity. In some cases our bounds meet, e.g., for the asymmetric network.Our results exhibit an equivalence between the transmitter side-information parameters t ℓ , t r and the receiver side-information parameters r ℓ , r r in the sense that increasing/decreasing t ℓ or t r by a positive integer δ has the same effect on the prelog as increasing/decreasing r ℓ or r r by δ. Moreover-even in asymmetric networks-there is an equivalence between the left side-information parameters t ℓ , r ℓ and the right side-information parameters t r , r r .

show abstract

“…Combining (24) and (25) establishes the desired lemma. The Cognitive MAC is obtained from the original network by revealing the genie-information V 0 , .…”

Section: Then the Multiplexing Gain Of The Network Is Upper Bounded Asmentioning

confidence: 63%

Cognitive Wyner Networks With Clustered Decoding

Lapidoth

Levy

Shamai

et al. 2014

IEEE Trans. Inform. Theory

Self Cite

View full text Add to dashboard Cite

show abstract

“…For simplicity, we use the term CoMP channel to denote the interference channel with CoMP transmission and CoMP reception. In [8], a potential application for studying such a channel is presented. Consider a three-hop wireless network scenario with the interference channel at the center forming a bottleneck.…”

Section: Degrees Of Freedom Of Interference Channels With Comp Transmmentioning

confidence: 99%

“…Special cases of the CoMP channel have been studied in the past under different names such as cognitive interference channel [25]- [29], interference channel with local or partial side information [30], [31], interference channel with clustered decoding [8], or a combination of these terms [32]. However, the DoF of the CoMP channel has not been determined except in some special cases.…”

Section: Related Workmentioning

confidence: 99%

“…The best outer bound on that can be found using Theorem 1 is obtained by solving the linear program subject to the constraints (5), given by for every such that . Since the transmit sets (3) and receive sets (4) are symmetric across the transmitter and receiver indices, by appropriately averaging the aforementioned upper bound by fixing , and rotating the sets and , we obtain the following upper bound on the normalized sum DoF: (8) Therefore, the objective is to choose the sets and so that the ratio on the RHS of the aforementioned inequality is minimized.…”

Section: B Outer Bound On Sum Dofmentioning

confidence: 99%

See 1 more Smart Citation

Degrees of Freedom of Interference Channels With CoMP Transmission and Reception

Annapureddy

Gamal

Veeravalli

2012

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

We study the degrees of freedom (DoF) of the K-user interference channel with coordinated multipoint (CoMP) transmission and reception. Each message is jointly transmitted by M t successive transmitters, and is jointly received by M r successive receivers. We refer to this channel as the CoMP channel with a transmit cooperation order of M t and receive cooperation order of M r . Since the channel has a total of K transmit antennas and K receive antennas, the maximum possible DoF is equal to K. We show that the CoMP channel has K DoF if and only if M t + M r K + 1. The key idea is that the zero forcing of the interference corresponding to the ith message at the decoder of the jth message, where j 6 = i, can be viewed as a shared responsibility between the M t transmitters carrying the ith message, and the M r receivers decoding the jth message. For the general case, we derive an outer bound that states that the DoF is bounded above by d(K + Mt + Mr 0 2)=2e. For the special case with only CoMP transmission, i.e, Mr = 1, we propose a scheme that can achieve (K +Mt 01)=2 DoF for all K < 10, and conjecture that the result holds true for all K. In the proposed coding scheme, the Mt transmitters carrying each message are used to cancel the interference introduced by this message at the first Mt 0 1 receivers, thereby allowing each of these receivers to enjoy 1 DoF, and asymptotic interference alignment is used to align the interfering signals at each other receiver to occupy half the signal space. The achievability proofs are based on the notion of algebraic independence from algebraic geometry.

show abstract

“…Some other studies considering the node position distributions and signal attenuation can be found in [27] and [28].…”

Section: Introductionmentioning

confidence: 99%

On the Interference Management for K-user Partially Connected Fading Interference Channels

Khatiwada

Choi

2012

IEEE Trans. Commun.

View full text Add to dashboard Cite

The multiplexing gain (MUXG) of the K-user interference channel (IC) with partially connected interfering links is analyzed. The motivation for the partially connected IC comes from the fact that not all interferences are equally strong in practice. We introduce the idea of the graphical representation of interference alignment (IA) condition. We show that for a K-user partially connected MIMO IC with M antennas at each transmitter and receiver, the transmit beamforming matrices achieving the MUXG of KM 2 can be generated sequentially almost surely if the interference channel has a graphical representation which follows certain criteria. We also present a novel scheme, where we use the idea of partially connected IC to obtain improvements in conventional distributed interference alignment algorithm for fully connected IC. The improvements are obtained in terms of greater average sum-rate and faster convergence.Index Terms-Interference management, interference alignment, partially connected interference channels, fading interference channels.

show abstract

Interference, cooperation and connectivity — A degrees of freedom perspective

Cited by 11 publications

References 8 publications

Cognitive Wyner Networks With Clustered Decoding

Cognitive Wyner Networks With Clustered Decoding

Degrees of Freedom of Interference Channels With CoMP Transmission and Reception

On the Interference Management for K-user Partially Connected Fading Interference Channels

Contact Info

Product

Resources

About