Time Synchronization of Turbo-Coded Square-QAM-Modulated Transmissions:\n Code-Aided ML Estimator and Closed-Form Cram\\'er-Rao Lower Bounds
Bibliographic record
Abstract
This paper introduces a new maximum likelihood (ML) solution for the\ncode-aided (CA) timing recovery problem in square-QAM transmissions and\nderives, for the very first time, its CA Cram\\'er-Rao lower bounds (CRLBs) in\nclosed-form expressions. By exploiting the full symmetry of square-QAM\nconstellations and further scrutinizing the Gray-coding mechanism, we express\nthe likelihood function (LF) of the system explicitly in terms of the code\nbits' \\textit{a priori} log-likelihood ratios (LLRs). The timing recovery task\nis then embedded in the turbo iteration loop wherein increasingly accurate\nestimates for such LLRs are computed from the output of the soft-input\nsoft-output (SISO) decoders and exploited at a per-turbo-iteration basis in\norder to refine the ML time delay estimate. The latter is then used to better\nre-synchronize the system, through feedback to the matched filter (MF), so as\nto obtain more reliable symbol-rate samples for the next turbo iteration. In\norder to properly benchmark the new CA ML estimator, we also derive for the\nvery first time the closed-form expressions for the exact CRLBs of the\nunderlying turbo synchronization problem. Computer simulations will show that\nthe new closed-form CRLBs coincide exactly with their empirical counterparts\nevaluated previously using exhaustive Monte-Carlo simulations. They will also\nshow unambiguously the potential performance gains in time synchronization that\ncan be achieved owing to the decoder assistance. Moreover, the new CA ML\nestimator almost reaches the underlying CA CRLBs, even for small SNRs, thereby\nconfirming its statistical efficiency in practice. It also enjoys significant\nimprovements in computational complexity as compared to the most powerful\nexisting ML solution, namely the combined sum-product and\nexpectation-maximization (SP-EM) algorithm.\n
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.002 | 0.010 |
| 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.002 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".