Estimation of achievable rates in additive Gaussian mixture noise channels
Bibliographic record
Abstract
This paper details novel methods to accurately estimate the achievable rates of channels with additive Gaussian mixture (GM) noise. Attention is paid to a Gaussian input and discrete inputs. Such discrete inputs represent a wide range of signaling strategies and include the capacity-achieving input as a special case. At first, we propose a simple technique to calculate the GM noise entropy. Specifically, when the noise level is high, a lower bound on the integrand of the noise entropy is established and the noise entropy can be estimated in closed-form. In the low noise region, the piecewise-linear curve fitting (PWLCF) method is applied to calculate the noise entropy. It is then demonstrated this can be estimated in both regions with a predetermined accuracy. We then extend this result to calculate the output entropy and the achievable rate when the input is Gaussian distributed, which is shown to be asymptotically optimal. Next, we propose a simple PWLCF-based method to estimate the output entropy for a given discrete input. In particular, the output entropy is evaluated by examining the output in high and low regions of amplitude using a lower bound on the integrand of the output entropy and PWLCF, respectively. It is demonstrated that the output entropy, and consequently, the achievable rates, can be computed to achieve any desired accuracy level.
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.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 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".