MétaCan
Menu
Back to cohort
Record W2108739365 · doi:10.1109/ccece.2006.277642

Dynamic Rate Assignment and Power Control in Uplink UMTSW-CDMA Systems

2006· article· en· W2108739365 on OpenAlexafffund
Gang Luo, Lian Zhao

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicWireless Communication Networks Research
Canadian institutionsToronto Metropolitan University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsCode division multiple accessComputer sciencePower controlQuality of serviceThroughputComputer networkTelecommunications linkTransmission (telecommunications)Interference (communication)Resource allocationChannel (broadcasting)Channel allocation schemesCellular networkPower (physics)Real-time computingTelecommunicationsWireless

Abstract

fetched live from OpenAlex

Power control and rate assignment are important tools to maximize system resource utilization while satisfying quality of service (QoS) in a code division multiple access (CDMA) system. In this paper, we propose an algorithm of simultaneously adapting transmission power and data rate to maximize system throughput and minimize the power consumption in a wideband CDMA (W-CDMA) network. The greedy rate packing (GRP) allocation scheme, where high date rates are assigned to users with favorite channel conditions and lower interference, is employed for the rate adaptation. Compared with the results using Zhao et al. (2005) (algorithm 2), close-loop power control (CLPC) alone, and rate adaptation alone approaches, our proposed power and rate transmission scheme (algorithm 1) significantly improves transmission efficiency

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 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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.971
Threshold uncertainty score0.345

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.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.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.008
GPT teacher head0.251
Teacher spread0.243 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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

Quick stats

Citations2
Published2006
Admission routes2
Has abstractyes

Explore more

Same topicWireless Communication Networks ResearchFrench-language works237,207