pith. machine review for the scientific record. sign in

arxiv: 1501.01957 · v3 · submitted 2015-01-08 · 💻 cs.IT · math.IT

Recognition: unknown

Finite-SNR Bounds on the Sum-Rate Capacity of Rayleigh Block-Fading Multiple-Access Channels with no a Priori CSI

Authors on Pith no claims yet
classification 💻 cs.IT math.IT
keywords capacityboundlowersum-rateupperblock-fadingboundschannel
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.