Search arXivSearch

arXiv · 1605.05633

Energy-Recycling Full-Duplex Radios for Next-Generation Networks

Abstract

In this work, a novel energy-recycling single-antenna full-duplex (FD) radio is designed, in which a new 3-port element including a power divider and an energy harvester is added between the circulator and the receiver (RX) chain. The presence of this new element brings advantages over the state of the art in terms of both spectral efficiency and energy consumption. In particular, it provides the means of performing both an arbitrary attenuation of the incoming signal, which in turn increases the effectiveness of the state-of-the-art self-interference cancellation strategies subsequently adopted in the RX chain, and the recycling of a non-negligible portion of the energy leaked through the non-ideal circulator. The performance of this architecture is analyzed in a practically relevant 4-node scenario in which 2 nodes operate in FD and 2 nodes in half-duplex (HD). Analytical approximations are derived for both the achievable rates of the transmissions performed by the FD and HD radios and the energy recycled by the FD radios. The accuracy of these derivations is confirmed by numerical simulations. Quantitatively, achievable rate gains up to 40% over the state-of-the-art alternatives, in the considered scenario, are highlighted. Furthermore, up to 50% of the leaked energy at the circulator, i.e., 5% of the energy of the transmitted signal, can be recycled.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marco Maso, Chen-Feng Liu, Chia-Han Lee, Tony Q. S. Quek, Leonardo S. Cardoso. 2016-05-18. Energy-Recycling Full-Duplex Radios for Next-Generation Networks. https://doi.org/10.1109/jsac.2015.2482058

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