A Novel Transmission Scheme for the $K$-user Broadcast Channel with Delayed CSIT
Chao He, Sheng Yang, Pablo Piantanida

TL;DR
This paper introduces a new, simple transmission scheme for the $K$-user broadcast channel with delayed CSIT, achieving capacity in symmetric erasure channels and outperforming existing methods at finite SNR.
Contribution
It proposes a novel, easy-to-evaluate transmission scheme that achieves the capacity region for symmetric erasure BCs and improves finite SNR performance for fading Gaussian BCs.
Findings
Achieves the capacity region of symmetric erasure BCs.
Attains optimal degrees of freedom at high SNR.
Outperforms existing schemes in finite SNR regimes.
Abstract
The state-dependent -user memoryless Broadcast Channel~(BC) with state feedback is investigated. We propose a novel transmission scheme and derive its corresponding achievable rate region, which, compared to some general schemes that deal with feedback, has the advantage of being relatively simple and thus is easy to evaluate. In particular, it is shown that the capacity region of the symmetric erasure BC with an arbitrary input alphabet size is achievable with the proposed scheme. For the fading Gaussian BC, we derive a symmetric achievable rate as a function of the signal-to-noise ratio~(SNR) and a small set of parameters. Besides achieving the optimal degrees of freedom at high SNR, the proposed scheme is shown, through numerical results, to outperform existing schemes from the literature in the finite SNR regime.
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 · Cellular Automata and Applications
