MétaCan
Menu
Back to cohort
Record W1519662764 · doi:10.1109/vetecf.2004.1400106

Channel-based downlink scheduling schemes for CDMA networks

2005· article· en· W1519662764 on OpenAlex
R. Kwan, Cyril Leung

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicWireless Communication Networks Research
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsTelecommunications linkComputer scienceOptimization problemScheduling (production processes)Code division multiple accessChannel (broadcasting)Joint (building)Computer networkChannel codeCellular networkCoding (social sciences)Transmission (telecommunications)Mathematical optimizationAlgorithmDecoding methodsTelecommunicationsMathematicsEngineering

Abstract

fetched live from OpenAlex

In this paper, the problem of allocating radio resources in the downlink of a CDMA network is studied. The modulation and coding schemes, numbers of multicodes, and transmit powers used for all mobile stations (MSs) can be jointly chosen so as to maximize the total transmission bit rate, subject to certain constraints. Since this joint optimization problem can be computationally complex, a sub-optimal sequential optimization procedure is proposed, in which the resources for each MS are optimized sequentially. Numerical results show that the joint optimization outperforms the sequential optimization substantially when the channel conditions are good. However, under poor channel conditions, the performance improvement is marginal.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.613
Threshold uncertainty score0.535

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0020.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.035
GPT teacher head0.307
Teacher spread0.272 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations7
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicWireless Communication Networks ResearchFrench-language works237,207