Toward Acceleration and Simplification of Coherent DSP Chains: Frequency Pilot Sub-Carrier Strategies for Coherent Systems
Bibliographic record
Abstract
This paper focuses on the development of narrow-bandwidth pilot sub-carriers designed to reduce signaling overhead and computational complexity while enabling fast and robust initialization of coherent optical systems. A proper DSP implementation for the transceiver design, along with a specific frame structure, is proposed. Fast initialization algorithms are introduced, including local-oscillator-frequency-offset (LOFO) estimation, coarse chromatic dispersion (CD) estimation, and clock recovery, utilizing two pilot sub-carriers and specific training sequence (TS) design. These algorithms are designed to be fast, robust, and capable of significantly reducing receiver response time—a critical feature for dynamic and low-latency optical networks. Moreover, the application of pilot sub-carriers is explored as a means to reduce implementation complexity by eliminating the need for complex modules (e.g., clock recovery and carrier recovery (CR)), while maintaining functionality through pilot sub-carriers. Additionally, frequency and phase tracking techniques using pilot sub-carriers are proposed. This approach removes the overhead associated with pilot symbols from the payload frame structure, resulting in performance improvements, cost reduction, and enhanced spectral efficiency.
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.001 | 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.001 |
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".