Low-Complexity Slot-Based Bit Loading for Multicarrier Wireless Systems
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In this paper, a low-complexity discrete adaptive bit loading algorithm is proposed for multicarrier systems with uniform power allocation operating in fading environments under the discontinuous bit rates assumption. The algorithm objective is to maximize the overall throughput of the system while guaranteeing that the average bit error rate (BER) remains below a prescribed threshold. The algorithm uses a signal-to-noise ratio (SNR) threshold to group adjacent subcarriers into slots where it allocates the same number of bits for all subcarriers within the slot. The grouping mechanism reduces the complexity of the bit-loading process with negligible throughput degradation as compared to optimal and near-optimal algorithms. In particular scenarios, the achieved complexity reduction may exceed 70% with throughput penalty that is less than 1% as compared to other well established bit loading algorithms.
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.
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.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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 it