Communicating over nonstationary nonflat wireless channels
Bibliographic record
Abstract
We develop the concept of joint time-frequency estimation of wireless channels. The motivation is to optimize channel usage by increasing the signal-to-noise ratio (SNR) after demodulation while keeping training overhead at a moderate level. This issue is important for single-input single-output (SISO) and multiple-input multiple-output (MIMO) systems but particularly so for the latter. Linear operators offer a general mathematical framework for symbol modulation in channels that vary both temporally and spectrally within the duration and bandwidth of one symbol. In particular, we present a channel model that assumes first-order temporal and spectral fluctuations within one symbol or symbol block. Discrete prolate spheroidal sequences (Slepian sequences) are used as pulse-shaping functions. The channel operator in the Slepian basis is almost tridiagonal, and the simple intersymbol interference pattern can be exploited for efficient and fast decoding using Viterbi's algorithm. To prove the concept, we use the acoustic channel as a meaningful physical analogy to the radio channel. In acoustic 2 /spl times/ 2 MIMO experiments, our method produced estimation results that are superior to first-order time-only, frequency-only, and zeroth-order models by 7.0, 9.4, and 11.6 db. In computer simulations of cellular wireless channels with realistic temporal and spectral fluctuations, time-frequency estimation gains us 12 to 18 db over constant-only estimation in terms of received SNR when signal-to-receiver-noise is 10 to 20 db. The bit error rate (BER) decreases by a factor of two for a binary constellation.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 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".