SearcharxivSearch

arXiv subjects

Tobias Fehenberger

Publications and source records attributed to Tobias Fehenberger.

At least 19 recordsLinked to original sources

Practical Methods for Distance-Adaptive Continuous-Variable Quantum Key Distribution

Continuous-variable quantum key distribution (CV-QKD) is a promising quantum-safe alternative to classical asymmetric cryptography that enables two authenticated parties to establish a shared secret over a potentially eavesdropped quantum channel. A key step in CV-QKD post-processing is information reconciliation, which leverages forward error correction (FEC) techniques to extract identical bit strings from noisy correlated data. In this work, we analyze the strict limitations on operating distance that are imposed by constant-rate FEC, severely limiting the practicability of CV-QKD systems in deployed optical networks. To overcome the distance limitations, we evaluate three strategies: (i) tuning modulation variance, (ii) adding controlled amounts of trusted detector loss, and (iii) the use of rate-adaptive FEC. All approaches are validated experimentally, compared in terms of performance, and we discuss implementation aspects. Our results show that while methods (i) and (ii) extend the operational distance of constant-rate FEC without the need for additional hardware components, they incur a significant penalty in secret key rate (SKR). In contrast, rate-adaptive FEC enables CV-QKD operation with performance close to the asymptotic SKR over a wide range of distances, provided that the reconciliation efficiency is chosen appropriately.

quant-ph

On the Benefits of Rate-Adaptive Transceivers: A Network Planning Study

Flexible-grid Elastic Optical Networks (EONs) have been widely deployed in recent years to support the growing demand for bandwidth-intensive applications. To address this cost-efficiently, optimized utilization of EONs is required. Next-generation bandwidth-variable transceivers (BVTs) will offer increased adaptivity in symbol rate as well as modulation through probabilistic constellation shaping. In this work, we therefore investigate the impact of increased configuration granularity on various aspects of optical networks. We account for practical implementation considerations of BVT configurations for the estimation of the required signal-to-noise ratio. Additionally, an optimization algorithm is presented that selects the most efficient configuration for each considered data rate and bandwidth combination. Based on the advanced transceiver configurations, we conduct a network planning study using a physical-layer-aware algorithm for flexible-grid EONs, and present results for a national and a continental optical backbone network topology. Our research demonstrates that a rise in modulation rate adaptivity results in substantial savings in resources, decreasing the number of necessary lightpaths by as much as 20% in EONs. In contrast, increased symbol rate granularity only results in minor savings.

cs.NI

QoT estimation using EGN-assisted machine learning for multi-period network planning

The rapidly growing traffic demands in fiber-optical networks require flexibility and accuracy in configuring lightpaths, for which fast and accurate quality of transmission (QoT) estimation is of pivotal importance. This paper introduces a machine learning (ML)-based QoT estimation approach that meets these requirements. The proposed gradient-boosting ML model uses precomputed per-channel self-channel-interference values as representative and condensed features to estimate non-linear interference in a flexible-grid network. With an enhanced Gaussian noise (GN) model simulation as the baseline, the ML model achieves a mean absolute signal-to-noise ratio error of approximately 0.1 dB, which is an improvement over the GN model. For three different network topologies and network planning approaches of varying complexities, a multi-period network planning study is performed in which ML and GN are compared as path computation elements (PCEs). The results show that the ML PCE is capable of matching or slightly improving the performance of the GN PCE on all topologies while reducing significantly the computation time of network planning by up to 70%.

cs.NI

Multi-Wavelength Transponders for High-capacity Optical Networks: A Physical-layer-aware Network Planning Study

Continued cost- and power-efficient capacity scaling in optical networks is imperative to keep pace with ever-increasing traffic demands. In this paper, we investigate multi-wavelength transponders as a potential way forward. Suitable system architectures and realistic specifications of multi-wavelength transponders are identified and analyzed in terms of transmit OSNR penalties and spectral constraints. We investigate the performance for different specifications as compared to single-wavelength transponders in a network planning study on two network topologies, developing guidelines for multi-wavelength transponders specifications and their potential benefits. The studies show a reduction in the number of required lasers of up to 83% at the expense of a slight increase in number of lightpaths, demonstrating the potential for significant cost savings and efficiency improvements.

cs.NI

Black-Box Assessment of Optical Spectrum Services

A spectral sweep process is introduced to discover performance issues in optical spectrum services. We detect filtering penalty, spectral ripple/tilt and channel crosstalk in field measurements, potentially leading to increased service robustness in low-margin networks.

cs.NI

QoT Assessment of the Optical Spectrum as a Service in Disaggregated Network Scenarios

The potential to operate third-party terminals over multi-domain transparent optical networks attracts operators and customers to implement Optical Spectrum as a Service (OSaaS). As infrastructure information cannot always be shared with OSaaS end customers, alternatives to off-line Quality of Transmission (QoT) estimation tools are required to assess the performance of the spectrum slot in order to estimate achievable throughput. In this paper, commercially available sliceable coherent transceivers are used to assess the Generalized Signal To Noise Ratio (GSNR) based QoT of the OSaaS in a live production network for both, narrow-band and wide-band OSaaS configurations. Extended channel probing based on symbol rate variability is combined with spectral sweeping and operation regime detection to characterize OSaaS implementations on 17 links with different underlying infrastructure configurations in order to maximize capacity and increase service margins in a low-margin operation regime. We achieve 0.05 dB estimation accuracy in GSNR for a wide-band spectrum services and 0.32 dB accuracy for narrow-band spectrum services. Based on the GSNR profile, spectral misalignment, spectral ripple, and operation regime are detected and service margin improvements are demonstrated. Finally, we discuss the network optimization perspective based on acquired data from channel probing and propose use-cases for continuous channel probing in transparent optical networks.

cs.NI

Fiber Nonlinearity Mitigation by Short-Length Probabilistic Constellation Shaping for Pilot-Aided Signaling

Probabilistic constellation shaping (PCS) offers a significant performance improvement over uniform signaling. It was recently discovered that long blocks are not required to achieve maximum shaping gain when transmitting over the nonlinear fiber channel because short-length PCS effectively mitigates fiber nonlinear interference (NLI). The reason for this behavior is that short-length PCS implicitly induces some temporal properties in the shaped transmit sequence that are beneficial for the fiber-optic channel. To achieve robust data-aided digital signal processing of high-order QAM, periodic quaternary phase shift keying pilots are typically inserted into the high-order QAM transmit sequence. In this work, we investigate in simulations the effect of such pilot-aided signaling on NLI mitigation. Albeit modifying the temporal properties of the shaped transmit sequence, a pilot rate of 1/32 is found to not alter the beneficial effects of short-length PCS. The operation meaning of this finding is that even with pilot-aided signaling, long PCS block lengths are not required for maximum shaping gain.

eess.SP

Analysis of Nonlinear Fiber Interactions for Finite-Length Constant-Composition Sequences

In order to realize probabilistically shaped signaling within the probabilistic amplitude shaping (PAS) framework, a shaping device outputs sequences that follow a certain nonuniform distribution. In case of constant-composition (CC) distribution matching (CCDM), the sequences differ only in the ordering of their constituent symbols, whereas the number of occurrences of each symbol is constant in every output block. Recent results by Amari \textit{et al.} have shown that the CCDM block length can have a considerable impact on the effective signal-to-noise ratio (SNR) after fiber transmission. So far, no explanation for this behavior has been presented. Furthermore, the block-length dependence of the SNR seems not to be fully aligned with previous results in the literature. This paper is devoted to a detailed analysis of the nonlinear fiber interactions for CC sequences. We confirm in fiber simulations the inverse proportionality of SNR with CCDM block length and present two explanations. The first one, which only holds in the short-length regime, is based on how two-dimensional symbols are generated from shaped amplitudes in the PAS framework. The second, more general explanation relates to an induced shuffling within a sequence, or equivalently a limited concentration of identical symbols, that is an inherent property for short CC blocks, yet not necessarily present for long blocks. This temporal property results in weaker nonlinear interactions, and thus higher SNR, for short CC sequences. For a typical multi-span fiber setup, the SNR difference is numerically demonstrated to be up to 0.7dB. Finally, we evaluate a heuristic figure of merit that captures the number of runs of identical symbols in a concatenation of several CC sequences. For moderate block lengths up to approximately 100 symbols, this metric suggests that limiting the number of identical-symbol runs can be beneficial.

eess.SP

Huffman-coded Sphere Shaping and Distribution Matching Algorithms via Lookup Tables

In this paper, we study amplitude shaping schemes for the probabilistic amplitude shaping (PAS) framework as well as algorithms for constant-composition distribution matching (CCDM). Huffman-coded sphere shaping (HCSS) is discussed in detail, which internally uses Huffman coding to determine the composition to be used and relies on conventional CCDM algorithms for mapping and demapping. Numerical simulations show that HCSS closes the performance gap between distribution matching schemes and sphere shaping techniques such as enumerative sphere shaping (ESS). HCSS is based on an architecture that is different from the trellis-based setup of ESS. It allows to tailor the used HCSS compositions to the transmission channel and to take into account complexity constraints. We further discuss in detail multiset ranking (MR) and subset ranking (SR) as alternatives to arithmetic-coding (AC) CCDM. The advantage of MR over AC is that it requires less sequential operations for mapping. SR operates on binary alphabets only, which can introduce some additional rate loss when a nonbinary-to-binary transformation is required. However, the binomial coefficients required for SR can be precomputed and stored in a lookup table (LUT). We perform an analysis of rate loss and decoding performance for the proposed techniques and compare them to other prominent amplitude shaping schemes. For medium to long block lengths, MR-HCSS and SR-HCSS are shown to have similar performance to ESS. SR-HCSS and uniform 64QAM are compared in additive white Gaussian noise simulations and shaping gains of 0.5 dB and 1 dB are demonstrated with 1 kbit and 100 kbit LUT size, respectively.

eess.SP

Probabilistic Shaping for Finite Blocklengths: Distribution Matching and Sphere Shaping

In this paper, we provide for the first time a systematic comparison of distribution matching (DM) and sphere shaping (SpSh) algorithms for short blocklength probabilistic amplitude shaping. For asymptotically large blocklengths, constant composition distribution matching (CCDM) is known to generate the target capacity-achieving distribution. As the blocklength decreases, however, the resulting rate loss diminishes the efficiency of CCDM. We claim that for such short blocklengths and over the additive white Gaussian channel (AWGN), the objective of shaping should be reformulated as obtaining the most energy-efficient signal space for a given rate (rather than matching distributions). In light of this interpretation, multiset-partition DM (MPDM), enumerative sphere shaping (ESS) and shell mapping (SM), are reviewed as energy-efficient shaping techniques. Numerical results show that MPDM and SpSh have smaller rate losses than CCDM. SpSh--whose sole objective is to maximize the energy efficiency--is shown to have the minimum rate loss amongst all. We provide simulation results of the end-to-end decoding performance showing that up to 1 dB improvement in power efficiency over uniform signaling can be obtained with MPDM and SpSh at blocklengths around 200. Finally, we present a discussion on the complexity of these algorithms from the perspective of latency, storage and computations.

eess.SP

Analysis and Optimisation of Distribution Matching for the Nonlinear Fibre Channel

Enhanced Gaussian noise models are used to demonstrate that the per-block SNR after fibre transmission varies significantly due to the variable-composition nature of modern probabilistic shaping schemes. We propose a nonlinearity-optimised distribution matcher that improves the average and worst-case SNR by 0.14 and 0.22 dB, respectively.

eess.SP

Parallel-Amplitude Architecture and Subset Ranking for Fast Distribution Matching

A distribution matcher (DM) maps a binary input sequence into a block of nonuniformly distributed symbols. To facilitate the implementation of shaped signaling, fast DM solutions with high throughput and low serialism are required. We propose a novel DM architecture with parallel amplitudes (PADM) for which m component DMs, each with a different binary output alphabet, are operated in parallel in order to generate a shaped sequence with m amplitudes. With negligible rate loss compared to a single nonbinary DM, PA-DM has a parallelization factor that grows linearly with m, and the component DMs have reduced output lengths. For such binary-output DMs, a novel constant-composition DM (CCDM) algorithm based on subset ranking (SR) is proposed. We present SR-CCDM algorithms that are serial in the minimum number of occurrences of either binary symbol for mapping and fully parallel in demapping. For distributions that are optimized for the additive white Gaussian noise (AWGN) channel, we numerically show that PA-DM combined with SR-CCDM can reduce the number of sequential processing steps by more than an order of magnitude, while having a rate loss that is comparable to conventional nonbinary CCDM with arithmetic coding.

eess.SP