How many complex multiplications are need to be performed for each FFT algorithm?
A. (N/2)logN
B. Nlog2N
C. (N/2)log2N
D. None of the mentioned
Answer:A
How many complex multiplications are need to be performed for each FFT algorithm?
A. (N/2)logN B. Nlog2N C. (N/2)log2N D. None of the mentioned