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

diff --git a/FFT.h b/FFT.h
index 0b51d26..5941e93 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 6
+
+/* 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 */