Finite-SNR Bounds on the Sum-Rate Capacity of Rayleigh Block-Fading Multiple-Access Channels With No A Priori CSI
Finite-SNR Bounds on the Sum-Rate Capacity of Rayleigh Block-Fading Multiple-Access Channels With No A Priori CSI
复制标题
DOI：
10.1109/tcomm.2015.2466536
复制
发表时间：
2015-01
影响因子：
8.3
通讯作者：
Rahul Devassy;G. Durisi;Johan Östman;Wei Yang;T. Eftimov;Zoran Utkovski
中科院分区：
文献类型：
--
作者：
Rahul Devassy;G. Durisi;Johan Östman;Wei Yang;T. Eftimov;Zoran Utkovski
在先验信道状态信息不可用的情况下，给出了瑞利块衰落多址信道和速率容量的非渐近上界和下界。上界依赖于信道容量的对偶公式和用户可以完美合作的假设。假设每个用户使用统一时空调制（独立于其他用户）的非合作场景，推导出下界。数值结果表明，在中等信噪比条件下，上界和下界之间的差距已经很小。这表明，在本文考虑的场景中，通过用户合作获得的总速率容量增益是最小的。
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.