On the Capacity of the $K$-User Cyclic Gaussian Interference Channel

DOI10.1109/TIT.2012.2218215zbMATH Open1364.94493arXiv1010.1044MaRDI QIDQ2989450

Lei Zhou, Wei Yu

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: This paper studies the capacity region of a $K$-user cyclic Gaussian interference channel, where the $k$th user interferes with only the $(k-1)$th user (mod $K$) in the network. Inspired by the work of Etkin, Tse and Wang, who derived a capacity region outer bound for the two-user Gaussian interference channel and proved that a simple Han-Kobayashi power splitting scheme can achieve to within one bit of the capacity region for all values of channel parameters, this paper shows that a similar strategy also achieves the capacity region of the $K$-user cyclic interference channel to within a constant gap in the weak interference regime. Specifically, for the $K$-user cyclic Gaussian interference channel, a compact representation of the Han-Kobayashi achievable rate region using Fourier-Motzkin elimination is first derived, a capacity region outer bound is then established. It is shown that the Etkin-Tse-Wang power splitting strategy gives a constant gap of at most 2 bits in the weak interference regime. For the special 3-user case, this gap can be sharpened to 1 1/2 bits by time-sharing of several different strategies. The capacity result of the $K$-user cyclic Gaussian interference channel in the strong interference regime is also given. Further, based on the capacity results, this paper studies the generalized degrees of freedom (GDoF) of the symmetric cyclic interference channel. It is shown that the GDoF of the symmetric capacity is the same as that of the classic two-user interference channel, no matter how many users are in the network.

Full work available at URL: https://arxiv.org/abs/1010.1044

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• The Approximate Capacity Region of the Symmetric <inline-formula> <tex-math notation="LaTeX">$K$ </tex-math> </inline-formula>-User Gaussian Interference Channel With Strong Interference 👍 👎
• The Approximate Sum Capacity of the Symmetric Gaussian <inline-formula> <tex-math notation="TeX">$K$ </tex-math></inline-formula>-User Interference Channel 👍 👎
• On the Symmetric Feedback Capacity of the $K$-User Cyclic Z-Interference Channel 👍 👎
• Capacity of the discrete-time Gaussian channel with intersymbol interference 👍 👎
• Capacity Bounds for the $K$ -User Gaussian Interference Channel 👍 👎
• Capacity Bounds for the Gaussian Interference Channel 👍 👎
• On the Capacity of Symmetric M-User Gaussian Interference Channels With Feedback 👍 👎
• Achievable Rates for $K$-User Gaussian Interference Channels 👍 👎
• Inner and Outer Bounds for the Gaussian Cognitive Interference Channel and New Capacity Results 👍 👎

This page was built for publication: On the Capacity of the $K$-User Cyclic Gaussian Interference Channel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989450)