Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2008.12507

A Low-Complexity Beamforming Design for Multiuser Wireless Energy Transfer

Onel L. A. López·Francisco A. Monteiro·Hirley Alves·Rui Zhang·Matti Latva-aho
View original source ↗Read source document ↗Export metadata ↓

Abstract

Wireless energy transfer (WET) is a green enabler of low-power Internet of Things (IoT). Therein, traditional optimization schemes relying on full channel state information (CSI) are often too costly to implement due to excessive energy consumption and high processing complexity. This letter proposes a simple, yet effective, energy beamforming scheme that allows a multi-antenna power beacon (PB) to fairly power a set of IoT devices by only relying on the first-order statistics of the channels. In addition to low complexity, the proposed scheme performs favorably as compared to benchmarking schemes and its performance improves as the number of PB's antennas increases. Finally, it is shown that further performance improvement can be achieved through proper angular rotations of the PB.

Explore related subjects

cs.ITcs.NImath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Onel L. A. López, Francisco A. Monteiro, Hirley Alves, Rui Zhang, Matti Latva-aho. 2020-08-28. A Low-Complexity Beamforming Design for Multiuser Wireless Energy Transfer. https://arxiv.org/abs/2008.12507

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗