Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1407.1492

Joint Beamforming Design for Multi-User Wireless Information and Power Transfer

Hyukmin Son·Bruno Clerckx
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we propose a joint beamforming algorithm for a multiuser wireless information and power transfer (MU-WIPT) system that is compatible with the conventional multiuser multiple input multiple output (MU-MIMO) system. The proposed joint beamforming vectors are initialized using the well established MU-MIMO zero-forcing beamforming (ZFBF) and are further updated to maximize the total harvested energy of energy harvesting (EH) users and guarantee the signal to interference plus noise ratio (SINR) constraints of the co-scheduled information decoding (ID) users. When ID and EH users are simultaneously served by joint beamforming vectors, the harvested energy can be increased at the cost of an SINR loss for ID users. To characterize the SINR loss, the target SINR ratio,u, is introduced as the target SINR (i.e., SINR constraint) normalized by the received SINR achievable with ZFBF. Based on that ratio, the sum rate and harvested energy obtained from the proposed algorithm are analyzed under perfect/imperfect channel state information at the transmitter (CSIT). Through simulations and numerical results, we validate the derived analyses and demonstrate the EH and ID performance compared to both state of the art and conventional schemes.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hyukmin Son, Bruno Clerckx. 2014-07-06. Joint Beamforming Design for Multi-User Wireless Information and Power Transfer. https://arxiv.org/abs/1407.1492

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↗