A New Iterative Algorithm for Calculating the Capacity of Discrete Memoryless Channels

被引：0

作者：

Liang, Xue-Bin ^{[1
]}

机构：

[1] Louisiana State Univ, Dept Elect & Comp Engn, Baton Rouge, LA 70803 USA

来源：

GLOBECOM 2006 - 2006 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE | 2006年

关键词：

D O I：

暂无

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

In this paper, we present a new iterative algorithm for calculating the capacity of discrete memoryless channels. The proposed algorithm is comparable in simplicity and effectiveness to the well-known Arimoto-Blahut algorithm. In addition, we provide a short and elementary proof for the convergence of the Arimoto-Blahut algorithm.

引用

页数：5

共 50 条

[21] The capacity of discrete-time memoryless Rayleigh-Fading channels
Abou-Faycal, IC
Trott, MD
Shamai, S
IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (04) : 1290 - 1301
[22] Computation of total capacity for discrete memoryless multiple-access channels
Rezaeian, M
Grant, A
IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (11) : 2779 - 2784
[23] Bounds on the Capacity of Discrete Memoryless Channels Corrupted by Synchronization and Substitution Errors
Mercier, Hugues
Tarokh, Vahid
Labeau, Fabrice
IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (07) : 4306 - 4330
[24] Capacity-Maximizing Input Symbol Selection for Discrete Memoryless Channels
Egger, Maximilian
Bitar, Rawad
Wachter-Zeh, Antonia
Gunduz, Deniz
Weinberger, Nir
2024 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, ISIT 2024, 2024, : 723 - 728
[25] THE FEEDBACK CAPACITY REGION OF A CLASS OF DISCRETE MEMORYLESS MULTIPLE ACCESS CHANNELS
WILLEMS, FMJ
IEEE TRANSACTIONS ON INFORMATION THEORY, 1982, 28 (01) : 93 - 95
[26] The Zero-Undetected-Error Capacity of Discrete Memoryless Channels with Feedback
Bunte, Christoph
Lapidoth, Amos
2012 50TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2012, : 1838 - 1842
[27] A NEW GEOMETRIC CAPACITY CHARACTERIZATION OF A DISCRETE MEMORYLESS CHANNEL
NAKAGAWA, K
KANAYA, F
IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (02) : 318 - 321
[28] On the Average-Listsize Capacity and the Cutoff Rate of Discrete Memoryless Channels with Feedback
Bunte, Christoph
Lapidoth, Amos
2013 IEEE INFORMATION THEORY WORKSHOP (ITW), 2013,
[29] A simple class of capacity-achieving strategies for discrete memoryless channels with feedback
Veugen, T
IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (06) : 2221 - 2228
[30] Capacity Bounds and Sum Rate Capacities of a Class of Discrete Memoryless Interference Channels
Zhu, Fangfang
Chen, Biao
IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (07) : 3763 - 3772

← 1 2 3 4 5 →