Generative Fast Fourier Transforms (GFFT)
0.3
|
In-place scaled FFT algorithm. More...
#include <gfftalg.h>
K | first factor |
M | second factor (N=K*M) |
T | value type of the data array |
S | sign of the transform: 1 - forward, -1 - backward |
W | compile-time root of unity |
doStaticLoop | rely on template instantiation loop IterateInTime (only for short loops) |
The notation for this template class follows SPIRAL. The class performs DFT(k) with the Kronecker product by the mxm identity matrix Im and twiddle factors (T).
K | first factor |
M | second factor (N=K*M) |
T | value type of the data array |
S | sign of the transform: 1 - forward, -1 - backward |
W | compile-time root of unity |
doStaticLoop | rely on template instantiation loop IterateInTime (only for short loops) |
The notation for this template class follows SPIRAL. The class performs DFT(k) with the Kronecker product by the mxm identity matrix Im and twiddle factors (T).