On Improving the BER Performance of Rate-Adaptive Block Transceivers, with Applications to DMT
Bibliographic record
Abstract
Two strategies for improving the (uncoded) bit error rate (BER) performance of practical rate-adaptive block-by-block communication schemes, such as discrete multitone modulation (DMT) is proposed. Our strategies are inspired by some recent work which showed that for uniformly bit-loaded schemes, the transmission strategy which minimizes the BER for a linear receiver involves allocating power to the subchannels that are implicit in the block-by-block framework in a minimum mean square error (MMSE) fashion and linearly combining these subchannels using a normalized discrete Fourier transform (DFT) matrix. This combining equalizes the decision point signal-to-noise ratios (SNRs) of the subchannels. Given a nonuniformly bit-loaded scheme, our first design strategy simply performs a DFT-based linear combination within the groups of subchannels which share the same constellation. Our second strategy provides further reduction in the BER by reallocating power within these groups in a MMSE fashion prior to DFT combining. Our examples indicate that our design strategies can provide significant reductions in the BER, and give rise to substantial SNR gains (of the order of several decibels).
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.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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".