Energy-efficient resource and power allocation for uplink multi-user OFDM systems
Bibliographic record
Abstract
In this paper, we consider the problem of energy-efficient resource and power allocation in the uplink of multiuser multi-channel Orthogonal Frequency Division Multiplexing (OFDM) based systems subject to constraints on user equipment (UE) transmit power. This problem is non-deterministic polynomial-time hard and an optimum solution for a system with U users and N resource units requires a complexity of at least O(NUN). Using an iterative solution approach, we propose two sub-optimal, yet efficient, scheduling algorithms that maximize the energy efficiency (EE) considering both UE circuit power (Pc) and rate-dependent transmit power with an upper limit of Pmax. Simulation results show that the proposed algorithms provide near-optimal solutions with much lower computational burden of O(UN) and O(UN2/2). Further performance studies indicate that the proposed algorithms can offer an EE of more than 2 times with a throughput reduction of less than 13% as compared to the spectral-efficient greedy algorithm. Our studies also reveal that the EE is quickly increased with Pmaxwhen ≪ Pcand then reach saturation as Pmax approaches Pc.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 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".