A fast algorithm for computing the capacity of discrete memoryless channels

Document Type

Conference Proceeding

Publication Date



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. ©2010 IEEE.

Publication Source (Journal or Book title)

2010 44th Annual Conference on Information Sciences and Systems, CISS 2010

This document is currently not available here.