Finite-SNR Bounds on the Sum-Rate Capacity of Rayleigh Block-Fading Multiple-Access Channels with no a Priori CSI
arXiv:1501.01957 · doi:10.1109/TCOMM.2015.2466536
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.
11 pages, 5 figures, to appear in IEEE Transactions on Communications, 2015. Numerical routines implementing the bounds described in the paper can be downloaded at https://github.com/infotheorychalmers/mac_capacity_bounds
References in corpus (1)
Cited by in corpus (5)
- Throughput Analysis of Massive MIMO Uplink with Low-Resolution ADCs
- Short-Packet Communications over Multiple-Antenna Rayleigh-Fading Channels
- Towards Massive, Ultra-Reliable, and Low-Latency Wireless Communication with Short Packets
- Optimal Energy Allocation For Delay-Constrained Traffic Over Fading Multiple Access Channels
- Finite-Blocklength Bounds on the Maximum Coding Rate of Rician Fading Channels with Applications to Pilot-Assisted Transmission