Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2006.07803

System Outage Probability of PS-SWIPT Enabled Two-Way AF Relaying with Hardware Impairments

Zhipeng Liu·Guangyue Lu·Yinghui Ye·Xiaoli Chu
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we investigate the system outage probability of a simultaneous wireless information and power transfer (SWIPT) based two-way amplify-and-forward (AF) relay network considering transceiver hardware impairments (HIs), where the energy-constrained relay node processes the received signals based on a power splitting protocol and the two terminals employ a selection combining (SC) scheme to exploit the signals from the direct and relaying links. Assuming independent but non-identically distributed Nakagami-m fading channels, we derive the system outage probability in a closed-form, which enables us to identify two crucial ceiling effects on the system outage probability caused by HIs in the high data rate regions, i.e., relay cooperation ceiling (RCC) and overall system ceiling (OSC). Specifically, the RCC prevents the relaying link from participating in cooperative communications, while the OSC leaves the overall system in outage. Furthermore, we derive the achievable diversity gain of the considered network, which shows that the diversity gain equals either the shape parameter of the direct link or zero. Computer simulations are provided to validate the correctness of our analytical results, and study the effects of various system parameters on the system outage performance and the optimal power splitting ratio, as well as the energy efficiency.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhipeng Liu, Guangyue Lu, Yinghui Ye, Xiaoli Chu. 2020-09-30. System Outage Probability of PS-SWIPT Enabled Two-Way AF Relaying with Hardware Impairments. https://doi.org/10.1109/tvt.2020.3030134

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↗