Analysis and verification of iterative estimation for joint random access satellite communications
Bibliographic record
Abstract
This paper investigates practical issues associated with ensuring high throughput in the random access satellite environment. In such situations it is typical for a large number of un-coordinated, mobile, low-cost, earth-based transmitters scattered over a large geographic area to connect intermittently to a single receiver over the satellite channel. This configuration fundamentally results in a random access scenario, where a large number of potential users contend for access to limited channel resources. Complexity is increased due to the geographic spread and localized weather effects which causes each user have its own independent channel that must be estimated to ensure a high level of system performance. This concept was explored previously, where joint detection and multiple packet reception (MPR) techniques were applied to show that it is theoretically possible to surpass the capacity of the current single-user random access channel. This was accomplished through adaptation of the concept of generalized modulation and the use of iterative estimation techniques to determine the channel response of each user. However, these results make a number of simplifying assumptions regarding the waveform processing required at the receiver. Under realistic conditions the proposed receiver is shown to be capable of surpassing the state of the art in satellite random access and achieve a system load of up to 2 bits/s/Hz in the high SNR region.
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.008 | 0.083 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 0.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.
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".