Extension of the Blahut-Arimoto algorithm for maximizing directed information

Haim H. Permuter, Iddo Naiss

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

We extend the Blahut-Arimoto algorithm for maximizing Massey's directed information, which can be used for estimating the capacity of channels with delayed feedback. 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, and show its convergence to the global 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, one can use a backward index time maximization combined with the alternating maximization procedure. We give a detailed description of the algorithm, its complexity, and memory needed. Some numerical results are provided to illustrate the performance of the suggested algorithm.

Original languageEnglish
Title of host publication2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010
Pages1442-1449
Number of pages8
DOIs
StatePublished - 1 Dec 2010
Event48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010 - Monticello, IL, United States
Duration: 29 Sep 20101 Oct 2010

Publication series

Name2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010

Conference

Conference48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010
Country/TerritoryUnited States
CityMonticello, IL
Period29/09/101/10/10

Keywords

  • Alternating maximization procedure
  • Backward index time maximization
  • Blahut-Arimoto algorithm
  • Causal conditioning
  • Channels with feedback
  • Directed information
  • Finite state channels

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Control and Systems Engineering

Fingerprint

Dive into the research topics of 'Extension of the Blahut-Arimoto algorithm for maximizing directed information'. Together they form a unique fingerprint.

Cite this