Search arXivSearch

arXiv · 2104.08404

Wireless Information and Power Transfer for IoT: Pulse Position Modulation, Integrated Receiver, and Experimental Validation

Abstract

Simultaneous wireless information and power transfer (SWIPT) has emerged as a viable technique to energize and connect low-power autonomous devices and enable future Internet of Things (IoT). A major challenge of SWIPT is the energy consumption of the receiver of such low-power devices. An attractive low-power solution consists in an integrated information decoder (ID) and energy harvester (EH) architecture for SWIPT receiver (IntRx) where the received RF signal is first rectified before being used for information decoding. Such architecture eliminates the need for energy-consuming RF components such as local oscillators and mixers. This paper proposes a novel modulation and demodulation method for the IntRx SWIPT architecture based on pulse position modulation (PPM) where information is encoded in the position of the pulse. The new method transmits high amplitude pulses to increase the Peak-to-Average Power Ratio (PAPR) of the transmit signal and exploits the EH's nonlinearity so as to boost the harvested DC power. Simultaneously, the information can be decoded from the rectifier signal by simply finding the position of the pulse in a certain symbol duration. We have analyzed both the information and the power transfer performance of the newly proposed PPM for IntRx SWIPT theoretically, numerically, and experimentally. To that end, we have established a SWIPT system testbed in an indoor environment by prototyping a base station to transfer information-power signal and the IntRx SWIPT receiver including ID and EH blocks. The performance evaluation of the PPM was carried out in various conditions, and the results have been compared and contrasted to conventional signals. Theoretical, numerical, and experimental results highlight the significant benefits of the proposed PPM scheme to enhance the power transfer performance and operate information decoding with low-power consumption.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Junghoon Kim, Bruno Clerckx. 2021-04-16. Wireless Information and Power Transfer for IoT: Pulse Position Modulation, Integrated Receiver, and Experimental Validation. https://arxiv.org/abs/2104.08404

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT