Computer Science – Information Theory
Scientific paper
2010-01-12
ICASSP, Taipei : Taiwan (2009)
Computer Science
Information Theory
Scientific paper
10.1109/ICASSP.2009.4960131
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.
Alberge Florence
Duhamel Pierre
Naja Ziad
No associations
LandOfFree
Geometrical interpretation and improvements of the Blahut-Arimoto's algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Geometrical interpretation and improvements of the Blahut-Arimoto's algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Geometrical interpretation and improvements of the Blahut-Arimoto's algorithm will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-459445