c@409: #ifndef KISS_FFT_H c@409: #define KISS_FFT_H c@409: c@409: #include c@409: #include c@409: #include c@409: #include c@409: c@409: #ifdef __cplusplus c@409: extern "C" { c@409: #endif c@409: c@409: /* c@409: ATTENTION! c@409: If you would like a : c@409: -- a utility that will handle the caching of fft objects c@409: -- real-only (no imaginary time component ) FFT c@409: -- a multi-dimensional FFT c@409: -- a command-line utility to perform ffts c@409: -- a command-line utility to perform fast-convolution filtering c@409: c@409: Then see kfc.h kiss_fftr.h kiss_fftnd.h fftutil.c kiss_fastfir.c c@409: in the tools/ directory. c@409: */ c@409: c@409: #ifdef USE_SIMD c@409: # include c@409: # define kiss_fft_scalar __m128 c@409: #define KISS_FFT_MALLOC(nbytes) _mm_malloc(nbytes,16) c@409: #define KISS_FFT_FREE _mm_free c@409: #else c@409: #define KISS_FFT_MALLOC malloc c@409: #define KISS_FFT_FREE free c@409: #endif c@409: c@409: c@409: #ifdef FIXED_POINT c@409: #include c@409: # if (FIXED_POINT == 32) c@409: # define kiss_fft_scalar int32_t c@409: # else c@409: # define kiss_fft_scalar int16_t c@409: # endif c@409: #else c@409: # ifndef kiss_fft_scalar c@409: /* default is float */ c@409: # define kiss_fft_scalar float c@409: # endif c@409: #endif c@409: c@409: typedef struct { c@409: kiss_fft_scalar r; c@409: kiss_fft_scalar i; c@409: }kiss_fft_cpx; c@409: c@409: typedef struct kiss_fft_state* kiss_fft_cfg; c@409: c@409: /* c@409: * kiss_fft_alloc c@409: * c@409: * Initialize a FFT (or IFFT) algorithm's cfg/state buffer. c@409: * c@409: * typical usage: kiss_fft_cfg mycfg=kiss_fft_alloc(1024,0,NULL,NULL); c@409: * c@409: * The return value from fft_alloc is a cfg buffer used internally c@409: * by the fft routine or NULL. c@409: * c@409: * If lenmem is NULL, then kiss_fft_alloc will allocate a cfg buffer using malloc. c@409: * The returned value should be free()d when done to avoid memory leaks. c@409: * c@409: * The state can be placed in a user supplied buffer 'mem': c@409: * If lenmem is not NULL and mem is not NULL and *lenmem is large enough, c@409: * then the function places the cfg in mem and the size used in *lenmem c@409: * and returns mem. c@409: * c@409: * If lenmem is not NULL and ( mem is NULL or *lenmem is not large enough), c@409: * then the function returns NULL and places the minimum cfg c@409: * buffer size in *lenmem. c@409: * */ c@409: c@409: kiss_fft_cfg kiss_fft_alloc(int nfft,int inverse_fft,void * mem,size_t * lenmem); c@409: c@409: /* c@409: * kiss_fft(cfg,in_out_buf) c@409: * c@409: * Perform an FFT on a complex input buffer. c@409: * for a forward FFT, c@409: * fin should be f[0] , f[1] , ... ,f[nfft-1] c@409: * fout will be F[0] , F[1] , ... ,F[nfft-1] c@409: * Note that each element is complex and can be accessed like c@409: f[k].r and f[k].i c@409: * */ c@409: void kiss_fft(kiss_fft_cfg cfg,const kiss_fft_cpx *fin,kiss_fft_cpx *fout); c@409: c@409: /* c@409: A more generic version of the above function. It reads its input from every Nth sample. c@409: * */ c@409: void kiss_fft_stride(kiss_fft_cfg cfg,const kiss_fft_cpx *fin,kiss_fft_cpx *fout,int fin_stride); c@409: c@409: /* If kiss_fft_alloc allocated a buffer, it is one contiguous c@409: buffer and can be simply free()d when no longer needed*/ c@409: #define kiss_fft_free free c@409: c@409: /* c@409: Cleans up some memory that gets managed internally. Not necessary to call, but it might clean up c@409: your compiler output to call this before you exit. c@409: */ c@409: void kiss_fft_cleanup(void); c@409: c@409: c@409: /* c@409: * Returns the smallest integer k, such that k>=n and k has only "fast" factors (2,3,5) c@409: */ c@409: int kiss_fft_next_fast_size(int n); c@409: c@409: /* for real ffts, we need an even size */ c@409: #define kiss_fftr_next_fast_size_real(n) \ c@409: (kiss_fft_next_fast_size( ((n)+1)>>1)<<1) c@409: c@409: #ifdef __cplusplus c@409: } c@409: #endif c@409: c@409: #endif