Multi-Frame Synchronization for a DTV Receiver: CFO, SFO, and Error Performance Analysis
Bibliographic record
Abstract
Synchronization is an important design problem for communication receivers, particularly in multipath channel scenarios. Further challenges arise due to the carrier frequency offset (CFO) caused by a mismatch in frequency of the local oscillators. The implementation is also limited by sampling frequency offset (SFO) associated with the drift of crystal oscillators. To account for these challenges, we propose a simple time domain correlation technique that relies on extending the preamble sequence via observing multiple data frames. We consider digital television as an example to show the effectiveness of the proposed technique. Due to self-resolving capability of the multipath components, the technique offers better performance in terms of peak to side-peak ratio than the conventional single preamble-based technique that correlates with a local reference. Owing to an extended preamble in the observation period, the proposed technique is shown to be robust against CFO. Besides, it is demonstrated that the technique shows resilience even in the presence of a strong SFO. Our theoretical analysis and simulated results are found to be in good match concerning peak to noise ratio. Finally, we derive a closed-form expression to compute the probability of the synchronization error that provides further insight into the performance gain offered by the proposed technique.
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.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".