Overlap–save method: Difference between revisions

Revision as of 13:05, 19 December 2019

Revision as of 18:45, 25 December 2019

Line 40:

==Pseudocode==

<font color=green>(''Overlap-save algorithm for linear convolution'')</font>

h := FIR_impulse_response

M := length(h)

overlap := M- − 1

N := 4* × overlap <span style="color:green;">(or a nearby power-of-2)</span>

step_size := N- − overlap

H := DFT(h, N)

position := 0

'''while''' position + N <=≤ length(x) '''do'''

yt = IDFT( DFT( x(1+position : N+position), N ) * H, N )

yt y= IDFT(DFT(x(1 + position : step_sizeN + position) = yt(M :, N) × H, #discard M-1 y-valuesN)

y(1 + position =: positionstep_size + step_sizeposition) = yt(M : N) # discard M−1 y-values

position := position + step_size

'''end'''

==Efficiency==