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.
翻译:考虑建立一个钻石网络,其中中央处理器通过反光无噪音连接与多个会议基地站连接,这些基地站通过多个接入频道与单一用户进行通信。我们提议编码技术以及容量的下限和上限。我们的可实现性计划使用基于Wand、Wigger和Zaidi提出的技术的共同云层编码战略(2018年),并扩大到两个中继系统之外。我们的上界将Bidokhti和Kramer提出的方法推广到两个中继钻石网络,而没有合作(2016年),并导致多个中继系统设置的新界限。我们专门为两种中继方案设定了上界(合作),我们提供了新的界限,并改进了最新技术。