Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1509.06602

Magnetic Beamforming for Wireless Power Transfer

Gang Yang·Mohammad R. Vedady Moghadam·Rui Zhang
View original source ↗Read source document ↗Export metadata ↓

Abstract

Magnetic resonant coupling (MRC) is an efficient method for realizing the near-field wireless power transfer (WPT). The use of multiple transmitters (TXs) each with one coil can be applied to enhance the WPT performance by focusing the magnetic fields from all TX coils in a beam toward the receiver (RX) coil, termed as "magnetic beamforming". In this paper, we study the optimal magnetic beamforming for an MRC-WPT system with multiple TXs and a single RX. We formulate an optimization problem to jointly design the currents flowing through different TXs so as to minimize the total power drawn from their voltage sources, subject to the minimum power required by the RX load as well as the TXs' constraints on the peak voltage and current. For the special case of identical TX resistances and neglecting all TXs' constraints on the peak voltage and current, we show that the optimal current magnitude of each TX is proportional to the mutual inductance between its TX coil and the RX coil. In general, the problem is a non-convex quadratically constrained quadratic programming (QCQP) problem, which is reformulated as a semidefinite programming (SDP) problem. We show that its semidefinite relaxation (SDR) is tight. Numerical results show that magnetic beamforming significantly enhances the deliverable power as well as the WPT efficiency over the uncoordinated benchmark scheme of equal current allocation.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gang Yang, Mohammad R. Vedady Moghadam, Rui Zhang. 2015-09-23. Magnetic Beamforming for Wireless Power Transfer. https://doi.org/10.1109/icassp.2016.7472415

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↗