Adaptive Downsampling in Oversampled Filter Banks in the Presence of Quantization Noise
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
FIR Oversampled Filter banks (OFB) with degree zero polyphase matrices can be used as block codes over the field of real numbers. Since they can be regarded as real-valued codes, one can also use their potential advantage of joint source-channel coding and graceful degradation over noisy channels. Due to the variable state of noisy channels, increase in bit error probability is unavoidable hence increasing the injected redundancy of the input signal or decreasing the code rate is necessary. To decrease the code rate, the downsampling rate should be decreased as well as filter lengths to maintain the degree zero of the polyphase matrix. However, decreasing the filter lengths will deteriorate the performance of the OFB both in compression rate of the input signal and the amount of injected redundancy. This paper proposes the idea of adaptively changing the downsampling rate to modify the code rate without changing the filter length. This could be considered as some form of puncturing. We show that adaptive downsampling results in just changing the way input is fed into the OFB. Simulation results for quantized DFT codes with erasures show the efficiency of this method specially when the number of erasures is not very large.
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.001 |
| 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.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