A Heuristic Description of Fast Fourier Transform
Z Cao, X Fan - arXiv preprint arXiv:1110.5989, 2011 - arxiv.org
Z Cao, X Fan
arXiv preprint arXiv:1110.5989, 2011•arxiv.orgFast 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.
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.
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.
arxiv.org
Showing the best result for this search. See all results