Generative Fast Fourier Transforms (GFFT)  0.3
Static Public Member Functions | Static Public Attributes | List of all members
GFFT::ComputeTwiddles< T, N, S, K > Struct Template Reference

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
 

Detailed Description

template<typename T, int_t N, int S, int_t K>
struct GFFT::ComputeTwiddles< T, N, S, K >

Template Parameters
Tvalue type
Nlength of the data
Ssign 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.


The documentation for this struct was generated from the following file:

Generated on Mon Feb 10 2014 for Generative Fast Fourier Transforms (GFFT) by DoxyGen 1.8.3.1