mathmyka@cosmo.UUCP (Mathias Myka) (11/14/89)
I am currently working on a program that is able to display graphically the spectral composition of sampled sounds. I have found several implementations of the FFT algorithm (including the C sample program in archive-server@uk.ac.oxford.prg, which is absolutely unreadable for non-C-experts), and have tried some optimizations, but still there is a severe speed problem on the Atari ST which I use for this task. So what I'm looking for is an implementation of FFT, optimized for handling large arrays of 16 bit signed integer data (i.e. more than 1024 elements), and possibly written in Pascal or Modula-2. Could anybody help me with this problem ? Thanks in advance , Mathias Myka E-Mail: cosmo!mathmyka (or mathmyka@cosmo.UUCP)