DISCRETE FOURIER TRANSFORM & FAST FOURIER TRANSFORM Lecture 4
DISCRETE FOURIER TRANSFORM & FAST FOURIER TRANSFORM Lecture 4. Decimation-in-Frequency FFT Algorithm x (0), x (1), … , x ( N -1) . let m = n-N/2 ( n = N/2+m ) n = N/2 => m = N/2-N/2 = 0 n = N- 1 => m = N-1-N/2 = N/2- 1.
1.24k views • 61 slides