An Improved Hybrid Prefiltered Open-Loop Algorithm for Three-Phase Grid Synchronization
Bibliographic record
Abstract
In this article, a robust three-phase grid synchronization technique has been proposed for rapid detection of fundamental frequency, phase, and amplitude. The widely accepted phase locked-loop (PLL) algorithms possess complex architectures and require tedious tuning process for attaining a good stability margin. In order to surpass the shortfalls of PLL algorithms, a computationally efficient, stable, and open-loop scheme has been reported in this article. A novel two consecutive samples based frequency estimator is developed for fast detection of the fundamental frequency. Moreover, an efficient hybrid prefiltering approach is implemented based on the demodulation of the grid voltage signal. Additionally, the combination of a delayed signal cancellation operator and a band-pass filter allowed rapid rejection of dc-offset and harmonics, respectively. In the event of a grid voltage imbalance, the instantaneous symmetrical component method is a rescuer for the rejection of the fundamental negative sequence component without any delay. Subsequently, overall transient response time of the scheme is observed to be improved. On the other hand, the fundamental positive sequence component facilitates the estimation of amplitude and phase angle information. Importantly, the dynamic performance of the proposed scheme has been experimentally validated in presence of various grid disturbances.
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.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".