Questions tagged [overlap-save]

Efficient way to evaluate the discrete convolution of a very long signal with a finite impulse response (FIR) filter. The concept is to divide the problem into multiple convolutions of the impulse response of FIR filter with short segments of the very long signal.

Filter by
Sorted by
Tagged with
1 vote
1 answer
307 views

Overlap and Add/Save Inverse Short-Time Fourier transform

Edited for conciseness, please see below: Question: How does overlap and save work, in the context of array buffers? How does overlap and add work? For a specific use case involving STFT, which one is ...
HFGCS's user avatar
  • 27
0 votes
1 answer
122 views

Matching outputs of FIR filters based on time domain convolution method and overlap-save method

I'm trying to match(to the best extent possible) the outputs of FIR filter based on Frequency domain overlap-save method and time domain convolution method resp. I was able to get most of the output ...
Naveen's user avatar
  • 418
1 vote
3 answers
895 views

Are there any reasons to use overlap algorithm when one could do ifft(X * Y) from the complete signal as well in similiar time complexity

We learned that overlap add and overlap save are used as fast convolution methods, because they can be applied with fft due to the formula $x[n] * y[n] = \text{IFFT}(X[k] Y[k])$ So now I was wondering ...
OuttaSpaceTime's user avatar
0 votes
0 answers
68 views

non-causal cascade filtering process in frequency domain

if i have linear filter that operate in frequency domain filter length is L (Overlap and save method) if there is no computational time, i get L input signal and fft and multiply filter and ifft the ...
gg h's user avatar
  • 101
2 votes
1 answer
244 views

overlap save method zero padding fft gibb's phenomenon

i'm doing overlap save method in frequency domain. i make hankel function to digital filter using frequency sampling method(to make arbitrary magnitude phase filter). and i do ifft and zero padding ...
gg h's user avatar
  • 101
2 votes
3 answers
2k views

Intuitive understanding of how 'overlap save' works in contrast to 'overlap add'

I am having a hard time to grasp how overlap save is exactly working in contrast to overlap add. The starting of both procedure seem pretty similar. Both algorithms are trimming the input series $x[k]$...
OuttaSpaceTime's user avatar
2 votes
1 answer
66 views

cascade and summation process in frequency domain using overlap and save method

hello i'm doing signal processing like this S : FFT of input signal from microphone Exp : just gain 1/(Q*J) : include frequency component, I convert this equation to frequency domain digital filter ...
gg h's user avatar
  • 101
0 votes
0 answers
84 views

overlap and save method) relation zero padding with double size FIR filter coefficient

i'm doing overlap and save method at frequency domain to do this, i added one block back and forth at filter and signal respectly The problem is my filter is bessel function and that is look like this ...
gg h's user avatar
  • 101
0 votes
1 answer
291 views

Fast overlap save method [closed]

If x[n]= (some values), h[n]=(some values). Now suppose length of h[n] is a multiple of two....
uchiha itachi's user avatar
6 votes
1 answer
1k views

Strategy / Method for Implementation of the Fastest 1D Linear Convolution / Correlation

I am after the method and its implementation of the fastest convolution of 1d signals: $$ y \left[ n \right] = \left( x \ast h \right) \left[ n \right] $$ Where $ \ast $ is the linear convolution ...
Shkodrani's user avatar
0 votes
2 answers
116 views

How to detect a long signal inside an even longer one?

I'm trying to detect a long pattern inside a long recorded audio. In order to do so I am implementing a matched filter in time by performing a FIR filtering using the coefficients of my pattern ...
VMMF's user avatar
  • 1,110