This program performs one 1-dimensional double-precision multicore complex-to-complex FFT.
- Parameters:
-
N | = FFT size |
n1 | = FFT size stage 1 |
n2 | = FFT size stage 2 |
para1 | = Twiddle, mixed radix & bluestein parameters for stage 1 |
para2 | = Twiddle, mixed radix & bluestein parameters for stage 2 |
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 |
- Algorithm:
- Algorithm can run in radix 2, 3, 4 & 5 based upon value of N.
Note:Parameters para1
& para2
are determined at runtime and will depend upon type of FFT desired, radix 3 & 5, or radix 2 & 4.
- Assumptions:
- N1 & N2 are a multiple of FFT_OMP_DP_1D_C2C_NUMOFLINEBUFS and positive values.
All input, output and working buffers are double word aligned.
No input, working or buffers overlap.
- Size Limitations:
- Current limitations are: 1024*1024 FFT size for power of 2.
- Implementation notes:
- Endian Support: The code supports little endian modes.
Interruptibility: The code is interrupt-tolerant but not interruptible.