Squeezing the Arimoto-Blahut algorithm for faster convergence

Details Squeezing the Arimoto-Blahut algorithm for faster convergence Squeezing the Arimoto-Blahut algorithm for faster convergence

2009-06-21

arxiv.org/abs/0906.3849v1

IEEE Trans. Inform. Theory 56 (2010) 3149-3157

Computer Science

Information Theory

Scientific paper

10.1109/TIT.2010.2048452

The Arimoto--Blahut algorithm for computing the capacity of a discrete
memoryless channel is revisited. A so-called ``squeezing'' strategy is used to
design algorithms that preserve its simplicity and monotonic convergence
properties, but have provably better rates of convergence.

Affiliated with

Also associated with

No associations

Rating

Squeezing the Arimoto-Blahut algorithm for faster convergence 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 Squeezing the Arimoto-Blahut algorithm for faster convergence, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Squeezing the Arimoto-Blahut algorithm for faster convergence will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-505298