Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2209.13263

Error Rate and Ergodic Capacity of RF-FSO System with Partial Relay Selection in the Presence of Pointing Errors

Milica I. Petkovic·Imran Shafique Ansari·Goran T. Djordjevic·Khalid A. Qaraqe
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper presents an analysis of a multiple dual-hop relaying system, which is composed of km-class radio frequency (RF)-free-space optical (FSO) links. Partial relay selection based on outdated channel state information (CSI) is employed in order to select active relay for further transmission. Amplify-and-forward relaying protocol is utilized. The RF links are assumed to be subject to Rayleigh fading, and the FSO links are influenced by both Gamma-Gamma atmospheric turbulence and pointing errors. On the basis of our previously derived expression for cumulative distribution function of the equivalent signal-to-noise ratio of the whole system, we derive novel analytical expressions for the average bit-error rate (BER) and ergodic capacity that are presented in terms of the Meijer's G-function and extended generalized bivariate Meijer's G-function, respectively. The numerical results are confirmed by Monte Carlo simulations. Considering the effect of time-correlation between outdated CSI and actual CSI related to the RF channel at the time of transmission, the average BER and the ergodic capacity dependence on various system and channel parameters are observed and discussed. The results illustrate that the temporal correlation between outdated and actual CSI has strong effect on system performance, particularly on BER values, when FSO hop is influenced by favorable conditions. Keywords: Bit error rate, ergodic capacity, free-space optical systems, partial relay selection, radio frequency systems.

Explore related subjects

cs.ITcs.NImath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Milica I. Petkovic, Imran Shafique Ansari, Goran T. Djordjevic, Khalid A. Qaraqe. 2022-09-28. Error Rate and Ergodic Capacity of RF-FSO System with Partial Relay Selection in the Presence of Pointing Errors. https://doi.org/10.1016/j.optcom.2019.01.028

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↗