Take a sneak peek at the new NIST.gov and let us know what you think!
(Please note: some content may not be complete on the beta site.).
NIST Authors in Bold
|Author(s):||D Donnelly; Bert W. Rust;|
|Title:||The Fast Fourier Transform for Experimentalists, Part I: Concepts|
|Published:||April 01, 2005|
|Abstract:||The discrete Fourier transform (DFT) is a widely used tool for the analysis of measured time series data. The Cooley-Tukey fast Fourier transform (FFT) algorithm gives an extremely fast and efficient implementation of the DFT. This is the first of a series of three articles which will describe the use of the FFT for experimental practitioners. This installment gives fundamental definitions and tells how to use the FFT to estimate power and amplitude spectra of a measured time series. It discusses the use of zero padding, the problem of aliasing, the relationship of the inverse DFT to Fourier series expansions, and the use of tapering windows to reduce the sidelobes on the peaks in an estimated spectrum.|
|Citation:||Computing in Science & Engineering|
|Pages:||pp. 80 - 88|
|Keywords:||discrete Fourier transform,fast Fourier transform,spectral analysis,time series analysis|
|PDF version:||Click here to retrieve PDF version of paper (206KB)|