Second-Order Perturbation Theory-Based Digital Predistortion for Fiber Nonlinearity Compensation
Bibliographic record
Abstract
The first-order (FO) perturbation theory-based nonlinearity compensation (PB-NLC) technique has been widely investigated to combat the detrimental effects of the intra-channel Kerr nonlinearity in polarization-multiplexed (Pol-Mux) optical fiber communication systems. However, the NLC performance of the FO-PB-NLC technique is significantly limited in highly nonlinear regimes of the Pol-Mux long-haul optical transmission systems. In this paper, we extend the FO theory to second-order (SO) to improve the NLC performance. This technique is referred to as the SO-PB-NLC. A detailed theoretical analysis is performed to derive the SO perturbative field for a Pol-Mux optical transmission system. Following that, we investigate a few simplifying assumptions to reduce the implementation complexity of the SO-PB-NLC technique. The numerical simulations for a single-channel system show that the SO-PB-NLC technique provides an improved bit-error-rate performance and increases the transmission reach, in comparison with the FO-PB-NLC technique. The complexity analysis demonstrates that the proposed SO-PB-NLC technique has a reduced computational complexity when compared to the digital back-propagation with one step per span.
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.000 |
| 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.002 | 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".