Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2005.14218

Performance of Multibeam Very High Throughput Satellite Systems Based on FSO Feeder Links with HPA Nonlinearity

Emna Zedini·Abla Kammoun·Mohamed-Slim Alouini
View original source ↗Read source document ↗Export metadata ↓

Abstract

Due to recent advances in laser satellite communications technology, free-space optical (FSO) links are presented as an ideal alternative to the conventional radio frequency (RF) feeder links of the geostationary satellite for next generation very high throughput satellite (VHTS) systems. In this paper, we investigate the performance of multibeam VHTS systems that account for nonlinear high power amplifiers at the transparent fixed gain satellite transponder. Specifically, we consider the forward link of such systems, where the RF user link is assumed to follow the shadowed Rician model and the FSO feeder link is modeled by the Gamma-Gamma distribution in the presence of beam wander and pointing errors where it operates under either the intensity modulation with direct detection or the heterodyne detection. Moreover, zero-forcing precoder is employed to mitigate the effect of inter-beam interference caused by the aggressive frequency reuse in the user link. The performance of the system under study is evaluated in terms of the outage probability, the average bit-error rate (BER), and the ergodic capacity that are derived in exact closed-forms in terms of the bivariate Meijer's G function. Simple asymptotic results for the outage probability and the average BER are also obtained at high signal-to-noise ratio.

Explore related subjects

cs.ITeess.SPmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Emna Zedini, Abla Kammoun, Mohamed-Slim Alouini. 2020-05-28. Performance of Multibeam Very High Throughput Satellite Systems Based on FSO Feeder Links with HPA Nonlinearity. https://arxiv.org/abs/2005.14218

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↗