Search arXivSearch

arXiv · 2205.05604

The Fluctuating Two-Ray Fading Model with Independent Specular Components

Abstract

We introduce and characterize the independent fluctuating two-ray (IFTR) fading model, a class of fading models consisting of two specular components which fluctuate independently, plus a diffuse component modeled as a complex Gaussian random variable. The IFTR model complements the popular fluctuating two-ray (FTR) model, on which the specular components are fully correlated and fluctuate jointly. The chief probability functions of the received SNR in IFTR fading, including the PDF, CDF and MGF, are expressed in closed-form, having a functional form similar to other state-of-the-art fading models. Then, the IFTR model is empirically validated using multiple channels measured in rather diverse scenarios, including line of sight (LOS) millimeter-wave, land mobile satellite (LMS) and underwater acoustic communication (UAC), showing a better fit than the original FTR model and other models previously used in these environments. Additionally, the performance of wireless communication systems operating under IFTR fading is evaluated in closed-form in two scenarios: (i) exact and asymptotic bit error rate for a family of coherent modulations; and (ii) exact and asymptotic outage probability.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Maryam Olyaee, José A. Cortés, F. Javier Lopez-Martinez, José F. Paris, Juan M. Romero-Jerez. 2022-05-11. The Fluctuating Two-Ray Fading Model with Independent Specular Components. https://arxiv.org/abs/2205.05604

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