Several applications, such as phasor measurements in Phasor Measurement Unit (PMU), require to retrieve only one spectral component of the whole signal. In such situations, the classical DFT and FFT algorithms may become computationally inefficient and several alternative methods have been proposed to measure a single spectral component in an efficient way. This paper proposes a modified Taylor-Fourier Transform (TFT) that features a higher computational efficiency than the FFT algorithm when a single harmonic component is needed and a comparable efficiency when up to 8 different harmonic components (not necessarily contiguos) are needed.
A modified TFT algorithm for computationally efficient PMUs
Carboni, Alberto;Ferrero, Alessandro
2017-01-01
Abstract
Several applications, such as phasor measurements in Phasor Measurement Unit (PMU), require to retrieve only one spectral component of the whole signal. In such situations, the classical DFT and FFT algorithms may become computationally inefficient and several alternative methods have been proposed to measure a single spectral component in an efficient way. This paper proposes a modified Taylor-Fourier Transform (TFT) that features a higher computational efficiency than the FFT algorithm when a single harmonic component is needed and a comparable efficiency when up to 8 different harmonic components (not necessarily contiguos) are needed.File | Dimensione | Formato | |
---|---|---|---|
AMPS 2017.pdf
Accesso riservato
Descrizione: Articolo principale
:
Publisher’s version
Dimensione
168.41 kB
Formato
Adobe PDF
|
168.41 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.