battaglia01 / CBPSpikesortDemo-MikeB

Demo code for spike sorting by continuous basis pursuit
0 stars 0 forks source link

Speedup - Fourier domain convolution #22

Open battaglia01 opened 8 years ago

battaglia01 commented 8 years ago

Mike's note - I assume this means that they're using conv(), which I think is O(n^2), when they could be using an FFT-based convolution in O(n log n)