1.

The number of complex additions and multiplications in FFT are, respectively,

A. \(\frac{N}{2}{{\log }_{2}}N~and~N{{\log }_{2}}N\)
B. \(N\;{{\log }_{2}}N~and\frac{N}{2}{{\log }_{2}}N\)
C. \(\frac{N}{2}{{\log }_{2}}N~and{{\log }_{2}}N\)
D. \({{\log }_{2}}N~and\frac{N}{2}{{\log }_{2}}N\)
Answer» C. \(\frac{N}{2}{{\log }_{2}}N~and{{\log }_{2}}N\)


Discussion

No Comment Found