Talk:Overlap–add method

I suggest we mention that the overlap-save algorithm is a little better, because the final step is just a copy/move instead of an addition. Here is pseudocode:

   (Overlap-save algorithm for linear convolution)
    $\,$ 
   Evaluate the best value of NFFT and L
   H = FFT(h,NFFT)
   i = 1
   while i <= Nx
       il = min(i+NFFT-1,Nx)
       yt = IFFT( FFT(x(i:il),NFFT) * H, NFFT)
       y(i : i+NFFT-L-1) = yt(1+L : NFFT)
       i = i+L
   end

--Bob K 13:26, 31 July 2007 (UTC)[reply]