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)log2N
B.	Nlog2N
C.	(N/2)logN
D.	None of the mentioned
Answer» C. (N/2)logN

Discussion

No Comment Found

Related MCQs

By means of the DFT and IDFT, determine the response of the FIR filter with impulse response h(n)={1,2,3} to the input sequence x(n)={1,2,2,1}?
What is the variance of the output DFT coefficients |X(k)|?
If x1(n) and x2(n) are two real valued sequences of length N, and let x(n) be a complex valued sequence defined as x(n)=x1(n)+jx2(n), 0≤ n≤ N-1, then what is the value of x2(n)?
Which of the following is true regarding the number of computations required to compute DFT at any one value of 'k'?
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) and F1(k) and F2(k) are the N/2 point DFTs of f1(k) and f2(k) respectively, then what is the N/2 point DFT X(k) of x(n)?
WNk+N/2=
What is the range in which the quantization errors due to rounding off are uniformly distributed as random variables if Δ=2-b?
Every fourfold increase in the size N of the DFT requires an additional bit in computational precision to offset the additional quantization errors.
What is the signal-to-noise ratio?
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.