Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2108.07236

Multihop RIS-Assisted FSO-RF System Over Double Generalized Gamma Fading

Vinay Kumar Chapala·S. M. Zafaruddin
View original source ↗Read source document ↗Export metadata ↓

Abstract

Reconfigurable intelligent surface (RIS) is a promising technology to avoid signal blockage by creating virtual line-of-sight (LOS) connectivity for free-space optical (FSO) and radio frequency (RF) wireless systems. This paper considers a mixed FSO-RF system by employing multiple RISs in both the links for multihop transmissions to extend the communication range. We develop probability density function (PDF) and cumulative density function (CDF) of the signal-to-noise ratio (SNR) for the cascaded channels by considering double generalized gamma (dGG) turbulence with pointing errors for the FSO link and the dGG distribution to model the signal fading for the RF. We derive exact closed-form expressions of the outage probability, average bit-error-rate (BER), and ergodic capacity using the decode-and-forward (DF) relaying for the mixed system. We also present asymptotic analysis on the performance in the high SNR regime depicting the impact of channel parameters on the diversity order of the system. We use computer simulations to demonstrate the effect of system and channel parameters on the RIS-aided multihop transmissions.

Explore related subjects

cs.ITeess.SPmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vinay Kumar Chapala, S. M. Zafaruddin. 2021-08-16. Multihop RIS-Assisted FSO-RF System Over Double Generalized Gamma Fading. https://arxiv.org/abs/2108.07236

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↗