X-Git-Url: https://git.stderr.nl/gitweb?p=matthijs%2Fprojects%2Fmontium-fft.git;a=blobdiff_plain;f=FFT.h;h=b94386e6f4e0d82bbe6f651f9aeaafc89ca930f4;hp=0b51d26f433abb3936a67bad13dd1254b22642fc;hb=HEAD;hpb=7b57bd2ad91ccd7b8faff015adf1cbe87ddff3ea

diff --git a/FFT.h b/FFT.h
index 0b51d26..b94386e 100644
--- a/FFT.h
+++ b/FFT.h
@@ -2,16 +2,17 @@
 #ifndef FFT_H_INCLUDED
 #define FFT_H_INCLUDED
 
-#define BIT_SIZE 3
-#define SIZE (1<<BIT_SIZE)
-
 /* Define some parameters for this FFT algorithm. We prefix them 
  * with PARAM_ so we can still use variable names like 'n' :-) */
 /* Change these: */
 /* 2log of number of tiles */
 #define PARAM_q 2
 /** 2log of total FFT size */
-#define PARAM_n 4
+#define PARAM_n 12
+
+/* Note that the FFT size on each tile 2^(n-q) must be at least
+ * 8 and always a multiple of 4. The number of stages on each 
+ * tile (n-q) must also be a multiple of 2. */
 
 /* But don't change these: */
 /* Number of tiles */
@@ -74,5 +75,16 @@
 	/* Values for the cycle_odd argument */
 #define EVEN_CYCLE 0
 #define ODD_CYCLE 1
+	
+enum in_strategy {	
+	REGULAR_IN,
+	DISTRIBUTED_IN,
+};
+
+enum out_strategy {
+	REGULAR_OUT,
+	DISTRIBUTED_OUT,
+	BITREVERSED_OUT,
+};
 
 #endif // !FFT_H_INCLUDED