Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1903.09353

A Comprehensive Performance Evaluation of a DF-Based Multi-Hop System Over $α-κ-μ$ and $α-κ-μ$-Extreme Fading Channels

Tau Raphael Rasethuntsa·Sandeep Kumar·Manpreet Kaur
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this work, an integrated performance evaluation of a decode-and-forward (DF) multi-hop wireless communication system is undertaken over the non-linear generalized $α-κ-μ$ and $α-κ-μ$-Extreme fading models. Analytical formulas for the probability density function (PDF) and the cumulative distribution function (CDF) of the received signal-to-noise ratio (SNR) as well as its generalized moments and moment generating function (MGF) are derived. Based on the derived PDFs, novel closed-form expressions for traditional performance metrics such as amount of fading (AF), outage probability (OP), bit error rate (BER) under coherent and non-coherent modulation schemes as well as channel capacity under various adaptive transmission techniques are derived. Additionally, asymptotic analyses of BER based on Poincare series expansions of SNR PDFs are carried out and results show good approximations for low SNR regimes. The correctness of the proposed solutions has been corroborated by comparing them with Monte Carlo simulation results.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tau Raphael Rasethuntsa, Sandeep Kumar, Manpreet Kaur. 2019-03-22. A Comprehensive Performance Evaluation of a DF-Based Multi-Hop System Over $α-κ-μ$ and $α-κ-μ$-Extreme Fading Channels. https://arxiv.org/abs/1903.09353

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↗