Speaker:
Title:
A faster Arimoto-Blahut algorithm via squeezing
Abstract:
The classical Arimoto-Blahut algorithm for numerical computation of the channel capacity is revisited. A so-called squeezing strategy is introduced to design algorithms that preserve its simplicity and monotonic convergence properties, but with provably faster rates of convergence.