Papers
Topics
Authors
Recent
Search
2000 character limit reached

Receiver Antenna Partitioning for Simultaneous Wireless Information and Power Transfer

Published 6 Oct 2014 in cs.IT and math.IT | (1410.1289v1)

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.

Citations (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.