Apostol Natsev, Alexander Haubold, et al.
MMSP 2007
The fast Fourier transform is a computational tool which facilitates signal analysis such as power spectrum analysis and filter simulation by means of digital computers. It is a method for efficiently computing the discrete Fourier transform of a series of data samples (referred to as a time series). In this paper, the discrete Fourier transform of a time series is defined, some of its properties are discussed, the associated fast method (fast Fourier transform) for computing this transform is derived, and some of the computational aspects of the method are presented. Examples are included to demonstrate the concepts involved. © 1967, IEEE. All rights reserved.
Apostol Natsev, Alexander Haubold, et al.
MMSP 2007
Alessandro Morari, Roberto Gioiosa, et al.
IPDPS 2011
Matthias Kaiserswerth
IEEE/ACM Transactions on Networking
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007