1969
DOI: 10.1109/te.1969.4320436
|View full text |Cite
|
Sign up to set email alerts
|

The Fast Fourier Transform and Its Applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
158
0
7

Year Published

1972
1972
2018
2018

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 404 publications
(169 citation statements)
references
References 10 publications
0
158
0
7
Order By: Relevance
“…This is supported by Figure 4a,c, which show a comparison between observed and normalised hourly demands, respectively, for a one-week period in DMA1. Furthermore, a fast Fourier transform (FFT) algorithm [31] was applied to compute the amplitude of sinusoidal components, as a function of the frequency, characterising the original (Figure 4b) and normalised (Figure 4d) time series. In order to make the results of the analysis comparable, both the time series were preliminary scaled to belong to the [0 1] interval.…”
Section: Case Studiesmentioning
confidence: 99%
“…This is supported by Figure 4a,c, which show a comparison between observed and normalised hourly demands, respectively, for a one-week period in DMA1. Furthermore, a fast Fourier transform (FFT) algorithm [31] was applied to compute the amplitude of sinusoidal components, as a function of the frequency, characterising the original (Figure 4b) and normalised (Figure 4d) time series. In order to make the results of the analysis comparable, both the time series were preliminary scaled to belong to the [0 1] interval.…”
Section: Case Studiesmentioning
confidence: 99%
“…Wave-frequency spectra were calculated using a Fast Fourier Transform (FFT) algorithm (Cooley et al 1969) and smoothed following the averaging procedure described by Otnes and Enochsen (1972, p. 302-306). The spectrum estimates were corrected for water-pressure filtering using the procedures of Kim and Simons (1974).…”
Section: Analysis Of Field Datamentioning
confidence: 99%
“…The Fast Fourier Transform (FFT) is a digital computer algorithm for fast and efficient computation of the Discrete Fourier Transform (DFT) [61,62]. The DFT is defined by…”
Section: The Fast Fourier Transformmentioning
confidence: 99%
“…A distortion due to aliasing occurs in the frequency domain for real functions which are not sampled at sufficiently high rates [62,63].…”
Section: The Approximation Of the Fourier Transform Or Fourier Series Bymentioning
confidence: 99%