Toward computing the capacity region of degraded broadcast channel

Kensuke Yasui*, Toshiyasu Matsushima

*この研究の対応する著者

研究成果: Conference contribution

5 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトル2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings
ページ570-574
ページ数5
DOI
出版ステータスPublished - 2010 8 23
イベント2010 IEEE International Symposium on Information Theory, ISIT 2010 - Austin, TX, United States
継続期間: 2010 6 132010 6 18

出版物シリーズ

名前IEEE International Symposium on Information Theory - Proceedings
ISSN(印刷版)2157-8103

Conference

Conference2010 IEEE International Symposium on Information Theory, ISIT 2010
国/地域United States
CityAustin, TX
Period10/6/1310/6/18

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • 情報システム
  • モデリングとシミュレーション
  • 応用数学

フィンガープリント

「Toward computing the capacity region of degraded broadcast channel」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル