On finite-state information rates from channel simulations

It has recently become feasible to compute information rates of finite-state source/channel models with not too many states. In this paper, we apply such methods to finite-state approximations of channels that are not finite-state. In this way, an upper bound and a conjectured lower bound on the information rate of the actual channel can be computed.

[1]  V. Sharma,et al.  Entropy and channel capacity in the regenerative setup with applications to Markov channels , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[2]  Hans-Andrea Loeliger,et al.  On the information rate of binary-input channels with memory , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[3]  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).