Sum-capacity of a class of K-user Gaussian interference channels within O(K) bits

Suvarup Saha*, Randall A. Berry

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Scopus citations

Abstract

Though the capacity of the 2-user Gaussian interference channel has long eluded information theorists, recent progress has been made by focussing on approximations with provable bounds. However, extensions to a general K-user network has proven to be non-obvious, in particular due to the role of interference alignment in these cases. In this paper, we look at a special case of a K-user Gaussian interference network where only one of the users interferes with and is also interfered by all the other users. We determine the sum-capacity of such a network within O(K) bits for all possible values of the channel parameters, provided the direct signal is stronger than the receiver noise.

Original languageEnglish (US)
Title of host publication2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011
Pages847-854
Number of pages8
DOIs
StatePublished - 2011
Event2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011 - Monticello, IL, United States
Duration: Sep 28 2011Sep 30 2011

Publication series

Name2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011

Other

Other2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011
Country/TerritoryUnited States
CityMonticello, IL
Period9/28/119/30/11

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Control and Systems Engineering

Fingerprint

Dive into the research topics of 'Sum-capacity of a class of K-user Gaussian interference channels within O(K) bits'. Together they form a unique fingerprint.

Cite this