The total number of complex additions required to compute N point DFT – McqOptions

MCQOPTIONS

1.	The total number of complex additions required to compute N point DFT by radix-2 FFT is?
A.	(N/2)log<sub>2</sub>N
B.	Nlog<sub>2</sub>N
C.	(N/2)logN
D.	None of the mentioned
Answer» C. (N/2)logN

Discussion

No Comment Found

Related MCQs

The total number of complex additions required to compute N point DFT by radix-2 FFT is?
The total number of complex multiplications required to compute N point DFT by radix-2 FFT is?
If we split the N point data sequence into two N/2 point data sequences f1(n) and f2(n) corresponding to the even numbered and odd numbered samples of x(n), then such an FFT algorithm is known as decimation-in-time algorithm.