Examveda

The number of complex multiplications required to calculate N-point DFT using radix-2 FFT algorithm is

A. N log2 N

B. $$\frac{{\text{N}}}{2}$$ log10 N

C. N log10 N

D. $$\frac{{\text{N}}}{2}$$ log2 N

Answer: Option D


Join The Discussion

Related Questions on Signal Processing