Geometrical interpretation and improvements of the Blahut-Arimoto's algorithm

2010/01/12 by Ziad Naja, Florence Alberge, P. Duhamel · 1 citation
Computer Science · Mathematics · #cs.IT #math.IT

paper · pdf · doi:10.1109/icassp.2009.4960131

published as ICASSP, Taipei : Taiwan (2009)

arxiv created 2010/01/12 · arxiv updated 2010/01/14

Abstract

The paper first recalls the Blahut Arimoto algorithm for computing the capacity of arbitrary discrete memoryless channels, as an example of an iterative algorithm working with probability density estimates. Then, a geometrical interpretation of this algorithm based on projections onto linear and exponential families of probabilities is provided. Finally, this understanding allows also to propose to write the Blahut-Arimoto algorithm, as a true proximal point algorithm. it is shown that the corresponding version has an improved convergence rate, compared to the initial algorithm, as well as in comparison with other improved versions.

Cited by

• Computation of Capacity-Distortion-Cost Functions for Continuous Memoryless Channels

Related

• Revisit the Arimoto-Blahut algorithm: New Analysis with Approximation
• On the Search Algorithm for the Output Distribution that Achieves the Channel Capacity
• Vector Flows and the Capacity of a Discrete Memoryless Channel
• A Blahut-Arimoto Type Algorithm for Computing Classical-Quantum Channel Capacity
• Extension of the Blahut-Arimoto algorithm for maximizing directed information