Revision as of 00:13, 21 October 2013 edit Mark viking (talk \| contribs) Extended confirmed users 19,327 edits Added context to first sentence, wl ← Previous edit		Revision as of 21:31, 11 December 2013 edit undo Enkiwang (talk \| contribs) 6 edits →The algorithm Next edit →
Line 59: H = FFT(h,N) <span style="color:green;">(''zero-padded FFT'')</span> i = 1 '''while''' i <= Nx <span style="color:green;">(''Nx last index of x[n]'')</span> il = min(i+L-1,Nx) yt = IFFT( FFT(x(i:il),N) * H, N)

Overlap–add method: Difference between revisions