Search arXivSearch

arXiv · 1609.00317

The κ-μ Shadowed Fading Model with Integer Fading Parameters

Abstract

We show that the popular and general κ-μ shad- owed fading model with integer fading parameters μ and m can be represented as a mixture of squared Nakagami (or Gamma) distributions. Thus, its PDF and CDF can be expressed in closed-form in terms of a finite number of elementary functions (powers and exponentials). The main implications arising from such connection are then discussed, which can be summarized as: (1) the performance evaluation of communication systems operating in κ-μ shadowed fading becomes as simple as if a Nakagami fading channel was assumed; (2) the κ-μ shadowed distribution can be used to approximate the κ-μ distribution us- ing a closed-form representation in terms of elementary functions, by choosing a sufficiently large value of m; and (3) restricting the parameters μ and m to take integer values has limited impact in practice when fitting the κ-μ shadowed fading model to field measurements. As an application example, the average channel capacity of communication systems operating under κ-μ shadowed fading is obtained in closed-form.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

F. Javier Lopez-Martinez, Jose F. Paris, Juan M. Romero-Jerez. 2017-01-11. The κ-μ Shadowed Fading Model with Integer Fading Parameters. https://doi.org/10.1109/tvt.2017.2678430

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