Novel FWM-Based Spectral Amplitude Code Label Recognition for Optical Packet-Switched Networks
Bibliographic record
Abstract
We propose and demonstrate a novel architecture for four-wave mixing (FWM)-based recognition of spectral amplitude code (SAC) labels in optical packet-switched networks. With a proper code design, a unique FWM idler for each SAC label, referred to as a label identifier (LI), is generated in a nonlinear medium. A serial array of fiber Bragg gratings is then used to reflect the LI wavelengths. Each LI is associated with a unique amount of delay between two optical signals received at two photodiodes (PDs). Label recognition is then achieved by measuring this unique time delay (referred to as the characteristic delay). The main advantages of the proposed method include the following: no serial-to-parallel conversion is required, simple label extraction is achieved, variable-length packets are supported, and the number of PDs used in the label recognition module is reduced. Moreover, the LI wavelengths do not need to exhibit any periodicity or match a particular wavelength grid; this results in a less challenging code design with smaller spectral occupancy for label generation. An experiment is conducted, where two variable-length data packets are transmitted over a 50-km dispersion-compensated span and switched at a forwarding node. The SAC labels are successfully recognized, and we obtain error-free transmission for the switched packets with less than 0.3-dB penalty.
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.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.001 | 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".