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

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.
Comment: Complementary proofs for the ISIT2022 conference paper