Toward computing the capacity region of degraded broadcast channel

Kensuke Yasui*, Toshiyasu Matsushima

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Citations (Scopus)

Abstract

Recently, computing the capacity region of the degraded broadcast channel (DBC) was showed as a nonconvex optimization problem by Calvo et al [6]. There seems to be no efficient method to solve in polynomial time due to the lack of convexity. In other nonconvex optimization problem, however, Kumar et al showed that Arimoto-Blahut type algorithm converges to the global optimum when some conditions hold [12]. In this paper, we present Arimoto-Blahut type algorithm toward computing the capacity region of the DBC. By using Kumar's method, we prove the global convergence of the algorithm when some conditions hold and derive an expression for its convergence rate.

Original languageEnglish
Title of host publication2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings
Pages570-574
Number of pages5
DOIs
Publication statusPublished - 2010
Event2010 IEEE International Symposium on Information Theory, ISIT 2010 - Austin, TX, United States
Duration: 2010 Jun 132010 Jun 18

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8103

Conference

Conference2010 IEEE International Symposium on Information Theory, ISIT 2010
Country/TerritoryUnited States
CityAustin, TX
Period10/6/1310/6/18

ASJC Scopus subject areas

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

Fingerprint

Dive into the research topics of 'Toward computing the capacity region of degraded broadcast channel'. Together they form a unique fingerprint.

Cite this