0
1.8kviews
Develop a radix $-2$ DIF -FFT algorithm for computing 8-point DFT.
1 Answer
0
39views

Solution:

This algorithm is obtained by using the divide \& conquer approach.

To derive this algorithm we begin with $^2$ splitting the DFT formula into hoo summation g of which one involves the sum over the first $\mathrm{N} / 2$ data points and the second sum over the last N/2 …

Create a free account to keep reading this post.

and 4 others joined a min ago.

Please log in to add an answer.