Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1508.04716

On the Impact of Optimal Modulation and FEC Overhead on Future Optical Networks

Alex Alvarado·David J. Ives·Seb Savory·Polina Bayvel
View original source ↗Read source document ↗Export metadata ↓

Abstract

The potential of optimum selection of modulation and forward error correction (FEC) overhead (OH) in future transparent nonlinear optical mesh networks is studied from an information theory perspective. Different network topologies are studied as well as both ideal soft-decision (SD) and hard-decision (HD) FEC based on demap-and-decode (bit-wise) receivers. When compared to the de-facto QPSK with 7% OH, our results show large gains in network throughput. When compared to SD-FEC, HD-FEC is shown to cause network throughput losses of 12%, 15%, and 20% for a country, continental, and global network topology, respectively. Furthermore, it is shown that most of the theoretically possible gains can be achieved by using one modulation format and only two OHs. This is in contrast to the infinite number of OHs required in the ideal case. The obtained optimal OHs are between 5% and 80%, which highlights the potential advantage of using FEC with high OHs.

Explore related subjects

cs.ITmath.ITphysics.optics

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alex Alvarado, David J. Ives, Seb Savory, Polina Bayvel. 2015-08-20. On the Impact of Optimal Modulation and FEC Overhead on Future Optical Networks. https://doi.org/10.1109/jlt.2016.2517699

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↗