Channel capacity using Arimoto-Blahut Algorithm

To find Channel capacity by maximizing mutual information w.r.t source symbol probability matrix Pc.

To find channel capacity one must maximize the mutual information with respect to the discrete set of probabilities of the source symbols 'c' , and for a given transition probability matrix.
An efficient algorithm to find channel capacity Cc was derived in 1972 by Blahut and independently Arimoto.This algorithm is based on the fact that channel capacity can be both upper and lower bounded by some simple functions of Pc.The algorithm recursively updates Pc based on these bounds.