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

Michael Dikshtein, Shirin Saeedi Bidokhti, Shlomo Shamai Shitz

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

A diamond network is considered in which the central processor is connected, via backhaul noiseless links, to multiple conferencing base stations that 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 (2016) and lead to new bounds for the multiple conferencing relay setting. Specializing our upper bounds to the two relay scenario, we provide new bounds and improve the state-of-the-art.

Original languageEnglish
Title of host publication2022 IEEE International Symposium on Information Theory, ISIT 2022
Pages3031-3036
Number of pages6
ISBN (Electronic)9781665421591
DOIs
StatePublished - 2022
Event2022 IEEE International Symposium on Information Theory, ISIT 2022 - Espoo, Finland
Duration: 26 Jun 20221 Jul 2022

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2022-June

Conference

Conference2022 IEEE International Symposium on Information Theory, ISIT 2022
Country/TerritoryFinland
CityEspoo
Period26/06/221/07/22

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Applied Mathematics
  • Modelling and Simulation

Fingerprint

Dive into the research topics of 'Bounds on the Capacity of the Multiple Access Diamond Channel with Cooperating Base-Stations'. Together they form a unique fingerprint.

Cite this