Early-detection scheme based on sequential tests for low-latency communications
Bibliographic record
Abstract
Abstract We propose an early-detection scheme to reduce communications latency based on sequential tests under finite blocklength regime for a fixed-rate transmission without any feedback channel. The proposed scheme processes observations sequentially to decide in favor of one of the candidate symbols. Such a process stops as soon as a decision rule is satisfied or waits for more samples under a given accuracy. We first provide the optimal achievable latency in additive white Gaussian noise channels for every channel code given a probability of block error. For example, for a rate $$R = 0.5$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>R</mml:mi> <mml:mo>=</mml:mo> <mml:mn>0.5</mml:mn> </mml:mrow> </mml:math> and a blocklength of 500 symbols, we show that only $$63\%$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mn>63</mml:mn> <mml:mo>%</mml:mo> </mml:mrow> </mml:math> of the symbol time is needed to reach an error rate equal to $$10^{-5}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msup> <mml:mn>10</mml:mn> <mml:mrow> <mml:mo>-</mml:mo> <mml:mn>5</mml:mn> </mml:mrow> </mml:msup> </mml:math> . Then, we prove that if short messages can be transmitted in parallel Gaussian channels via a multi-carrier modulation, there exists an optimal low-latency strategy for every code. Next, we show how early detection can be effective with band-limited orthogonal frequency-division multiplexing signals while maintaining a given spectral efficiency by random coding or pre-coding random matrices. Finally, we show how the proposed early-detection scheme is effective in multi-hop systems.
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.002 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.002 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.003 | 0.001 |
| 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".