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 x1(n)=g(2n) and x2(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 x1(n)=g(2n) and x2(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)=x1(n)+jx2(n), 0≤ n≤ N-1, then what is the DFT of x1(n)?
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)?
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 x1(n)?
HOW_MANY_COMPLEX_MULTIPLICATIONS_ARE_NEED_TO_BE_PERFORMED_FOR_EACH_FFT_ALGORITHM??$