X-Git-Url: http://git.kpe.io/?p=ctsim.git;a=blobdiff_plain;f=include%2Ffourier.h;h=f1067ddd9350029e639d24b6fe1f4d44674caad4;hp=5215a3a25928ad645869be3c2eeadba9e9b2d875;hb=1a050c98763fbbc0662731b0b76953acede6f5d7;hpb=c8b19dfaffba9f06d8b6c40cb1bb83a8964867f7 diff --git a/include/fourier.h b/include/fourier.h index 5215a3a..f1067dd 100644 --- a/include/fourier.h +++ b/include/fourier.h @@ -41,7 +41,7 @@ public: static void shuffleFourierToNaturalOrder (fftw_complex* pc, const int n); static void shuffleNaturalToFourierOrder (fftw_complex* pc, const int n); #endif - + // Odd Number of Points // Natural Frequency Order: -(n-1)/2...-1,0,1...(n-1)/2 // Fourier Frequency Order: 0, 1..(n-1)/2,-(n-1)/2...-1 @@ -49,7 +49,7 @@ public: // Natural Frequency Order: -n/2...-1,0,1...((n/2)-1) // Fourier Frequency Order: 0,1...((n/2)-1),-n/2...-1 template - static void shuffleNaturalToFourierOrder (T* pVector, const int n) + static void shuffleNaturalToFourierOrder (T* pVector, const int n) { T* pTemp = new T [n]; int i; @@ -82,7 +82,7 @@ public: int i; if (isOdd(n)) { // Odd int iHalfN = (n - 1) / 2; - + pTemp[iHalfN] = pVector[0]; for (i = 0; i < iHalfN; i++) pTemp[i + 1 + iHalfN] = pVector[i + 1]; @@ -96,7 +96,7 @@ public: for (i = 0; i < iHalfN - 1; i++) pTemp[i + iHalfN + 1] = pVector[i+1]; } - + for (i = 0; i < n; i++) pVector[i] = pTemp[i]; delete pTemp;