MétaCan
Menu
Back to cohort
Record W2171492451 · doi:10.1109/iscas.2005.1465165

A Preamble-Aided Symbol and Frequency Synchronization Scheme for OFDM Systems

2005· article· en· W2171492451 on OpenAlexaff
Meng Wu, Wei‐Ping Zhu

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Wireless Communication Techniques
Canadian institutionsConcordia University
Fundersnot available
KeywordsOrthogonal frequency-division multiplexingPreambleComputer scienceFrequency offsetMultipath propagationRobustness (evolution)Synchronization (alternating current)FadingCarrier frequency offsetIEEE 802.11a-1999Electronic engineeringSpectral efficiencyWirelessMultipath interferenceReal-time computingAlgorithmTelecommunicationsDecoding methodsEngineeringChannel (broadcasting)

Abstract

fetched live from OpenAlex

Orthogonal frequency division multiplexing is considered to be an appealing modulation technique for high-speed wireless communication systems owing to its spectral efficiency and robustness against multipath fading. However, an OFDM system is very sensitive to synchronization and a small frequency or timing offset may cause a large intercarrier interference (ICI), leading to a dramatic degradation in system performance. The paper presents an efficient symbol and frequency synchronization scheme for OFDM systems that is compatible with the IEEE 802.16a standard. A timing algorithm is proposed based on the preamble defined in IEEE 802.16a. The conjugate symmetry of the preamble structure is exploited to reduce computational complexity. It is shown that the new scheme not only reduces the estimation error significantly, but also allows for independent symbol synchronization compared to the conventional methods where fine timing usually has to be done after the frequency offset correction.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.001
Threshold uncertainty score0.005

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.000
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.

Opus teacher head0.010
GPT teacher head0.236
Teacher spread0.226 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

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".

Quick stats

Citations34
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Wireless Communication TechniquesFrench-language works237,207