Entropy and channel capacity in the regenerative setup with applications to Markov channels
- 13 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
We obtain new entropy and mutual information formulae for regenerative stochastic processes. We use them on Markov channels to generalize the results in Goldsmith and Varaiya (1996). Also we obtain tighter bounds on capacity and better algorithms than in Goldsmith and Varaiya.Keywords
This publication has 2 references indexed in Scilit:
- Fading channels: information-theoretic and communications aspectsIEEE Transactions on Information Theory, 1998
- Capacity, mutual information, and coding for finite-state Markov channelsIEEE Transactions on Information Theory, 1996