MétaCan
Menu
Back to cohort

A Dynamic Gate Driver with Auto-Patterning to Reduce Ringing and Switching Loss

2025· article· en· W4413321036 on OpenAlexafffund
Wen Tao Cui, William Zhang, Jingyuan Liang, Haruki Nishio, M. Iwamoto, Wai Tung Ng

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicVLSI and FPGA Design Techniques
Canadian institutionsUniversity of Toronto
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsRingingComputer scienceLogic gateElectronic engineeringEngineeringTelecommunicationsAlgorithm

Abstract

fetched live from OpenAlex

Parasitics in the gate loop can cause undesirable ringing oscillation for SiC power MOSFETs. Normally, ringing can be suppressed by adding a fixed gate resistor <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\left(R_{G}\right)$</tex> to slow down the switching transient by limiting the gate current (<tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$I_{G}$</tex>). However, a large <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\boldsymbol{R}_{\boldsymbol{G}}$</tex> will increase the turn-on or turn-off times and the switching loss. Dynamic gate driving is implemented to mitigate this issue by adjusting <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$R_{G}$</tex> during different phases of the gate transient. The optimal timing (topt) was traditionally determined through a trial-and-error procedure. In this paper, we proposed a practical dynamic gate driver IC that can automatically identify the appropriate <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$R_{G}$</tex> driving pattern to achieve fast switching, low ringing, and improved efficiency. The end of the Miller plateau is detected as the point to adjust the gate driving strength <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\left(R_{G}\right)$</tex>. An internal switched capacitor filter is designed to sense the end of the Miller plateau by monitoring the gate node (<tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$V_{\text {Gate }}$</tex>). This timing with respect to the PWM input signal, topt, is used to generate a new gate driving pattern for the next switching cycle. Tests were conducted using a double pulse test (DPT) for varying IDS conditions. A value of 507 ns for <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$t_{O P T}$</tex> is obtained for <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$I_{D S}=3 \mathrm{A}, V_{D S}=15 \mathrm{V}$</tex>, and <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$V_{\text {Drive }}=$</tex> 15 V. Applying topt to the gate driving pattern on the following DPT cycle, ringing undershoot on <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$V_{\text {Gate }}$</tex>, switching speed, and switching loss are improved by <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$59 \%, 74 \%$</tex>, and 57 %, respectively, when compared to the fixed large <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$R_{G}$</tex> method.

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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.804
Threshold uncertainty score0.462

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.003
GPT teacher head0.217
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 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

Citations1
Published2025
Admission routes2
Has abstractyes

Explore more

Same topicVLSI and FPGA Design TechniquesFrench-language works237,207