A Space Virtual-Vector Modulation With Voltage Balance Control for Nested Neutral-Point Clamped Converter Under Low Output Frequency Conditions
Bibliographic record
Abstract
The recently-developed nested neutral-point clamped (NNPC) converter is a four-level converter for medium-voltage high-power applications. It has some merits such as operating over wide voltage ranges (2.4–7.2 kV) without switching devices in series and less diodes or capacitors when compared with classical four-level topologies. But it has severe voltage balancing problems under low output frequency conditions when conventional space vector modulation (SVM) or sinusoidal pulse width modulation (SPWM) is applied, which limits its wide applications. In order to solve this issue, a space virtual-vector modulation (SVVM) along with a voltage balance control (VBC) algorithm is proposed in this paper. It helps reduce the voltage ripples greatly and maintain them within an acceptable region under low output frequency conditions. Therefore, it guarantees even voltage stresses among switching devices and extends the NNPC converter's applications. Principles of the proposed SVVM and VBC algorithms are elaborated in detail, and the voltage balancing performance is investigated and compared with the cases where conventional SVM and SPWM with the same VBC are applied. The relationship curves between voltage ripples and flying capacitance, output power, and output frequency have been explored and compared for both conventional SVM and proposed SVVM. Simulation and experimental results are presented to verify the effectiveness of the proposed 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 imitationNot 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.
Codex and Gemma teacher scores by category
| 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.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".