Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1505.02536

Efficient Symbol Detection for the FSO IM/DD System with Automatic and Adaptive Threshold Adjustment: The Multi-level PAM Case

Tianyu Song·Pooi-Yuen Kam
View original source ↗Read source document ↗Export metadata ↓

Abstract

To detect M-ary pulse amplitude modulation signals reliably in an FSO communication system, the receiver requires accurate knowledge about the instantaneous channel attenuation on the signal. We derive here an optimum, symbol-by-symbol receiver that jointly estimates the attenuation with the help of past detected data symbols and detects the data symbols accordingly. Few pilot symbols are required, resulting in high spectral efficiency. Detection can be performed with a very low complexity. From both theoretical analysis and simulation, we show that as the number of the detected data symbols used for estimating the channel attenuation increases, the bit error probability of our receiver approaches that of detection with perfect channel knowledge.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tianyu Song, Pooi-Yuen Kam. 2015-05-11. Efficient Symbol Detection for the FSO IM/DD System with Automatic and Adaptive Threshold Adjustment: The Multi-level PAM Case. https://arxiv.org/abs/1505.02536

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↗