comparison src/window.c @ 150:9283aaf1ffb8

implemented optimised FFT via the Accelerate framework. closes #5

 
     int n;
     const double M = N - 1;
 
     for (n = 0; n < N; n++)
-        window[n] = 0.53836 - (0.46164 * cos(2.0 * PI * (double)n / M));
+        window[n] = 0.53836 - (0.46164 * cos(2.0 * M_PI * (double)n / M));
 
 }
 
 void hann(double *window, const int N)
 {
 
     int n;
     const double M = N - 1;
 
     for (n = 0; n < N; n++)
-        window[n] = 0.5 * (1.0 - cos(2.0 * PI * (double)n / M));
+        window[n] = 0.5 * (1.0 - cos(2.0 * M_PI * (double)n / M));
 
 }
 
 void bartlett(double *window, const int N)
 {

 
     for (n = 0; n < N; n++)
     {
 
         term1 = a1 * fabs(n / M - 0.5);
-        term2 = a2 * cos(2.0 * PI * (double)n / M);
+        term2 = a2 * cos(2.0 * M_PI * (double)n / M);
 
         window[n] = a0 - term1 - term2;
     }
 }
 

           term2 = 0.0;
 
     for (n = 0; n < N; n++)
     {
 
-        term1 = a1 * cos(2.0 * PI * (double)n / M);
-        term2 = a2 * cos(4.0 * PI * (double)n / M);
+        term1 = a1 * cos(2.0 * M_PI * (double)n / M);
+        term2 = a2 * cos(4.0 * M_PI * (double)n / M);
 
         window[n] = a0 - term1 + term2;
     }
 }
 

           term3 = 0.0;
 
     for (n = 0; n < N; n++)
     {
 
-        term1 = a1 * cos(2.0 * PI * n / M);
-        term2 = a2 * cos(4.0 * PI * n / M);
-        term3 = a3 * cos(6.0 * PI * n / M);
+        term1 = a1 * cos(2.0 * M_PI * n / M);
+        term2 = a2 * cos(4.0 * M_PI * n / M);
+        term3 = a3 * cos(6.0 * M_PI * n / M);
 
         window[n] = a0 - term1 + term2 - term3;
     }
 }