Ultrafast and low overhead training symbol based channel estimation in coherent M-QAM single-carrier transmission systems
Bibliographic record
Abstract
We propose a training symbol based channel estimation (TS-EST) algorithm that estimates the 2 × 2 Jones channel matrix. The estimated matrix entries are then used as the initial center taps of the 2 × 2 butterfly equalizer. Employing very few training symbols for TS-EST, ultrafast polarization tracking is achieved and tap update can be initially pursued using the decision-directed least mean squares (DD-LMS) algorithm to mitigate residual intersymbol interference (ISI). We experimentally verify the proposed TS-EST algorithm for 112 Gbps PDM-QPSK and 224 Gbps PDM-16QAM systems using 10 and 40 training symbols for TS-EST, respectively. Steady-state and transient bit error rates (BERs) achieved using the TS-EST algorithm are compared to those obtained using the constant modulus algorithm (CMA) and the training symbol least mean squares (TS-LMS) algorithm and results show that the proposed TS-EST algorithm provides the same steady-state BER with a superior convergence speed. Also, the tolerance of the proposed TS-EST algorithm to laser phase noise and fiber nonlinearity is experimentally verified. Finally, we show by simulation that the superior tracking speed of the TS-EST algorithm allows not only for initial polarization tracking but also for tracking fast polarization transients if four training symbols are periodically sent during steady-state operation with an overhead as low as 0.57%.
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.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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".