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

@article{Vontobel2008AGO,
title={A Generalization of the Blahut–Arimoto Algorithm to Finite-State Channels},
author={Pascal O. Vontobel and Aleksandar Kavcic and Dieter-Michael Arnold and Hans-Andrea Loeliger},
journal={IEEE Transactions on Information Theory},
year={2008},
volume={54},
pages={1887-1918}
}

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… CONTINUE READING