1970
DOI: 10.1049/el:19700513
|View full text |Cite
|
Sign up to set email alerts
|

Square-wave Fourier transform

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

1977
1977
2011
2011

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 6 publications
0
1
0
Order By: Relevance
“…The FFT actually computes a discrete Fourier series, but may be used to approximate a continuous Fourier integral using sampled data. It has been shown (Hunt 1971 ) that the discrete Fourier transform of sampled data, as computed by the FFT, is equivalent to a trapezoidal approximation to the Fourier integral, and that the Fourier transform computed in this manner is more accurate than that evaluated using a higher order interpolation scheme on the data, provided that there is no aliasing (Bates et al 1970 ) .…”
Section: Discussionmentioning
confidence: 99%
“…The FFT actually computes a discrete Fourier series, but may be used to approximate a continuous Fourier integral using sampled data. It has been shown (Hunt 1971 ) that the discrete Fourier transform of sampled data, as computed by the FFT, is equivalent to a trapezoidal approximation to the Fourier integral, and that the Fourier transform computed in this manner is more accurate than that evaluated using a higher order interpolation scheme on the data, provided that there is no aliasing (Bates et al 1970 ) .…”
Section: Discussionmentioning
confidence: 99%