Journal ArticleDOI
The capacity of the Gaussian interference channel under strong interference (Corresp.)
Reads0
Chats0
TLDR
The capacity region of a Gaussian interference channel with two separate messages is obtained for the case of moderately strong interference and it is shown that the region coincides with the one where both messages are required in both receiving terminals.Abstract:
The capacity region of a Gaussian interference channel with two separate messages is obtained for the case of moderately strong interference. It is shown that the region coincides with the one where both messages are required in both receiving terminals.read more
Citations
More filters
Proceedings ArticleDOI
Gaussian Z-interference channel with a relay link: Achievable rate region and asymptotic sum capacity
TL;DR: This paper studies a Gaussian Z-interference channel with a rate-limited digital relay link from the interference-free receiver to the interfered receiver and proposes a partial interference-forwarding relaying strategy based on a combination of the Han-Kobayashi common-private information splitting technique and a partial blocking strategy.
Posted Content
Coding Schemes and Asymptotic Capacity of the Gaussian Broadcast and Interference Channels with Feedback
TL;DR: A coding scheme is proposed for the memoryless Gaussian broadcast channel with correlated noises and feedback and it is demonstrated that if the noise variances are equal, then feedback is useless, and otherwise, feedback affords unbounded rate gains and doubles the prelog.
Proceedings ArticleDOI
Adaptive Sum Power Iterative Waterfilling for MIMO Cognitive Radio Channels
TL;DR: This paper concludes by providing numerical results which demonstrate that the algorithm takes very few iterations to converge to the optimum, and a specialized class of sum power iterative waterfilling algorithms is determined that exploits the inherent structure of the sum capacity problem.
Journal ArticleDOI
Sum Secure Degrees of Freedom of Two-Unicast Layered Wireless Networks
Jianwei Xie,Sennur Ulukus +1 more
TL;DR: This paper considers the setting where, in addition to being reliably transmitted, each message is required to be kept information-theoretically secure from the unintended receiver, and shows that the sum secure d.o.f. can only take one of five possible values: 0, 2/3, 1, 3/2, 2, for all network configurations.
Proceedings ArticleDOI
Outer bound and noisy-interference sum-rate capacity for symmetric Gaussian interference channels
TL;DR: It is shown that if the channel coefficients and power constraints satisfy a simple condition then single-user detection at each receiver is sum-rate optimal, i.e., treating the interference as noise incurs no loss in performance.
References
More filters
Journal ArticleDOI
Interference channels
TL;DR: General bounds on the capacity region are obtained for discrete memoryless interference channels and for linear-superposition interference channels with additive white Gaussian noise.
Journal ArticleDOI
A case where interference does not reduce capacity (Corresp.)
TL;DR: In this paper, it was shown that under certain conditions, two strongly interfering communication links with additive white Gaussian noise can achieve rates as high as would be achievable without this interference.
Journal ArticleDOI
The Capacity Region of a Channel with Two Senders and Two Receivers
TL;DR: In this paper, a characterization of the capacity region of a two-way channel is given for the communication situation, in which both senders send independent messages simultaneously to both receivers and all senders and receivers are at different terminals.
Journal ArticleDOI
Two-user communication channels
TL;DR: Degraded two-user channels are introduced and studied in detail; in particular, an achievable region is obtained by combining two regions that correspond to the two different modes of transmission.