In-place decimation-in-time FFT version. More...
#include <gfftalg.h>
Inheritance diagram for GFFT::InTime< N, NFact, T, S, W1, LastK >:
Detailed Description
template<int_t N, typename NFact, typename T, int S, class W1, int_t LastK = 1>
class GFFT::InTime< N, NFact, T, S, W1, LastK >
- Template Parameters
-
N current transform length NFact factorization list T value type of the data array S sign of the transform: 1 - forward, -1 - backward W1 compile-time root of unity
This is the core of decimation in-time FFT algorithm: Strided DFT runs K times recursively, where the next factor K is taken from the compile-time list. The scaled DFT is performed afterwards.
- See Also
- InFreq, DFTk_x_Im_T
The documentation for this class was generated from the following file: