WG: [PD] fft algorithms

[Thomas Grill]

Hi all,
i'd like to join in as i'm in the need of an FFT algorithm with the
following properties:
- in-place (or with a small workspace)
- separated vectors for real and imaginary data, with stride factors
- preferably also mixed-radix (for non-power-2 transforms)

Alternatively, as FFTW exists (but doesn't fulfill the 2nd requirement):
- is there an algorithm that transforms a vector of complex points into
separated real and imaginary vectors in place?

many thanks
Thomas

> -----Ursprüngliche Nachricht-----
> Von: Orm Finnendahl [mailto:finnendahl at folkwang-hochschule.de]
> Gesendet: Mittwoch, 10. April 2002 10:53
> An: pd-list at iem.kug.ac.at
> Betreff: [PD] fft algorithms
>
>
> Hi Miller,
>
> I was looking around for fft algorithms I might want to use in a
> project and found many different applications with different
> benchmarks. Looking into the sources I found that pd seems to use a
> method implementing a network-like approach from Kevin Peterson from
> '86. As I didn't find that method on any of the benchmark pages could
> you comment on the effectivity? On the mentioned pages it seems there
> have been made some achievements regarding algorithms and speed in the
> 90's. But that could be wrong in pd's case, or, if there are faster
> algorithms, a reason for your selection of the algorithm could be
> related to the overall architecture of pd.
>
> I'm just asking because my project will probably contain some heavy
> fft processing and I'm trying to find out whether it's necessary to
> implement other fft routines than the existing ones to minimize
> cpu-load.
>
> Yours,
> Orm
>
>
>
>