Optimal symbol timing for OFDM wireless communications
Bibliographic record
Abstract
Orthogonal frequency division multiplexing (OFDM) has become a promising physical layer modulation technology for beyond 3G or 4G wireless communications due to effective inter-symbol interference mitigation for high speed data transmission. However, the timing of the OFDM symbol, i.e., the placement of the DFT collection window in a multi-path time dispersive channel remains an important and challenging issue in OFDM receiver design. An erroneous timing decision creates inter-symbol interference (ISI), inter-carrier interference (ICI), channel attenuation, and channel estimation error, which leads to a penalty on the collected OFDM symbol signal to noise ratio (SNR) resulting in an irreducible error floor. In this paper we quantify such effects and derive an optimal OFDM symbol timing solution in the sense of maximizing the signal to interference ratio (SIR) of the collected OFDM symbol. A practical timing algorithm, referred to as the equilibrium algorithm, is then developed to approximate the optimal timing decision. Compared with existing schemes in the literature, the proposed approach does not rely on explicit detection of individual channel paths or the delay spread boundary and therefore greatly reduces timing complexity. The equilibrium algorithm performs nearly as well as the optimal solution over a variety of channel delay spreads, is simple to implement, and is robust to channel estimation errors.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.002 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.004 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".