Adaptive digital back propagation exploiting adjoint-based optimization for fiber-optic communications
Bibliographic record
Abstract
This work proposes a novel and powerful adaptive digital back propagation (A-DBP) method with a fast adaption process. Given that the total transmission distance is known, the proposed A-DBP algorithm blindly compensates for the linear and nonlinear distortions of optical fiber transmission systems and networks, without knowing the launch power and channel parameters. An adjoint-based optimization (ABO) technique is proposed to significantly accelerate the parameters estimation of the A-DBP. The ABO algorithm utilizes a sequential quadratic programming (SQP) method coupled with an adjoint sensitivity analysis (ASA) approach to rapidly solve the A-DBP training problem. The design parameters are optimized using the minimum overhead of only one extra system simulation. Regardless of the number of A-DBP design parameters, the derivatives of the training objective function with respect to all parameters are estimated using only one extra adjoint system simulation per optimization iterate. This is contrasted with the traditional finite-difference (FD)-based optimization methods whose sensitivity analysis calculations cost per iterate scales linearly with the number of parameters. The robustness, performance, and efficiency of the proposed A-DBP algorithm are demonstrated through applying it to mitigate the distortions of 4-span and 20-span optical fiber communication systems. Coarse-mesh A-DBPs with less number of virtual spans are also used to significantly reduce the computational complexity of the equalizer, achieving compensation performance higher than that obtained using the coarse-mesh DBP with the exact channel parameters and full number of virtual spans.
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.001 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.001 |
| 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".