Nonisolated DC–DC Power Converter Synthesis Using Low-Entropy Equations
Bibliographic record
Abstract
There is a growing demand for novel nonisolated dc–dc power converters with the deployment of dc power distribution systems integrating renewable sources and energy storing elements. The load and source of these applications have different input and output voltage levels, and it is vital to avoid operating the interfacing power converters at extreme duty ratios. Therefore, engineers and researchers explore the power converter synthesizing techniques since the mid-1970s, fulfilling the above requirement besides the nonpulsating input and output current. Among them, the analytical synthesis method has gained popularity, although it gives rise to high-entropy equations. This article shows a simple yet powerful topology synthesis method based on the low-entropy equations that reveal the connection between the energy storing elements and switches. To this end, a set of design rules have been introduced in this article to realize the voltage-second balance equations obtained by decomposing the voltage gain polynomial using design-oriented analysis. Moreover, different decomposition levels of the gain polynomial have been discussed to embed inductors at either input or output or both ports. Furthermore, the synthesis of multitopology converters using low-entropy equations has been demonstrated. The applicability of the proposed method is validated using motivational examples and using experimental results of the selected converters.
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.001 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".