FFT

Procedure RecursiveFFT(X, Y, n, w)

if (n == 1)

Y[0] = X[0]

else

RecursiveFFT(<X[0],X[2],…X[n-2]>,

<Q[0],Q[1],…Q[n/2]>, n/2, w2);

RecursiveFFT(<X[1],X[3],…X[n-1]>,

<T[0], T[1],… T[n/2]>, n/2, w2);

for i = 0 to n-1

Y[i] = Q[i mod (n/2)] + wi * T[i mod (n/2)];

end

Optimization Opportunity

Previous slide

Next slide

Back to first slide

View graphic version