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