A Generalization of the Blahut–Arimoto Algorithm to Finite-State Channels

DOI10.1109/TIT.2008.920243MaRDI QIDQ3604502zbMATH OpenOpenAlexFDO

Authors Pascal O. Vontobel, Aleksandar Kavčić, Dieter Arnold, Hans-Andrea Loeliger

Publication date 24 February 2009

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

Full work available at URL https://doi.org/10.1109/tit.2008.920243

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40)

Cited in

(2)

• Asymptotics of input-constrained binary symmetric channel capacity
• On a proof of the convergence speed of quadratic recurrence formulas in the Arimoto-Blahut algorithm

This page was built for publication: A Generalization of the Blahut–Arimoto Algorithm to Finite-State Channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604502)