{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T12:41:41Z","timestamp":1766580101118,"version":"build-2065373602"},"reference-count":24,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2017,11,14]],"date-time":"2017-11-14T00:00:00Z","timestamp":1510617600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>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\u2019s coding, which facilitates dependence among the multiple-access channel inputs. The upper bound uses Ozarow\u2019s 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.<\/jats:p>","DOI":"10.3390\/e19110610","type":"journal-article","created":{"date-parts":[[2017,11,14]],"date-time":"2017-11-14T10:58:32Z","timestamp":1510657112000},"page":"610","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Capacity Bounds on the Downlink of Symmetric, Multi-Relay, Single-Receiver C-RAN Networks"],"prefix":"10.3390","volume":"19","author":[{"given":"Shirin","family":"Saeedi Bidokhti","sequence":"first","affiliation":[{"name":"Department of Electrical and Systems Engineering, University of Pennsylvania, Philadelphia, PA 19104, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3904-9181","authenticated-orcid":false,"given":"Gerhard","family":"Kramer","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, Technical University of Munich, 80333 Munich, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shlomo","family":"Shamai","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Technion, Haifa 3200003, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2017,11,14]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1109\/MSP.2014.2330031","article-title":"Fronthaul compression for cloud radio access networks: Signal processing advances inspired by network information theory","volume":"31","author":"Park","year":"2014","journal-title":"IEEE Signal Proc. Mag."},{"key":"ref_2","unstructured":"Yu, W. (2016, January 6). Cloud radio-access networks: Coding strategies, capacity analysis, and optimization techniques. Proceedings of the Communications Theory Workshop, Toronto, ON, Canada."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1109\/MWC.2015.7096298","article-title":"Fronthaul-constrained cloud radio access networks: Insights and challenges","volume":"22","author":"Peng","year":"2015","journal-title":"IEEE Wirel. Commun."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1326","DOI":"10.1109\/ACCESS.2014.2362860","article-title":"Sparse beamforming and user-centric clustering for downlink cloud radio access network","volume":"2","author":"Dai","year":"2014","journal-title":"IEEE Access"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"5646","DOI":"10.1109\/TSP.2013.2280111","article-title":"Joint precoding and multivariate backhaul compression for the downlink of cloud radio access networks","volume":"61","author":"Park","year":"2013","journal-title":"IEEE Trans. Signal Proc."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Patil, P., and Yu, W. (2014, January 9\u201314). Hybrid compression and message-sharing strategy for the downlink cloud radio-access network. Proceedings of the Information Theory and Applications Workshop (ITA), San Diego, CA, USA.","DOI":"10.1109\/ITA.2014.6804240"},{"key":"ref_7","unstructured":"Liu, N., and Kang, W. (July, January 29). A new achievability scheme for downlink multicell processing with finite backhaul capacity. Proceedings of the IEEE International Symposium on Information Theory, Honolulu, HI, USA."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Wang, C., Wigger, M.A., and Zaidi, A. (arXiv, 2016). On achievability for downlink cloud radio access networks with base station cooperation, arXiv.","DOI":"10.1109\/WCNC.2017.7925530"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Yang, T., Liu, N., Kang, W., and Shamai, S. (arXiv, 2016). An upper bound on the sum capacity of the downlink multicell processing with finite backhaul capacity, arXiv.","DOI":"10.1109\/ISIT.2017.8006890"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Traskov, D., and Kramer, G. (2007, January 2\u20136). Reliable communication in networks with multi-access interference. Proceedings of the Information Theory Workshop, Tahoe City, CA, USA.","DOI":"10.1109\/ITW.2007.4313098"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"6049","DOI":"10.1109\/TIT.2015.2479923","article-title":"The Gaussian multiple access diamond channel","volume":"61","author":"Kang","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"7103","DOI":"10.1109\/TIT.2016.2609388","article-title":"Capacity bounds for diamond networks with an orthogonal broadcast channel","volume":"62","author":"Kramer","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"El Gamal, A., and Kim, Y.H. (2011). Network Information Theory, Cambridge University Press.","DOI":"10.1017\/CBO9781139030687"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"2106","DOI":"10.1109\/TIT.2003.815767","article-title":"Multiple description coding with many channels","volume":"49","author":"Venkataramani","year":"2006","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_15","unstructured":"Saeedi Bidokhti, S., and Kramer, G. (July, January 29). Capacity bounds for a class of diamond networks. Proceedings of the International Symposium Information Theory, Honolulu, HI, USA."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1909","DOI":"10.1002\/j.1538-7305.1980.tb03344.x","article-title":"On a source-coding problem with two channels and three receivers","volume":"59","author":"Ozarow","year":"1980","journal-title":"Bell Syst. Tech. J."},{"key":"ref_17","unstructured":"Cover, T.M., and Thomas, J.A. (2006). Elements of Information Theory, Wiley-Interscience."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1109\/TIT.1987.1057341","article-title":"Feedback can at most double Gaussian multiple access channel capacity","volume":"33","author":"Thomas","year":"1987","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1109\/TIT.2016.2623795","article-title":"Secure degrees of freedom of the Gaussian diamond-wiretap channel","volume":"63","author":"Lee","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"3121","DOI":"10.1109\/TIT.2015.2421905","article-title":"An information theoretic approach to secret sharing","volume":"61","author":"Zou","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1509","DOI":"10.1109\/TIT.2015.2401000","article-title":"A unified approach to hybrid coding","volume":"61","author":"Minero","year":"2005","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Grover, P., Wagner, A.B., and Sahai, A. (arXiv, 2010). Information embedding meets distributed control, arXiv.","DOI":"10.1109\/ITWKSPS.2010.5503206"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"2594","DOI":"10.1109\/TIT.2014.2312285","article-title":"Is non-unique decoding necessary?","volume":"60","author":"Prabhakaran","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1109\/TIT.1985.1057042","article-title":"The discrete memoryless multiple-access channel with cribbing encoders","volume":"31","author":"Willems","year":"1985","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/19\/11\/610\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T18:49:26Z","timestamp":1760208566000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/19\/11\/610"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,14]]},"references-count":24,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2017,11]]}},"alternative-id":["e19110610"],"URL":"https:\/\/doi.org\/10.3390\/e19110610","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2017,11,14]]}}}