A Virtual Space Vector Modulation Scheme for a Reduced-Component Four-Level Flying Capacitor Converter
Bibliographic record
Abstract
Among multilevel topologies, flying capacitor (FC)-based converters stand out for their modularity, self-voltage balancing features, and fault-tolerant operation. However, conventional FC converters require multiple capacitors per phase, increasing hardware complexity and control effort. To address this, a four-level single flying capacitor (4L-SFC) converter is proposed in literature, which reduces the number of capacitors to one per phase without sacrificing output quality. The major challenge of this simplified topology lies in the absence of redundant switching states, which restricts voltage balancing flexibility. To overcome this, a Virtual Space Vector Modulation (V-SVM) technique is developed. By synthesizing virtual vectors through weighted combinations of space vectors, the method ensures zero-average capacitor current over each sampling period, enabling effective voltage balancing. The V-SVM algorithm divides each space vector sector into triangular regions and maps reference vectors to optimized switching sequences, ensuring stable flying capacitor voltages, improved switching loss distribution, and low voltage ripple.
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.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.003 | 0.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.
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".