Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
