Simulation-based computation of information rates: upper and lower bounds
- 1 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
It has recently become feasible to compute information rates of finite-state source/channel models with memory. Such methods can also be used to compute upper and lower bounds on the information rate of very general (nonfinite-state) channels with memory by means of finite-state approximations. Further numerical bounds are obtained from reduced-state computations.Keywords
This publication has 3 references indexed in Scilit:
- On the achievable information rates of finite state ISI channelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On the information rate of binary-input channels with memoryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Entropy and channel capacity in the regenerative setup with applications to Markov channelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002