arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1912.04483cs.ITmath.IT
收藏

有限正交前传云无线接入网容量域研究

On the Capacity Regions of Cloud Radio Access Networks with Limited Orthogonal Fronthaul

Shouvik Ganguly, Seung-Eun Hong, Young-Han Kim

摘要:

上行链路和下行链路云无线电接入网络被建模为两跳K用户L中继网络,由此小型基站充当用于端到端通信的中继,并且经由有限容量的正交前传链路连接到中央处理器。提出了网络压缩转发(或噪声网络编码)和分布式解码转发的简化版本,以在上行链路和下行链路通信的容量区域上建立内部边界,其将相应的割集边界匹配到独立于信道增益和信噪比的有限间隙内。然后将这些近似容量区域与前传上没有容量限制的网络的容量区域进行比较。虽然它需要无限的前传链路容量,以达到这些“前传无限”的容量区域,这些容量区域可以近似地接近有限容量的前传。表征了接近前传无限和速率(对于上行链路和下行链路)所需的总前传链路容量。在此基础上,通过理论分析和仿真,建立了在一定的上下行网络模型下,大网络规模限制下的容量缩放定律。

英文摘要:

Uplink and downlink cloud radio access networks are modeled as two-hop K-user L-relay networks, whereby small base-stations act as relays for end-to-end communications and are connected to a central processor via orthogonal fronthaul links of finite capacities. Simplified versions of network compress-forward (or noisy network coding) and distributed decode-forward are presented to establish inner bounds on the capacity region for uplink and downlink communications, that match the respective cutset bounds to within a finite gap independent of the channel gains and signal to noise ratios. These approximate capacity regions are then compared with the capacity regions for networks with no capacity limit on the fronthaul. Although it takes infinite fronthaul link capacities to achieve these "fronthaul-unlimited" capacity regions exactly, these capacity regions can be approached approximately with finite-capacity fronthaul. The total fronthaul link capacities required to approach the fronthaul-unlimited sum-rates (for uplink and downlink) are characterized. Based on these results, the capacity scaling law in the large network size limit is established under certain uplink and downlink network models, both theoretically and via simulations.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑