DocumentCode :
2325653
Title :
CTH04-5: A New Iterative Algorithm for Calculating the Capacity of Discrete Memoryless Channels
Author :
Liang, Xue-Bin
Author_Institution :
Dept. of Electr. & Comput. Eng., Louisiana State Univ., Baton Rouge, LA
fYear :
2006
fDate :
Nov. 27 2006-Dec. 1 2006
Firstpage :
1
Lastpage :
5
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.
Keywords :
channel capacity; iterative methods; memoryless systems; Arimoto-Blahut algorithm; discrete memoryless channels; iterative algorithm; Capacity planning; Convergence; Iterative algorithms; Iterative methods; Mathematical programming; Memoryless systems; Mutual information; Probability distribution;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Global Telecommunications Conference, 2006. GLOBECOM '06. IEEE
Conference_Location :
San Francisco, CA
ISSN :
1930-529X
Print_ISBN :
1-4244-0356-1
Electronic_ISBN :
1930-529X
Type :
conf
DOI :
10.1109/GLOCOM.2006.56
Filename :
4150686
Link To Document :
بازگشت