Description: Discrete Fourier transform (referred to as DFT) analysis for discrete signal theory provides a transform tool, but due to a computational time and difficult to realize, fast Fourier transform (the FFT) is a reduction in the effective algorithm to calculate time. In this paper, DFT calculation was carried out on the basis of the analysis points out the ways and realize the FFT calculation of FFT algorithm for program design and application examples are given.
To Search:
File list (Check if you may need any files):
Download