Search arXivSearch

arXiv · 1507.04240

Unified Performance Analysis of Mixed Radio Frequency/Free-Space Optical Dual-Hop Transmission Systems

Abstract

The mixed radio frequency (RF)/free-space optical (FSO) relaying is a promising technology for coverage improvement, while there lacks unified expressions to describe its performance. In this paper, a unified performance analysis framework of a dual-hop relay system over asymmetric RF/FSO links is presented. More specifically, we consider the RF link follows generalized $κ$-$μ$ or $η$-$μ$ distributions, while the FSO link experiences the gamma-gamma distribution, respectively. Novel analytical expressions of the probability density function and cumulative distribution function are derived. We then capitalize on these results to provide new exact analytical expressions of the outage probability and bit error rate (BER). Furthermore, the outage probability for high signal-to-noise ratios and the BER for different modulation schemes are deduced to provide useful insights into the impact of system and channel parameters of the overall system performance. These accurate expressions are general, since they correspond to generalized fading in the RF link and account for pointing errors, atmospheric turbulence and different modulation schemes in the FSO link. The links between derived results and previous results are presented. Finally, numerical and Monte-Carlo simulation results are provided to demonstrate the validity of the proposed unified expressions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jiayi Zhang, Linglong Dai, Yu Zhang, Zhaocheng Wang. 2015-07-15. Unified Performance Analysis of Mixed Radio Frequency/Free-Space Optical Dual-Hop Transmission Systems. https://doi.org/10.1109/jlt.2015.2409570

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