Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the Sum Capacity of Many-to-one and One-to-many Gaussian Interference Channels

Published 18 Jan 2017 in cs.IT and math.IT | (1701.04971v4)

Abstract: We obtain new sum capacity results for the Gaussian many-to-one and one-to-many interference channels in channel parameter regimes where the sum capacity was known only up to a constant gap. Simple Han-Kobayashi (HK) schemes, i.e., HK schemes with Gaussian signaling, no time-sharing, and no common-private power splitting, achieve sum capacity under the channel conditions for which the new results are obtained. To obtain sum capacity results, we show that genie-aided upper bounds match the achievable sum rate of simple HK schemes under certain channel conditions.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.