The number of complex multiplications in Fast Fourier Transform (FFT) is given by

1
\(~N{{\log }_{2}}N\)
2
\(\frac{N}{2}{{\log }_{2}}N\)
3
\({{\log }_{2}}N\)
4
\(~N{{\log }_{2}}\frac{N}{2}\)

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Quick Navigation