Search arXivSearch

arXiv · 1901.05999

Robust Design of AC Computing-Enabled Receiver Architecture for SWIPT Networks

Abstract

Inspired by the direct use of alternating current (AC) for computation, we propose a novel integrated information and energy receiver architecture for simultaneous wireless information and power transfer (SWIPT) networks. In this context, the AC computing method, in which wirelessly harvested AC energy is directly used to supply the computing block of receivers, enhances not only computational ability but also energy efficiency over the conventional direct current (DC) one. Further, we aim to manage the trade-off between the information decoding (ID) and energy harvesting (EH) optimally while taking imperfect channel estimation into account. It results in a worst-case optimization problem of maximizing the data rate under the constraints of an EH requirement, the energy needed for supplying the AC computational logic, and a transmit power budget. Then, we propose a method to derive closed-form optimal solutions. The numerical results demonstrate that the proposed architecture with AC computing significantly improves the rate-energy region.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ha-Vu Tran, Georges Kaddoum. 2019-01-17. Robust Design of AC Computing-Enabled Receiver Architecture for SWIPT Networks. https://arxiv.org/abs/1901.05999

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