Description: Discrete Fourier Transform of the 20th century 60 s computational complexity is a major milestone in one study, in 1965 Cooley and Tukey studied the calculation of discrete Fourier transform (Discrete Fourier Test) fast Fourier transform (FFT) calculation increased from О (n2) dropped to О (nlogn), the FFT to promote deeper, broader research and application of law. This is a Fourier transform of the MPI process, with C language.
- [fourier_2D] - fourier transform 2D
- [mega32_FFT_AVR] - The fast Fourier transform is realized i
- [dft] - Discrete Fourier Transform and Power Spe
- [FFT] - Fast Fourier algorithm, C language progr
- [java] - This procedure is a java client, there i
- [caputre] - Interception of images, there are full-s
- [dft] - Discrete Fourier Transform, the developm
- [calculate2] - This a fast Fourier algorithm using elec
File list (Check if you may need any files):
Download