Description:
Dsp to achieve the fast Fourier transform (FFT) algorithm, the FFT is not a new transform, which is a fast algorithm for the discrete Fourier transform (DFT).Since the time when we in the calculation of DFT complex multiplication required four real multiplications and secondary real additions a complex additions need to quadratic real additions. Each operator a (k) 4N complex multiplications and 2N+2 (N-1) = 2 (2N-1) times the real number addition. Entire DFT operation a total of 4N ^ 2 real multiplications and N* 2 (2N-1) = 2N (2N-1) real additions
To Search:
File list (Check if you may need any files):
Lab0503-FFT
...........\1.DAT
...........\c5509.h
...........\cc_build_Debug.log
...........\clk_init.c
...........\Debug
...........\Debug.lkf
...........\Debug.lkv
...........\.....\clk_init.obj
...........\.....\FFT.obj
...........\.....\Fir.map
...........\.....\Fir.out
...........\.....\sdram_init.obj
...........\FFT.c
...........\FFT.CS_
...........\.......\FILE.CDX
...........\.......\FILE.DBF
...........\.......\FILE.FPT
...........\.......\SYMBOL.CDX
...........\.......\SYMBOL.DBF
...........\.......\SYMBOL.FPT
...........\FFT.paf
...........\FFT.paf2
...........\FFT.pjt
...........\FFT.sbl
...........\FFT.wks
...........\func.h
...........\ICETEK-VC5509-A.cmd
...........\ICETEK-VC5509-EDU.h
...........\myapp.h
...........\peripherals.h
...........\scancode.h
...........\sdram_init.c
Download