|
LMMS
|
#include <fft.h>
Public Types | |
| typedef std::complex< T > | complex |
Public Member Functions | |
| fft () | |
| void | calculate (complex *input, complex *output, bool inverse) const |
| template<class InType> | |
| void | calculateN (InType *input, complex *output, bool inverse, int order) const |
| void | execute_r2r (int order, float *input, float *output, complex *tmp, bool inverse=false) const |
Private Attributes | |
| int | scramble [1<< O] |
| complex | sines [1<< O] |
FFT routine copied from my old OneSignal library, modified to match Calf's style. It's not fast at all, just a straightforward implementation.
| typedef std::complex<T> dsp::fft< T, O >::complex |
|
inline |
|
inline |
|
inline |