An Iterative Adaptive Vold–Kalman Filter for Nonstationary Signal Decomposition in Mechatronic Transmission Fault Diagnosis Under Variable Speed Conditions
Bibliographic record
Abstract
Vold–Kalman filter (VKF) is a powerful tool for time-frequency (TF) decomposition of nonstationary signals. However, the overdependence on instantaneous frequency (IF) estimation, neglect of nonlinear initial phase, and improper bandwidth selection against noise interference limit its practical performance in mechatronic transmission fault diagnosis under variable speed conditions. This article proposes a novel signal processing method named iterative adaptive Vold–Kalman filter (IAVKF) to tackle the challenges in VKF and realize accurate IF estimation and fault dynamic feature extraction. Specifically, an improved VKF model is developed with the consideration of nonlinear initial phase and discrepancies between true and estimated IFs. Then, the estimated IF is refined by the recovered envelope to ameliorate TF resolution. Finally, an iterative bandwidth adaptation step is developed based on signal orthogonality to reduce noise interference and ensure algorithm convergence. Numerical analysis and two engineering applications in mechatronic transmission fault diagnosis are conducted, showing that IAVKF provides higher accuracy and efficiency in fault feature extraction and IF estimation.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".