Demultiplexing by independent component analysis in coherent optical transmission: The polarization channel alignment problem
Bibliographic record
Abstract
Digital coherent receivers are essential to the attainment of high spectral efficiency in high capacity fiber-optic transmission. Coherent receivers detect both amplitude and phase of the optical field, which permits the use of advanced modulation formats by the transmitter. A real-time coherent optical receiver using Digital Signal Processing (DSP) enables the transmission system to perform dispersion compensation, carrier phase estimation, polarization de-multiplexing, polarization mode dispersion compensation and data recovery for an advanced modulated format. DSP methods that have been suggested to de-multiplex data from mixed polarizations fall into two classes. First class includes the Least Mean Square algorithm and the decision-directed algorithm require training sequences. The second class that includes the Constant Modulus Algorithms (CMA) and Independent Component Analysis (ICA) is preferable because they work blind and do not need training sequences. The blind source separation methods are preferable since they estimate the source signals directly from the observed signals and, in addition, do not limiting the spectral efficiency. Although, ICA solves the convergence-to-same-source problem of CMA while possessing similar polarization tracking capability, it inherently suffers from a drawback, which is called permutation ambiguity. A novel technique is proposed in this technique that enables ICA to accurately track polarization channel alignment. An improved ICA method is used to identify the input polarizations that carry two different channels but are mixed randomly while the light is propagating in the optical fiber. The addition of some steps to eliminate the permutation ambiguity through a novel technique involving the projection onto the nearest equivalent class technique results in an algorithm that is considerably more robust than the conventional ICA algorithm. The main contribution is tracking channel alignment when the changes in polarization are aggressive due to environmental perturbations (e.g. aerial fiber, multimode systems). Accurate polarization demultiplexing is verified by numerical simulation for the DQPSK modulation format.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 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".