High Efficiency Modeling of Multi-Layer Cascaded Dual-Active-Bridge (DAB) Units on Real-time Simulator
Bibliographic record
Abstract
Modeling Dual-Active-Bridge (DAB) topologies in a real time simulator presents challenge due to the high switching frequency and the substantial number of submodules. This requires both the firing pulses’ precision and high-speed matrix computation. In this paper, an aggregated model is proposed for a typical Dual-Active-Bridge (DAB) circuit using the state-space circuit approach. It accurately implements the duty cycle of the firing pulses and consequently enhances accuracy. The two H- bridge converters and the ac transformer with the blocking capacitors are consolidated into a single-unit. To address scenarios involving multi-level cascaded DAB units with input series output parallel (ISOP), the multiple single-unit blocks are further packed into an aggregated model. Compared to using single-unit models for the cascaded topology, our developed aggregated model not only conserves electrical nodes, but also the calculation time for history terms, resulting in reduced hardware resources. The simulation timestep can be efficiently reduced, resulting in an outcome of better precise and the capability to model much higher switching frequencies. The proposed aggregated model can be widely applied in the real-time simulation of cascaded DAB topologies, accommodating switching frequency up to 100kHz.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 0.001 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".