A Novel Reconstructed Voltage Predictive Control for the Multilevel T-NPC Converter: Design, Simulation, and Experimentation
Bibliographic record
Abstract
This article presents a novel reconstructed voltage model predictive control (RVMPC) approach for a three-level T-type neutral point clamped inverter. Unlike the conventional model predictive controllers, which require exhaustive searches across the entire finite state space, the proposed method uses the load model to estimate the reference voltage and exploit a level-shifted pulsewidth modulation (LSPWM) technique to control the switching actions. The integration of RVMPC with LSPWM not only ensures a consistent switching frequency throughout operation but also effectively balances the midpoint dc-link voltage. In addition, the proposed modulation technique significantly reduces the computational time and complexity compared to the existing finite control set model predictive control (FCS-MPC) methods. By eliminating the need to search the entire state-space, the approach does not require optimization of weight factors or cost function control, thereby simplifying the overall design. The proposed RVMPC method reduces computational time from 17 μs (as seen in the conventional FCS-MPC) to 6 μs, achieving a 64.7% reduction. Furthermore, it improves dc-link voltage utilization and enhances the inverter performance, with a 7% reduction in line-to-line total harmonic distortion (THD) and over 72% improvement in phase current THD. The effectiveness and performance of the proposed modulation technique are validated through computer simulations and experimental verification on a small-scale laboratory prototype.
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".