Searcharxiv⌕ Search

arXiv subjects

Marco Secondini

Publications and source records attributed to Marco Secondini.

At least 19 recordsLinked to original sources
arXiv2026

Performance Optimization of Short Reach Optical Interconnects based on Direct Detection

Short-reach optical interconnects are evolving toward data rates beyond 400 Gb/s per lane, driven by the bandwidth and energy-efficiency requirements of AI-enabled datacenter networks. At these operating speeds, channel impairments, device nonlinearities, and hardware constraints limit the effectiveness of conventional transceiver design and digital signal processing (DSP). This paper presents a unified framework for the optimization of direct-detection optical interconnects, encompassing digital surrogate modeling, receiver-side DSP optimization, and end-to-end (E2E) transceiver learning. The proposed formulation provides a common perspective for model-based and machine-learning-based approaches, including linear and nonlinear equalization, lookup tables, decision trees, neural-network receivers, and E2E optimization. Their performance is discussed together with computational complexity and hardware implementation aspects, highlighting the associated trade-offs. We show, through simulations and experimental validations, that for a 40~Gb/s 10~km link, decision trees can outperform by 0.5--1~dB conventional linear equalization, with negligible hardware requirements. Moreover, we show that an E2E technique based on transformers can provide a gain up to 6~dB, highlighting the potential of joint transceiver optimization to improve the performance of next-generation short-reach optical links.

physics.optics↗
arXiv2026

The Memory-Enhanced Gaussian Noise (MEGN) Model for Fiber-Optic Channels

The enhanced Gaussian noise (EGN) model is widely used for estimating the nonlinear interference (NLI) power accumulated in coherent fiber-optic transmission systems. Given a fixed fiber link, under the assumption that transmitted symbols are independent and identically distributed (i.i.d.), the EGN model establishes that the NLI power depends on time-invariant signal statistics, i.e., the second-, fourth-, and sixth-order moments of the symbols, which are determined by the modulation format and its probability distribution. However, recent advances in coded modulation have sought to mitigate NLI by introducing controlled temporal correlations among transmitted symbols, thereby violating the i.i.d. assumption underlying the EGN model. Among these correlations, symbol energy correlations are believed to exert the most significant influence on NLI. This work presents a rigorous mathematical derivation of a memory extension of the EGN model that explicitly accounts for symbol energy correlations, referred to as the MEGN model. The proposed MEGN model is validated through both numerical simulations and transmission experiments. Normalized average NLI power estimations with less than 5% errors across a wide range of symbol rates and transmission distances are reported. The model also provides a theoretical framework for analyzing and optimizing optical transmission systems employing temporally correlated modulation schemes.

eess.SP↗
arXiv2026

Nonlinearity Compensation for Coherent Optical Satellite Communications

Optical satellite uplinks rely on high-power optical amplifiers (HPOAs) to overcome free-space attenuation and enable long-distance transmission. However, at high power levels, fiber Kerr nonlinearity becomes significant and degrades system performance. In this work, we develop a realistic model for optical uplinks that accounts for nonlinear effects and analyze their impact, highlighting key differences from conventional longhaul fiber systems. We then introduce low-complexity digital signal processing techniques for nonlinearity compensation, based on constellation shaping via a look-up table (LUT) and a simple nonlinear phase rotation applied at the transmitter and/or receiver. The LUT also enables adaptive rate tuning according to channel conditions, enhancing robustness against link variations. Simulation results show that the proposed techniques increase the maximum acceptable link loss by up to 6 dB with negligible complexity. Finally, we show that, at the system level, propagation in the HPOA can be modeled as a simple nonlinear phase rotation, equivalent to propagation in a zero-dispersion noiseless fiber link, and fully characterized by a single parameter - the characteristic nonlinear power.

cs.IT↗
arXiv2026

Discrete-modulation continuous-variable quantum key distribution with probabilistic amplitude shaping over a linear quantum channel

The practical implementation difficulties arising from the Gaussian modulation of the GG02 protocol lead us to investigate the possibilities offered by the combination of probabilistic amplitude shaping technique and quadrature amplitude modulation formats in the context of continuous variable quantum key distribution systems. Our interest comes from the fact that quadrature amplitude modulation and probabilistic shaping can be implemented with current technologies and are widely used in classical telecom equipment. In this treatment, we assume to work in the scenario of a linear quantum channel and we analyze maximum achievable secure key rates, maximum reachable distances and the resilience to noise of our discrete-modulation based protocol with respect to GG02, which is taken as a benchmark. In particular, we deal with the infinite key size regime, consider a homodyne detection scheme, and analyze what happens for different cardinalities of the input alphabet at different distances, in the case of collective attacks and in the reverse reconciliation picture. We find that our protocol, beyond being easily reproducible in the laboratory, provides a way to closely approach the theoretical performance offered by GG02 and, at the same time, preserves the ability to assure an unconditional security level.

quant-ph↗
arXiv2026

Joint Subcarrier Phase Recovery for Nonlinearity Mitigation

We propose a low-complexity phase recovery scheme that simultaneously mitigates laser phase noise and fiber nonlinearity across several subcarriers. In a long single-span link with Raman amplification, the scheme achieves 0.9 dB gain with 99 real multiplications per complex symbol.

eess.SP↗
arXiv2026

ML-Enhanced Digital Backpropagation for Long-Reach Single-Span Systems

We propose a digital backpropagation method that employs machine-learning-aided joint optimization of dispersion step lengths and nonlinear phase rotation filters within an FFT-based enhanced split-step Fourier structure, achieving improved accuracy at low computational complexity.

eess.SP↗
arXiv2025

Soft-Decoding Reverse Reconciliation in Discrete-Modulation CV-QKD

In continuous-variable quantum key distribution, information reconciliation is required to extract a shared secret key from correlated random variables obtained through the quantum channel. Reverse reconciliation (RR) is generally preferred, since the eavesdropper has less information about Bob's measurements than about Alice's transmitted symbols. When discrete modulation formats are employed, however, soft information is available only at Bob's side, while Alice has access only to hard information (her transmitted sequence). This forces her to rely on hard-decision decoding to recover Bob's key. In this work, we introduce a novel RR technique for PAM (and QAM) in which Bob discloses a carefully designed soft metric to help Alice recover Bob's key, while leaking no additional information about the key to an eavesdropper. We assess the performance of the proposed technique in terms of achievable secret key rate (SKR) and its bounds, showing that the achievable SKR closely approaches the upper bound, with a significant gain over hard-decision RR. Finally, we implement the scheme at the coded level using binary LDPC codes with belief-propagation decoding, assess its bit-error rate through numerical simulations, compare the observed gain with theoretical predictions from the achievable SKR, and discuss the residual gap.

cs.IT↗
arXiv2025

Fiber Nonlinearity Mitigation in Coherent Optical Systems

Fiber nonlinearity represents a critical challenge to the capacity enhancement of modern optical communication systems. In recent years, significant research efforts have focused on mitigating its impact through two complementary approaches. On the one hand, researchers have investigated practical digital signal processing (DSP) techniques to mitigate or compensate for nonlinear impairments, such as reversing fiber propagation effects through digital backpropagation (DBP). However, the high computational complexity of these techniques often discourages their practical implementation. On the other hand, information-theoretic studies have sought to establish the capacity limits of the nonlinear optical fiber channel, providing a framework for evaluating the ultimate performance of existing optical networks and guiding the design of next-generation systems. This work reviews recent advances and proposes future directions for nonlinearity compensation and mitigation, including constellation shaping techniques and low-complexity DBP. Furthermore, it highlights the potential of these innovations both in advancing the theoretical understanding of fiber capacity limits and in enabling practical DSP implementations.

cs.IT↗
arXiv2024

Soft Reverse Reconciliation for Discrete Modulations

The performance of the information reconciliation phase is crucial for quantum key distribution (QKD). Reverse reconciliation (RR) is typically preferred over direct reconciliation (DR) because it yields higher secure key rates. However, a significant challenge in continuous-variable (CV) QKD with discrete modulations (such as QAM) is that Alice lacks soft information about the symbol decisions made by Bob. This limitation restricts error correction to hard-decoding methods, with low reconciliation efficiency. This work introduces a reverse reconciliation softening (RRS) procedure designed for CV-QKD scenarios employing discrete modulations. This procedure generates a soft metric that Bob can share with Alice over a public channel, enabling her to perform soft-decoding error correction without disclosing any information to a potential eavesdropper. After detailing the RRS procedure, we investigate how the mutual information between Alice's and Bob's variables changes when the additional metric is shared. We show numerically that RRS improves the mutual information with respect to RR with hard decoding, practically achieving the same mutual information as DR with soft decoding. Finally, we test the proposed RRS for PAM-4 signalling with a rate 1/2 binary LDPC code and bit-wise decoding through numerical simulations, obtaining more than 1dB SNR improvement compared to hard-decoding RR.

cs.IT↗
arXiv2024

Cost-Gain Analysis of Sequence Selection for Nonlinearity Mitigation

We propose a low-complexity sign-dependent metric for sequence selection and study the nonlinear shaping gain achievable for a given computational cost, establishing a benchmark for future research. Small gains are obtained with feasible complexity. Higher gains are achievable in principle, but with high complexity or a more sophisticated metric.

cs.IT↗
arXiv2024

A New Twist on Low-Complexity Digital Backpropagation

This work proposes a novel low-complexity digital backpropagation (DBP) method, with the goal of optimizing the trade-off between backpropagation accuracy and complexity. The method combines a split step Fourier method (SSFM)-like structure with a simplified logarithmic perturbation method to obtain a high accuracy with a small number of DBP steps. Subband processing and asymmetric steps with optimized splitting ratio are also employed to further reduce the number of steps required to achieve a prescribed performance. The first part of the manuscript is dedicated to the derivation of a simplified logarithmic-perturbation model for the propagation of signal in an optical fiber, which serves for the development of the proposed coupled-band enhanced split step Fourier method (CB-ESSFM) and for the analytical calculation of the model coefficients. Next, the manuscript presents a DSP algorithm for the implementation of DBP based on a discrete-time version of the model and an overlap-and-save processing strategy. Practical approaches for the optimization of the coefficients used in the algorithm and of the splitting ratio of the asymmetric steps are also discussed. A detailed analysis of the computational complexity is presented. Finally, the performance and complexity of the proposed DBP method are investigated through simulations. In a five-channel 100 GHz-spaced wavelength division multiplexing system over a 15x80 km single-mode-fiber link, the proposed CB-ESSFM achieves a gain of about 1dB over simple dispersion compensation with only 15 steps (corresponding to 681 real multiplications per 2D symbol), with an improvement of 0.9 dB over conventional SSFM and almost 0.4dB over our previously proposed ESSFM. Significant gains and improvements are obtained also at lower complexity. A similar analysis is performed also for longer links, confirming the good performance of the proposed method.

cs.IT↗
arXiv2024

Coupled-Band ESSFM for Low-Complexity DBP

We propose a novel digital backpropagation (DBP) technique that combines perturbation theory, subband processing, and splitting ratio optimization. We obtain 0.23 dB, 0.47 dB, or 0.91 dB gains w.r.t. dispersion compensation with only 74, 161, or 681 real multiplications/2D-symbol, improving significantly on existing DBP techniques.

cs.IT↗
arXiv2023

Sequence-Selection-Based Constellation Shaping for Nonlinear Channels

Probabilistic shaping is a pragmatic approach to improve the performance of coherent optical fiber communication systems. In the nonlinear regime, the advantages offered by probabilistic shaping might increase thanks to the opportunity to obtain an additional nonlinear shaping gain. Unfortunately, the optimization of conventional shaping techniques, such as probabilistic amplitude shaping (PAS), yields a relevant nonlinear shaping gain only in scenarios of limited practical interest. In this manuscript we use sequence selection to investigate the potential, opportunities, and challenges offered by probabilistic shaping for nonlinear channels. First, we show that ideal sequence selection is able to provide up to 0.13 bit/s/Hz gain with respect to PAS with an optimized blocklength. However, this additional gain is obtained only if the selection metric accounts for the signs of the symbols: they must be known to compute the selection metric, but there is no need to shape them. Furthermore, we show that the selection depends in a non-critical way on the symbol rate and link length: the sequences selected for a certain scenario still provide a relevant gain if these are modified. Then, we analyze and compare several practical implementations of sequence selection by taking into account interaction with forward error correction (FEC) and complexity. Overall, the single block and the multi block FEC-independent bit scrambling are the best options, with a gain up to 0.08 bit/s/Hz. The main challenge and limitation to their practical implementation remains the evaluation of the metric, whose complexity is currently too high. Finally, we show that the nonlinear shaping gain provided by sequence selection persists when carrier phase recovery is included.

cs.IT↗
arXiv2023

Optical identification using physical unclonable functions

In this work, the concept of optical identification (OI) based on physical unclonable functions is introduced for the first time, to our knowledge, in optical communication systems and networks. The OI assigns an optical fingerprint and the corresponding digital representation to each sub-system of the network and estimates its reliability in different measures. We highlight the large potential applications of OI as a physical layer approach for security, identification, authentication, and monitoring purposes. To identify most of the sub-systems of a network, we propose to use the Rayleigh backscattering pattern, which is an optical physical unclonable function and allows to achieve OI with a simple procedure and without additional devices. The applications of OI to fiber and path identification in a network and to the authentication of users in a quantum key distribution system are described.

eess.SP↗