An efficient multiuser scheduling scheme for MIMO-CDMA wireless systems
Bibliographic record
Abstract
In multiuser CDMA wireless systems where the base station is equipped with multiple antennas, the base station takes advantage from the spatial and code separability between the served users in order to enhance the performance of the system. However, this enhancement is constrained by the design of an appropriate scheduling scheme which is responsible of choosing the best users to serve. In this paper, we propose efficient scheduling algorithms for the downlink of multiantenna CDMA wireless systems using zero forcing beamforming. Our proposition maximizes the system sum rate and keeps the computational complexity low. We make use of a graph theoretical approach to represent the system as an undirected weighted graph. As a second step, we formulate the scheduling problem as the maximum weight k-colorable subgraph problem. We propose two heuristic solutions to find the users to serve in each time slot in an acceptable polynomial time. Finally we evaluate the efficiency of the proposed schemes by mean of simulations and the results show the near-optimal performance of the proposed schedulers with very low computational complexity compared to the optimal exhaustive search over all the possible users combinaisons.
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".