Generative Fast Fourier Transforms (GFFT)
0.3
|
Twiddle factors computation. More...
#include <gfftspec.h>
Static Public Member Functions | |
static void | apply (T *c, T *s) |
Static Public Attributes | |
static const int_t | K2 = K*2 |
T | value type |
N | length of the data |
S | sign of the transform (-1 for inverse) |
Computes twiddle factors, e.g. cos(2*pi/N),...,cos(2*K*pi/N) and sin(2*pi/N),...,sin(2*K*pi/N). It is used for prime factors greater than 3.