Answers are grounded in this paper and cite their sources.
An upper bound on the speed of convergence of Blahut algorithm is derived. This bound is inversely proportional to the number of iterations.
No takes yet. Share an insight, caveat, or question.
P. Boukris (1973) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: