Overlap–save is the traditional name for an efficient way to evaluate the discrete convolution between a very long signal x[n] and a finite impulse response (FIR) filter h[n]:(Overlap–save algorithm for linear convolution) H = FFT(h,N) i = 1 while i <= Nx il = min(i+N-1,Nx) yt = IFFT( FFT(x(i:il),N) * H, N) y(i : i+N-M) = yt(M : N) i = i+N-M+1 end




File list:
overl.m