** This is part of the CTSim program
** Copyright (C) 1983-2000 Kevin Rosenberg
**
-** $Id: procsignal.h,v 1.10 2001/01/01 10:14:34 kevin Exp $
+** $Id: procsignal.h,v 1.11 2001/01/02 05:34:57 kevin Exp $
**
** This program is free software; you can redistribute it and/or modify
** it under the terms of the GNU General Public License (version 2) as
static void finiteFourierTransform (const double input[], std::complex<double> output[], const int n, const int direction);
static void finiteFourierTransform (const std::complex<double> input[], std::complex<double> output[], const int n, const int direction);
static void finiteFourierTransform (const std::complex<double> input[], double output[], const int n, const int direction);
-
-
- static void shuffleNaturalToFourierOrder (float* pdVector, const int n);\r
- static void shuffleNaturalToFourierOrder (double* pdVector, const int n);\r
- static void shuffleNaturalToFourierOrder (std::complex<double>* pdVector, const int n);\r
- static void shuffleFourierToNaturalOrder (float* pdVector, const int n);\r
- static void shuffleFourierToNaturalOrder (double* pdVector, const int n);\r
- static void shuffleFourierToNaturalOrder (std::complex<double>* pdVector, const int n);\r
\r
private: