Subblock-Constrained Codes for Real-Time Simultaneous Energy and Information Transfer

Anshoo Tandon, Mehul Motani, Lav R. Varshney

This paper, published in 2015, tackles a critical challenge in the field of Simultaneous Wireless Information and Power Transfer (SWIPT): how to keep a low-power receiver alive when its battery is too small to buffer energy over long periods.

TL;DR

The authors introduce Subblock-Constrained Codes, specifically Constant Subblock-Composition Codes (CSCCs), designed to ensure a steady flow of energy to a receiver. By regularizing energy delivery at the subblock level, they prevent power outages in devices with tiny batteries while quantifying the inevitable trade-off in information transmission rates.

What Problem Does This Paper Address?

In traditional SWIPT research, we often assume a receiver can harvest enough energy if the average power of a long codeword is high enough. However, practical low-power devices—like medical implants or tiny sensors—have very limited energy storage (small batteries or capacitors).

If a codeword contains a long "burst" of low-energy symbols (e.g., many zeros in an on-off keying scheme), a small battery might drain completely before the next high-energy symbol arrives, causing a power outage. This paper addresses the need for real-time energy transfer, where energy must be guaranteed within every small window of time (a subblock) to keep the circuitry running.

Methods

The authors propose a "subblock-constrained" approach. They divide codewords into equal-sized subblocks of length $L$ and require each subblock to meet a minimum energy threshold.

  1. Constant Subblock-Composition Codes (CSCCs): A specific coding strategy where every subblock in every codeword has the exact same "composition" (the same fraction of each symbol from the alphabet).
  2. Induced Vector Channel: To calculate the capacity of these codes, the authors treat each subblock as a single "super-letter" in a higher-dimensional space. They prove that even if the underlying channel is messy, this induced subblock channel is symmetric, which makes the math for capacity much easier.
  3. Subblock Energy-Constrained Codes (SECCs): A more flexible version where different subblocks can have different compositions as long as they all meet the energy requirement.
  4. Local Subblock Decoding (LSD): A method for real-time information transfer where the receiver decodes each subblock immediately rather than waiting for the whole codeword.

Datasets

As a theoretical information theory paper, it does not use external datasets. Instead, it evaluates the proposed codes using standard mathematical channel models:

  • Binary Symmetric Channel (BSC): Used to model bit-flip errors.
  • Binary Erasure Channel (BEC): Used to model lost bits.
  • Z-channel: Used to model asymmetric noise.

Key Insights and Ideas

  • The Battery-Subblock Link: The authors derive a concrete mathematical relationship between a receiver's battery capacity ($E_{max}$) and the maximum allowable subblock length ($L$). If your battery is smaller, your subblocks must be shorter to ensure frequent energy "top-ups."
  • Symmetry Simplification: One of the "aha" moments is proving that the induced subblock channel is always symmetric. This allows the use of uniform input distributions to achieve capacity, significantly reducing computational complexity.
  • Energy Latency vs. Info Latency: A fascinating finding is that real-time energy is "cheaper" than real-time information. Requiring energy in every subblock (but decoding jointly at the end) results in a smaller rate penalty than requiring the receiver to decode every subblock immediately.
  • Diversity of Composition: While CSCCs are easier to analyze, the authors show that SECCs (allowing different subblock types) can achieve higher information rates while still satisfying the same "never-die" energy constraint.

Key Results

  • Rate Loss Quantification: The authors proved that the rate penalty for using CSCCs (compared to standard codes) is bounded by a term that decreases as the subblock length $L$ increases.
  • Scaling Laws: For joint decoding (energy real-time), the rate loss decreases at a rate of $\frac{\log L}{L}$. For local decoding (information real-time), the loss is much steeper, decreasing at $\frac{1}{\sqrt{L}}$.
  • Numerical Trade-offs: Simulations on a BSC showed that as the required energy per symbol ($B$) increases, the available information capacity drops sharply, especially for very small subblock lengths (stricter constraints).

Limitations and Future Work

  • Channel Models: The current work focuses on Discrete Memoryless Channels (DMC). The authors note that extending this to AWGN (Additive White Gaussian Noise) channels—which are more common in radio communications—is a necessary next step.
  • Static Energy Harvesting: The model assumes the energy harvested from a symbol is constant. In reality, harvesting efficiency can change over time. Future work could incorporate energy arrival statistics to make the bounds more robust for fluctuating environments.
  • Complexity: While they simplified the capacity calculation, the "super-letter" approach still grows exponentially with subblock length, making it difficult to compute for very large $L$.

Summary updated

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 analyze subblock energy-constrained codes (SECCs), which ensure that sufficient energy is carried within every subblock duration. We consider discrete memoryless channels and characterize the SECC capacity and the SECC error exponent, and provide useful bounds for these values. We also study constant subblock-composition codes (CSCCs), which are a subclass of SECCs where all the 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 with 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 exploit the symmetry in CSCCs to obtain a necessary and sufficient condition on the subblock length for avoiding power outage at the receiver. Furthermore, for CSCC sequences, we present a tight lower bound on the average energy per symbol within a sliding time window. We provide numerical examples highlighting the tradeoff between the 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 compared with the ability to use information in real-time.
BibTeX
@article{tandon2016subblock,
  author = {Anshoo Tandon and Mehul Motani and Lav R. Varshney},
  title = {{Subblock-Constrained Codes for Real-Time Simultaneous Energy and Information Transfer}},
  journal = {IEEE Trans. Information Theory},
  year = {2016},
  url = {https://openreview.net/forum?id=0YTNYJemiu},
}

Loading related content...

Figure