Squeezing the Arimoto-Blahut algorithm for faster convergence

  • Authors:
  • Yaming Yu

  • Affiliations:
  • Department of Statistics, University of California, Irvine, CA

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2010

Quantified Score

Hi-index 754.84

Visualization

Abstract

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.