Subchannel and Power Allocation in Downlink VLC Under Different System Configurations
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
Visible light communication (VLC) has attracted a significant amount of research interest due to its ability to support high data-rates. However, the issue of inter-cell interference (ICI) caused by resource sharing and the line-of-sight (LoS) blockage problem are significant challenges that need to be considered in the design and analysis of VLC systems. This paper investigates the resource allocation problem for the downlink of an orthogonal frequency-division multiple access-based multi-cell VLC system, while considering ICI and LoS blockage. This is carried out under various system configurations employing different transmission modes. Specifically, the joint problem of subchannel allocation (SA) and power allocation (PA) to maximize the sum-rate is formulated as a combinatorial and highly non-convex optimization problem due to the binary and continuous optimization variables. To obtain an efficient solution, the original problem is first separated into the SA problem and the PA problem. Two simple, yet efficient, procedures based on the quality of the channel conditions and matching theory are proposed for the SA problem, respectively. Then, the quadratic transform approach is exploited to develop an algorithm for the PA problem. Simulation results demonstrate the effectiveness of the proposed solutions in terms of their fast convergence and overall performance.
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.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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