algorithm, for N a power of 2, can compute the same result with only (N/2) log2 N complex multiplies ... FFT algorithms require ト(N log N) operations (technically, O only denotes an upper bound), although ... transforms of the sequences yk[n] are evaluated by multiplying the FFT of xk[n] with the FFT of h[n