Title
A new iterative algorithm for calculating the capacity of discrete memoryless channels
Document Type
Conference Proceeding
Publication Date
12-1-2006
Abstract
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. © 2006 IEEE.
Publication Source (Journal or Book title)
GLOBECOM - IEEE Global Telecommunications Conference
Recommended Citation
Liang, X. (2006). A new iterative algorithm for calculating the capacity of discrete memoryless channels. GLOBECOM - IEEE Global Telecommunications Conference https://doi.org/10.1109/GLOCOM.2006.56
COinS