CONVNFFT Fourier transform (FT) convolution theorem for Matlab
Download

CONVNFFT Ranking & Summary

CONVNFFT Tags

Convolution Reverb Convolution morphing convolution convolution engine Fourier Pitch Fourier Fourier series analyzer Fourier series Sound Convolution Fast Fourier Transform convolution filter frame convolution discrete Fourier Fast Convolution Engine Matlab component matlab theorem prover convolution plugin HRTF convolution fourier transform FFT-based convolution Fourier transform convultion Convolution theorem Theorem 2D convolution Discrete Fourier Transform Infinite Monkey Theorem. Simulate Theorem fourier analysis Fourier transforms Fourier transformation Fourier-Bessel Transform display Fourier transform study sampling theorem simulate sampling theorem sampling theorem analyzer study Fourier series analyze Fourier spectrum study Fourier optics ft ft software matlab 6.5 matlab 7.0

CONVNFFT Description

CONVNFFT uses Fourier transform (FT) convolution theorem, i.e. FT of the convolution is equal to the product of the FTs of the input functions, opposed to Matlab CONV, CONV2, and CONVN implemented as straight forward sliding sums. In 1-D, the complexity is O((na+nb)*log(na+nb)), where na/nb are respectively the lengths of A and B. Optional arguments to control the dimension(s) along which convolution is carried out. Slightly less accurate than sliding sum convolution.

CONVNFFT Related Software