Deep Learning-Assisted Nonlinearity Compensation in Subcarrier-Multiplexing Coherent Optical Systems
Bibliographic record
Abstract
Fiber nonlinearity imposes limitations on the transmission distances in optical fiber networks. Fiber nonlinearity compensation (NLC) becomes essential for extending the transmission reach; however, conventional methods like digital backpropagation (DBP) experience challenges related to the intricacies of computational demands. To mitigate the fiber nonlinearity cost-effectively, subcarrier multiplexing (SCM) emerges as a promising solution compared to single-carrier systems. However, the SCM performance is limited by nonlinear effects such as self-subcarrier nonlinearity (SSN) and cross-subcarrier nonlinearity (CSN). In previous studies, a combination of SCM with DBP, named SCM-DBP, has been employed to address these issues. Concurrently, deep learning-assisted NLC, for example, learned DBP (LDBP), has shown promise in enhancing performance and reducing complexity. In this paper, we aim to apply learning to the SCM-DBP by holistically combining the principles of the SCM-DBP and LDBP approaches, denoted as SCM-LDBP, to mitigate SSN and CSN cost-effectively. To investigate the efficacy of our proposed SCM-LDBP technique, we carry out numerical simulations for both a contemporary 32 Gbaud and a strategic 120 Gbaud SCM transmission system over a 1600 km optical fiber link. With only two interfering subcarriers in the back-propagation routine, our proposed SCM-LDBP demonstrates a 0.3 dBQfactor improvement and a 31.7% complexity reduction in the 32 Gbaud system when compared to the SCM-DBP. Similarly, in the 120 Gbaud system, the proposed SCM-LDBP demonstrates a 0.2 dBQfactor improvement and a 37.8% reduction in complexity over the SCM-DBP technique.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".