A note on the Arimoto- Blahut algorithm for computing the capacity of discrete memoryless channels (Corresp.)
Helmut Jürgensen · IEEE Transactions on Information Theory · 1984
In this work a termination condition for the Arimoto-Blahut algorithm for computing the capacity of a discrete memoryless channel will be discussed which turns out to decrease the number of iterations needed in many cases.