A Third-Order MAF Based QT1-PLL That is Robust Against Harmonically Distorted Grid Voltage With Frequency Deviation
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
The quasi-type-l phase-locked loop (QT1-PLL) is a grid synchronization technique that has become very popular in recent years thanks to its attractive performance such as easy implementation, fast dynamic response, and good accuracy in steady-state operation. However, it is still vulnerable to operation under harmonically distorted grid voltages with frequency drift. This paper proposes a novel QT1-PLL based synchronization algorithm that makes an appropriate combination of two filters’ types: an in-loop third-order moving average filter (MAF) with a reduced window width, and a simplified second-order fast delayed signal cancellation (FDSC) based prefiltering stage. The proposed PLL is named third-order MAF based QT1-PLL (TQT1-PLL). Though both TQT1-PLL's filters do not need any adaptive algorithm, it is able to reject non-triplen odd-harmonics and the fundamental frequency negative sequence (FFNS) even under grid frequency drift. Its correct operation is confirmed through numerical simulations and real-time implementation on a digital signal processor (DSP). Moreover, the obtained results confirm its ability to reduce the ripple in the estimated frequency and phase under distorted grid voltages and off-nominal frequency operation. Authors show also through an analytical development that the topology of the proposed TQT1-PLL can be extended to enable the rejection of the DC-offset.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| 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.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it