By Topic

Design, implementation and performance evaluation of a new digital distance relaying algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Waikar, D.L. ; Dept. of Electr. Eng., Singapore Polytech., Singapore ; Liew, A.C. ; Elangovan, S.

This paper presents the design, simulation, implementation and performance evaluation of a computationally efficient and accurate digital distance relaying algorithm. Published historical data were used in the first phase for validation purpose. Sample results illustrating highly accurate fault impedance estimates for various conditions are reported. The second phase uses voltage and current signals generated by Alternative Transients Program (ATP) and a sample power system for various first-zone, second-zone and third-zone faults. Results of these studies confirming stability and computational efficiency of the algorithm are presented and discussed. In the third phase, a prototype of the relay was developed and tested using real-time fault data generated from physical models of the transmission lines. Oscillographs for these conditions were recorded. Results of these tests indicating high speed relay operation are also discussed. The performance evaluation studies reported in this paper conclusively demonstrate that the new algorithm provides fast and accurate fault impedance estimates for the three-zone protection of transmission lines

Published in:

Power Systems, IEEE Transactions on  (Volume:11 ,  Issue: 1 )