Blahut–Arimoto algorithm explained

The term Blahut–Arimoto algorithm is often used to refer to a class of algorithms for computing numerically either the information theoretic capacity of a channel, the rate-distortion function of a source or a source encoding (i.e. compression to remove the redundancy). They are iterative algorithms that eventually converge to one of the maxima of the optimization problem that is associated with these information theoretic concepts.

History and application

For the case of channel capacity, the algorithm was independently invented by Suguru Arimoto^[1] and Richard Blahut.^[2] In addition, Blahut's treatment gives algorithms for computing rate distortion and generalized capacity with input contraints (i.e. the capacity-cost function, analogous to rate-distortion). These algorithms are most applicable to the case of arbitrary finite alphabet sources. Much work has been done to extend it to more general problem instances.^{[3] [4]} Recently, a version of the algorithm that accounts for continuous and multivariate outputs was proposed with applications in cellular signaling. There exists also a version of Blahut–Arimoto algorithm for directed information.^[5]

Algorithm for Channel Capacity

A discrete memoryless channel (DMC) can be specified using two random variables

X, Y with alphabet l X, l Y , and a channel law as a conditional probability distribution p(y|x) . The channel capacity, defined as C : = \sup _{p} I(X;Y) , indicates the maximum efficiency that a channel can communicate, in the unit of bit per use.^[6] Now if we denote the cardinality | l X| = n, | l Y| = m , then p _{Y|X} is a n x m matrix, which we denote the i ^{th} row, j ^{th} column entry by w _{ij} . For the case of channel capacity, the algorithm was independently invented by Suguru Arimoto^[7] and Richard Blahut.^[8] They both found the following expression for the capacity of a DMC with channel law: C = max _{p} max _{Q} \sum ^{n} _{i =1} \sum ^{m} _{j =1} p _{i} w _{ij} log \left(\dfrac {Q _{ji} }\right)

where

p and Q are maximized over the following requirements: p is a probability distribution on X , That is, if we write p as (p _{1,} p _{2} ... , p _{n),} \sum ^{np} _{i} = 1 Q = (q _{ji} ) is a m x n matrix that behaves like a transition matrix from Y to X with respect to the channel law. That is, For all 1 \leq i \leq n, 1 \leq j \leq m :q _{ji} \geq 0 , q _{ji} = 0 \Leftrightarrow w _{ij} = 0

• • Every row sums up to 1, i.e.

\sum ^{n} _{i =1} q _{ji} = 1 .

Then upon picking a random probability distribution

p ^{0} : = (p ^{0} _{1 ,} p ^{0} _{2 ,} ... p ^{0} _{n)} on X , we can generate a sequence ( p ^{0,} Q ^{0,} p ^{1,} Q ^{1} ...) iteratively as follows:(q ^{t} _{ji} ): = \dfrac{p ^{t} _{iw} _{ij} }p ^{t +1} _{k} : = \dfrac {\prod ^{m} _{j =1} (q ^{t} _{jk} ) ^{w _{kj}} }

For

t = 0 , 1 , 2 ... .

Then, using the theory of optimization, specifically coordinate descent, Yeung^[9] showed that the sequence indeed converges to the required maximum. That is,

\lim _{t\to} \sum ^{n} _{i =1} \sum ^{m} _{j =1} p ^{t} _{i} w _{ij} log \left(\dfrac {Q ^{t} _{ji} }\right) = C.

So given a channel law

p(y|x) , the capacity can be numerically estimated up to arbitrary precision.

Algorithm for Rate-Distortion

Suppose we have a source

X with probability p(x) of any given symbol. We wish to find an encoding p(\hat{x}|x) that generates a compressed signal \hat{X} from the original signal while minimizing the expected distortion \langle d(x,\hat{x}) \rangle , where the expectation is taken over the joint probability of X and \hat{X} . We can find an encoding that minimizes the rate-distortion functional locally by repeating the following iteration until convergence:p _{t+1} (\hat{x}) = \sum _{x} p(x)p _{t(\hat{x}|x)} p _{t+1} (\hat{x}|x) = (p _{t(\hat{x})/()) \exp( - \beta d(x,\hat{x}))}{\sum _{\hat{x} } p_t(\hat) \exp(-\beta d(x,\hat))}

where

\beta is a parameter related to the slope in the rate-distortion curve that we are targeting and thus is related to how much we favor compression versus distortion (higher \beta means less compression).

Notes and References

1. .
2. .
3. A Generalized Blahut–Arimoto Algorithm . Pascal O. . Vontobel . Proceedings IEEE International Symposium on Information Theory, 2003 . 2003 . 53 . 10.1109/ISIT.2003.1228067 . 0-7803-7728-1 .
4. 1012.5071v2 . Iddo Naiss . Haim Permuter . Extension of the Blahut-Arimoto algorithm for maximizing directed information . cs.IT . 2010.
5. Naiss . Iddo . Permuter . Haim H. . Extension of the Blahut–Arimoto Algorithm for Maximizing Directed Information . IEEE Transactions on Information Theory . January 2013 . 59 . 1 . 204–222 . 10.1109/TIT.2012.2214202. 1012.5071 . 3115749 .
6. Book: Cover, T. M. . Elements of information theory . 2006 . Wiley-Interscience . Joy A. Thomas . 0-471-24195-4 . 2nd . Hoboken, N.J. . 59879802.
7. .
8. .
9. Book: Yeung, Raymond W. . Information theory and network coding . 2008 . Springer . 978-0-387-79234-7 . New York . 288469056.