How many number of butterflies are required per output point in FFT algorithm?
A. N
B. N+1
C. 2N
D. N-1
Answer:A
How many number of butterflies are required per output point in FFT algorithm?
A. N B. N+1 C. 2N D. N-1
Explanation: We find that, in general, there are N/2 in the first stage of FFT, N/4 in the second stage, N?8 in the third state, and so on, until the last stage where there is only one. Consequently, the number of butterflies per output point is N-1.