arrow
Return

A new half-cycle phasor estimation algorithm

delete2005-04-01
delete98
PRE
AI
T
T.S. Sidhu
Z
Zhang, XD
B
Balamourougan, V
DOI:10.1109/TPWRD.2004.834677delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Phasor estimation algorithms for protective relaying are required to filter out unwanted components from the input signals and retain only the components of interest. The components to be removed include harmonics and the decaying-exponential transient (dc offset) component. They affect the accuracy and the speed of convergence of the phasor estimation algorithms to a great extent. This paper presents a new technique, which effectively removes the harmonics and the decaying dc component present in the input signals, within half a cycle of the power system frequency. This is achieved by means of a simple computational procedure using three off-line look-up tables. The proposed algorithm has been tested for a wide variety of signals to assess its performance. The performance is also compared with the two most popular half-cycle phasor estimation algorithms; the half-cycle least error squares algorithms and the mimic plus half-cycle Fourier algorithm. The test results show that the proposed relaying algorithm has a faster convergence and better accuracy compared to these previously proposed algorithms. The results also indicate that the proposed algorithm converges to its final value within half a cycle of the power system frequency as compared to the other two algorithms, which take more than half a cycle to converge, when a decaying dc component is present in the input.
Keywords:
DFT
digital filtering
least error squares algorithm
mimic filters
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Transactions on Power Delivery cover
IEEE Transactions on Power Delivery
IF:
3.7
Papers:
9.1K
Citations:
2.2W

Organization

No organization information available
Cited Papers

Cited Papers