Efficient Approximation of Channel Capacity using the Arimoto-Blahut Algorithm
The Arimoto-Blahut algorithm can efficiently compute the capacity of discrete memoryless channels with an inverse exponential rate of convergence to an ε-optimal solution, for any constant ε > 0.
