9 #define kiss_fftr_alloc ms_kiss_fftr_alloc
10 #define kiss_fftr ms_kiss_fftr
11 #define kiss_fftr2 ms_kiss_fftr2
12 #define kiss_fftri ms_kiss_fftri
13 #define kiss_fftri2 ms_kiss_fftri2
18 Real optimized version can save about 45% cpu time vs. complex fft of a real seq.
24 typedef struct kiss_fftr_state *kiss_fftr_cfg;
27 kiss_fftr_cfg kiss_fftr_alloc(int nfft,int inverse_fft,void * mem, size_t * lenmem);
31 If you don't care to allocate space, use mem = lenmem = NULL
35 void kiss_fftr(kiss_fftr_cfg cfg,const kiss_fft_scalar *timedata,kiss_fft_cpx *freqdata);
37 input timedata has nfft scalar points
38 output freqdata has nfft/2+1 complex points
41 void kiss_fftr2(kiss_fftr_cfg st,const kiss_fft_scalar *timedata,kiss_fft_scalar *freqdata);
43 void kiss_fftri(kiss_fftr_cfg cfg,const kiss_fft_cpx *freqdata,kiss_fft_scalar *timedata);
45 void kiss_fftri2(kiss_fftr_cfg st,const kiss_fft_scalar *freqdata, kiss_fft_scalar *timedata);
48 input freqdata has nfft/2+1 complex points
49 output timedata has nfft scalar points
52 #define kiss_fftr_free ms_free