Search arXivSearch

arXiv · 1904.05587

The α-κ-μ Shadowed Fading Distribution: Statistical Characterization and Applications

Abstract

We introduce the α-κ-μ shadowed (α-KMS) fading distribution as a natural generalization of the versatile α-κ-μ and α-η-μ distributions. The α-KMS fading distribution unifies a wide set of fading distributions, as it includes the α-κ-μ, α- η-μ, α-μ, Weibull, κ-μ shadowed, Rician shadowed, κ-μ and η- μ distributions as special cases, together with classical models like Rice, Nakagami-m, Hoyt, Rayleigh and one-sided Gaussian. Notably, the α-KMS distribution reduces to a finite mixture of α-μ distributions when the fading parameters μ and m take positive integer values, so that performance analysis over α-KMS fading channels can be tackled by leveraging previous (existing) results in the literature for the simpler α-μ case. As application examples, important performance metrics like the outage probability and average channel capacity are analyzed.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pablo Ramirez-Espinosa, Jules M. Moualeu, Daniel Benevides da Costa, F. Javier Lopez-Martinez. 2019-04-11. The α-κ-μ Shadowed Fading Distribution: Statistical Characterization and Applications. https://doi.org/10.1109/globecom38437.2019.9013399

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