Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1707.09796

Performance analysis of FSO communications under LOS blockage

Jose Maria Garrido-Balsells·F. Javier Lopez-Martinez·Miguel Castillo-Vazquez·Antonio Jurado-Navas·Antonio Puerta-Notario
View original source ↗Read source document ↗Export metadata ↓

Abstract

We analyze the performance of a free-space optical (FSO) link affected by atmospheric turbulence and line-of-sight (LOS) blockage. For this purpose, the atmospheric turbulence induced fading is modeled by the M-distribution, which includes the Gamma-Gamma distribution as special case. We exploit the fact that the physical interpretation of the M-distribution allows to split the optical energy through the propagation link into three different components: two coherent components and one incoherent scatter component. Based on this separation, we derive novel analytical expressions for the probability density function (PDF), for the cumulative distribution function (CDF) and for the moment generating function (MGF) of the M-distribution under the temporary blockage of the coherent components, hereinafter referred to as LOS blockage. Further, a new closed-form expression for the outage probability (OP) under LOS blockage is derived in terms of the turbulence model parameters and the LOS blockage probability. By means of an asymptotic analysis, this expression is simplified in the high-SNR regime and the OP in terms of the diversity order and diversity gain is then deduced. Obtained results show that the impact of the LOS blockage on the OP strongly depends on the intensity of the turbulence and on the LOS blockage probability.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jose Maria Garrido-Balsells, F. Javier Lopez-Martinez, Miguel Castillo-Vazquez, Antonio Jurado-Navas, Antonio Puerta-Notario. 2017-07-31. Performance analysis of FSO communications under LOS blockage. https://doi.org/10.1364/oe.25.025278

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↗