Rate enhancement for the Gaussian Z-interference channel with transmitter cooperation

Authors:
Dae-Won Seo;Sang-Woon Jeon;Sae-Young Chung;Junmo Kim
Affiliations:
Department of Electrical Engineering, KAIST, Daejeon, South Korea;Department of Electrical Engineering, KAIST, Daejeon, South Korea;Department of Electrical Engineering, KAIST, Daejeon, South Korea;Department of Electrical Engineering, KAIST, Daejeon, South Korea
Venue:
IEEE Communications Letters
Year:
2010

Citing 10
Cited 0

Gaussian interference networks: sum capacity in the low-interference regime and new outer bounds on the capacity region

IEEE Transactions on Information Theory
Cognitive radio: an information-theoretic perspective

IEEE Transactions on Information Theory
Bounds and capacity results for the cognitive Z-interference channel

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
On achievable rate regions for the Gaussian interference channel

IEEE Transactions on Information Theory
Achievable rates in cognitive radio channels

IEEE Transactions on Information Theory
Capacity of Interference Channels With Partial Transmitter Cooperation

IEEE Transactions on Information Theory
Capacity of a Class of Cognitive Radio Channels: Interference Channels With Degraded Message Sets

IEEE Transactions on Information Theory
Sum Capacity of One-Sided Parallel Gaussian Interference Channels

IEEE Transactions on Information Theory
On The Han–Kobayashi Region for theInterference Channel

IEEE Transactions on Information Theory
Gaussian Interference Channel Capacity to Within One Bit

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a two-user Gaussian Z-interference channel in which only one-sided interference exists. We assume that there is a one-sided conferencing link from the interfering transmitter to the other, which can be used to mitigate the interference. We propose a cooperative transmission scheme that delivers a part of the interfering message through the conferencing link and then applies the dirty paper coding by regarding the delivered message as a known transmit side information. We characterize its achievable rate region for general channel coefficients and show that a finite-rate conferencing can improve both achievable rate region and its sum rate.