Questions tagged [fast-convolution]

Fast convolution is using the FFT, multiplication in the frequency domain, and inverse FFT to perform convolution of a long signal with a long FIR.

Filter by
Sorted by
Tagged with
26
votes
2answers
17k views

Overlap-Add versus Overlap-Save

What differences or other criteria can be used to help decide between using overlap-add and overlap-save for filtering? Both overlap-add and overlap-save are described as algorithms for doing FFT ...
3
votes
2answers
280 views

Understanding DFT-ODD operation in Gardner Efficient Convolution paper

As a newbie to DSP I am trying to understand and implement an efficient convolution engine as per JAES V43.3 1995/03 - Gardner - Efficient Convolution without I/O Delay. I'm pretty much there with a ...
1
vote
0answers
37 views

Multiple 1D gaussian filter

Given $$ \begin{cases} &f_0(x)=1 \\ &f_{n+1}(x)= (\varphi*(f\mathbb{I}_{[a_n,b_n]}))(x)=\int_{-\infty}^{+\infty}\varphi(x-t)f_n(t)\mathbb{I}_{[a_n,b_n]}(t)dt = \int_{a_n}^{b_n}\varphi(x-t)f_n(...
6
votes
1answer
4k views

Implementing Convolution in Frequency Domain?

Suppose, we have a bitmap image represented as a 2D integer array, int [,] image2D; whose FFT is Complex[,] fftImage2D; ...
2
votes
3answers
1k views

Other techniques like overlap save/overlap add

I know overlap save and overlap add are used for long data sequence filtering. Are there any other similar or better techniques like these?