Implementation and System-Level Modeling of a Hardware Efficient Cell Balancing Circuit for Electric Vehicle Range Extension
Bibliographic record
Abstract
This article presents a novel hardware-efficient battery balancing circuit for electric vehicle batteries that uses the low-voltage battery as a convenient source and sink for balancing. Compared to existing techniques, the proposed topology strikes a balance between the current industry standard of passive balancing and high component-count, high-cost solutions. For a battery pack consisting of n cells in series within m modules, the proposed design uses (n +1) bilateral switches for cell selection, and m low-voltage isolated dc/dc converters for cell balancing. Balancing can occur quickly during driving as the circuit can transfer energy between nonadjacent cells concurrently throughout the pack. This article presents the design, control, simulation results, and experimental results of the proposed architecture. Furthermore, system-level vehicle modeling shows an increase in driving range of 1.8%-20.1% for different balancing parameters on repeated Urban Dynamometer Driving Schedule and Highway Fuel Economy Driving Schedule cycles for an end-of-life pack, compared to passive balancing, which does not charge cells while driving.
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.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.004 | 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".