1

A Full- and Half-Cycle DFT-based Technique for

Fault Current Filtering


Chi-Shan Yu, Member, IEEE Yi-Sheng Huang Joe-Air Jiang, Member, IEEE
Department of Electrical Engineering, Department of Electrical and Department of Bio-Industrial
National Taipei University of Technology Electronic Engineering Mechatronics Engineering
chsyu@ntut.edu.tw Chung Cheng Institute of Technology National Taiwan University
National Defense University jajiang@ntu.edu.tw
yshuang@ndu.edu.tw



Abstract Decaying DC components in fault currents will
make the digital filter to obtain inaccurate phasors and cause the
false operations of a relay system. Many studies have put their
focuses for removing the decaying DC components from fault
currents. Generally, they need extra samples or phasors to obtain
the parameters of the decaying DC component. In order to
accelerate the filter response, this paper presents a new Discrete
Fourier Transform (DFT)-based algorithm which does not need
extra sample to remove the decaying DC component. To achieve
this, the samples used for a traditional DFT computation are split
to four groups. Both the Full-Cycle DFT (FCDFT) and the Half-
Cycle DFT (HCDFT) based computations have been developed
in this paper. The proposed algorithm is evaluated by
MATLAB/SIMULINK generated data to show its effectiveness.

Keywords decaying DC component, phasor, relay, DFT.
I. INTRODUCTION
ISCRETE Fourier Transform [1,2] is the most widely
used filter algorithm in computer relays. Usually, we
need the digital filter to obtain the fundamental phasors of
fault measurements as fast as possible. When the fault currents
are pure sinusoidal, the FCDFT only needs one-cycle-samples
to obtain an accurate fundamental phasor. However, in most
cases, the fault currents contain a large amount of decaying
DC components, and the decaying DC components contain
non-integer harmonics. Thus, FCDFT always cannot obtain an
accurate fundamental phasor for the relaying scheme, and the
obtained inaccurate current phasor will cause false operations
of the relaying scheme.
Due to the fast progression of the digital computers, more
complex digital filter algorithms can be realized in computer
relays to overcome the problems caused by the decaying DC
components. In recent decades, many papers [3-10] have been
proposed for that. The aim of those papers is to find a fast
algorithm to remove the decaying DC components from fault
current and obtain the accurate fundamental phasor of the fault
current. In [3], Benmouyal has proposed a digital mimic filter
technique which needs an extra sample to remove the
decaying DC component by using a pre-defined time constant.
This technique cannot completely remove the decaying DC
components. If the pre-defined time constant is far from its
exact value, the performance of this technique will be
degraded. In [4-5], Gu and Yang have proposed the DFT-
based algorithms which require three consecutive phasors to
accurately remove the decaying DC components. In [6], the
author has proposed a simpler method which also needs two
extra samples to obtain an accurate fundamental phasor. In [7],
we have proposed an impedance-based algorithm which needs
one extra sample to obtain the fundamental phasors for
distance protections. In [8], Sidhu has proposed a full cycle-
DFT based method which does not need extra sample to
obtain an accurate fundamental phasor. This algorithm used an
extra harmonic phasor to remove the decaying DC
components. In [9], a look up table method is also proposed by
Sidhu to solve the half-cycle computations. In [10], Guo has
proposed an algorithm which only uses one cycle samples to
obtain an accurate fundamental phasor. However, pure DC
component will degrade the performance of this algorithm.
A new DFT-based algorithm which does not need extra
samples to remove the decaying DC component is presented in
this paper. First, the samples used for a traditional DFT
computation is split to four groups. Four phasors can then be
obtained by these four sample groups, respectively. Then, the
parameters of the decaying DC components can be obtained
by the four obtained phasors. Finally, the decaying DC
components can be directly removed from previously obtained
four phasors to find the accurate fundamental phasor. The
proposed algorithm can be applied to both the full cycle- and
half cycle-based computations. Since the proposed algorithm
does not need extra sample, it has fast response for obtaining
the fundamental phasor of the fault measurements.
II. THE PROPOSED ALGORITHM
The signal ( ) x t which contains the decaying DC
component is used to describe the proposed algorithm. The
signal ( ) x t is as follows:

1
/
1
( ) cos ( )
N
t
m m m
m
x t A t Be



=
= + +

(1)
where
m
A ,
m
, and 2
m
m = are the magnitude, the
phase angle and the angular frequency of the
th
m order
harmonic component, respectively. The signal x(t) is assumed
having passed through an anti-aliasing filter where
1
N is the
highest harmonic order that can pass through the anti-aliasing
filter. B and are the magnitude and the time constant of the
D
978-1-4244-5697-0/10/$25.00 2010 859
2
decaying DC component, respectively. If we take N samples
per cycle (the sampling interval is 1 (60 ) t N = ), the
th
k
sample of ( ) x t is presented by variable
( ) k
x as follows:
1
( )
1
2
( ) cos( )
N
k
k m m
m
m
x x k t A k B
N

=
= = + +

(2)
where the decaying constant
t
e

= .
Using the recursive Discrete Fourier Transform (DFT) [1,2],
the
th
k phasor can be obtained by the following sum-of-
product computations:
( )
1
2

k
m
k m k k
m k M
x x a A D
M
= +
= = +

(3)
where
2 j N
a e

= and M denotes the window length of the
DFT computation. (For FCDFT computation, M N = ; for
HCDFT computation, 2 M N = ),

k
A denotes the accurate
fundamental phasor and

ki
D denotes the decaying DC
components which has the following form
( 1)
1
2 2 ( )

( )
1
M k
m
k
m k M
B a a
D B a
M M a
+
= +

= =

(4)
If the parameters B and can be obtained, the decaying DC
components

ki
D and the accurate fundamental phasor can be
obtained by the results of (3-4).
In order to obtain the parameters B and , the M samples
(
( 1) k M
x
+
,
( 2) k M
x
+
, ,
( 1) k
x

,
( ) k
x ) used in (3) are split to
1
G ,
2
G ,
3
G and
4
G four groups as follows:
1
G group: {
( 1) k M
x
+
,
( 5) k M
x
+
, ,
( 7) k
x

,
( 3) k
x

}
2
G group: {
( 2) k M
x
+
,
( 6) k M
x
+
, ,
( 6) k
x

,
( 2) k
x

}
3
G group: {
( 3) k M
x
+
,
( 7) k M
x
+
, ,
( 5) k
x

,
( 1) k
x

}
4
G group: {
( 4) k M
x
+
,
( 8) k M
x
+
, ,
( 4) k
x

,
( ) k
x }
All groups have 4 M samples. Using these groups, four
phasors,
_1

k
x ,
_ 2

k
x ,
_ 3

k
x and
_ 4

k
x are obtained as follows:
3
_1 ( ) _1 _1
1,
5,...
2

4
k
m
k m k k
m k M
k M
x x a A D
M

= +
+
= = +

(5)
2
_ 2 ( ) _ 2 _ 2
2,
6,...
2

4
k
m
k m k k
m k M
k M
x x a A D
M

= +
+
= = +

(6)
1
_ 3 ( ) _ 3 _ 3
3,
7,...
2

4
k
m
k m k k
m k M
k M
x x a A D
M

= +
+
= = +

(7)
_ 4 ( ) _ 4 _ 4
4,
8,...
2

4
k
m
k m k k
m k M
k M
x x a A D
M
= +
+
= = +

(8)
where
_1

k
A ,
_1

ki
D ,
_ 2

k
A ,
_ 2

ki
D ,
_ 3

k
A ,
_ 3

ki
D ,
_ 4

k
A , and
_ 4

ki
D denote the fundamental phasors and decaying DC
components obtained by
1
G ,
2
G ,
3
G and
4
G sample groups,
respectively. Since we use the recursive DFT to obtain the
phasor, four fundamental phasors will satisfy the relation
_1

k
A
=
_ 2

k
A =
_ 3

k
A =
_ 4

k
A . The parameters and B can be
obtained as follows:
_ 4 _ 2
_ 3 _1


k k
k k
x x
x x

(9)
2
_ 3 _1 ( 1)
( ) 1
Real ( )
8 ( )
k k M
M a
B x x
a a
+
+
=



(10)
Finally, the accurate fundamental phasor

k
A can be easily
obtained as follows:
( )
( 1)
_1 _ 2 _ 3 _ 4

1 2 ( )

4 1
k k k
M
k k k k
A x D
B a a
x x x x
M a
+
=

= + + +

(11)
Since the recursive DFT is used for obtaining the phasor,
the computation burdens for obtaining the ( 1)
th
k + phasors
can be significantly reduced. If the
th
k phasors
_1

k
x ,
_ 2

k
x ,
_ 3

k
x and
_ 4

k
x have been obtained, the ( 1)
th
k + phasor
_1

k
x ,
_ 2

k
x ,
_ 3

k
x and
_ 4

k
x can be obtained by using the recursive
concept as follows:
_( 1) _1 _ _ 2

m k m k
x x
+
= (12)
_( 1) _ 2 _ _ 3

m k m k
x x
+
= (13)
_( 1) _ 3 _ _ 4

m k m k
x x
+
= (14)
( )
_( 1) _ 4 _ _1
( 1) ( 1)
( 1) ( 1)

2
4
m k m k
k k M
k m k M m
x x
x a x a
M
+
+ +
+ +
=
+
(15)
Thus, after the first phasors for four sample groups have been
obtained, the computation burdens of the consecutive phasors
can be reduced. In comparison with previous works [3-7], the
response time of the proposed algorithm is faster. By changing
the window length M , the proposed algorithm can be easily
applied to the HCDFT- and FCDFT-based computations.
III. SIMULATION RESULTS
In this section, the performances of the proposed algorithm
are evaluated by some specific signals and those signals
generated from a power system example. For all the following
simulation cases, the sampling frequencies are 2880
S
f Hz = .
The number of per cycle samples is 48 N = .
A. Test Signals Cases
Three signals
1
( ) x t ,
2
( ) x t and
3
( ) x t are specified in
verifying the effectiveness of the proposed algorithm under
various environments.
a) Full-cycle computation
1
40
( ) 10 10cos(120 1) 5cos(240 2)
2cos(360 3) cos(600 5) 10
t
x t t t
t t e



= + + + +
+ + + + +

The signal
1
( ) x t containing a pure DC, an even and an odd
integer harmonics, along with a decaying DC component is
used to test the performance of the full-cycle computations.
For comparison, the test signal is also filtered by conventional
860
3
FCDFT, Gus algorithm [4] and the digital mimic filter +
FCDFT. The time constant set for the digital mimic filter is
0.01sec = .Fig.1 depicts the fundamental phasor magnitude
responses. Since the proposed algorithm is capable of
removing the decaying DC component without the need of
extra sample, the accurate fundamental phasor magnitude
could be obtained by using one-cycle sample computations.
On the other hand, the conventional FCDFT is not able to
obtain the accurate results, and its result contains large
oscillation which is out of the range of the figure. The mimic
filter + FCDFT needs one extra sample to obtain the results
with less error. Gus algorithm, however, can obtain accurate
results. Nonetheless, it needs one-cycle-plus-two samples.
Thus, the response time of the proposed algorithm is more
efficient.
0.9 1 1.1 1.2 1.3 1.4 1.5 1.6
9.5
10
10.5
11
Time (cycle)
P
h
a
s
o
r

m
a
g
n
i
t
u
d
e

(
A
)


The proposed algorithm based on FCDFT
FCDFT
Gu's algorithm
Mimic filter + FCDFT

Fig. 1 Fundamental phasor magnitude responses of full-cycle computations of
different filter algorithms
b) Half-cycle computation
2
40
( ) 10cos(120 1) 5cos(360 3)
2cos(600 5) cos(840 7) 10
t
x t t t
t t e



= + + +
+ + + +

In the Half-Cycle Computation test, the signal
2
( ) x t
containing the 3
rd
, the 5
th
and the 7
th
order harmonics along
with a decaying DC component is used to demonstrate the
performance of the half-cycle computations. For comparison,
the test signal is similarly checked by other filter algorithms
mentioned in the previous test. Fig.2 shows the fundamental
phasor magnitude responses of different filter algorithms. Still,
we can note that the conventional HCDFT is not capable of
obtaining accurate results, and the mimic filter + HCDFT can
only calculate the results with lessened error. Gus algorithm,
however, can obtain accurate results by using two extra
samples. With the proposed algorithm, the accurate
fundamental phasor can be obtained by only using half-cycle
samples computations.
0.4 0.5 0.6 0.7 0.8 0.9 1 1.1 1.2
8
9
10
11
Time (cycle)
P
h
a
s
o
r

m
a
g
n
i
t
u
d
e

(
A
)


The proposed algorithm based on HCDFT
HCDFT
Gu's algorithm
Mimic filter + HCDFT

Fig. 2 Fundamental phasor magnitude responses of half-cycle computations
of different filter algorithms
c) Statistical Performance Analysis
In the Statistical Performance Analysis, the same signal
1
( ) x t and
2
( ) x t are used, but the consideration of various
decaying DC time constants took place. Random noise with a
different Signal-to-Noise ratio (SNR) was also added to test
the filters performances. The signal
1
( ) x t is used to evaluate
the performances of the full-cycle computations, and the
signal
2
( ) x t is used to evaluate the performances of the half-
cycle computations. The decaying DC time constant used for
simulations are 1/40sec, 1/80sec, 1/120sec, and 1/160sec.
Random noise is generated by the rand function of MATLAB
[12], and its magnitude is matched with different SNRs (60dB,
80dB, and 100dB). For comparison, this test also uses the
digital mimic filter + DFT for simulations. The time constant
set for the digital mimic filter is 0.01sec = . Meanwhile, the
two indices [7], PRMSE% and PPE%, are used to demonstrate
the filter performances. These two indices are defined as
follows:
(i) The percentage root-mean-square error (PRMSE%):
2 n+N-1
k=n
(Filter output-Steady state value)
N
PRMSE% = 100%
Steady state value

(16)
This index is used to evaluate the averaged performance in
one cycle. The data used for analysis are the first N samples
after the fault occurring.
(ii) The percentage peak error (PPE%):
Max Filter output-Steady state value
PPE%= 100%
Steady state value

(17)
This index is used to evaluate the maximum error. The
data used for this index are similar to those used in PRMSE%.
Figure 3 shows the simulation results of the full-cycle
computations of the signal
1
( ) x t under various decaying DC
time constants. The PRMSE% and PPE% indices are used to
execute the performance analysis. Obviously, the proposed
algorithm is better than the mimic filter +FCDFT. Although
the errors of mimic filter + FCDFT results decrease when the
time constants were near to their preset value, they remain
prone to large errors. Meanwhile, the proposed algorithm is
hardly affected by the variations in time constant.
Figure 4 shows the simulation results of the full-cycle
computations of the signal
1
( ) x t under various SNR ratios.
Notably, the effects of these ratios on the mimic filter +
FCDFT are not obvious. On the other hand, the proposed
algorithm is affected by different SNR ratios. However, the
proposed algorithm has a better performance than the mimic
filter + FCDFT.
Figure 5 shows the simulation results of the signal
2
( ) x t
half-cycle computations under various decaying DC time
constants. Obviously, the proposed algorithm is more efficient
than the mimic filter + HCDFT under half-cycle computations.
In half-cycle computations, the proposed algorithm is still not
affected by time constant variations.
861
4
1/40 1/80 1/120 1/160
0
0.5
1
Time constant (sec)
(a) PRMSE%
P
R
M
S
E

(
%
)


The proposed algorithm
Mimic filter + FCDFT

1/40 1/80 1/120 1/160
0
1
2
3
4
Time constant (sec)
(b) PPE%
P
R
M
S
E

(
%
)


The proposed algorithm
Mimic + FCDFT

Fig. 3 Full-cycle computation responses of the signal
1
( ) x t under various
decaying DC time constant
60 80 100
0
0.2
0.4
0.6
0.8
SNR (dB)
(a) PRMSE%
P
P
E

(
%
)


The proposed algorithm
Mimic filter + FCDFT

60 80 100
0
0.5
1
1.5
2
SNR (dB)
(b) PPE%
P
P
E

(
%
)


The proposed algorithm
Mimic filter + FCDFT

Fig. 4 Full-cycle computation responses of the signal
1
( ) x t under various
SNR ratios
1/40 1/80 1/120 1/160
0
2
4
6
8
Time constant (sec)
(a) PRMSE%
P
R
M
S
E

(
%
)


The proposed algorithm
Mimic filter + HCDFT

1/40 1/80 1/120 1/160
0
5
10
Time constant (sec)
(b) PPE%
P
R
M
S
E

(
%
)


The proposed algorithm
Mimic filter + HCDFT

Fig. 5 Half-cycle computation responses of the signal
2
( ) x t under various
decaying DC time constant
60 80 100
0
1
2
3
4
SNR (dB)
(a) PRMSE%
P
P
E

(
%
)


The proposed algorithm
Mimic filter + HCDFT

60 80 100
0
2
4
6
8
SNR (dB)
(b) PPE%
P
P
E

(
%
)


The proposed algorithm
Mimic filter + HCDFT

Fig. 6 Half-cycle computation responses of the signal
2
( ) x t under various
SNR ratios
Fig. 6 shows the simulation results of the signal
2
( ) x t half-
cycle computations under various SNR ratios. Similarly, the
proposed algorithm is still affected by different SNR ratios.
However, the proposed algorithm remained to have better
performances than the mimic filter + FCDFT.
d) Half-cycle computation Pure DC Component Test
3
( ) 5 10cos(120 1)
2cos(600 5) cos(840 7)
x t t
t t

= + +
+ + + +

In this test, the signal
3
( ) x t without the decaying DC
component but containing a pure DC component and two odd-
harmonics (the 5
th
and 7
th
) is used to test the half-cycle
computation performance of the proposed algorithm. In this
test, the filtering result of the conventional HCDFT is used for
comparison. Meanwhile, a random noise with SNR = 60dB is
also added in
3
( ) x t for testing. Fig. 7 depicts the fundamental
phasor magnitude responses of the two filter algorithms.
Obviously, due to the pure DC component, the HCDFT is not
able to obtain the accurate fundamental phasor. On the other
hand, the proposed algorithm can achieve accurate results.
With the proposed algorithm, the ratio computation of (9) can
easily obtain the decaying constant 1 = for this pure DC
component case, and (10) could then arrive at 5 B = . Thus,
for a signal containing a pure DC component, the half-cycle
computations of the proposed algorithm can still obtain the
accurate result.
0 0.5 1 1.5 2 2.5 3
0
20
40
Time (cycle)
P
h
a
s
o
r

m
a
g
n
i
t
u
d
e

(
A


The proposed algorithm based on HCDFT
HCDFT

Fig. 7 Fundamental phasor magnitude responses of half-cycle computations of
the signal
3
( ) x t
B. Fault Transmission Line Case

Fig. 8 The single-line-diagram of the power system for testing
In this test, a fault transmission line shown in Fig.8 is used
to generate the fault currents for evaluating the performances
of the proposed algorithm. The parameters of the transmission
line are listed in Table I. Assuming a three-phase shorted fault
occurs at 50km from BUS S, which has a 0.1 fault
resistance. The total simulation time is 12 cycles, and the fault
is incepted at the end of the 6
th
cycle. Fault current
measurements are used to verify the performances of the
proposed algorithm. Second order low-pass Butterworth anti-
aliasing filters with 360-Hz cut-off frequency are adopted to
filter the fault currents. The filtered results were then sampled
by 2880 Hz for digital signal processing. Afterward, these
samples were filtered by the proposed half- and full-cycle
DFT-based algorithms for obtaining the fundamental phasors.
For comparison, the FCDFT and full-cycle computation of
Gus algorithm [4] are performed.
TABLE I Parameters of the transmission line
System voltage 345kV System frequency 60Hz
Generator parameters:
ES=1.00pu ER=1.0-10pu
ZS1=0.238+j5.7132() ZR1=0.238+j6.19()
ZS0=2.738+j10 () ZR0=0.833+j5.118()
Transmission line parameters : Length = 100km
Positive sequence: R1=0.0321(/km) L1=0.473(mH/km) C1=0.038(uF/km)
Zero sequence: R0=0.3479(/km) L0=1.370(mH/km) C0=0.038(uF/km)
Data Acquisition:
Sampling frequency : 2880Hz,
2
nd
order Butterworth with 360Hz cut-off frequency
862
5
a) Sending-End Waveform Analysis Measured at BUS S
In this test, the fault currents are measured at BUS S.
Fig.9(a) shows the A-phase current waveform. We have noted
that the waveform contains the decaying DC component. The
fundamental phasor magnitudes obtained by various filter
algorithms are shown in Fig.9(b). Meanwhile, Fig.9(c) is the
expanded view of the dashed rectangle in Fig.9(b). All the
waveforms have an estimated 0.08msec time delay caused by
the anti-aliasing filter. We can note that the FCDFT is not
capable of attaining the accurate result until the decaying DC
component disappears. On the other hand, the proposed
algorithm and Gus algorithm could obtain the accurate results.
Since the proposed algorithm does not need extra samples to
remove the decaying DC component, its response time is
faster than that of Gus algorithm by two samples. In
considering the results of the full-cycle computations, the error
of the proposed algorithm is minimal at the time of the one-
sample before the 7
th
cycle. However, the error of Gus
algorithm was quite significant during that period. Thus, if the
designing of a relay is based on the proposed algorithm, it
could have a quicker response time.
b) Receiving-End Waveform Analysis Measured at BUS R
In this test, the fault currents are measured at BUS R.
Fig.10(a) shows the A-phase current waveform. We can note
that the waveform also contains the decaying DC component.
The fundamental phasor magnitudes obtained by various filter
algorithms are shown in Fig.10(b). Meanwhile, Fig.10(c) is
the expanded view of the dashed rectangle in Fig.10(b).
Obviously, the proposed algorithm can completely remove the
decaying DC components in a fast manner and can still have
the quickest response time.
5 6 7 8 9 10 11 12
-20
0
20
40
Time (cycle)
A
-
p
h
a
s
e

c
u
r
r
e
n
t

(
K
A
)

(a) The A-phase current waveform
5 6 7 8 9 10 11 12
0
5
10
15
20
25
Time (cycle)
P
h
a
s
o
r

m
a
g
n
i
t
u
d
e

(
K
A
)


The proposed algorithm based on FCDFT
The proposed algorithm based on HCDFT
FCDFT
Gu's algorithm

(b) The fundamental phasor magnitude obtained by various algorithms
6.4 6.6 6.8 7 7.2 7.4
17
18
19
20
21
22
Time (cycle)
P
h
a
s
o
r

m
a
g
n
i
t
u
d
e

(
K
A
)


The proposed algorithm based on FCDFT
The proposed algorithm based on HCDFT
FCDFT
Gu's algorithm

(c) The expanded view of (b)
Fig.9 A-phase fault current waveform and its fundamental phasor magnitudes
5 6 7 8 9 10 11 12
-20
0
20
40
Time (cycle)
A
-
p
h
a
s
e

c
u
r
r
e
n
t

(
K
A
)

(a) The A-phase current waveform
5 6 7 8 9 10 11 12
0
5
10
15
20
25
Time (cycle)
P
h
a
s
o
r

m
a
g
n
i
t
u
d
e

(
K
A
)


The proposed algorithm based on FCDFT
The proposed algorithm based on HCDFT
FCDFT
Gu's algorithm

(b) The fundamental phasor magnitude obtained by various algorithms
6.5 6.7 6.9 7.1 7.3 7.5
17
18
19
20
21
22
Time (cycle)
P
h
a
s
o
r

m
a
g
n
i
t
u
d
e

(
K
A
)


The proposed algorithm based on FCDFT
The proposed algorithm based on HCDFT
FCDFT
Gu's algorithm

(c) The expanded view of (b)
Fig.10 A-phase fault current waveform and its fundamental phasor
magnitudes
IV. CONCLUSIONS
In this paper, a new phasor estimation algorithm is
proposed. This algorithm does not need extra samples to
remove the decaying DC component. Thus, it has fast
response time. Since the proposed algorithm is using DFT-
based approaches, both the HCDFT- and FCDFT-based
computations could be achieved through the same equations.
Meanwhile, recursive computations are developed to reduce
the burdens of computation. Simulation results demonstrate
the effectiveness of the proposed algorithm under various fault
conditions.
863
6
ACKNOWLEDGEMENT
This work is sponsored by the National Science Council
under the grant NSC 96-2628-E-027-115-MY2.
V. REFERENCE
[1] A. G. Phadke and J.S. Thorp, Computer Relaying for Power Systems:
John Wiley & Sons, 1988, pp.125-129.
[2] A. T. Johns and S. K. Salman, Digital Protection for Power Systems,
Peter Peregrinus Ltd. , 1995, pp. 72-83.
[3] G. Benmouyal, Removal of dc offset in current waveforms using digital
mimic filtering, IEEE Transactions Power Delivery, vol.10, no. 2, Apr.,
1995, pp. 621-630.
[4] J. -C. Gu and S. -L Yu, Removal of DC offset in current and voltage
signals using a novel Fourier filter algorithm, IEEE Transactions on
Power Delivery, vol.15, no.1, Jan., 2000, pp. 73-79.
[5] J. -Z. Yang and C. -W. Liu, A precise calculation of power system
frequency and phasor, IEEE Transactions on Power Delivery, vol.5,
no.2, Apr., 2000, pp.494-499.
[6] J. F. Minambres Arguelles, et. al., A new method for decaying DC
offset removal for digital protective relays, Electric Power Systems
Research. 76, 2006, pp. 194-199
[7] C. -S. Yu, A Discrete-Fourier-transform based adaptive mimic phasor
estimator for distance relaying applications, IEEE Transactions on
Power Delivery, vol.21, no.4, Oct., 2006, pp.1836-1846.
[8] T. S. Sidhu, X. Zhang, F. Albas and M. S. Sachdev, Discrete-Fourier-
transform-based technique for removal of decaying DC offset from
phasor estimates,, IEE Proc.-Gener. Transm. Distrib, vol.150, no.6,
Nov., 2003, pp. 745 752.
[9] T. S. Sidhu, X. Zhang, and V. Balamourougan, A New Half-Cycle
Phasor Estimation Algorithm, IEEE Transactions on Power Delivery,
Vol. 20, No. 2, Apr., 2005, pp.1299-1305.
[10] Y. Guo, M. Kezunovic, and D. Chen, Simplified Algorithms for
Removal of the Effect of Exponentially Decaying DC-Offset on the
Fourier Algorithm, IEEE Transactions on Power Delivery, vol.18, no.3,
Jul., 2003, pp.711-717.
[11] The Math Works, Inc., Power System Blockset Users Guide, 2002.
[12] G. Strang and T. Nguyen, Wavelets and Filter Banks, Wellesley
Cambridge Press, 1996.
[13] J. R. Rice, Numerical Methods, Software, and Analysis, Academic Press
Inc., San Diego, 1993.
864