Danielson-Lanczos section of the decimation-in-frequency FFT version. More...
#include <gfftalgfreq.h>
Inheritance diagram for GFFT::InFreq< 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::InFreq< N, NFact, T, S, W1, LastK >
- Template Parameters
-
N current transform length T value type of the data array S sign of the transform: 1 - forward, -1 - backward
This template class implements resursive metaprogram, which runs funciton apply() twice recursively at the end of the function apply() with the half of the transform length N until the simplest case N=2 has been reached. Then function _spec2 is called. Therefore, it has two specializations for N=2 and N=1 (the trivial and empty case).
- See Also
- InTime
The documentation for this class was generated from the following file: