- Category:
- Algorithm
- Tags:
-
[PPT]
- File Size:
- 410kb
- Update:
- 2012-11-26
- Downloads:
- 0 Times
- Uploaded by:
- ieffly
Description: The FFT algorithm s basic principle is decomposes gradually long sequence DFT into short sequence DFT. different may divide into according to the extraction way DIT-FFT (according to time extraction) and DIF-FFT (according to frequency extraction) the algorithm. Different may divide into the base 2, base 4, bases according to the butterfly-shaped operation s constitution 8 as well as the random factor (2n, n is bigger than 1 integer), the base 2, base 4 algorithms are more common.
- [FFTC] - a good procedure, fft the C language pro
- [FFT] - Elaborated on development and formula ap
- [FFT_API] - Written by a master of the FFT needs to
- [1+fft] - 2 fft-based basic principles to achieve
- [fft] - fft butterfly algorithm, using c++ prepa
- [xiangWeiCha] - Are some figures related to law 1.FFT la
- [1024FFT.ZIP] - fast fourier transform
- [ADSP-21062_Compl_FFT_rad-4] - In general, a radix-4 FFT will run faste
- [CORDIC] - fft twiddle factor multiplier design wit
File list (Check if you may need any files):
快速傅里叶变换.ppt
Download