Algorithm 1: Computing channel capacity
Input: $p\left(y\right|x)$, maximum iterations N, threshold $ϵ>0$;
Initialization: $q_0\left(x\right)>0$, ${ϵ}_0>ϵ$, $n=0$;
while $n<N$ and ${ϵ}_n>ϵ$ do
		$\phantom{(}$ $\phantom{(}$ $n\leftarrow n+1$;
		$Q_n=Q\left[q_{n-1}\right]$ using Equation (5);
		$q_n=q\left[Q_n\right]$ using Equation (7);
		$C(q_n,Q_n)=ln{\sum }_{x}exp\left\{d\left[Q_n\right]\left(x\right)\right\}$ using Equations (8) and (4);
		${ϵ}_n={max}_x\{d\left[Q_n\right]\left(x\right)-ln{q}_{n-1}\left(x\right)\}-C(q_n,Q_n)$ using Equation (4);
end
Output: $q_n\left(x\right)$, $Q_n\left(x\right|y)$, $C(q_n,Q_n)$