On Cognitive Interference Networks
Amos Lapidoth, Shlomo Shamai (Shitz), Michele A. Wigger

TL;DR
This paper analyzes the asymptotic sum-rate capacity of multi-user interference networks with side-information, providing bounds and characterizations of when full or near-full capacity pre-log can be achieved.
Contribution
It offers a complete characterization of the pre-log behavior in interference networks with message side-information, including bounds and conditions for full pre-log.
Findings
Complete characterization of networks with full pre-log
Bounds on the pre-log based on side-information
Conditions for achieving near-full pre-log
Abstract
We study the high-power asymptotic behavior of the sum-rate capacity of multi-user interference networks with an equal number of transmitters and receivers. We assume that each transmitter is cognizant of the message it wishes to convey to its corresponding receiver and also of the messages that a subset of the other transmitters wish to send. The receivers are assumed not to be able to cooperate in any way so that they must base their decision on the signal they receive only. We focus on the network's pre-log, which is defined as the limiting ratio of the sum-rate capacity to half the logarithm of the transmitted power. We present both upper and lower bounds on the network's pre-log. The lower bounds are based on a linear partial-cancellation scheme which entails linearly transforming Gaussian codebooks so as to eliminate the interference in a subset of the receivers. Inter alias, the…
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.
