By Topic

A recursive least-squares 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
$33 $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

2 Author(s)
A. S. AlFuhaid ; Dept. of Electr. & Comput. Eng., Kuwait Univ., Safat, Kuwait ; M. A. El-Sayed

A new digital distance relaying algorithm based on the well-known theory of least-squares is developed, and the results of testing it using numerical simulation are presented. The new technique estimates the distance to the fault and the fault resistance. To minimize the computational requirements of the digital relay, a recursive least-squares approach is used. Computer simulation results of the new least-squares algorithm seem promising, indicating that it should be considered for further testing and evaluation

Published in:

IEEE Transactions on Power Delivery  (Volume:14 ,  Issue: 4 )