Capacity bounds on the downlink of symmetric, multi-relay, single receiver C-RAN networks

Shirin Saeedi Bidokhti, Gerhard Kramer, Shlomo Shamai

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

Abstract

The downlink of symmetric Cloud Radio Access Networks (C-RANs) with multiple relays and a single receiver is studied. Lower and upper bounds are derived on the capacity. The lower bound is achieved by Marton's coding which facilitates dependence among the multiple-access channel inputs. The upper bound uses Ozarow's technique to augment the system with an auxiliary random variable. The bounds are studied over scalar Gaussian C-RANs and are shown to meet and characterize the capacity for interesting regimes of operation.

Original languageEnglish
Title of host publication2017 IEEE International Symposium on Information Theory, ISIT 2017
Pages2058-2062
Number of pages5
ISBN (Electronic)9781509040964
DOIs
StatePublished - 9 Aug 2017
Event2017 IEEE International Symposium on Information Theory, ISIT 2017 - Aachen, Germany
Duration: 25 Jun 201730 Jun 2017

Publication series

NameIEEE International Symposium on Information Theory - Proceedings

Conference

Conference2017 IEEE International Symposium on Information Theory, ISIT 2017
Country/TerritoryGermany
CityAachen
Period25/06/1730/06/17

All Science Journal Classification (ASJC) codes

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

Fingerprint

Dive into the research topics of 'Capacity bounds on the downlink of symmetric, multi-relay, single receiver C-RAN networks'. Together they form a unique fingerprint.

Cite this