论文信息 - A fast algorithm for computing the capacity of discrete memoryless channels

A fast algorithm for computing the capacity of discrete memoryless channels

In this paper, we propose a fast algorithm for computing the capacity of an arbitrarily given discrete memoryless channel (DMC). The proposed algorithm is iterative and it is proved to be convergent for any given DMC. Numerical experiment shows that this new proposed algorithm works well for DMCs with tens of hundreds input and output symbols, while the Arimoto-Blahut algorithm appears to be slowly convergent in those cases.

Xue-Bin Liang

[1] Stephen P. Boyd,et al. Geometric programming duals of channel capacity and rate distortion , 2004, IEEE Transactions on Information Theory.

[2] Xue-Bin Liang. CTH04-5: A New Iterative Algorithm for Calculating the Capacity of Discrete Memoryless Channels , 2006, IEEE Globecom 2006.

[3] Suguru Arimoto,et al. An algorithm for computing the capacity of arbitrary discrete memoryless channels , 1972, IEEE Trans. Inf. Theory.

[4] Richard E. Blahut,et al. Computation of channel capacity and rate-distortion functions , 1972, IEEE Trans. Inf. Theory.

[5] Xue-Bin Liang,et al. An Algebraic, Analytic, and Algorithmic Investigation on the Capacity and Capacity-Achieving Input Probability Distributions of Finite-Input– Finite-Output Discrete Memoryless Channels , 2008, IEEE Transactions on Information Theory.