c@174: #ifndef KISS_FTR_H
c@174: #define KISS_FTR_H
c@174: 
c@174: #include "kiss_fft.h"
c@174: #ifdef __cplusplus
c@174: extern "C" {
c@174: #endif
c@174: 
c@174:     
c@174: /* 
c@174:  
c@174:  Real optimized version can save about 45% cpu time vs. complex fft of a real seq.
c@174: 
c@174:  
c@174:  
c@174:  */
c@174: 
c@174: typedef struct kiss_fftr_state *kiss_fftr_cfg;
c@174: 
c@174: 
c@174: kiss_fftr_cfg kiss_fftr_alloc(int nfft,int inverse_fft,void * mem, size_t * lenmem);
c@174: /*
c@174:  nfft must be even
c@174: 
c@174:  If you don't care to allocate space, use mem = lenmem = NULL 
c@174: */
c@174: 
c@174: 
c@174: void kiss_fftr(kiss_fftr_cfg cfg,const kiss_fft_scalar *timedata,kiss_fft_cpx *freqdata);
c@174: /*
c@174:  input timedata has nfft scalar points
c@174:  output freqdata has nfft/2+1 complex points
c@174: */
c@174: 
c@174: void kiss_fftri(kiss_fftr_cfg cfg,const kiss_fft_cpx *freqdata,kiss_fft_scalar *timedata);
c@174: /*
c@174:  input freqdata has  nfft/2+1 complex points
c@174:  output timedata has nfft scalar points
c@174: */
c@174: 
c@174: #define kiss_fftr_free free
c@174: 
c@174: #ifdef __cplusplus
c@174: }
c@174: #endif
c@174: #endif