Blind, fast and SOP independent polarization recovery for square dual polarization–MQAM formats and optical coherent receivers
Bibliographic record
Abstract
We present both theoretically and experimentally a novel blind and fast method for estimating the State of Polarization (SOP) of a single carrier channel modulated in square Dual Polarization (DP) MQAM format for optical coherent receivers. The method can be used on system startup, for quick channel reconfiguration, or for burst mode receivers. It consists of converting the received waveform from Jones to Stokes space and looping over an algorithm until a unitary polarization derotation matrix is estimated. The matrix is then used to initialize the center taps of the subsequent classical decision-directed stochastic gradient algorithm (DD-LMS). We present experimental comparisons of the initial Bit Error Rate (BER) and the speed of convergence of this blind Stokes space polarization recovery (PR) technique against the common Constant Modulus Algorithm (CMA). We demonstrate that this technique works on any square DP-MQAM format by presenting experimental results for DP-4QAM, -16QAM and -64QAM at varying distances and baud rates. We additionally numerically assess the technique for varying differential group delays (DGD) and sampling offsets on 28 Gbaud DP-4QAM format and show fast polarization recovery for instantaneous DGD as high as 90% of symbol duration. We show that the convergence time of this blind PR technique does not depend on the initial SOP as CMA does and allows switching to DD-LMS faster by more than an order of magnitude. For DP-4QAM, it shows a convergence time of 5.9 ns, which is much smaller than the convergence time of recent techniques using modified CMA algorithms for quicker convergence. BER of the first 20 × 10(3) symbols is always smaller by several factors for DP-16QAM and -64QAM but not always for DP-4QAM.
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 distilled prediction
Teacher imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| 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 teacher head, 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".