Computationally-Efficient Synchrophasor Estimation: Delayed in-quadrature Interpolated DFT
The paper proposes a synchropahsor estimation (SE) algorithm that leverages the use of a delayed in-quadrature complex signal to mitigate the self-interference of the fundamental tone. The estimator, which uses a three-point IpDFT combined with a three-cycle Hanning window, incorporates a new detection mechanism to iteratively estimate and remove the effects caused by interfering tones within the out-of-band interference (OOBI) range. The main feature of the method is its ability to detect interfering tones with an amplitude lower than that adopted by the IEC/IEEE Std. 60255-118, this detection being notably challenging. Furthermore, it simultaneously satisfies all the accuracy requirements for the P and M phasor measurement unit (PMU) performance classes, while offering a reduction in the total computational cost compared to other state-of-the-art techniques. Despite an increase in total memory requirements, a preliminary analysis reveals its suitability for implementation on embedded devices.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
A Synchrophasor Estimator Characterized by Attenuated Self-Interference and Robustness Against DC Offsets: the DCSOGI Interpolated DFT
The second-order generalized integrator (SOGI), which can be used to attenuate the self-interference of the fundamental tone, is unable to reject DC offsets on the input signal. Consequently, the performance of any SOGI …
Deep Bayesian Quadrature Policy Optimization
We study the problem of obtaining accurate policy gradient estimates using a finite number of samples. Monte-Carlo methods have been the default choice for policy gradient estimation, despite suffering from high variance…
continuous-controlContinuous ControlPolicy Gradient MethodsKernel Quadrature with Randomly Pivoted Cholesky
This paper presents new quadrature rules for functions in a reproducing kernel Hilbert space using nodes drawn by a sampling algorithm known as randomly pivoted Cholesky. The resulting computational procedure compares fa…
Kernel quadrature with randomly pivoted Cholesky
This paper presents new quadrature rules for functions in a reproducing kernel Hilbert space using nodes drawn by a sampling algorithm known as randomly pivoted Cholesky. The resulting computational procedure compares fa…
Repulsive Monte Carlo on the sphere for the sliced Wasserstein distance
In this paper, we consider the problem of computing the integral of a function on the unit sphere, in any dimension, using Monte Carlo methods. Although the methods we present are general, our guiding thread is the slice…
Point Processes