2000 character limit reached
A Heuristic Description of Fast Fourier Transform (1110.5989v1)
Published 27 Oct 2011 in cs.NA
Abstract: Fast Fourier Transform (FFT) is an efficient algorithm to compute the Discrete Fourier Transform (DFT) and its inverse. In this paper, we pay special attention to the description of complex-data FFT. We analyze two common descriptions of FFT and propose a new presentation. Our heuristic description is helpful for students and programmers to grasp the algorithm entirely and deeply.