MétaCan
Menu
Back to cohort
Record W4377715328 · doi:10.1109/tcpmt.2023.3279098

Deep Independent Recurrent Neural Network Technique for Modeling Transient Behavior of Nonlinear Circuits

2023· article· en· W4377715328 on OpenAlexaff
Amin Faraji, Sayed Alireza Sadrossadat, Ali Moftakharzadeh, Morteza Nabavi, Yvon Savaria

Bibliographic record

VenueIEEE Transactions on Components Packaging and Manufacturing Technology · 2023
Typearticle
Languageen
FieldEngineering
TopicAnalog and Mixed-Signal Circuit Design
Canadian institutionsPolytechnique Montréal
Fundersnot available
KeywordsNonlinear systemArtificial neural networkTransient (computer programming)Electronic circuitComputer scienceTransient analysisTransient responseControl theory (sociology)Electronic engineeringArtificial intelligenceEngineeringElectrical engineeringPhysics

Abstract

fetched live from OpenAlex

This article introduces a novel macromodeling method based on a recurrent neural network (RNN) called deep independently RNN (DIRNN). The proposed method applies to time-domain modeling of nonlinear circuits and components, resulting in better training. It overcomes the vanishing and exploding gradient problems encountered with conventional RNNs. In conventional RNNs, all neurons in each layer are involved in recurrent connections that cause unnecessary connections, increasing the model’s complexity over time and making it hard to train for long-time sequences. To solve this problem, the proposed DIRNNs neurons are independent of each other in recurrent connections because each neuron only receives connections from its own previous hidden state. The validity of the proposed method is verified by modeling two nonlinear circuit examples, namely, a multistage driver terminated by a multiline interconnect, and an ON-chip voltage generator.

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.000
metaresearch head score (Gemma)0.001
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: Methods · Consensus signal: Methods
Teacher disagreement score0.004
Threshold uncertainty score0.008

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.000
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.027
GPT teacher head0.241
Teacher spread0.214 · 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
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

Citations8
Published2023
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Components Packaging and Manufacturing TechnologySame topicAnalog and Mixed-Signal Circuit DesignFrench-language works237,207