PWM-Geometric Modeling and Centric Control of Basic DC–DC Topologies for Sleek and Reliable Large-Signal Response
Bibliographic record
Abstract
Traditional linear techniques are widely used for the control of basic dc-dc converters due to their simple implementation. However, due to the small-signal validity range of the models employed, the converters usually perform poorly under large transients, and the dynamic response can be improved only to a limited extent in order to ensure a stable behavior. On the other hand, faster dynamic response can be achieved with boundary controllers, which require faster sensors and more powerful processors. A novel control scheme that combines the advantages of fixed-frequency pulsewidth modulation with state-plane geometric analysis is introduced to obtain fast and reliable large-signal response. The natural evolution of the average state variables is described by a large-signal unified model, which provides the basis to develop a reliable nonlinear control scheme. The proposed technique is suitable for implementation in low-cost digital signal processors, using low-bandwidth sensing stages, and it features fast, sleek, and consistent dynamic response with constant switching frequency. Since the model developed accurately predicts the large-signal behavior, reliable and predictable responses can be obtained at any operating point. In this way, the transient response obtained shows reduced, consistent, and well-determined peaks in inductor current and capacitor voltage, avoiding magnetic saturation and system failures even during extremely large transients. Furthermore, the maximum rating specifications for the reactive components can be reduced, which, combined with the low requirements for sensors and processors, lowers the implementation cost and makes the controller a very appealing alternative for high-volume applications. The contributions made to the theoretical and applied field are valid for any combination of reactive components due to the normalized approach adopted. The theoretical concepts are supported by detailed mathematical procedures. The proposed theory and controller are validated by experimental results.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".