Comparisons of the execution times and memory requirements for high-speed discrete fourier transforms and fast fourier transforms, for the measurement of AC power harmonics

A. J. Roscoe, G. M. Burt

Research output: Contribution to conferenceProceeding

2 Citations (Scopus)
79 Downloads (Pure)

Abstract

Conventional wisdom dictates that a Fast Fourier Transform (FFT) will be a more computationally effective method for measuring multiple harmonics than a Discrete Fourier Transform (DFT) approach. However, in this paper it is shown that carefully coded discrete transforms which distribute their computational load over many frames can be made to produce results in shorter execution times than the FFT approach, even for large number of harmonic measurement frequencies. This is because the execution time of the presented DFT actually rises with N and not the classical N2 value, while the execution time of the FFT rises with Nlog2N.
Original languageEnglish
Pages40-45
Number of pages6
Publication statusPublished - Jun 2011
Event2nd IMEKO TC 11 International Symposium Metrological Infrastructure - Dubrovnik, Croatia
Duration: 15 Jun 201117 Jun 2011

Conference

Conference2nd IMEKO TC 11 International Symposium Metrological Infrastructure
CountryCroatia
CityDubrovnik
Period15/06/1117/06/11

Fingerprint

Discrete Fourier transforms
Fast Fourier transforms
Data storage equipment

Keywords

  • power system harmonics
  • harmonic analysis
  • Fourier transforms
  • power quality

Cite this

@conference{3a0d681a18c04479b7b8d1febd8ebb20,
title = "Comparisons of the execution times and memory requirements for high-speed discrete fourier transforms and fast fourier transforms, for the measurement of AC power harmonics",
abstract = "Conventional wisdom dictates that a Fast Fourier Transform (FFT) will be a more computationally effective method for measuring multiple harmonics than a Discrete Fourier Transform (DFT) approach. However, in this paper it is shown that carefully coded discrete transforms which distribute their computational load over many frames can be made to produce results in shorter execution times than the FFT approach, even for large number of harmonic measurement frequencies. This is because the execution time of the presented DFT actually rises with N and not the classical N2 value, while the execution time of the FFT rises with Nlog2N.",
keywords = "power system harmonics, harmonic analysis, Fourier transforms, power quality",
author = "Roscoe, {A. J.} and Burt, {G. M.}",
year = "2011",
month = "6",
language = "English",
pages = "40--45",
note = "2nd IMEKO TC 11 International Symposium Metrological Infrastructure ; Conference date: 15-06-2011 Through 17-06-2011",

}

Roscoe, AJ & Burt, GM 2011, 'Comparisons of the execution times and memory requirements for high-speed discrete fourier transforms and fast fourier transforms, for the measurement of AC power harmonics' 2nd IMEKO TC 11 International Symposium Metrological Infrastructure, Dubrovnik, Croatia, 15/06/11 - 17/06/11, pp. 40-45.

Comparisons of the execution times and memory requirements for high-speed discrete fourier transforms and fast fourier transforms, for the measurement of AC power harmonics. / Roscoe, A. J.; Burt, G. M.

2011. 40-45 2nd IMEKO TC 11 International Symposium Metrological Infrastructure, Dubrovnik, Croatia.

Research output: Contribution to conferenceProceeding

TY - CONF

T1 - Comparisons of the execution times and memory requirements for high-speed discrete fourier transforms and fast fourier transforms, for the measurement of AC power harmonics

AU - Roscoe, A. J.

AU - Burt, G. M.

PY - 2011/6

Y1 - 2011/6

N2 - Conventional wisdom dictates that a Fast Fourier Transform (FFT) will be a more computationally effective method for measuring multiple harmonics than a Discrete Fourier Transform (DFT) approach. However, in this paper it is shown that carefully coded discrete transforms which distribute their computational load over many frames can be made to produce results in shorter execution times than the FFT approach, even for large number of harmonic measurement frequencies. This is because the execution time of the presented DFT actually rises with N and not the classical N2 value, while the execution time of the FFT rises with Nlog2N.

AB - Conventional wisdom dictates that a Fast Fourier Transform (FFT) will be a more computationally effective method for measuring multiple harmonics than a Discrete Fourier Transform (DFT) approach. However, in this paper it is shown that carefully coded discrete transforms which distribute their computational load over many frames can be made to produce results in shorter execution times than the FFT approach, even for large number of harmonic measurement frequencies. This is because the execution time of the presented DFT actually rises with N and not the classical N2 value, while the execution time of the FFT rises with Nlog2N.

KW - power system harmonics

KW - harmonic analysis

KW - Fourier transforms

KW - power quality

UR - http://www.imeko-mi2011.org/

UR - http://www.imeko.org/

M3 - Proceeding

SP - 40

EP - 45

ER -