Ergodic Layered Erasure One-Sided Interference Channels
Vaneet Aggarwal, Lalitha Sankar, A. Robert Calderbank, H., Vincent Poor

TL;DR
This paper derives the sum capacity for layered erasure one-sided interference channels without transmitter channel state information, providing tight bounds for various interference regimes based on fading statistics.
Contribution
It introduces outer bounds for the sum capacity and proves their tightness for multiple interference subclasses defined by fading characteristics.
Findings
Outer bounds are tight for weak interference.
Outer bounds are tight for strong and ergodic very strong interference.
The results depend on specific fading statistics.
Abstract
The sum capacity of a class of layered erasure one-sided interference channels is developed under the assumption of no channel state information at the transmitters. Outer bounds are presented for this model and are shown to be tight for the following sub-classes: i) weak, ii) strong (mix of strong but not very strong (SnVS) and very strong (VS)), iii) ergodic very strong (mix of strong and weak), and (iv) a sub-class of mixed interference (mix of SnVS and weak). Each sub-class is uniquely defined by the fading statistics.
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
TopicsCooperative Communication and Network Coding · Advanced MIMO Systems Optimization · Advanced Wireless Communication Techniques
