Description: Using fast Fourier transform computer can calculate the number of multiplications needed for the discrete Fourier transform greatly reduced, especially sampling points N is transformed more and save FFT algorithm to calculate the amount of the more remarkable.
To Search:
File list (Check if you may need any files):
FFT.m
Download