Capacity per Unit-Energy of Gaussian Random Many-Access Channels

Capacity per Unit-Energy of Gaussian Random Many-Access Channels
复制标题

高斯随机多址信道的单位能量容量

DOI:
--
复制
发表时间:
2020
期刊:
International Symposium on Information Theory
影响因子:
--
通讯作者:
T. Koch
T. Koch
中科院分区:
--
文献类型:
--
作者:
Jithin Ravi;T. Koch

文献摘要

参考文献

被引文献

相似文献

我们考虑一个高斯多址接入信道与随机用户活动的用户总数n<inf>n</inf>和活跃用户的平均数k<inf>n</inf>可能是无界的。对于这个通道,我们表征的最大数量的位,可以可靠地传输每单位能量的方面<inf>的n</inf>和k<inf>n</inf>。我们表明,如果k<inf>n</inf> log n<inf>n</inf>是次线性的n,那么每个用户可以实现每单位能量的单用户容量。相反,如果k<inf>n</inf> log n<inf>n</inf>在n中是超线性的,那么单位能量的容量为零。我们进一步证明,当所有用户以概率1活跃时为最佳的正交接入方案可能是严格次优的。
We consider a Gaussian multiple-access channel with random user activity where the total number of users ℓ<inf>n</inf> and the average number of active users k<inf>n</inf> may be unbounded. For this channel, we characterize the maximum number of bits that can be transmitted reliably per unit-energy in terms of ℓ<inf>n</inf> and k<inf>n</inf>. We show that if k<inf>n</inf> log ℓ<inf>n</inf> is sublinear in n, then each user can achieve the single-user capacity per unit-energy. Conversely, if k<inf>n</inf> log ℓ<inf>n</inf> is superlinear in n, then the capacity per unit-energy is zero. We further demonstrate that orthogonal-access schemes, which are optimal when all users are active with probability one, can be strictly suboptimal.
通过高斯不等式改进高斯 MAC 和稀疏回归的界限
DOI: 10.1109/isit.2019.8849764
发表时间: 2019
期刊: IEEE Int. Symp. Inf. Theory (ISIT
影响因子: --
作者:
Zadik, I.;Polyanskiy, Y.;Thrampoulidis, C.
通讯作者: Thrampoulidis, C.
DOI: 10.1109/tit.2021.3091423
发表时间: 2021-09-01
影响因子: 2.5
作者:
Kowshik, Suhas S.;Polyanskiy, Yury
通讯作者: Polyanskiy, Yury