Computer Science – Information Theory
Scientific paper
2010-12-22
Computer Science
Information Theory
28 pages, 13 figures, 34 references
Scientific paper
We extend the Blahut-Arimoto algorithm for maximizing Massey's directed information. The algorithm can be used for estimating the capacity of channels with delayed feedback, where the feedback is a deterministic function of the output. In order to do so, we apply the ideas from the regular Blahut-Arimoto algorithm, i.e., the alternating maximization procedure, onto our new problem. We provide both upper and lower bound sequences that converge to the optimum value. Our main insight in this paper is that in order to find the maximum of the directed information over causal conditioning probability mass function (PMF), one can use a backward index time maximization combined with the alternating maximization procedure. We give a detailed description of the algorithm, its complexity, the memory needed, and several numerical examples.
Naiss Iddo
Permuter Haim
No associations
LandOfFree
Extension of the Blahut-Arimoto algorithm for maximizing directed information does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Extension of the Blahut-Arimoto algorithm for maximizing directed information, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Extension of the Blahut-Arimoto algorithm for maximizing directed information will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-582727