The Approximate Sum Capacity of the Symmetric Gaussian <inline-formula> <tex-math notation="TeX">K </tex-math></inline-formula>-User Interference Channel

DOI10.1109/TIT.2014.2316136MaRDI QIDQ2986336zbMATH OpenOpenAlexFDO

Authors Or Ordentlich, Uri Erez, Bobak Nazer

Publication date 16 May 2017

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

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

Mathematics Subject Classification ID

Communication theory (94A05) Information theory (general) (94A15) Channel models (including quantum) in information and communication theory (94A40)

Abstract: Interference alignment has emerged as a powerful tool in the analysis of multi-user networks. Despite considerable recent progress, the capacity region of the Gaussian K-user interference channel is still unknown in general, in part due to the challenges associated with alignment on the signal scale using lattice codes. This paper develops a new framework for lattice interference alignment, based on the compute-and-forward approach. Within this framework, each receiver decodes by first recovering two or more linear combinations of the transmitted codewords with integer-valued coefficients and then solving these equations for its desired codeword. For the special case of symmetric channel gains, this framework is used to derive the approximate sum capacity of the Gaussian interference channel, up to an explicitly defined outage set of the channel gains. The key contributions are the capacity lower bounds for the weak through strong interference regimes, where each receiver should jointly decode its own codeword along with part of the interfering codewords. As part of the analysis, it is shown that decoding K linear combinations of the codewords can approach the sum capacity of the K-user Gaussian multiple-access channel up to a gap of no more than K log(K)/2 bits.

Cited in

(9)

• Number theory meets wireless communications: an introduction for dummies like us
• Characterizing the performance of wireless communication architectures via basic Diophantine approximation bounds
• Nested linear/lattice codes revisited
• Noisy-Interference Sum-Rate Capacity for Vector Gaussian Interference Channels
• On the Capacity of the K-User Cyclic Gaussian Interference Channel
• Symmetric capacity and signal design for L-out-of-K symbol-synchronous CDMA Gaussian channels
• On the Capacity of Symmetric M-User Gaussian Interference Channels With Feedback
• Sum Capacity of a Class of Symmetric SIMO Gaussian Interference Channels Within $ {\cal O}(1)$
• Noisy-Interference Sum-Rate Capacity of Parallel Gaussian Interference Channels

This page was built for publication: The Approximate Sum Capacity of the Symmetric Gaussian <inline-formula> <tex-math notation="TeX">$K$ </tex-math></inline-formula>-User Interference Channel

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