20 October 2003
WASPAA 2003 - New Paltz, NY
10
Overlap & Save algorithm (4):
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.
• Management problem with internal memory of the DSP.
Solution
• Uniformly-partitioned Overlap & Save algorithm.