Fastest Filtering in the West An FFT-based algorithm for a fast 2D convolution using the overlap-add method
Download

Fastest Filtering in the West Ranking & Summary

Fastest Filtering in the West Tags

Algorithm Convolution Reverb Convolution FFT analysis FFT FFT curve morphing convolution convolution engine FFT phase analysis Sound Convolution convolution filter fft spectrum FFT-based onset detection Fast Convolution Engine matlab convolution plugin HRTF convolution Overlap Window FFT-based convolution Convolution theorem Overlap-add Method FFT algorithm 2D convolution polygon overlap overlap calculate overlap overlap calculator FFT component consistency based algorithm

Fastest Filtering in the West Description

The FFW package is an FFT-based algorithm for a fast 2D convolution using the overlap-add method. The overlap-add method is based on the fundamental technique in DSP: decompose the signal into simple components, process each of the components in some useful way, and recombine the processed components into the final signal. This is possible since the convolutional operator is linear. The FFW package works similarly to fftfilt function (Matlab Image Processing Toolbox) but in a deeper way: all possible lengths for vectors are considered and not only lengths which are powers of two. This is highly necessary since the FFTW package includes codelets optimized also for other fixed sizes. Codelets are produced automatically by the FFTW codelet generator: you can add your own codelets and re-calculate the execution times for each FFT. The FFW package can be easily used to improve speed performances of: 2D convolution (Matlab function conv2) 2D filtering (Matlab function filter2) 2D cross-correlation (Matlab function xcorr2) Normalized cross-correlation (Matlab function normxcorr2) Give Fastest Filtering in the West a try to see what it's really capable of!

Fastest Filtering in the West Related Software