From: Bruno Luong on 16 Jun 2010 16:44 Gideon <gideon.simpson(a)gmail.com> wrote in message <d247b78c-aaf4-4f30-8b2d-796d1efa5d3a(a)h13g2000yqm.googlegroups.com>... > > This will be an O(N^2) computation, won't it? If you use FFT-based convolution, it will be O(N*log(N)), but no need to worry about the complexity if the size of the data is not too large. One of such convolution on FEX is here: http://www.mathworks.com/matlabcentral/fileexchange/24504-fft-based-convolution Bruno
First
|
Prev
|
Pages: 1 2 3 Prev: MATLAB FFT and IFFT Next: How to color specific markers with different color? |