Fast harmonic computation for digital relaying

Author

Expósito, Antonio Gómea ; Macías, Joyé A Roscndo

Author_Institution

Dept. of Electr. Eng., Seville Univ., Spain

Volume

14

Issue

4

fYear

1999

fDate

10/1/1999 12:00:00 AM

Firstpage

1263

Lastpage

1268

Abstract

It has been shown that the fast Fourier transform of a sequence which slides over a time-limited rectangular window can be carried out in a nonrecursive manner by means of O(N) computations. The same idea is applied in this paper to the digital relaying field, where only certain isolated harmonics, rather than the full spectrum, are needed, leading to O(log₂N) computations per harmonic. The particular case N=16 has been used for comparison purposes, showing that the new technique is less expensive than other nonrecursive algorithms in the literature

Keywords

discrete Fourier transforms; power system harmonics; power system relaying; spectral analysis; O(N) computations; O(log₂N) computations; digital relaying; discrete Fourier transform; fast harmonic computation; isolated harmonics; spectral analysis; time-limited rectangular window; Computational efficiency; Digital relays; Discrete Fourier transforms; Harmonic analysis; Marketing and sales; Power & Energy Society; Power system harmonics; Power system relaying; Printing; Transactions Committee;

fLanguage

English

Journal_Title

Power Delivery, IEEE Transactions on

Publisher

ieee

ISSN

0885-8977

Type

jour

DOI

10.1109/61.796216

Filename

796216