#define BIT_SIZE 3\r
#define SIZE (1<<BIT_SIZE)\r
\r
+/* Define some parameters for this FFT algorithm. We prefix them \r
+ * with PARAM_ so we can still use variable names like 'n' :-) */\r
/* Change these: */\r
/* 2log of number of tiles */\r
-#define q 2\r
+#define PARAM_q 2\r
/** 2log of total FFT size */\r
-#define n 4\r
+#define PARAM_n 4\r
\r
/* But don't change these: */\r
/* Number of tiles */\r
-#define Q (1 << q)\r
+#define PARAM_Q (1 << PARAM_q)\r
/** Total FFT size */\r
-#define N (1 << n)\r
+#define PARAM_N (1 << PARAM_n)\r
/** FFT size on each tile */\r
-#define N_t (N / Q)\r
+#define PARAM_N_t (PARAM_N / PARAM_Q)\r
/** 2log of FFT size on each tile */\r
-#define n_t (n - q)\r
+#define PARAM_n_t (PARAM_n - PARAM_q)\r
\r
#ifndef __MONTIUMCC__\r
void pre_run();\r
/* Now, do a single stage. That means N_t / 2 cycles. Since we do 2\r
* cycles on every iteration, plus one before and after the loop,\r
* we will loop N_t / 4 - 1 times. */\r
- init_loop(LC2, (N_t / 4) - 1);\r
+ init_loop(LC2, (PARAM_N_t / 4) - 1);\r
do {\r
/* Write outputs of previous cycle */\r
write_output_regular(m, out, second_half);\r