Description: Fast Fourier Transform (Fast Fourier Tranformation, FFT) is a large number N of DFT is decomposed into a number of small dots combination of DFT. Arithmetic will significantly reduce the workload, thus greatly improving the Discrete Fourier Transform (DFT) calculation speed. Due to various technical fields of science extensive use of FFT techniques which greatly promoted the progress of signal processing technology, has become a powerful tool for digital signal processing
To Search:
File list (Check if you may need any files):
DFT与FFT2
.........\1.m
.........\lab141.m
.........\lab142.m
.........\lab143.asv
.........\lab143.m
.........\lab144.asv
.........\lab144.m
.........\lab21.m
.........\lab22.m
.........\lab23.m
Download