Issue No. 04 - July/August (2005 vol. 7)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/MCSE.2005.82
When undergraduate students first compute a fast Fourier transform (FFT), their initial impression is often a bit misleading. The process all seems so simple and transparent: the software takes care of the computations, and it's easy to create the plots. But once they start probing, students quickly learn that like any rich scientific expression, the implications, the range of applicability, and the associated multilevel understandings needed to fully appreciate the subtleties involved take them far beyond the basics. Even professionals find surprises when performing such computations, becoming aware of details that they might not have fully appreciated until they asked more sophisticated questions. In the first of this five-part series, we discussed several basic properties of the FFT. In addition to some fundamental elements, we treated zero-padding, aliasing, and the relationship to a Fourier series, and ended with an introduction to windowing. In this article, we'll briefly look at the convolution process.
convolution, fast Fourier transform, discrete fast Fourier transform, FFT, DFFT
B. Rust and D. Donnelly, "The Fast Fourier Transform for Experimentalists, Part II: Convolutions," in Computing in Science & Engineering, vol. 7, no. , pp. 92-95, 2005.