A Hierarchical Permutation Cyclic Coding Strategy for Sensorless Capacitor Voltage Balancing in Modular Multilevel Converters
Bibliographic record
Abstract
This paper presents a new sensorless capacitor voltage balancing strategy for modular multilevel converters (MMCs) to effectively balance the submodule capacitor voltages in a wide range of switching frequencies. The proposed strategy is realized via a balancing unit equipped with a hierarchical permutation cyclic coding (PCC) method to evenly distribute the switching gate signals among the submodules of each arm within a permutation time. The proposed strategy balances the submodule capacitor voltages to track their reference values with low voltage ripple in a wide range of switching frequencies. It remarkably enhances the converter system reliability, especially for a large number of submodules, because the need to measure the submodule capacitor voltages in each arm is eliminated. The proposed hierarchical PCC algorithm is decoupled from other standard control loops in an MMC. Digital time-domain simulation studies are conducted on a 21-level MMC to confirm the effectiveness of the proposed algorithm in high and low switching frequencies under balanced and unbalanced load conditions. In addition, the proposed method is implemented in the FPGA-based RT-LAB real-time simulator platform to validate its performance in a hardware-in-the-loop setup.
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.000 |
| 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.001 | 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".