Training Symbol-Based Equalization for Quadrature Duobinary PDM-FTN Systems
Bibliographic record
Abstract
A training symbol-based equalization algorithm is proposed for polarization de-multiplexing in quadrature duobinary (QDB) modulated polarization division multiplexedfaster-than-Nyquist (FTN) coherent optical systems. The proposed algorithm is based on the least mean square algorithm, and multiple location candidates of a symbol are considered in order to make use of the training symbols with QDB modulation.Results show that an excellent convergence performance is obtained using the proposed algorithm under different polarization alignment scenarios. The optical signal-to-noise ratio required to attain a bit error rate of 2*10-2 is reduced by 1.7 and 1.8 dB using the proposed algorithm, compared to systems using the constant modulus algorithm with differential coding for 4-ary quadrature amplitude modulation(4-QAM) and 16-QAM systems with symbol-by-symbol detection, respectively.Furthermore, comparisons with the Tomlinson-Harashima precoding-based FTN systems illustrate that QDB is preferable when 4-QAM is utilized.
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.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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".