How many complex additions are required to be performed in linear filt – McqOptions

MCQOPTIONS

1.	How many complex additions are required to be performed in linear filtering of a sequence using FFT algorithm?
A.	(N/2)logN
B.	2Nlog<sub>2</sub>N
C.	(N/2)log<sub>2</sub>N
D.	Nlog<sub>2</sub>N
Answer» C. (N/2)log<sub>2</sub>N

Discussion

No Comment Found

Related MCQs

How many complex multiplication are required per output data point?
How many complex additions are required to be performed in linear filtering of a sequence using FFT algorithm?
How many complex multiplications are need to be performed for each FFT algorithm?
Decimation-in frequency FFT algorithm is used to compute H(k).
If g(n) is a real valued sequence of 2N points and x<sub>1</sub>(n)=g(2n) and x<sub>2</sub>(n)=g(2n+1), then what is the value of G(k), k=N,N-1, 2N-1?
If g(n) is a real valued sequence of 2N points and x<sub>1</sub>(n)=g(2n) and x<sub>2</sub>(n)=g(2n+1), then what is the value of G(k), k=0,1,2 N-1?
If X(k) is the DFT of x(n) which is defined as x(n)=x<sub>1</sub>(n)+jx<sub>2</sub>(n), 0 n N-1, then what is the DFT of x<sub>1</sub>(n)?
If x<sub>1</sub>(n) and x<sub>2</sub>(n) are two real valued sequences of length N, and let x(n) be a complex valued sequence defined as x(n)=x<sub>1</sub>(n)+jx<sub>2</sub>(n), 0 n N-1, then what is the value of x<sub>2</sub>(n)?
If x<sub>1</sub>(n) and x<sub>2</sub>(n) are two real valued sequences of length N, and let x(n) be a complex valued sequence defined as x(n)=x<sub>1</sub>(n)+jx<sub>2</sub>(n), 0 n N-1, then what is the value of x<sub>1</sub>(n)?