Time Synchronization of Turbo-Coded Square-QAM-Modulated Transmissions: Code-Aided ML Estimator and Closed-Form Cramér–Rao Lower Bounds
Bibliographic record
Abstract
This paper introduces a new maximum likelihood (ML) solution for the code-aided (CA) timing recovery problem in square-quadrature amplitude modulation (QAM) transmissions and derives, for the very first time, its CA Cramér-Rao lower bounds (CRLBs) in closed-form expressions. The channel is assumed to be slowly time varying so that it can be considered as constant over the observation interval. By exploiting the full symmetry of square-QAM constellations and further scrutinizing the Gray-coding mechanism, we express the likelihood function of the system explicitly in terms of the code bits' a priori log-likelihood ratios (LLRs). The timing recovery task is then embedded in the turbo iteration loop, wherein increasingly accurate estimates for such LLRs are computed from the output of the soft-input soft-output decoders and exploited at a per-turbo-iteration basis in order to refine the ML time delay estimate. The latter is then used to better resynchronize the system, through feedback to the matched filter, so as to obtain more reliable symbol-rate samples for the next turbo iteration. In order to properly benchmark the new CA ML estimator, we also derive for the very first time the closed-form expressions for the exact CRLBs of the underlying turbo synchronization problem. Computer simulations will show that the new closed-form CRLBs coincide exactly with their empirical counterparts evaluated previously using exhaustive Monte Carlo simulations. They will also show unambiguously the remarkable performance improvements of CA estimation against the traditional nondata-aided scheme, thereby highlighting the potential performance gains in time synchronization that can be achieved owing to the decoder assistance. Over a wide range of practical signal-to-noise ratios (SNRs), CA estimation becomes even equivalent to the completely data-aided scheme in which all the transmitted symbols are perfectly known to the receiver. Moreover, the new CA ML estimator almost reaches the underlying CA CRLBs, even for small SNRs, thereby confirming its statistical efficiency in practice. It also enjoys significant improvements in computational complexity as compared to the most powerful existing ML solution, namely the combined sum-product and expectation-maximization algorithm.
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.017 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| 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.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".