DISCRETE FOURIER-TRANSFORM COMPUTATION FOR DIGITAL RELAYING

In this paper several ways of computing the discrete Fourier transform are presented. Starting from the conventional non-recursive version, three recursive algorithms are obtained. Even though these recursive f ilters are computationally efficient their steady-state response is no t always accurate. So, an efficient non-recursive version is proposed which requires computing only the imaginary component of the transform . An example is included in order to compare the operation counts of t he different schemes.