On Sun, 26 Aug 2007, Andrew Coppin wrote:
The only thing I'm uncertain about is whether it would have good
enough time and space performance. All the real work is writing yet
another set of basic envelope, oscillator, and fft primitives. You
*should* be able to go all the way down to the samples in pure haskell
though, which would be more elegant than those other languages :)
Heh. FFT is tricky. But I got it to work one time... ;-)
There's already an extensive FFT implementation in Haskell by Matt
Donadio:
http://haskelldsp.sourceforge.net/
(I'm working on some clean up at
http://darcs.haskell.org/dsp/Numeric/Transform/Fourier/ )
_______________________________________________
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
