Friday, 22 July 2005
A.Farina,
L.Tronchin
52/86
Overlap &
Save algorithm:
Industrial
Engineering Dept.
University
of Parma – Italy
FFT
N-point
FFT
N-point
x
IFFT
Xm(k)H(k)
Select
last
N – Q +
1
samples
Append to y(n)
xm(n)
h(n)
Overlap & Save convolution process:
Problems
• Latency between
Input and Output data is too high.
• Requires to allocate
very large memory buffers.
Solution
• Uniformly-partitioned
Overlap & Save algorithm.