Question

Find the DFT of 8 point causal sequence using RADIX 2 DIT FFT »(n) = $1, 2, 3, 4, 4, 3, 2, 1}

Answer 1

There are Three stages in the computation of an N = 8-point DFT.

Explanation:

Eight-point decimation-in-time FFT algorithm.

When is a power of

, say where is an integer, then the above DIT decomposition can be performed times, until each DFT is length .

A length. DFT requires no multiplies. The overall result is called a radix 2 FFT.

DFT[x1(n) N x2(n)] = X1(k)X2(k) Where N indicates N-point circular convolution.