MétaCan
Menu
Back to cohort
Record W3002740548 · doi:10.3390/fi12020021

Adaptive Pre/Post-Compensation of Cascade Filters in Coherent Optical Transponders

2020· article· en· W3002740548 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueFuture Internet · 2020
Typearticle
Languageen
FieldEngineering
TopicOptical Network Technologies
Canadian institutionsUniversity of Ottawa
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsComputer scienceCompensation (psychology)MultiplexerCascadeSIGNAL (programming language)Bit error rateGradient descentElectronic engineeringAlgorithmTelecommunicationsMultiplexingDecoding methodsArtificial intelligenceArtificial neural network

Abstract

fetched live from OpenAlex

We propose an adaptive joint pre- and post-compensation to correct the filtering effects caused by cascading reconfigurable optical add drop multiplexers (ROADMs). The improvement is achieved without using additional hardware (HW) on the link or within the signal processor in the transponders. Using Monte Carlo simulations, the gradient-descent based method shows an improvement of 0.6 dB and 1.1 dB in the required optical signal-to-noise ratio (R-OSNR) at the threshold pre-decoder bit error rate (BER) of 0.02 versus pre-compensation only in the linear and nonlinear operating region of fiber respectively. We experimentally verified the method with lab measurements in the presence of heavy filtering and optical impairments. We observed a gain up to ~0.4 dB compared to typically used pre-compensation only. Additionally, other tangible system benefits of our method are listed and discussed.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.410
Threshold uncertainty score0.496

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.012
GPT teacher head0.200
Teacher spread0.188 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it