2021-03-09 12:29:40 +00:00
|
|
|
/*
|
|
|
|
|
* Copyright (c) 2003-2004, Mark Borgerding. All rights reserved.
|
|
|
|
|
* This file is part of KISS FFT - https://github.com/mborgerding/kissfft
|
|
|
|
|
*
|
|
|
|
|
* SPDX-License-Identifier: BSD-3-Clause
|
|
|
|
|
* See COPYING file for more information.
|
|
|
|
|
*/
|
|
|
|
|
|
2012-09-09 16:57:42 +01:00
|
|
|
#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;
|
|
|
|
|
|
|
|
|
|
|
2021-03-09 12:29:40 +00:00
|
|
|
kiss_fftr_cfg KISS_FFT_API kiss_fftr_alloc(int nfft,int inverse_fft,void * mem, size_t * lenmem);
|
2012-09-09 16:57:42 +01:00
|
|
|
/*
|
|
|
|
|
nfft must be even
|
|
|
|
|
|
|
|
|
|
If you don't care to allocate space, use mem = lenmem = NULL
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
2021-03-09 12:29:40 +00:00
|
|
|
void KISS_FFT_API kiss_fftr(kiss_fftr_cfg cfg,const kiss_fft_scalar *timedata,kiss_fft_cpx *freqdata);
|
2012-09-09 16:57:42 +01:00
|
|
|
/*
|
|
|
|
|
input timedata has nfft scalar points
|
|
|
|
|
output freqdata has nfft/2+1 complex points
|
|
|
|
|
*/
|
|
|
|
|
|
2021-03-09 12:29:40 +00:00
|
|
|
void KISS_FFT_API kiss_fftri(kiss_fftr_cfg cfg,const kiss_fft_cpx *freqdata,kiss_fft_scalar *timedata);
|
2012-09-09 16:57:42 +01:00
|
|
|
/*
|
|
|
|
|
input freqdata has nfft/2+1 complex points
|
|
|
|
|
output timedata has nfft scalar points
|
|
|
|
|
*/
|
|
|
|
|
|
2021-03-09 12:29:40 +00:00
|
|
|
#define kiss_fftr_free KISS_FFT_FREE
|
2012-09-09 16:57:42 +01:00
|
|
|
|
|
|
|
|
#ifdef __cplusplus
|
|
|
|
|
}
|
|
|
|
|
#endif
|
|
|
|
|
#endif
|
