Many engineers, technicians and students are familiar with Fourier analysis and the DFT and, while they know about the fantastic things this technology can do, they are thwarted in their attempts to use these tools because of the advanced level at which the FFT is usually presented. This book explains the FFT and the software at a level that can be handled by advanced high school students and above. -- From the publisher
--This text refers to an out of print or unavailable edition of this title.
From the Publisher
Part I presents an introduction to (or review of) the discrete Fourier transform (DFT) and Part II is a detailed presentation of the fast Fourier transform (FFT). While this is primarily a tutorial on writing FFT programs, it necessarily develops the function and purpose of the DFT, as well as the underlying algorithm for the FFT. Written at a level that can be handled by advanced high-school students, the material will obviously be accessible to undergraduates as well as practicing engineers and programmers. For instructional purposes the programs are written in low level BASIC language, but the emphasis is placed on the function of each routine (with a detailed description of each line of code) so that readers may easily convert/write these programs in the language of their choice. In presenting the practical considerations of writing FFT programs the author has employed a technique of data management that avoids much of the confusion surrounding this technology. In this second edition a chapter has been added to deal with these difficulties i.e., data "scrambling" and "bit reversal." Finally, a chapter on convolution has been added since, apparently, this is something of a stumbling block for students and users alike.