Maximum Wireless Power Transmission Using Real-Time Single Iteration Adaptive Impedance Matching
Bibliographic record
Abstract
Wireless power transfer (WPT) systems’ efficiency is significantly impacted by non-monotonic variations in the coupling coefficient. For very short distances or strong-coupling cases, the WPT efficiency is minimal at the natural resonant frequency, with two peaks around this frequency, known as the frequency splitting phenomenon. On the other hand, WPT capability decreases for long distances or weak coupling cases. Therefore, adaptive matching is required for WPT systems with varying distances, like wireless charging systems for electric vehicles (EVs). This paper first presents a detailed analysis of the frequency splitting phenomenon by studying the root locations of the WPT system’s transfer function. Then, a real-time fixed-frequency adaptive impedance matching (IM) method is proposed, in which the amplitude and phase of the input impedance is estimated using the average active power, the average reactive power, and the amplitude of input voltage. Unlike traditional search-and-find techniques, the proposed method calculates the optimal IM network parameters only in a single iteration, which improves the convergent speed. A scaled-down 20-Watt prototype controlled by the TMSF2812 is fabricated and used to validate the effectiveness of the proposed method over a wide range of coil-to-coil distances.
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.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.001 |
| Open science | 0.001 | 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".