A New Sum-Rate Outer Bound for Interference Channels with Three Source-Destination Pairs
Daniela Tuninetti

TL;DR
This paper introduces a new sum-rate outer bound for three-user interference channels, extending existing methods and outperforming previous bounds in specific Gaussian channel scenarios.
Contribution
It generalizes techniques for two-user channels to three-user interference channels, providing a tighter outer bound for certain Gaussian cases.
Findings
Outperforms existing bounds for some Gaussian channel parameters
Extends two-user techniques to three-user interference channels
Provides a new theoretical limit for sum-rate capacity
Abstract
This paper derives a novel sum-rate outer bound for the general memoryless interference channel with three users. The derivation is a generalization of the techniques developed by Kramer and by Etkin et al for the Gaussian two-user channel. For the three-user Gaussian channel the proposed sum-rate outer bound outperforms known bounds for certain channel parameters.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsWireless Communication Security Techniques · Cooperative Communication and Network Coding · Advanced MIMO Systems Optimization
