Question

The number of stages in radix-2 DIT FFT for \( N = 8 \) is

• A. 5
• B. 3
• C. 4
• D. 1

Hint:

The number of stages in an FFT algorithm is calculated as \( \log_2 N \).

Answer 1

The Correct Option is B

- The number of stages in a radix-2 DIT FFT is given by \( \log_2 N \). - For \( N = 8 \), we have \( \log_2 8 = 3 \).
Conclusion: The correct answer is option (b).