How many complex additions are required to be performed in linear filtering of a sequence using FFT algorithm?
A. (N/2)logN
B. 2Nlog2N
C. (N/2)log2N
D. Nlog2N
Answer:A
How many complex additions are required to be performed in linear filtering of a sequence using FFT algorithm?
A. (N/2)logN B. 2Nlog2N C. (N/2)log2N D. Nlog2N
Explanation: The number of additions to be performed in FFT are Nlog2N. But in linear filtering of a sequence, we calculate DFT which requires Nlog2N complex additions and IDFT requires Nlog2N complex additions. So, the total number of complex additions to be performed in linear filtering of a sequence using FFT algorithm is 2Nlog2N.