Q485
The number of complex multiplications required to calculate N-point DFT using radix-2 FFT algorithm is
A.
N log2 N
B.
log10 N
C.
N log10 N
D.
log2 N
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board