#ifndef FFT_H_INCLUDED\r
#define FFT_H_INCLUDED\r
\r
-#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 PARAM_q 2\r
/** 2log of total FFT size */\r
-#define PARAM_n 4\r
+#define PARAM_n 6\r
+\r
+/* Note that the FFT size on each tile 2^(n-q) must be at least\r
+ * 8 and always a multiple of 4. The number of stages on each \r
+ * tile (n-q) must also be a multiple of 2. */\r
\r
/* But don't change these: */\r
/* Number of tiles */\r