Adaptive Filtering in Optical Coherent Flexible Bit-Rate Receivers in the Presence of State-of-Polarization Transients and Colored Noise
Bibliographic record
Abstract
In this article, we analyze the performance of adaptive filtering in the context of dual-polarization coherent optical flexible bit-rate transceivers. We investigate the ability of different adaptive algorithms to track fast state-of-polarization (SOP) transients in the presence of colored noise. Colored noise exists due to the concatenation of Wavelength Selective Switches (WSSs) and polarization dependent loss (PDL) which can be considered as spatially dependent noise. We consider the use of different modulation formats, and the practical limitation of error signal feedback delay in decision-directed adaptive filters is also taken into account. The back-to-back required signal-to-noise ratio (RSNR) penalty that can be tolerated determines the maximum SOP rate of change that can be tracked by the adaptive filters as well as the filter’s adaptive step size. We show that the recursive least squares algorithm, using the covariance matrix as an aggressive “step size,” has a much better convergence speed compared to the least mean squares (LMS) and normalized LMS (NLMS) algorithms in the presence of colored noise in the fiber. However, the three algorithms have similar tracking capabilities in the absence of colored noise.
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.001 | 0.005 |
| 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.001 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 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".