Enhancing SRM Performance through Multi-Platform Optimization and FPGA-Based Real-Time Simulation
Bibliographic record
Abstract
This paper proposes a multi-platform algorithm methodology in order to define firing angles of torque sharing functions (TSFs) for the indirect torque control of switched reluctance motors (SRM) through a hardware-in-the-loop (HIL) system. This proposal is used to achieve optimal levels of torque ripple and losses with accuracy and reliability, while taking advantage of real-time simulation. The analysis is performed assuming steady-state conditions of speed and torque reference for levels below the base speed, aiming to obtain firing angles ensuring optimal tracking performance. A novel methodology is proposed by using a grid search algorithm that handles the communication between Python, Code Composer, and the Typhoon HIL device. For that, an experimental data FPGA-based model with 500~ns of simulation time step is used to ensure highly accurate dynamic responses of current and electromagnetic torque. Moreover, controller-HIL (C-HIL) is used to have a safe and high fidelity testing environment, allowing rapid testing before transitioning to an experimental test bench. The simulation results are experimentally validated, demonstrating that the proposed strategy is effective and ensures optimal performance, taking into account peripheral systems of A/D, signal conditioning, PWM, and sensor emulation.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 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.002 | 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".