Toward computing the capacity region of degraded broadcast channel

Kensuke Yasui, Toshiyasu Matsushima

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

    5 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 publicationIEEE International Symposium on Information Theory - Proceedings
    Pages570-574
    Number of pages5
    DOIs
    Publication statusPublished - 2010
    Event2010 IEEE International Symposium on Information Theory, ISIT 2010 - Austin, TX
    Duration: 2010 Jun 132010 Jun 18

    Other

    Other2010 IEEE International Symposium on Information Theory, ISIT 2010
    CityAustin, TX
    Period10/6/1310/6/18

    Fingerprint

    Broadcast Channel
    Nonconvex Optimization
    Nonconvex Problems
    Computing
    Optimization Problem
    Global Optimum
    Global Convergence
    Convergence Rate
    Convexity
    Polynomial time
    Polynomials
    Converge

    ASJC Scopus subject areas

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

    Cite this

    Yasui, K., & Matsushima, T. (2010). Toward computing the capacity region of degraded broadcast channel. In IEEE International Symposium on Information Theory - Proceedings (pp. 570-574). [5513525] https://doi.org/10.1109/ISIT.2010.5513525

    Toward computing the capacity region of degraded broadcast channel. / Yasui, Kensuke; Matsushima, Toshiyasu.

    IEEE International Symposium on Information Theory - Proceedings. 2010. p. 570-574 5513525.

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

    Yasui, K & Matsushima, T 2010, Toward computing the capacity region of degraded broadcast channel. in IEEE International Symposium on Information Theory - Proceedings., 5513525, pp. 570-574, 2010 IEEE International Symposium on Information Theory, ISIT 2010, Austin, TX, 10/6/13. https://doi.org/10.1109/ISIT.2010.5513525
    Yasui K, Matsushima T. Toward computing the capacity region of degraded broadcast channel. In IEEE International Symposium on Information Theory - Proceedings. 2010. p. 570-574. 5513525 https://doi.org/10.1109/ISIT.2010.5513525
    Yasui, Kensuke ; Matsushima, Toshiyasu. / Toward computing the capacity region of degraded broadcast channel. IEEE International Symposium on Information Theory - Proceedings. 2010. pp. 570-574
    @inproceedings{5964f09044dc4ee2a271d8b9e13ee4d4,
    title = "Toward computing the capacity region of degraded broadcast channel",
    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.",
    author = "Kensuke Yasui and Toshiyasu Matsushima",
    year = "2010",
    doi = "10.1109/ISIT.2010.5513525",
    language = "English",
    isbn = "9781424469604",
    pages = "570--574",
    booktitle = "IEEE International Symposium on Information Theory - Proceedings",

    }

    TY - GEN

    T1 - Toward computing the capacity region of degraded broadcast channel

    AU - Yasui, Kensuke

    AU - Matsushima, Toshiyasu

    PY - 2010

    Y1 - 2010

    N2 - 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.

    AB - 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.

    UR - http://www.scopus.com/inward/record.url?scp=77955689234&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=77955689234&partnerID=8YFLogxK

    U2 - 10.1109/ISIT.2010.5513525

    DO - 10.1109/ISIT.2010.5513525

    M3 - Conference contribution

    AN - SCOPUS:77955689234

    SN - 9781424469604

    SP - 570

    EP - 574

    BT - IEEE International Symposium on Information Theory - Proceedings

    ER -