An FPGA-based Cost-effective Digital Differential Relay for Wind Farm Protection
Bibliographic record
Abstract
Wind farm protection against any abnormalities such as extreme wind speed, symmetrical and unsymmetrical faults remains an engineering challenge. Commonly, inverse time-delay overcurrent relay and distance protection relays have been used for power system protection against overcurrent incidences. However, the performance of these relays is not reliable for wind farm protection due to dynamic behavior of wind farms during harsh wind speed variations. A microprocessor-based differential protection relays (MDPR) with extensive communication capability may be used to tackle the effect of wind speed variation on protective relays. Nonetheless, implementing several MDPR in a large-scale wind farm could be extremely costly and in the event of communication failure, the relay would fail to operate during fault incidence. Therefore, in this research a cost-effective and more reliable differential protection relay is designed in a field-programmable gate array (FPGA) and is proposed as an alternative protection scheme for wind farms. The performance of the proposed FPGA-based digital differential protection scheme (FPGA-DDPS) is verified in the lab environment using DE2-115 FPGA board equipped with Cyclone IV E (EP4CE115F29C7). The experimental results show that the proposed FPGA-DDPR can successfully detects fault locations, trips the internal faults and even faults with extremely high resistance, while ignores the external fault. Thus, the proposed FPGA-DDPR protection scheme would be a cost-effective alternative to MDPRs.
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 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".