Energy-efficient power allocation for multicarrier systems with delay-outage probability constraints
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
This paper presents an optimal energy-efficient power allocation scheme for a point-to-point multicarrier link over frequency-selective fading channel subject to a delay-outage probability constraint. For a target delay-outage limit, the energy efficiency (EE) objective function is formulated as the ratio of the achieved link effective capacity to the total expenditure power, expressed in units of b/J/Hz. We first prove that this objective function is quasi-concave in the transmission power, and, hence, the global maximum solution of the underlying optimization problem can be obtained using fractional programming. Subsequently, we develop a two-step optimal power allocation algorithm by first obtaining the average sum power level corresponding to the maximum achievable EE, followed by jointly distributing this obtained average power over time and frequency. Analytical results show that the EE-based power allocation has a structure similar to that of the QoS-driven spectral-efficient scheme, but with a different cut-off threshold below which no transmission power is allocated. Simulation results show that the proposed joint optimal power allocation scheme provides significant EE gains over the simple independent subcarrier optimization scheme, where these performance advantages become more pronounced with tighter delay constraints and in fading channels with more severe frequency selectivity.
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