Cart (Loading....) | Create Account
Close category search window
 

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
$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

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

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:

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

Date of Publication:

Oct 1999

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.