Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2402.11352

Maximum Spectral Efficiency of Adaptive Coherent Terrestrial FSO Links

Himani Verma·Kamal Singh·Ranjan K. Mallik
View original source ↗Read source document ↗Export metadata ↓

Abstract

Terrestrial free-space optical (FSO) communication systems, while designed to operate on large unlicensed optical bandwidths, are fundamentally power-constrained due to stringent eye-safety regulations. Moreover, channel fluctuations inherent to terrestrial FSO links further reduce the received optical power. Consequently, the achievable signal-to-noiseratio (SNR) per hertz could become limited -- especially for future terrestrial FSO systems based on coherent communications. This necessitates the development of efficient and adaptive communication strategies at both the optical transmitter and receiver. However, a comprehensive assessment of adaptive coherent terrestrial FSO systems remains largely unexplored in the existing literature. This paper investigates terrestrial FSO communication links employing adaptive coherent transmission and synchronous heterodyne detection-based reception operating in the shot-noise-limited regime. Specifically, we propose a novel exact closed-form expression for the average spectral efficiency limit of coherent FSO communication systems with optimal adaptive signaling over gamma-gamma turbulence channels with pointing errors. More importantly, we provide a detailed assessment of the impact of turbulence and pointing error impairments on the coherent FSO system performance, revealing several novel and counterintuitive insights. Extensive numerical results help elucidate the intricacies of analyzing these terrestrial FSO systems and clarify a few misconceptions alluded to in recent related literature.

Explore related subjects

cs.ITeess.SPmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Himani Verma, Kamal Singh, Ranjan K. Mallik. 2026-02-25. Maximum Spectral Efficiency of Adaptive Coherent Terrestrial FSO Links. https://arxiv.org/abs/2402.11352

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↗