Microprocessor Execution Time and Memory Use for Battery State of Charge Estimation Algorithms
Bibliographic record
Abstract
Accurate battery state of charge (SOC) estimation is essential for safe and reliable performance of electric vehicles (EVs). Lithium-ion batteries, commonly used for EV applications, have strong time-varying and non-linear behaviour, making SOC estimation challenging. In this paper, a processor in the loop (PIL) platform is used to assess the execution time and memory use of different SOC estimation algorithms. Four different SOC estimation algorithms are presented and benchmarked, including an extended Kalman filter (EKF), EKF with recursive least squares filter (EKF-RLS) feedforward neural network (FNN), and a recurrent neural network with long short-term memory (LSTM). The algorithms are deployed to two different NXP S32Kx microprocessors and executed in real-time to assess the algorithms' computational load. The algorithms are benchmarked in terms of accuracy, execution time, flash memory, and random access memory (RAM) use. In order to ensure the validity of running these models for multiple cells in the pack, the impact of increasing the number of instances to run each algorithm simultaneously is investigated as well. The results show that the four algorithms present a reasonable accuracy, with less than 5% maximum error. For the more power microprocessor tested, the execution time was found to be 0.24 ms, 0.25 ms, 0.14 ms, and 0.71 ms for the EKF, EKF-RLS, FNN, and LSTM respectively. The neural network SOC estimation algorithms were also demonstrated to have lower RAM use than the EKFs, with less than 1 kB RAM required to run one instance of the estimators. Moreover, the FNN SOC estimation algorithm is found to be a promising option with both low execution time and memory use.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.008 | 0.001 |
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".