Receiver Antenna Partitioning for Simultaneous Wireless Information and Power Transfer

Rahul Vaze, Jainam Doshi, Kaibin HuangarXiv 2014 · OpenReview

Abstract

Powering mobiles using microwave power transfer (PT) avoids the inconvenience of battery recharging by cables and ensures uninterrupted mobile operation. The integration of PT and information transfer (IT) allows wireless PT to be realized by building on the existing infrastructure for IT and also leads to compact mobile designs. As a result, simultaneous wireless information and power transfer (SWIPT) has emerged to be an active research topic. In this paper, a practical SWIPT system is considered where two multi-antenna stations perform separate PT and IT to a multi-antenna mobile to accommodate their difference in ranges. The mobile dynamically assigns each antenna for either PT or IT. The antenna partitioning results in a tradeoff between the MIMO IT channel capacity and the PT efficiency. The optimal partitioning for maximizing the IT rate under a PT constraint is a NP-hard integer program, and the paper proposes solving it via efficient greedy algorithms with guaranteed performance. To this end, the antenna-partitioning problem is proved to be one that optimizes a sub-modular function over a matroid constraint. This structure allows the application of two well-known greedy algorithms that yield solutions no smaller than the optimal one scaled by factors $(1-1/e)$ and 1/2, respectively.

Introduction

Simultaneous Wireless Information and Power Transfer (SWIPT) envisions a future where mobile devices are powered wirelessly via microwaves while maintaining high-speed data connections. To achieve compact receiver designs, engineers can share a device's multiple antennas between Information Transfer (IT) and Power Transfer (PT). A practical approach is dynamic antenna partitioning, where each antenna is assigned to either data reception or energy harvesting.

System model for SWIPT with separate base station and power beacon.

Problem Formulation

The core challenge lies in optimizing the antenna partition to maximize the MIMO IT channel capacity while satisfying a minimum circuit-power constraint. Because antenna assignment is a discrete binary decision, the optimization is an integer programming problem. Such problems are typically NP-hard, making them computationally prohibitive for real-time mobile applications.

Methodology: Sub-modular Maximization

The authors reframe the physical antenna partitioning problem as a combinatorial optimization task. They demonstrate that the IT capacity function exhibits sub-modularity—the property of diminishing returns where adding more antennas to data transfer yields progressively smaller gains. Furthermore, they show that the circuit-power requirement can be modeled as a matroid constraint.

The authors also extend these methods to scenarios where the base station knows the channel state (CSIT) and can dynamically allocate transmit power using waterfilling. By mapping the problem to the maximization of a sub-modular function over a matroid, the authors leverage two established greedy algorithms:

  1. Continuous Greedy Algorithm: Utilizes pipage rounding to achieve a theoretical approximation ratio of $(1 - 1/e)$.
  2. Simple Greedy Algorithm: An iterative approach that selects antennas based on marginal gain, providing a $1/2$ approximation guarantee.

Key Results and Performance

Numerical simulations using Rayleigh fading channels validate the effectiveness of these greedy approaches. As shown in the throughput comparison, both algorithms significantly outperform their theoretical worst-case bounds.

Throughput comparison as a function of receive antennas $N_r$.

A key finding is the trade-off between theoretical guarantees and practical utility. While the Continuous Greedy algorithm offers a tighter theoretical bound, its $O(n^8)$ complexity makes it unsuitable for real-time use. In contrast, the Simple Greedy algorithm operates at $O(n^2)$ complexity and, surprisingly, often achieves higher throughput in simulated environments, making it the preferred choice for practical implementation.

Conclusion

This research bridges the gap between wireless communications and combinatorial optimization. By identifying the sub-modular nature of MIMO capacity in SWIPT systems, the authors provide a framework for efficient, near-optimal antenna management. Future work may extend these matroid-based techniques to more complex scenarios, such as multi-cell coordination or dynamic user scheduling in wireless networks.

Summary updated

Abstract

Powering mobiles using microwave \emph{power transfer} (PT) avoids the inconvenience of battery recharging by cables and ensures uninterrupted mobile operation. The integration of PT and \emph{information transfer} (IT) allows wireless PT to be realized by building on the existing infrastructure for IT and also leads to compact mobile designs. As a result, \emph{simultaneous wireless information and power transfer} (SWIPT) has emerged to be an active research topic that is also the theme of this paper. In this paper, a practical SWIPT system is considered where two multi-antenna stations perform separate PT and IT to a multi-antenna mobile to accommodate their difference in ranges. The mobile dynamically assigns each antenna for either PT or IT. The antenna partitioning results in a tradeoff between the MIMO IT channel capacity and the PT efficiency. The optimal partitioning for maximizing the IT rate under a PT constraint is a NP-hard integer program, and the paper proposes solving it via efficient greedy algorithms with guaranteed performance. To this end, the antenna-partitioning problem is proved to be one that optimizes a sub-modular function over a matroid constraint. This structure allows the application of two well-known greedy algorithms that yield solutions no smaller than the optimal one scaled by factors $(1-1/e)$ and 1/2, respectively.
BibTeX
@misc{vaze2014receiver,
  author = {Rahul Vaze and Jainam Doshi and Kaibin Huang},
  title = {{Receiver Antenna Partitioning for Simultaneous Wireless Information and Power Transfer}},
  year = {2014},
  eprint = {1410.1289},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/1410.1289},
}
Figure