Robust OFDMA Uplink Synchronization by Exploiting the Variance of Carrier Frequency Offsets
Bibliographic record
Abstract
In this paper, the uplink frequency offset estimation for orthogonal frequency-division multiplexing access (OFDMA) is discussed. We consider a general subcarrier allocation scheme where each user subcarrier group need not be contiguous. For an OFDMA uplink, we model the frequency offset for each user as an independent and identically distributed (i.i.d.) random variable with mean zero and variance$\sigma_{ \epsilon}^{2}$. An analysis of multiple access interference (MAI) is performed, and the Cramer–Rao lower bound (CRLB) for the estimation of variance of each user is derived. The signal-to-interference-plus-noise ratio (SINR) is derived as a function of the variance of the frequency offset. The variance of the frequency offset estimation error is lower bounded as a function of the signal-to-noise ratio (SNR). Successive interference cancellation (SIC) and iterative frequency offset estimation are considered. An estimate of the variance of the frequency offset is derived as a function of SINR and SNR. An estimate of the range of frequency offsets is derived using the assumption of uniformly distributed frequency offsets. Based on this estimate of the range of frequency offsets, the accuracy of any existing algorithm can be improved. Thus, new versions of the SIC-based frequency offset estimation and differential estimation algorithms are derived. Extensive simulation results are provided for a 16-user, 256-subcarrier OFDMA system over a multipath fading channel.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.001 |
| 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".