Optical Time-Mapped Spectrograms (II): Fractional Talbot Designs
Bibliographic record
Abstract
Real-time implementations of joint time-frequency analysis over instantaneous bandwidths above the GHz range remain challenging. In a companion paper, we have proposed an analog photonic processing scheme that enables computing a short-time Fourier transform (STFT), or spectrogram (SP), of an incoming arbitrary broadband signal, over tens-of-GHz analysis bandwidths, in a continuous, gapless and real-time manner. The proposed method involves a temporal sampling of the signal under test (SUT) with a periodic train of interfering, linearly chirped optical pulses followed by group-velocity dispersion to map the spectra of consecutive and overlapping truncated sections of the SUT along the time domain. This scheme offers a notable design versatility to customize the performance specifications of the computed SP, but it generally involves a sub-optimal non-uniform sampling of the SUT and it requires the use of a bulky and expensive pulsed optical source. In this communication, we show that this previous general scheme can be easily configured to ensure an optimal, uniform sampling of the SUT by simply setting the involved dispersive lines to satisfy a fractional self-imaging condition, while keeping all the advantages (e.g., design versatility) of the original scheme. Moreover, the resulting design is further adapted to entirely avoid the need for a pulsed source, using instead a more efficient and simpler phase-only temporal sampling of the SUT, e.g., implemented through electro-optic phase modulation. We derive the design conditions and performance trade-offs of the proposed time-mapped STFT schemes based on dispersion-induced fractional Talbot self-imaging. Through numerical simulations and experimental demonstration, we confirm the potential of this simple and efficient approach for real-time SP analysis of arbitrary signals over instantaneous bandwidths above a few tens of GHz, with MHz frequency resolutions and ultrahigh processing speeds, approaching billions of FTs per second.
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.001 | 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.001 |
| 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".