Analysis of a frame synchronization method using periodic preamble for OFDM based WLANS
Bibliographic record
Abstract
Frame and frequency synchronization schemes are critical in the design of OFDM receivers. In burst communications, such as HIPERLAN/2 and IEEE 802.11a WLANs, synchronization must be achieved at the beginning of the packet using only the given preamble. Thus, for such systems, it's important to design accurate synchronization methods that converge quickly. The most common approach combines an autocorrelation based metric with a max (or min) search. However, such methods typically achieve only coarse synchronization and need to be made more accurate through combinations with other approaches (such as cross-correlation or maximum-likelihood). An autocorrelation based metric is also used, but instead the correct timing is estimated by looking for changes in the gradient of the metric. The proposed method achieves higher accuracy than autocorrelation based max/min searches and has lower latency than many other methods. We provide an approximate closed-form expression for the gradient change that is statistically accurate in both AWGN and frequency-selective channels and offer simulation results illustrating the performance of the proposed method in 802.11a networks.
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.005 |
| 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.001 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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".