By Topic

Squeezing the Arimoto–Blahut Algorithm for Faster Convergence

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Yaming Yu ; Dept. of Stat., Univ. of California, Irvine, CA, USA

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.

Published in:

Information Theory, IEEE Transactions on  (Volume:56 ,  Issue: 7 )