MétaCan
Menu
Back to cohort
Record W2097869860 · doi:10.1109/ccece.2005.1556896

Enhanced multiuser resource allocation using near-continuous loading algorithms with adaptive coding for digital subscriber loops

2006· article· en· W2097869860 on OpenAlexafffund
S. Panigrahi, Xu Yang, Tho Le‐Ngoc

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicPower Line Communications and Noise
Canadian institutionsMcGill University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsDigital subscriber lineComputer scienceGranularityLink adaptationAlgorithmCoding (social sciences)Iterated functionReal-time computingElectronic engineeringComputer networkMathematicsEngineering

Abstract

fetched live from OpenAlex

In this paper, we present a multi-user resource allocation technique for multi-carrier digital subscriber loop (DSL) systems using an adaptive coding/modulation scheme. Traditional bit loading based on only adaptive modulation requires the number of bits to be integer and hence causes granularity loss that can be significant in dynamic spectrum management (DSM) when each user's sub-carrier-specific power is implicitly constrained due to other user's rate demand. By adaptively varying the code rate of a programmable Reed Solomon (RS) code, a fine-granularity loading in conjunction with the purely distributed iterated water filling (IWF) is proposed to recover such granularity losses. Simulation results for various VDSL-DMT scenarios show that the proposed scheme can provide higher rates than the distributed IWF and centralized optimum spectrum management (OSM) with integer-bit loading

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.000
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: Empirical · Consensus signal: none
Teacher disagreement score0.620
Threshold uncertainty score0.638

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.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.0000.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.016
GPT teacher head0.225
Teacher spread0.208 · 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 topicPower Line Communications and NoiseFrench-language works237,207