1 #include "libmontiumc.h"
\r
2 #ifndef FFT_H_INCLUDED
\r
3 #define FFT_H_INCLUDED
\r
6 #define SIZE (1<<BIT_SIZE)
\r
8 /* Define some parameters for this FFT algorithm. We prefix them
\r
9 * with PARAM_ so we can still use variable names like 'n' :-) */
\r
11 /* 2log of number of tiles */
\r
13 /** 2log of total FFT size */
\r
16 /* But don't change these: */
\r
17 /* Number of tiles */
\r
18 #define PARAM_Q (1 << PARAM_q)
\r
19 /** Total FFT size */
\r
20 #define PARAM_N (1 << PARAM_n)
\r
21 /** FFT size on each tile */
\r
22 #define PARAM_N_t (PARAM_N / PARAM_Q)
\r
23 /** 2log of FFT size on each tile */
\r
24 #define PARAM_n_t (PARAM_n - PARAM_q)
\r
26 #ifndef __MONTIUMCC__
\r
31 * Support structure to store the result of a butterfly.
\r
41 * Support structure to store teh inputs for a butterfly.
\r
53 * A struct to hold all the used memories. We put these in
\r
54 * a struct, so we can store them in a local variable and
\r
55 * pass them around in arguments, so we can change the memories
\r
56 * allocated to each on ever stage (MontiumC doesn't support
\r
57 * reassigning global mem variables).
\r
60 mem input_a_re, input_a_im, input_b_re, input_b_im, output_a_re, output_a_im, output_b_re, output_b_im, twiddle_re, twiddle_im;
\r
63 INLINE struct bf_out butterfly(struct bf_in in);
\r
66 /* Values for the second_half argument */
\r
67 #define FIRST_HALF 0
\r
68 #define SECOND_HALF 1
\r
70 /* Values for the stage_odd argument */
\r
71 #define EVEN_STAGE 0
\r
74 /* Values for the cycle_odd argument */
\r
75 #define EVEN_CYCLE 0
\r
78 #endif // !FFT_H_INCLUDED
\r