Modular control with carrier auto‐interleaving and capacitor‐voltage balancing for MMCs
Bibliographic record
Abstract
In this study, a new control method dedicated to modular multilevel converters (MMCs) is proposed. The approach is based on local communication between the individual controls of each submodule (SM). The local values of the capacitor voltages and the carrier‐phase angles are shared between immediate neighbours achieving balancing of their capacitor voltages, and an automatic interleaving of the pulse‐width modulation (PWM) signals. Using an inter‐cell communication strategy, the number of required data exchanges with a centralised controller is greatly reduced. This method works for any number of SMs present in the converter and provides an integrated dynamic reconfiguration capability to enable or disable SMs during operation, without any additional consideration for the control‐algorithm's implementation. Such a capability is not offered by classical MMC control methods using either PWM or nearest‐level control strategies. Higher stability, robustness and larger bandwidth of the proposed method are first demonstrated through real‐time simulation. The auto‐interleaving of the PWM carriers and the capacitor‐voltage balancing, provide fast responses and adequate accuracy. Experimental results are provided using a 600 V/3 kW/18 cells single‐phase MMC demonstrator confirming the simulation results, and the advantages of this SM control strategy.
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.000 | 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".