论文信息 - Estimating the information rate of noisy two-dimensional constrained channels

Estimating the information rate of noisy two-dimensional constrained channels

The problem of computing the information rate of noisy two-dimensional constrained source / channel models has been an unsolved problem. In this paper, we propose two Monte Carlo methods for this problem. The first method, which is exact in expectation, combines tree-based Gibbs sampling with importance sampling. The second method uses generalized belief propagation and is shown to yield a good approximation of the information rate.

Hans-Andrea Loeliger | Mehdi Molkaraie | Mehdi Molkaraie | Hans-Andrea Loeliger

[1] H.-A. Loeliger,et al. An introduction to factor graphs , 2004, IEEE Signal Process. Mag..

[2] Hans-Andrea Loeliger,et al. Simulation-based estimation of the partition function and the information rate of two-dimensional models , 2008, 2008 IEEE International Symposium on Information Theory.

[3] Shlomo Shamai,et al. Discrete-Input Two-Dimensional Gaussian Channels With Memory: Estimation and Information Rates Via Graphical Models and Statistical Mechanics , 2008, IEEE Transactions on Information Theory.

[4] Nando de Freitas,et al. From Fields to Trees , 2004, UAI.

[5] Paul H. Siegel,et al. On the achievable information rates of finite state ISI channels , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[6] X. Jin. Factor graphs and the Sum-Product Algorithm , 2002 .

[7] David J. C. Mackay,et al. Introduction to Monte Carlo Methods , 1998, Learning in Graphical Models.

[8] William T. Freeman,et al. Constructing free-energy approximations and generalized belief propagation algorithms , 2005, IEEE Transactions on Information Theory.

[9] Wei Zeng,et al. Simulation-Based Computation of Information Rates for Channels With Memory , 2006, IEEE Transactions on Information Theory.

[10] Hans-Andrea Loeliger,et al. Estimating the partition function of 2-D fields and the capacity of constrained noiseless 2-D channels using tree-based Gibbs sampling , 2009, 2009 IEEE Information Theory Workshop.