Can anyone help?
Where I can find a C++ - or a C- procedure which calculates the
fast fourier transform and the inverse fast fourier transform
of a vector, where the length of the vector is of the form (2^n*3).
Or more general: A procedure of the form
      FFT(2^n*3^m,real_part,imaginare_part)
     |        |          |
     |        |          |->imaginare part of a vector
     |        |->real part of a vector
     |->length of the vector
anolog iFFT(2^n*3^m,real_part,imaginare_part).
Thank you for the help.
Daniel Potts    nfa505@hp1.uni-rostock.de