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

Authors:
P. O. Vontobel;A. Kavcic;D. M. Arnold;H. -A. Loeliger
Affiliations:
Hewlett-Packard Labs., Palo Alto;-;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2008

Citing 0
Cited 6

Capacity-achieving codes for finite-state channels with maximum-likelihood decoding

IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Optimization of information rate upper and lower bounds for channels with memory

IEEE Transactions on Information Theory
Upper bounds on the capacities of non-controllable finite-state channels using dynamic programming methods

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Concavity of mutual information rate for input-restricted finite-state memoryless channels at high SNR

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Capacity-achieving codes for channels with memory with maximum-likelihood decoding

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Capacity theorems for discrete, finite-state broadcast channels with feedback and unidirectional receiver cooperation

IEEE Transactions on Information Theory

Quantified Score

Hi-index	754.96

Visualization

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 channel input and output. Our main result is an algorithm that efficiently solves this problem numerically; thus, we call the proposed procedure the generalized BAA. It includes as special cases not only the classical BAA but also an algorithm that solves the problem of finding the capacity-achieving input distribution for finite-state channels with no noise. While we present theorems that characterize the local behavior of the generalized BAA, there are still open questions concerning its global behavior; these open questions are addressed by some conjectures at the end of the paper. Apart from these algorithmic issues, our results lead to insights regarding the local conditions that the information-rate-maximizing FSMSs fulfill; these observations naturally generalize the well-known Kuhn-Tucker conditions that are fulfilled by capacity-achieving DMSs at the input of DMCs.