![]() |
![]() |
fft_plan_t | ifft_sp_plan_1d_c2c (int N, int mode, fft_callout_t fxns) |
int | ifft_sp_1d_c2c_direct (fft_param_u u, void *edmaState) |
int | ifft_sp_1d_c2c_ecpy (fft_param_u u, void *edmaState) |
int | ifft_sp_1d_c2c_4step_ecpy (fft_param_u u, void *edmaState) |
#define | IFFT_SP_1D_C2C_4STEP_MIN_SIZE ( 4*1024) |
#define | IFFT_SP_1D_C2C_4STEP_MAX_SIZE (4*1024*1024) |
#define | IFFT_SP_1D_C2C_NUMOFLINEBUFS 2 |
1
#define IFFT_SP_1D_C2C_4STEP_MIN_SIZE ( 4*1024) |
Definition at line 51 of file ifft_sp_1d_c2c.h.
#define IFFT_SP_1D_C2C_4STEP_MAX_SIZE (4*1024*1024) |
Definition at line 52 of file ifft_sp_1d_c2c.h.
#define IFFT_SP_1D_C2C_NUMOFLINEBUFS 2 |
IFFT_SP_1D_C2C_NUMOFLINEBUFS | = number of cache lines to process each iteration |
Definition at line 58 of file ifft_sp_1d_c2c.h.
fft_plan_t ifft_sp_plan_1d_c2c | ( | int | N, |
int | mode, | ||
fft_callout_t | fxns | ||
) |
N | = IFFT size dimension 1 |
mode | = FFT_DIRECT & FFT_ECPY are supported for 1d IFFT |
int ifft_sp_1d_c2c_direct | ( | fft_param_u | u, |
void * | edmaState | ||
) |
This program performs one 1-dimensional single-precision complex-to-complex IFFT.
N | = IFFT size |
M | = Power of 2 IFFT size, if Bluestein algorithm is used |
twsize | = Twiddle buffer size in bytes |
N_p2 | = Power of 2 IFFT size in Mixed-radix IFFT |
s_r3 | = Number of stages of radix-3 |
s_r5 | = Number of states of radix-5 |
in | = input pointer |
out | = output pointer |
tw | = twiddle pointer |
Bn | = Bluestein pointer |
workbuf | = Bluestein scratch pointer |
int ifft_sp_1d_c2c_ecpy | ( | fft_param_u | u, |
void * | edmaState | ||
) |
This program performs one 1-dimensional single-precision complex-to-complex IFFT.
N | = IFFT size |
M | = Power of 2 IFFT size, if Bluestein algorithm is used |
twsize | = Twiddle buffer size in bytes |
N_p2 | = Power of 2 IFFT size in Mixed-radix IFFT |
s_r3 | = Number of stages of radix-3 |
s_r5 | = Number of states of radix-5 |
data | = input pointer |
work | = output pointer |
data_w | = input/output buffer pointer |
work_w | = working buffer pointer |
tw | = twiddle pointer |
tw_w | = twiddle buffer pointer |
Bn | = Bluestein pointer |
Bn_w | = Bluestein buffer pointer |
workbuf | = Bluestein scratch pointer |
int ifft_sp_1d_c2c_4step_ecpy | ( | fft_param_u | u, |
void * | edmaState | ||
) |
This program performs one 1-dimensional single-precision complex-to-complex IFFT.
n1 | = IFFT size stage 1 |
n2 | = IFFT size stage 2 |
twsize | = Twiddle buffer size in bytes |
N_p2 | = stage 1 Power of 2 IFFT size in Mixed-radix IFFT |
s_r3 | = stage 1 Number of stages of radix-3 |
s_r5 | = stage 1 Number of states of radix-5 |
twsize1 | = Twiddle buffer size for 1st stage of mixed-radix |
N_p21 | = stage 2 Power of 2 IFFT size in Mixed-radix IFFT |
s_r31 | = stage 2 Number of stages of radix-3 |
s_r51 | = stage 2 Number of states of radix-5 |
data | = input pointer |
work | = output pointer |
data_w | = input/output buffer pointer |
work_w | = working buffer pointer |
work_t | = Cache line buffer pointer |
tw | = twiddle pointer |
tw_w | = twiddle buffer pointer |