Professional Documents
Culture Documents
com
Abstract
An approach to the design of a digital algorithm for network frequency estimation is proposed. The algorithm is derived by using the Fourier and
zero crossing techniques. The Fourier method is used for digital filtering and the zero crossing technique is applied to the cosine or sine components
of the original signal, which is usually corrupted by higher harmonics. The algorithm showed a very high level of robustness as well as a high
measurement accuracy over a wide range of frequency changes. It can be used for frequency tracking in power networks when higher harmonics
are present in the voltage or current signals. The theoretical basis and practical implementation of the technique are described. The performance
of the developed algorithm has been verified by the computer simulations, and the field and laboratory tests.
2008 Elsevier B.V. All rights reserved.
Keywords: Protective relaying; Frequency measurement; Algorithm; Fourier method; Zero crossing technique
1. Introduction
The frequency of a power network is an important operational
parameter for the safety, stability, and efficiency of the power
system. Reliable frequency measurement is a prerequisite for
the effective power control, load shedding, load restoration, and
system protection. Therefore, there is a need for a fast and accurate estimation of the frequency of the power network by using
voltage waveforms which may be corrupted by the noise and
higher harmonics.
Several digital methods for frequency measurement have
been proposed over the past few decades. The use of the zero
crossing detection and calculation of the number of cycles within
a predetermined time interval [1] is a simple and well-known
method. The discrete Fourier transform (DFT), least squares
error, and Kalman filter are also known signal processing techniques used for frequency measurement [25]. As shown in [6],
the bilinear form approach seems to be a very efficient method
for both small frequency deviation and off-nominal frequency
estimation. An adaptive algorithm for frequency measurement
Corresponding author.
E-mail addresses: mdjuric@etf.bg.ac.yu (M.B. Djuric),
djurisic@etf.bg.ac.yu (Z.R.
Djurisic).
0378-7796/$ see front matter 2008 Elsevier B.V. All rights reserved.
doi:10.1016/j.epsr.2008.01.008
over a wide range is suggested in [7]. For generator protection, where frequency is to be estimated over a wide range, an
algorithm with a variable window length is proposed in [8].
A Newton-type algorithm has been proposed in [9]. Majority of the algorithms used in modern multifunctional digital
relays for frequency estimation and phasor tracking is based
on DFT. Several of these algorithms have appeared in the literature [1014]. The sensitivities of these algorithms to higher
harmonics in the vicinity of the nominal frequency are relatively
small. As the frequency deviates from the nominal value, a periodic error in the frequency measurement [15], proportional to
the frequency deviation, arises. The frequency deviation also
increases the error caused by the presence of higher harmonics
owing to the so called spectrum leakage. An algorithm based
on DFT and Pronys estimation method has been published in
[16]. The algorithms based on Pronys method [17], Newton
optimization technique [9], and expansion to Taylor series [18]
have been tested in [17]. A comparative analysis showed that the
highest demand for processor time was set by Pronys method
and that it was quite sensitive to the DC component and higher
harmonics. The algorithm based on Newton method was less
sensitive to the DC component and harmonic distortions, but it
was quite hardware demanding. The frequency measuring algorithm using complex computer techniques like generic algorithm
[19] or neural networks [20,21] have been developed recently.
1408
(1)
a
a
a
a
xn cos
n j xn sin
n
X(i)
=
m
m
m
n=i
n=i
= A(i) + jB(i),
(2)
where C(i)a = A(i)2 + B(i)2 is the estimated amplitude of the
fundamental harmonic in the i-th data window, a the assumed
angular frequency in the Fourier series (relation (2) gives exact
A(i) =
2
xn cos(n)
m
i+m
and
B(i) =
n=i
2
xn sin(n),
m
n=i
(3)
CO =
x2
x3
...
xm ]T .
(5)
Fig. 1. The original signal x(t) and its cosine component (A).
1
m
= fa
.
mA Ts
mA
(6)
The above algorithm has some limitations. When the frequencies f and fa are different, the period of the orthogonal component
does not contain an integer number of samples. For a high sampling frequency this fact will cause a small error. But for a low
sampling frequency, the error will be significant. Therefore, it is
necessary to modify the previous algorithm. Fig. 2 shows a zero
crossing of the cosine or sine component.
Let us observe the last positive sample Ap in the previous
period and the first negative sample An in the subsequent period.
In the zero crossing area the cosine and sine functions can be
well represented by a linear function and the following equations
are obtained:
Ap
An
=
K
P
and K + P = Ts .
(7)
An
Ts
Ap A n
and K =
Ap
Ts .
Ap A n
(8)
1409
When the signal passes through zero, from the positive to the
negative half of the period, the number P (P < Ts ) is indicated as
the FIRST sample of the subsequent period. At the next signal
passing through zero, from the positive to the negative half of the
period, the number K (K < Ts ) is indicated as the LAST sample
of the previous period and number P (P < Ts ) is indicated as
the FIRST sample of the subsequent period. All the samples
between An and Ap which correspond to one period are equal
to Ts . The sum P + K, from the same period can be different
from Ts . Therefore, the number of samples mA of one whole
period of the cosine or sine component can be a fraction. This
modification makes the algorithm to be much more accurate.
The accuracy of the algorithm can also be improved by using
the average number of samples of M periods. One register of
length M is needed where the number of samples of the last M
periods (M may be 410) is stored.
MA = [mA1
mA2
mA3
...
mAM ]T .
(9)
(10)
m
mAs
(11)
1410
Fig. 3. Filtering features of the sine (B) and cosine (A) orthogonal components.
has better filtering feature than the sine component for low frequency components with f < 50 Hz (subharmonic components).
These conclusions are explicitly presented in Fig. 3.
4. Performance evaluation of the algorithm through
simulation
The static, dynamic, and noise tests were performed by using
computer-simulated test signals. A comparison of the accuracy
of the results obtained by applying the cosine or sine components
is given.
4.1. The algorithm sensitivity to the presence of higher
harmonics
For testing the efficiency of the proposed technique for estimating the frequency in the presence of harmonics, the input
signal shown in Fig. 1 is used. The fundamental frequency in
the Fourier series was fa = 50 Hz and the sampling frequency
was fs = 1 kHz. The frequency estimates, obtained by the zero
crossing method applied to the original signal and to the cosine
component of the original signal are shown in Fig. 4.
The true values of the fundamental frequency of the
processed signal were obtained by using the proposed algorithm in the frequency range defined by Shannons sampling
theorem, i.e. for the fh < fs /2 = 500 Hz, where fh is the highest harmonic frequency in the signal. The zero crossing
technique applied directly to the signal in the presence
1411
Fig. 5. Frequency estimates of a complex periodic signal containing, in addition to the fundamental, the 2nd, 3rd, 5th, and 9th harmonics. t 3 s: V1 = 100, V2 = 5,
V3 = 20, V5 = 30, and V9 = 15; 3 s < t 6 s: V1 = 10, V2 = 0.5, V3 = 2, V5 = 3, and V9 = 1.5; 6 s < t 9 s: V1 = 10, V2 = 5, V3 = 20, V5 = 30, and V9 = 15.
,
(12)
Fig. 6. Test signal x(t) corrupted by noise and its cosine component A(t).
1412
It may also be concluded that the influence of noise on the measurement accuracy is significant for SNR 40 dB. In a power
system under normal operating conditions the level of noise in
the voltage signals is typically SNR > 50 dB. The maximum frequency measurement error caused by the noise corresponding to
SNR = 70 dB and with the sampling frequency of fs = 1000 Hz is
about 3 mHz without averaging (M = 1) and bellow 0.5 mHz if
the averaging was performed over three (M = 3) periods. These
error estimates due to noise should be added to the systematic
error of the zero crossing method if f = ff , in accordance with
the analyses carried out in the preceding sections. The test indicates a good performance of the algorithm even if the measured
signal is weak when the quantization noise may become significant. The minimum required amplitude of the fundamental
harmonic of the measured signal depends on the A/D converter,
i.e. on the level of noise which appears as the quantization error
in the measured signal.
4.3. Dynamic tests
Fig. 8. Frequency estimation error as function of SNR without averaging (dark) and with averaging over the last three periods (gray).
1413
Fig. 9. Frequency estimation: (a) stepwise change of the input signal frequency
and (b) stepwise change of the input signal amplitude.
Fig. 10. The original signal x(t) and its cosine (A) and sine (B) components.
1414
Fig. 11. Frequency estimates of the 50 Hz signal shown in Fig. 10 by the present algorithm by using either the sine or cosine orthogonal components.
Fig. 12. Frequency estimates of the 55 Hz signal, like the one of Fig. 10, by the present algorithm by using the sine (B) and cosine (A) orthogonal components.
Fig. 13. (a) Steady-state network voltage waves and (b) frequency estimation.
Fig. 14. (a) Variable generator voltage and (b) frequency estimation during the
voltage and frequency transients.
1415