Finite-SNR Bounds on the Sum-Rate Capacity of Rayleigh Block-Fading Multiple-Access Channels with no a Priori CSI
Rahul Devassy, Giuseppe Durisi, Johan \"Ostman, Wei Yang, Tome, Eftimov, Zoran Utkovski

TL;DR
This paper derives finite-SNR bounds on the sum-rate capacity of Rayleigh block-fading multiple-access channels without prior CSI, showing minimal gains from user cooperation at moderate SNRs.
Contribution
It provides the first nonasymptotic bounds on sum-rate capacity for no-CSI Rayleigh MACs, highlighting the limited benefit of cooperation.
Findings
Upper and lower bounds are close at moderate SNRs.
User cooperation offers minimal capacity gains.
Bounds are derived using dual capacity formulas and space-time modulation.
Abstract
We provide nonasymptotic upper and lower bounds on the sum-rate capacity of Rayleigh block-fading multiple-access channels for the setup where a priori channel state information is not available. The upper bound relies on a dual formula for channel capacity and on the assumption that the users can cooperate perfectly. The lower bound is derived assuming a noncooperative scenario, where each user employs unitary space-time modulation (independently from the other users). Numerical results show that the gap between the upper and the lower bound is small already at moderate SNR values. This suggests that the sum-rate capacity gains obtainable through user cooperation are minimal.
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.
