Bounds on the Capacity of the Multiple Access Diamond Channel with Cooperating Base-Stations

TL;DR

This paper establishes new capacity bounds for a diamond network with multiple conferencing base stations communicating with a single user, extending existing methods to multiple relays and improving bounds for the two-relay case.

Contribution

It introduces novel coding schemes and bounds for the multiple access diamond channel with cooperating base stations, generalizing previous two-relay results to multiple relays.

Findings

Proposed a cloud coding strategy extending Wand et al. (2018) to multiple relays.

Derived new upper bounds generalizing Bidokhti and Kramer's (2016) method.

Improved capacity bounds for the two-relay diamond network with cooperation.

Abstract

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.