We provide nonasymptotic upper and lower bounds on the sum-rate capacity of Rayleigh block-fading multiple-access channels for the set up 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 for the scenarios considered in the paper.
引用
收藏
页码:3621 / 3632
页数:12
相关论文
共 27 条
[1]
Abramowitz M., 1972, Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, Vtenth