534 IEEE Transactions On Power Delivery, Vol. 2, April 1988
534 IEEE Transactions On Power Delivery, Vol. 2, April 1988
534 IEEE Transactions On Power Delivery, Vol. 2, April 1988
2, April 1988
0885-8977/88/O4OO-0534$01.00@1988 IEEE
535
A p p l i c a t i o n of Walsh f u n c t i o n s has a l s o been proposed
by Rahman e t a l . [17,18] f o r d i g i t a l p r o t e c t i o n of From t h e s a m p l e s g( t i ) , r e c t a n g u l a r c o e f f i c i e n t s can
transformers. The following s e c t i o n summarizes the be obtained as:
mathematical f o r m u l a t i o n of t h e commonly u s e d
algorithms f o r transformer d i f f e r e n t i a l p r o t e c t i o n .
g ( t ) = Fo + JT F1 sin(-) + @ F2 cos(+) +
T
JT F3 sin(&)
T
+ 4 F4 COS(%)
T
+ ... (1)
For example, t h e matrix [A-'] takes the form:
with c o e f f i c i e n t s
1 0 -1 I3 0 -115
1 0 0 0 -113 . . -
F1 IT g ( t ) s i n ( 9 ) dt 1 0 0 0 . . .
[A-l] =
1 0 0 . . .
0 1 0 . . .
Using t h i s approach, t h e d i f f e r e n t i a l c u r r e n t is L * _ I
analyzed in terms of i t s F o u r i e r s e r i e s and the peak Using t h i s approach f o r transformer d i f f e r e n t i a l
of the fundamental and second harmonic c o n t e n t s a r e
given by:
p r o t e c t i o n , F1 ..
F4 can be obtained as:
s i n y t ( x ) = sgn ( s i n x) (6 1 g ( t ) = k L4 Wk wal(k, T
")
W = AF (18)
w h e r e any e l e m e n t Akk of m a t r i x A is t h e r e s u l t of
s u b s t i t u t i n g t h e k t h s i n u s o i d t h a t appears in e q u a t i o n
(1) f o r g ( t ) in ( 1 6 ) . T h e F o u r i e r c o e f f i c i e n t s F1,
F 2 , F3 a n d F4 c a n b e d e t e r m i n e d f r o m t h e Walsh
c o e f f i c i e n t s as:
F2 i
i 0.9 w2 + 0.373 w6 - -074 w10 (20)
0 elsewhere
[A] m X = I (37)
SIMULATION RESULTS
COMPARISON OF ALGORITHMS
Y
o uv
a
8
*
Figure 7.a Fourier Algorithm Performance for Haar Functions Algorithm Performance
Figure 7.d
Inrush 0 for Inrush
0 0 0
vA
i Um vi
Figure 7.b Rectangular Transform Algorithm Figure 7.e Finite Impulse Response Algorithm
Performance for Inrush 0 Performance € O K Inrush 0
0 0 0
I
0
8 8
Time a f t e r f a u l t Im.1
Figure 8.a Fourier Algorithm Performance for Figure 8.d Haar Functions Algorithm Performance
Fault for Fault
0 0 0 O
n I
n
..
0
+a 0".
-&
+
3
-- 3
LO 0-
ri
-0
6"
n-
-f ;
-
0
-
CD
'"8 0"'"
7 - i
5
L
Y
.
o u
.f 2
0
, ri
B.W. Hogg, "Application of Haar Functions for should be 54,94,and 62, respectively. With these changes in the numbers
Transmission Line and Transformer Differential of + / - operations, the corresponding numbers in columns 6 and 7 of
Protection", Electrical Power & Energy Systems, Table 1 would also change.
Vol. 6, NO. 3, July 1984, pp. 169-180. 4) The authors state that the frequency response of two filters for
measuring the fundamental frequency and the two filters for measuring the
M.A. Rahman, B. Jeyasurya, A. Gangopadhyay, second-harmonic frequency component have been combined to provide
"Digital Differential Protection of Power single responses shown in Figs. 1-3. We fail to find from the paper how the
Transformers based on Walsh Functions", responses of two filters designed to pass the selected frequency were
Transactions of CEA Engineering h Operating combined to obtain single responses. In our opinion, combining the outputs
Division, Vol. 24, Part 3, Paper 85-SP-149, of two algorithms to determine the fundamental frequency components
1985. provides a band of values. This can be illustrated as follows:
Consider that two algorithms provide orthogonal outputs of A, sin wt and
B. Jeyasurya, M.A. Rahman, "Application of Walsh A, cos wt when the input to the algorithms is A sin (wt + 0) as shown in
Functions for Microprocessor-Based Transformer Fig. D. 1 . Since the filters are nonrecursive, the outputs are orthogonal (they
Protection", IEEE Trans. on Electromagnetic
Compatability, Vol. EMC-27, No. 4, Nov. 1985, A q;(*t+e) As Sfn(wt)
~
pp. 221-225.
Discussion
0.8
M. S. Sachdev, T. S. Sidhu, and A. Srivastava (Power System Research U
01
of A: is 0.5(A: + A f ) but the average value of A, is not [+(A: + after simulating a transformer digital relay, implementing the various
A similar phenomenon is observed, when the responses for the second- algorithms on a Personal Computer. The computational requirements are
harmonic filters are combined. based on an INTEL 8086 Microprocessor and an INTEL 8087 Numeric
5) We would also like to point out that the Fourier Algorithm should Data Processor which is required to do multiply, divide, and square root
have been implemented using 12 samples per cycle. This would have operations. The sampling rate is 16 samples per cycle. The programs
required fewer computations in comparison to the author’s approach of written in Assembly language are available from the authors from which
one may verify the total number of required arithmetic operations. The
using 16 samples per cycle. Twelve sample Fourier algorithm requires only number of arithmetic operations is correct. However, it is to be noted that
42 additionslsubtractions, 8 multiplications, and 2 square root operations.
the number of operations can be reduced further. But it requires additional
6) We would also like to point out that on-line application of the least MOVE, STORE, and LOAD instructions which are more time-consuming
square error approach was developed at University of Saskatchewan in the than simple ADD/SUB instructions.
1970’s [I]. The algorithm was used to design an algorithm for distance 4) The frequency response plot for an algorithm is obtained by
protection of transmission lines. Later, the least square error approach was transforming the algorithm into the complex Z-domain and substituting
applied to differential and earth fault protection of transformers [2]. frequency for the complex variable Z(Z = UT, where T i s the sampling
interval). The outputs are time-invariant for a specified sampling interval as
References per [I] of the paper and [A]. The responses shown in Figs. 1-3 of the paper
are obtained by evaluating the square root of the sum of the squares of the
[I] M. S. Sachdev and M. A. Baribeau, “A new algorithm for digital individual responses. The discussers provided a valid argument on two
impedence relays,” IEEE Trans. Power App. Syst., vol. PAS-98, orthogonal algorithms. In the paper it is assumed that A, is equal to A,.
no. 6, pp. 2232-2240, NovJDec. 1979. Thus it is implied that both the filter outputs are time-invariant. For the sake
[2] M. S. Sachdev and D. V. Shah, “Transformer differential and of completeness, the typographical errors of the discussion are corrected as
restricted earth fault protection using a digital processor,” in Trans.
follows
CEA, vol. 20, no. 4, paper 81-SP-155, Mar. 1981.
Manuscript received March 3, 1987. A,=[(A, sin ~ t ) ~ + ( A , c o~s t ) ~ ] ’ ~
= [ A i sin2 wt+Af cos2
M. A. Rahman and B. Jeyasurya: The authors thank the discussers for The output of filter F2 is A, cos w t .
their comments on the paper. In fact, Prof. M. S. Sachdev and his associates 5) The twelve-sample Fourier algorithm will reduce the total computa-
have extended the paper by the discussion contribution. tional requirements as pointed out by the discussers. Some of the algorithms
1) The authors agree with the discussers that performance of the studied specifically require that the number of samples per cycle be an
algorithms should also be checked during marginal operating conditions. integral power of 2. Hence a rate of 16 samples per cycle was also
Since the objective of the paper was to compare the algorithms with respect considered for the Fourier algorithm.
to their capability to distinguish between an inrush and internal fault, 6) The authors took note of the discussers’ research on the application of
saturation of current transformers, loads containing additional harmonic the least square error approach for digital protection as noted in [ 141 of the
currents, etc., have not been simulated. A practical design implementing
any suitable algorithm s h d d incorporate additional logic to ensure that the paper.
relay provides a secure restraining signal during operating conditions which Reference
call for undesirable trip signal ([7] of the paper).
2) The filter coefficients of the algorithms corresponding to the [A] M. Habib and M. A. Marin, “A comparative analysis of digital
performance shown in Figs. 8(a), 8(b), 8(c), 8(d), and 8(f) of the paper relaying algorithms for the differential protection of three phase
have finite values at the beginning of the data window. At t = O+ , the fault transformers,” in IEEE 1987 PICA Conf. Rec. (Montreal, Que.,
current also has a finite value. This is multiplied by the finite filter Canada, 1987), pp. 460466.
coefficient resulting in finite values of restraint and operating signals.
3) The arithmetic operations listed in Table 1 of the paper are arrived at Manuscript received June 30, 1987.