Abstract
Consider an energy-harvesting receiver that uses the same received signal both for decoding information and for harvesting energy, which is employed to power its circuitry. In the scenario where the receiver has limited battery size, a signal with bursty energy content may cause power outage at the receiver since the battery will drain during intervals with low signal energy. In this paper, we consider a discrete memoryless channel and characterize achievable information rates when the energy content in each codeword is regularized by ensuring that sufficient energy is carried within every subblock duration. In particular, we study constant subblock-composition codes (CSCCs) where all subblocks in every codeword have the same fixed composition, and this subblock-composition is chosen to maximize the rate of information transfer while meeting the energy requirement. Compared to constant composition codes (CCCs), we show that CSCCs incur a rate loss and that the error exponent for CSCCs is also related to the error exponent for CCCs by the same rate loss term. We show that CSCC capacity can be improved by allowing different subblocks to have different composition while still meeting the subblock energy constraint. We provide numerical examples highlighting the tradeoff between delivery of sufficient energy to the receiver and achieving high information transfer rates. It is observed that the ability to use energy in real-time imposes less of penalty than the ability to use information in real-time.
Introduction
Simultaneous Wireless Information and Power Transfer (SWIPT) is a critical technology for low-power devices such as medical implants and IoT sensors. While traditional research often assumes receivers can buffer energy over long periods, practical devices possess limited energy storage. If a transmission contains long intervals of low-energy symbols, a small battery may deplete, leading to a power outage. This paper addresses the challenge of real-time energy transfer, ensuring that energy is delivered consistently within short time windows to maintain receiver operation.
System Model
The system consists of a transmitter, a communication channel, and a receiver equipped with both an information decoder and an energy harvester. The energy harvested from the incoming signal is used to power the decoding circuitry.
A critical link exists between the receiver's battery capacity ($E_{max}$) and the signal structure. To prevent outages, the signal must be regularized such that every small window of time—a subblock—provides a minimum threshold of energy. If the battery is smaller, subblocks must be shorter to ensure frequent energy "top-ups."
Methods: Subblock-Constrained Coding
To guarantee real-time energy delivery, the authors propose dividing codewords of length $n$ into $m$ equal-sized subblocks of length $L$.
Two primary coding strategies are explored:
- Constant Subblock-Composition Codes (CSCCs): Every subblock in every codeword maintains the exact same symbol composition (the fraction of each alphabet symbol used). This ensures uniform energy delivery across the entire transmission.
- Subblock Energy-Constrained Codes (SECCs): A more flexible approach where different subblocks can have different compositions, provided each individual subblock meets the minimum energy requirement.
To analyze capacity, the authors treat each subblock as a "super-letter" in a higher-dimensional space. They demonstrate that the induced subblock channel is symmetric, which significantly simplifies the calculation of information rates by allowing the use of uniform input distributions.
Key Insights and Results
The research yields several significant findings regarding the trade-offs between energy and information:
- Rate Loss Quantification: Using CSCCs introduces a rate penalty compared to standard codes. This loss is bounded and decreases as the subblock length $L$ increases. Specifically, for joint decoding (where energy is needed in real-time but information is decoded at the end), the rate loss scales as $O(\frac{\log L}{L})$.
- Energy vs. Information Latency: A key discovery is that real-time energy is "cheaper" than real-time information. Requiring the receiver to decode information locally (subblock-by-subblock) results in a much steeper rate penalty ($O(\frac{1}{\sqrt{L}})$) than simply requiring real-time energy delivery.
- Numerical Trade-offs: Simulations on standard channels (BSC, BEC, Z-channel) show that as the required energy per symbol increases, the information capacity drops sharply, particularly for small $L$ where constraints are most rigid.
Conclusion and Future Work
This work provides a theoretical foundation for designing codes that satisfy the physical power constraints of tiny, energy-harvesting receivers. While the current analysis focuses on Discrete Memoryless Channels (DMC), future research is needed to extend these principles to AWGN channels and to account for dynamic energy harvesting efficiency. Additionally, reducing the computational complexity of the "super-letter" approach for large subblock lengths remains an open challenge.
Summary updated