MétaCan
Menu
Back to cohort
Record W1967294339 · doi:10.1109/glocom.2011.6133944

Ergodic Capacity of a DSL Binder Channel

2011· article· en· W1967294339 on OpenAlexaff
S. Huberman, Tho Le‐Ngoc

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicPower Line Communications and Noise
Canadian institutionsMcGill University
Fundersnot available
KeywordsDigital subscriber lineUpper and lower boundsChannel (broadcasting)Channel capacityComputer scienceErgodic theoryBounded functionInterference (communication)Capacity planningGaussianErgodicityTopology (electrical circuits)AlgorithmElectronic engineeringTelecommunicationsMathematicsStatisticsEngineeringElectrical engineeringPhysicsMathematical analysis

Abstract

fetched live from OpenAlex

The goal of this paper is to investigate the capacity of a symmetric Digital Subscriber Line (DSL) channel under Gaussian interference and thermal noise. Previous efforts only considered various analytical worst-case channel models to calculate the capacity of the DSL channel. Assuming a statistically averaged system, it is shown that the ergodic capacity of the system can be lower- bounded using Jensen's inequality. This lower-bound is compared to the performance of some state-of-the- art spectrum management techniques for both the measured data and the American National Standards Institute (ANSI) model. Results indicate that the measured data obtain significantly higher data-rates than the ANSI model prediction. As well, it is found that the lower-bound derived in this paper could be used as an indication of achievable data-rates for scenarios where the channel statistics (expected values of transfer functions) are known. This lower- bound could be useful for system operators when estimating the capacity of their networks.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.005
Version: metacan-v3-hybrid-931329e0061cValidation 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.006
Threshold uncertainty score0.018

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.005
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0010.002
Scholarly communication0.0020.002
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.064
GPT teacher head0.206
Teacher spread0.143 · 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 source (direct Gemma or distilled Codex), 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

Citations1
Published2011
Admission routes1
Has abstractyes

Explore more

Same topicPower Line Communications and NoiseFrench-language works237,207