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