Abstract
The Cooley–Tukey fast Fourier transform (FFT) has had an extraordinary impact on the computation of Fourier transforms. A tutorial account is given of how the algorithm works and of its relationship to the more familiar continuous Fourier transform and Fourier series. Some pitfalls associated with sampled data over a finite window are outlined. Several examples are given illustrating how the FFT is useful as a teaching tool to introduce the subtleties of spectral analysis of sampled data by interactive minicomputer experiments. A bibliography to the literature is given.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
