MétaCan
Menu
Back to cohort
Record W2121884091 · doi:10.1109/aps.2000.873728

An efficient method for frequency-domain and transient analysis of interconnect networks

2002· article· en· W2121884091 on OpenAlexaff
L.Y. Li, Greg E. Bridges, I.R. Ciric

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicLow-power high-performance VLSI design
Canadian institutionsUniversity of Manitoba
Fundersnot available
KeywordsPadé approximantMoment (physics)Frequency domainLossy compressionInterconnectionComputer scienceTransfer functionTime domainAlgorithmMethod of moments (probability theory)Matching (statistics)Point set registrationTransient (computer programming)Transmission linePoint (geometry)Topology (electrical circuits)MathematicsMathematical analysisTelecommunicationsEngineeringPhysics

Abstract

fetched live from OpenAlex

An improved method is proposed for efficiently computing the frequency and transient responses of large linear interconnect networks which can include lossy coupled transmission lines. Unlike previously published algorithms, where moment information from one expansion point is utilized independently of that from other points, the proposed method employs all the moment sets available from all updated expansion points in order to create more accurate multipoint Pade approximations. Using these multipoint approximations, the method requires, for the same accuracy, a smaller number of expansion points compared to existing multipoint moment matching techniques, resulting in a substantially reduced CPU time. The method generates a single transfer function for a large linear network and thus is convenient for both frequency-domain and time-domain analysis.

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.587
Threshold uncertainty score0.528

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.001
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.010
GPT teacher head0.232
Teacher spread0.222 · 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

Citations4
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicLow-power high-performance VLSI designFrench-language works237,207