MétaCan
Menu
Back to cohort
Record W1965071906 · doi:10.1109/itst.2006.288949

A Novel Dynamic Stepsize Power Control Algorithm for UMTS W-CDMA Systems

2006· article· en· W1965071906 on OpenAlexaff
Gang Luo, Lian Zhao

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicWireless Communication Networks Research
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsComputer scienceUMTS frequency bandsCode division multiple accessPower (physics)Power controlAlgorithmAdaptive stepsizeThroughputControl theory (sociology)MathematicsControl (management)TelecommunicationsWirelessNumerical analysis

Abstract

fetched live from OpenAlex

Power control is an essential mechanism for wideband code division multiple access (W-CDMA) systems. In our earlier work, a combined power control and a greedy rate packing (GRP) allocation scheme employing conventional fixed stepsize power control (FSPC) is discussed and evaluated. In this paper, we extend the algorithm to apply a novel dynamic stepsize power control (DSPC) algorithm to improve system performance. The dynamic stepsize (DS) is determined by the difference between the target SIR* and the received SIR. A larger stepsize is applied when the difference between the received SIR and the target SIR* is large to enhance tracking ability, and vice versa to reduce granular noise. Simulation results show the effectiveness of the proposed DSPC algorithm, with around 2% gain of throughput, 6.5% average power consumption saving and 0.5 dB standard deviation (STD) reduction of the received SIR, when compared with the FSPC scheme

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: Methods · Consensus signal: none
Teacher disagreement score0.954
Threshold uncertainty score0.534

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.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.014
GPT teacher head0.273
Teacher spread0.259 · 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
GenreMethods

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

Citations0
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicWireless Communication Networks ResearchFrench-language works237,207