Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1405.2029

Mutual Information as a Figure of Merit for Optical Fiber Systems

Tobias Fehenberger·Norbert Hanik
View original source ↗Read source document ↗Export metadata ↓

Abstract

Advanced channel decoders rely on soft-decision decoder inputs for which mutual information (MI) is the natural figure of merit. In this paper, we analyze an optical fiber system by evaluating MI as the maximum achievable rate of transmission of such a system. MI is estimated by means of histograms for which the correct bin number is determined in a blind way. The MI estimate obtained this way shows excellent accuracy in comparison with the true MI of 16-state quadrature amplitude modulation (QAM) over an additive white Gaussian noise channel with additional phase noise, which is a simplified model of a nonlinear optical fiber channel. We thereby justify to use the MI estimation method to accurately estimate the MI of an optical fiber system. In the second part of this work, a transoceanic fiber system with 6000 km of standard single-mode fiber is simulated and its MI determined. Among rectangular QAMs, 16-QAM is found to be the optimal modulation scheme for this link as to performance in terms of MI and requirements on components and digital signal processing. For the reported MI of 3.1 bits/symbol, a minimum coding overhead of 29% is required when the channel memory is not taken into account. By employing ideal single-channel digital back-propagation, an increase in MI by 0.25 bits/symbol and 0.28 bits/symbol is reported for 16-QAM and 64-QAM, respectively, lowering the required overhead to 19% and 16%. When the channel spacing is decreased to be close to the Nyquist rate, the dual-polarization spectral efficiency is 5.7 bits/s/Hz, an increase of more than 2 bits/symbol compared to a 50 GHz spacing.

Explore related subjects

cs.ITmath.ITphysics.optics

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tobias Fehenberger, Norbert Hanik. 2015-11-19. Mutual Information as a Figure of Merit for Optical Fiber Systems. https://arxiv.org/abs/1405.2029

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↗