论文标题
与合作基站的多个访问钻石通道的容量界限
Bounds on the Capacity of the Multiple Access Diamond Channel with Cooperating Base-Stations
论文作者
论文摘要
考虑了一个钻石网络，其中中央处理器通过回程无噪声链接连接到多个会议基站，这些链条通过多个访问通道与单个用户通信。我们建议在容量上提出编码技术以及下限和上限。我们的可实现性方案采用了基于Wand，Wigger和Zaidi（2018）提出的技术的通用云编码策略，并将其扩展到两个继电器之外。我们的上限概括了Bidokhti和Kramer针对两个中继钻石网络而提出的方法（2016年），并为多个继电器设置带来了新的界限。我们专门为两个接力场景（合作）提供了我们的上限，我们提供了新的界限并改善了最新的界限。
A diamond network is considered in which the central processor is connected, via backhaul noiseless links, to multiple conferencing base stations, which communicate with a single user over a multiple access channel. We propose coding techniques along with lower and upper bounds on the capacity. Our achievability scheme uses a common cloud coding strategy based on the technique proposed by Wand, Wigger, and Zaidi (2018) and extends it beyond two relays. Our upper bounds generalize the method proposed by Bidokhti and Kramer for the two relay diamond network without cooperation (2016) and lead to new bounds for the multiple relay setting. Specializing our upper bounds for the two relay scenario (with cooperation), we provide new bounds and improve state-of-the-art.
