Squeezing the Arimoto-Blahut Algorithm for Faster Convergence

被引：21
|
作者：
Yu, Yaming [1 ]
机构：
[1] Univ Calif Irvine, Dept Stat, Irvine, CA 92697 USA
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2010年 / 56卷 / 07期
关键词：
Alternating minimization; channel capacity; discrete memoryless channel; rate of convergence; CAPACITY;
D O I：
10.1109/TIT.2010.2048452
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The Arimoto-Blahut algorithm for computing the capacity of a discrete memoryless channel is revisited. A so-called "squeezing" strategy is used to design algorithms that preserve its simplicity and monotonic convergence properties, but have provably better rates of convergence.
引用
收藏
页码：3149 / 3157
页数：9
相关论文
共 50 条
  • [1] Iterating the Arimoto-Blahut algorithm for faster convergence
    Sayir, J
    2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, : 235 - 235
  • [2] A generalization of Arimoto-Blahut algorithm
    Rezaeian, M
    Grant, A
    2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 181 - 181
  • [3] Analysis of the Convergence Speed of the Arimoto-Blahut Algorithm by the Second-Order Recurrence Formula
    Nakagawa, Kenji
    Takei, Yoshinori
    Hara, Shin-ichiro
    Watabe, Kohei
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (10) : 6810 - 6831
  • [4] Arimoto-Blahut Algorithm for the Bidirectional Broadcast Channel with Side Information
    Oechtering, Tobias J.
    Andersson, Mattias
    Skoglund, Mikael
    2009 IEEE INFORMATION THEORY WORKSHOP (ITW 2009), 2009, : 394 - 398
  • [5] Generalized quantum Arimoto-Blahut algorithm and its application to quantum information bottleneck
    Hayashi, Masahito
    Liu, Geng
    QUANTUM SCIENCE AND TECHNOLOGY, 2024, 9 (04):
  • [6] Algorithms of Arimoto-Blahut type for computing quantum channel capacity
    Nagaoka, H
    1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 1998, : 354 - 354
  • [7] A generalized Blahut-Arimoto algorithm
    Vontobel, PO
    2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 2003, : 53 - 53
  • [8] Extension of the Blahut-Arimoto Algorithm for Maximizing Directed Information
    Naiss, Iddo
    Permuter, Haim H.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (01) : 204 - 222
  • [9] GEOMETRICAL INTERPRETATION AND IMPROVEMENTS OF THE BLAHUT-ARIMOTO'S ALGORITHM
    Naja, Ziad
    Alberge, Florence
    Duhamel, Pierre
    2009 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOLS 1- 8, PROCEEDINGS, 2009, : 2505 - +
  • [10] A generalization of the Blahut-Arimoto algorithm to finite-state channels
    Vontobel, Pascal O.
    Kavcic, Aleksandar
    Arnold, Dieter M.
    Loeliger, Hans-Andrea
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (05) : 1887 - 1918
12345