A Heuristic Description of Fast Fourier Transform

From MaRDI portal

MaRDI QIDQ6511483arXivFDO

Authors Zhengjun Cao, Xiao Fan

Published in arXiv




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.














This page was built for publication: A Heuristic Description of Fast Fourier Transform

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6511483)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=A_Heuristic_Description_of_Fast_Fourier_Transform&oldid=103596023"
Powered by MediaWiki