mirror of
https://github.com/DrBeef/ioq3quest.git
synced 2024-11-30 15:51:53 +00:00
52 lines
1 KiB
C
52 lines
1 KiB
C
|
#ifndef KISS_FTR_H
|
||
|
|
#define KISS_FTR_H
|
||
|
|
|
||
|
|
#include "kiss_fft.h"
|
||
|
|
#ifdef __cplusplus
|
||
|
|
extern "C" {
|
||
|
|
#endif
|
||
|
|
|
||
|
|
|
||
|
|
/*
|
||
|
|
|
||
|
|
Real optimized version can save about 45% cpu time vs. complex fft of a real seq.
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
*/
|
||
|
|
|
||
|
|
typedef struct kiss_fftr_state *kiss_fftr_cfg;
|
||
|
|
|
||
|
|
|
||
|
|
kiss_fftr_cfg kiss_fftr_alloc(int nfft,int inverse_fft,void * mem, size_t * lenmem);
|
||
|
|
/*
|
||
|
|
nfft must be even
|
||
|
|
|
||
|
|
If you don't care to allocate space, use mem = lenmem = NULL
|
||
|
|
*/
|
||
|
|
|
||
|
|
|
||
|
|
void kiss_fftr(kiss_fftr_cfg cfg,const kiss_fft_scalar *timedata,kiss_fft_cpx *freqdata);
|
||
|
|
/*
|
||
|
|
input timedata has nfft scalar points
|
||
|
|
output freqdata has nfft/2+1 complex points
|
||
|
|
*/
|
||
|
|
|
||
|
|
void kiss_fftr2(kiss_fftr_cfg st,const kiss_fft_scalar *timedata,kiss_fft_scalar *freqdata);
|
||
|
|
|
||
|
|
void kiss_fftri(kiss_fftr_cfg cfg,const kiss_fft_cpx *freqdata,kiss_fft_scalar *timedata);
|
||
|
|
|
||
|
|
void kiss_fftri2(kiss_fftr_cfg st,const kiss_fft_scalar *freqdata, kiss_fft_scalar *timedata);
|
||
|
|
|
||
|
|
/*
|
||
|
|
input freqdata has nfft/2+1 complex points
|
||
|
|
output timedata has nfft scalar points
|
||
|
|
*/
|
||
|
|
|
||
|
|
#define kiss_fftr_free speex_free
|
||
|
|
|
||
|
|
#ifdef __cplusplus
|
||
|
|
}
|
||
|
|
#endif
|
||
|
|
#endif
|