Squeezing the Arimoto–Blahut Algorithm for Faster Convergence

DOI10.1109/TIT.2010.2048452zbMath1366.94436arXiv0906.3849MaRDI QIDQ5281382

Yaming Yu

Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0906.3849

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40)

Related Items (3)

Computation of channel capacity based on self-concordant functions ⋮ Strict monotonicity and convergence rate of Titterington's algorithm for computing D-optimal designs ⋮ Geometry of Arimoto algorithm

This page was built for publication: Squeezing the Arimoto–Blahut Algorithm for Faster Convergence