Novel Water-Filling for Maximum Throughput of Power Grid, MIMO, and Energy Harvesting Coexisting System With Mixed Constraints
Bibliographic record
Abstract
Multiple-input multiple-output (MIMO) technology equips the transmitters with the multiple antennas. It can combine with energy harvesting (EH) to lift the spectrum efficiency and make use of a greener energy resource. A power grid is added to serve as a supplementary source to regulate the not-so-stable harvested energy supply of the system. Besides the MIMO technology being used, the power allocated to the user provided by both EH and the power grid is subject to the epoch power upper bound constraints. The background of these constraints comes from field requirements, such as avoiding the saturation of power allocated to the user(s), avoiding system-level out-of-band power leakage, and reducing interference with other transmitter(s) due to the non-linearity generated via the transmitting mechanisms to the user(s). The epoch power upper bound constraints make this problem more challenging, with the controllable power grid energy budget and its allocation. This paper applies our recently proposed geometric water-filling with group upper bounded power constraints and recursion machinery to form the proposed algorithm for solving the proposed throughput maximization problem. Our algorithm is precisely defined, and further provides the exact solution via the lower degree polynomial complexity. This point is very suitable for the massive MIMO system. To the best of our knowledge, no prior algorithm has been reported in the open literature to solve the targeted problem in this paper.
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".