Blahut–Arimoto algorithm

The Blahut–Arimoto algorithm, is often used to refer to a class of algorithms for computing numerically either the information theoretic capacity of a channel, or the rate-distortion function of a source. They are iterative algorithms that eventually converge to the optimal solution of the convex optimization problem that is associated with these information theoretic concepts.

For the case of channel capacity, the algorithm was independently invented by Arimoto and Blahut. In the case of lossy compression, the corresponding algorithm was invented by Richard Blahut. The algorithm is most applicable to the case of arbitrary finite alphabet sources. Much work has been done to extend it to more general problem instances.^[1]^[2]

Algorithm

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)={\frac {p_{t}({\hat {x}})\exp(-\beta d(x,{\hat {x}}))}{\sum _{\hat {x}}p_{t}({\hat {x}})\exp(-\beta d(x,{\hat {x}}))}}

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).

References

↑ Pascal O. Vontobel (2002). "A Generalized Blahut–Arimoto Algorithm". CiteSeerX 10.1.1.1.2567. Missing or empty |url= (help)
↑ Iddo Naiss; Haim Permuter (2010). "Extension of the Blahut-Arimoto algorithm for maximizing directed information". arXiv:1012.5071v2 [cs.IT].

This article is issued from Wikipedia - version of the 11/10/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.