Weighted Sliding DFT (2 of 3)

Our new sliding DFT process is efficient in its requirement for hardware. It uses just 3N complex multiply operations for an N-point weighted DFT. Computing the FFT, on the other hand, requires a number of complex multiply operations equal to N/2 times the base 2 logarithm of N, plus an amplitude weighting. The figure below compares the number of complex multiply operations required for each approach.