The total number of complex multiplications required to compute N point DFT by radix-2 FFT is:
A. (N/2)log2N
B. Nlog2N
C. (N/2)logN
D. None of the mentioned
Answer:A
The total number of complex multiplications required to compute N point DFT by radix-2 FFT is:
A. (N/2)log2N B. Nlog2N C. (N/2)logN D. None of the mentioned