Presentation 2023-08-04
New Algorithms for Computing Arimoto-Sibson Capacity
Yuki Ishikawa, Akira Kamatsuka, Koki Kazama,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Arimoto's alternating optimization algorithm (Arimoto--Blahut algorithm) has been proposed as an algorithm for calculating the channel capacity. Arimoto capacity and Sibson capacity have been proposed as extensions of this capacity, and Arimoto has shown that similar algorithms can be used to compute these quantities. In this study, by using H"{o}lder's inequality, we give new expressions for the Arimoto and Sibson mutual information, and propose novel algorithms for calculating the Arimoto and Sibson capacity. Furthermore, we show the equivalence of the proposed algorithms with conventional methods.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Capacity / Alternating Optimization Algorithm / H?lder's inequality
Paper # IT2023-22
Date of Issue 2023-07-27 (IT)

Conference Information
Committee IT
Conference Date 2023/8/3(2days)
Place (in Japanese) (See Japanese page)
Place (in English) Shonan Institute of Technology
Topics (in Japanese) (See Japanese page)
Topics (in English) Freshman session, General
Chair Tetsuya Kojima(Tokyo Kosen)
Vice Chair Yasuyuki Nogami(Okayama Univ.)
Secretary Yasuyuki Nogami(Waseda Univ.)
Assistant Tetsunao Matsuta(Saitamai Univ.)

Paper Information
Registration To Technical Committee on Information Theory
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) New Algorithms for Computing Arimoto-Sibson Capacity
Sub Title (in English)
Keyword(1) Capacity
Keyword(2) Alternating Optimization Algorithm
Keyword(3) H?lder's inequality
1st Author's Name Yuki Ishikawa
1st Author's Affiliation Shonan Institute of Technology(SIT)
2nd Author's Name Akira Kamatsuka
2nd Author's Affiliation Shonan Institute of Technology(SIT)
3rd Author's Name Koki Kazama
3rd Author's Affiliation Waseda University(Waseda Univ.)
Date 2023-08-04
Paper # IT2023-22
Volume (vol) vol.123
Number (no) IT-149
Page pp.pp.44-49(IT),
#Pages 6
Date of Issue 2023-07-27 (IT)