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