did the fourier transform 'myself':
N=441; % length of sample
numBins=20;
F_min = 20;
F_max = 20000;
f_frac = logspace( log10(F_min/Fs), log10(F_max/Fs), numBins);
W = exp(-1j * (0:N*2-1)' * 2 * pi * f_frac );
logbinned = sample * W
And this seems to go fine! I end up with a numBins long vector with the magnitudes of the frequency bins. (I think?!) It looks a bit different when plotted to semilogx(abs(fft(sample))) but I guess that's just because they can end up being computed different. Speed is good enough for me at the moment.
Does anyone see any problems with this?
