{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T16:31:19Z","timestamp":1776443479254,"version":"3.51.2"},"reference-count":29,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2024,2,20]],"date-time":"2024-02-20T00:00:00Z","timestamp":1708387200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key R&amp;D Program of China","doi-asserted-by":"publisher","award":["2021YFA1000500"],"award-info":[{"award-number":["2021YFA1000500"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Huawei Tech. Co., Ltd","award":["2021YFA1000500"],"award-info":[{"award-number":["2021YFA1000500"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>The celebrated Blahut\u2013Arimoto algorithm computes the capacity of a discrete memoryless point-to-point channel by alternately maximizing the objective function of a maximization problem. This algorithm has been applied to degraded broadcast channels, in which the supporting hyperplanes of the capacity region are again cast as maximization problems. In this work, we consider general broadcast channels and extend this algorithm to compute inner and outer bounds on the capacity regions. Our main contributions are as follows: first, we show that the optimization problems are max\u2013min problems and that the exchange of minimum and maximum holds; second, we design Blahut\u2013Arimoto algorithms for the maximization part and gradient descent algorithms for the minimization part; third, we provide convergence analysis for both parts. Numerical experiments validate the effectiveness of our algorithms.<\/jats:p>","DOI":"10.3390\/e26030178","type":"journal-article","created":{"date-parts":[[2024,2,20]],"date-time":"2024-02-20T11:50:07Z","timestamp":1708429807000},"page":"178","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Blahut\u2013Arimoto Algorithms for Inner and Outer Bounds on Capacity Regions of Broadcast Channels"],"prefix":"10.3390","volume":"26","author":[{"given":"Yanan","family":"Dou","sequence":"first","affiliation":[{"name":"State Key Laboratory of ISN, Xidian University, Xi\u2019an 710071, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanqing","family":"Liu","sequence":"additional","affiliation":[{"name":"IT Operation Center, Bank of China, Beijing 100094, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5713-1739","authenticated-orcid":false,"given":"Xueyan","family":"Niu","sequence":"additional","affiliation":[{"name":"Theory Lab, Central Research Institute, 2012 Labs, Huawei Tech. Co., Ltd., Shatin, N.T., Hong Kong SAR, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Bai","sequence":"additional","affiliation":[{"name":"Theory Lab, Central Research Institute, 2012 Labs, Huawei Tech. Co., Ltd., Shatin, N.T., Hong Kong SAR, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Han","sequence":"additional","affiliation":[{"name":"Theory Lab, Central Research Institute, 2012 Labs, Huawei Tech. Co., Ltd., Shatin, N.T., Hong Kong SAR, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4451-7242","authenticated-orcid":false,"given":"Yanlin","family":"Geng","sequence":"additional","affiliation":[{"name":"State Key Laboratory of ISN, Xidian University, Xi\u2019an 710071, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2024,2,20]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/TIT.1972.1054727","article-title":"Broadcast Channels","volume":"18","author":"Cover","year":"1972","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1109\/TIT.1973.1054980","article-title":"Random coding theorem for broadcast channels with degraded components","volume":"19","author":"Bergmans","year":"1973","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_3","unstructured":"Csisz\u00e1r, I., and Elias, P. (1977). Topics in Information Theory, North-Holland."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1109\/TIT.1979.1056046","article-title":"A coding theorem for the discrete memoryless broadcast channel","volume":"25","author":"Marton","year":"1979","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1109\/TIT.2006.887492","article-title":"An outer bound to the capacity region of the broadcast channel","volume":"53","author":"Nair","year":"2007","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1109\/TIT.2021.3128136","article-title":"Outer bounds for multiuser settings: The auxiliary receiver approach","volume":"68","author":"Gohari","year":"2022","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_7","unstructured":"Liu, Y., and Geng, Y. (July, January 26). Blahut-Arimoto Algorithms for Computing Capacity Bounds of Broadcast Channels. Proceedings of the IEEE International Symposium on Information Theory, Espoo, Finland."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Liu, Y., Dou, Y., and Geng, Y. (2023, January 25\u201330). Blahut-Arimoto Algorithm for Marton\u2019s Inner Bound. Proceedings of the IEEE International Symposium on Information Theory, Taipei, Taiwan.","DOI":"10.1109\/ISIT54713.2023.10206580"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Calvo, E., Palomar, D.P., Fonollosa, J.R., and Vidal, J. (2008, January 6\u201311). The computation of the capacity region of the discrete degraded BC is a nonconvex DC problem. Proceedings of the IEEE International Symposium on Information Theory, Toronto, ON, Canada.","DOI":"10.1109\/ISIT.2008.4595282"},{"key":"ref_10","unstructured":"Nocedal, J., and Wright, S.J. (2006). Numerical Optimization, Springer. [2nd ed.]."},{"key":"ref_11","unstructured":"Wilson, R.B. (1963). A simplicial Algorithm for Concave Programming. [Ph.D. Thesis, Graduate School of Business Administration, Harvard University]."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1109\/TIT.1972.1054855","article-title":"Computation of channel capacity and rate distortion functions","volume":"18","author":"Blahut","year":"1972","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/TIT.1972.1054753","article-title":"An algorithm for computing the capacity of arbitrary discrete memoryless channels","volume":"18","author":"Arimoto","year":"1972","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"2779","DOI":"10.1109\/TIT.2004.836661","article-title":"Computation of Total Capacity for Discrete Memoryless Multiple-Access Channels","volume":"50","author":"Rezaeian","year":"2004","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"3512","DOI":"10.1109\/TCOMM.2010.091710.090239","article-title":"On the Computation of the Capacity Region of the Discrete MAC","volume":"58","author":"Calvo","year":"2010","journal-title":"IEEE Trans. Commun."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Yasui, K., and Matsushima, T. (2010, January 13\u201318). Toward Computing the Capacity Region of Degraded Broadcast Channel. Proceedings of the IEEE International Symposium on Information Theory, Austin, TX, USA.","DOI":"10.1109\/ISIT.2010.5513525"},{"key":"ref_17","unstructured":"Dupuis, F., Yu, W., and Willems, F.M.J. (July, January 27). Blahut-Arimoto algorithms for computing channel capacity and rate-distortion with side information. Proceedings of the IEEE International Symposium on Information Theory, Chicago, IL, USA. Available online: https:\/\/www.comm.utoronto.ca\/~weiyu\/ab_isit04.pdf."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"3748","DOI":"10.1109\/TIT.2014.2321384","article-title":"On Marton\u2019s Inner Bound for the General Broadcast Channel","volume":"60","author":"Gohari","year":"2014","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1109\/TIT.2013.2285925","article-title":"On Marton\u2019s Inner Bound and Its Optimality for Classes of Product Broadcast Channels","volume":"60","author":"Geng","year":"2014","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1361","DOI":"10.1109\/TIT.2018.2880241","article-title":"On the Evaluation of Marton\u2019s Inner Bound for Two-Receiver Broadcast Channels","volume":"65","author":"Anantharam","year":"2019","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Geng, Y. (2019, January 11\u201313). Single-Letterization of Supporting Hyperplanes to Outer Bounds for Broadcast Channels. Proceedings of the IEEE\/CIC International Conference on Communications in China, Changchun, China.","DOI":"10.1109\/ICCChina.2019.8855806"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Gowtham, K.R., and Thangaraj, A. (2008, January 6\u201311). Computation of secrecy capacity for more-capable channel pairs. Proceedings of the IEEE International Symposium on Information Theory, Toronto, ON, Canada.","DOI":"10.1109\/ISIT.2008.4595042"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1109\/TIT.1979.1055989","article-title":"Evaluation of an achievable rate region for the broadcast channel","volume":"25","author":"Hajek","year":"1979","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1109\/TIT.1975.1055418","article-title":"An achievable rate region for the broadcast channel","volume":"21","author":"Cover","year":"1975","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1109\/TIT.1975.1055347","article-title":"Random coding theorems for the general discrete memoryless broadcast channel","volume":"21","year":"1975","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_26","unstructured":"Nair, C., and Wang, Z.V. (February, January 27). On the inner and outer bounds for 2-receiver discrete memoryless broadcast channels. Proceedings of the Information Theory and Applications Workshop, San Diego, CA, USA."},{"key":"ref_27","unstructured":"Gohari, A., and Anantharam, V. (July, January 28). Evaluation of Marton\u2019s inner bound for the general broadcast channel. Proceedings of the IEEE International Symposium on Information Theory, Seoul, Repubic of Korea."},{"key":"ref_28","unstructured":"Jog, V., and Nair, C. (February, January 31). An information inequality for the BSSC channel. Proceedings of the Information Theory and Applications Workshop, La Jolla, CA, USA."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"El Gamal, A., and Kim, Y.-H. (2011). Network Information Theory, Cambridge University Press.","DOI":"10.1017\/CBO9781139030687"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/26\/3\/178\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T14:01:47Z","timestamp":1760104907000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/26\/3\/178"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,20]]},"references-count":29,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2024,3]]}},"alternative-id":["e26030178"],"URL":"https:\/\/doi.org\/10.3390\/e26030178","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,20]]}}}