You need to use some kind of FFT in order to benefit from the fantastic
speed increase possible with the Convolution Theorem.
Right. A*B= fourier AxB, or cepstral A+B. I know a bit about Fourier theory, real and imaginary and radix-2 etc optimisations although I have never implemented one myself (no need).
  Some form of radix optimization is exactly what I suggested to Nicolas (Chetry) with whom I wrote the amdf-based voicing_detector~ , but he's writing his PhD now and has no time for this. What I am wondering is how to turn any form of autocorrelation matrix into a radix-type algorithm, so that code such as the two examples enclosed can be optimized.

...maybe I should take another degree? if only!

Ed


->
->
-->
--->
----->
-------->
-------------> (insert quote here)


To help you stay safe and secure online, we've developed the all new Yahoo! Security Centre.