Conference
A Generalization of the Blahut–Arimoto Algorithm to Finite-State Channels
Abstract
The classical Blahut-Arimoto algorithm (BAA) is a well-known algorithm that optimizes a discrete memoryless source (DMS) at the input of a discrete memoryless channel (DMC) in order to maximize the mutual information between channel input and output. This paper considers the problem of optimizing finite-state machine sources (FSMSs) at the input of finite-state machine channels (FSMCs) in order to maximize the mutual information rate between …
Authors
Vontobel PO; Kavcic A; Arnold DM; Loeliger H-A
Volume
54
Pagination
pp. 1887-1918
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Publication Date
May 1, 2008
DOI
10.1109/tit.2008.920243
Conference proceedings
IEEE Transactions on Information Theory
Issue
5
ISSN
0018-9448