Capacity Analysis of Discrete Energy Harvesting Channels
- 12 July 2017
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 63 (00189448) , 1
Abstract
We study the channel capacity of a general discrete energy harvesting channel with a finite battery. Contrary to traditional communication systems, the transmitter of such a channel is powered by a device that harvests energy from a random exogenous energy source and has a finite-sized battery. As a consequence, at each transmission opportunity, the system can only transmit a symbol whose energy is no more than the energy currently available. This new type of power supply introduces an unprecedented input constraint for the channel, which is simultaneously random, instantaneous, and influenced by the full history of the inputs and the energy harvesting process. Furthermore, naturally, in such a channel, the energy information is observed causally at the transmitter. Both of these characteristics pose great challenges for the analysis of the channel capacity. In this paper, we use techniques developed for channels with side information and finite-state channels, to obtain lower and upper bounds on the capacity of energy harvesting channels. In particular, in a general case with Markov energy harvesting processes, we use stationarity and ergodicity theory to compute and optimize the achievable rates for the channels, and derive a series of computable capacity upper and lower bounds.Keywords
All Related Versions
This publication has 42 references indexed in Scilit:
- Concavity of mutual information rate of finite-state channels2013
- A randomized approach to the capacity of finite-state channels2013
- Simulation-Based Computation of Information Rates for Channels With MemoryIEEE Transactions on Information Theory, 2006
- On the achievable information rates of finite state ISI channels2002
- On the information rate of binary-input channels with memory2002
- Entropy and channel capacity in the regenerative setup with applications to Markov channels2002
- Hidden Markov processesIEEE Transactions on Information Theory, 2002
- Entropy and Information Theory1990
- The Strong Ergodic Theorem for Densities: Generalized Shannon-McMillan-Breiman TheoremThe Annals of Probability, 1985
- Computation of channel capacity and rate-distortion functionsIEEE Transactions on Information Theory, 1972