newfct.h

普林斯顿开发的快速球面调和变换算法

// newFCT.h: interface for the newFCT class.
//
//////////////////////////////////////////////////////////////////////

#if !defined(AFX_NEWFCT_H__E39B87E7_2A9B_4702_A49F_BBC751E9F955__INCLUDED_)
#define AFX_NEWFCT_H__E39B87E7_2A9B_4702_A49F_BBC751E9F955__INCLUDED_

#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000

#include <math.h>
#include <string.h>
#include <malloc.h>
#include "FFT.h"



struct lowhigh{
  double low;
  double high;
} ;


class newFCT  
{
public:
		FFT fft1;
	static const int* get_perm(int n);
	static const double* get_mods(int n);

	void ExpIFCT( double *data, double *result,double *workspace,int n,int k, int permflag);
	static void ChebyDivRem(double *dividend,double m0,double *remres,int n);
	static void ChebyDivRemOrig(double *dividend,double m0,double *remres, int n);
	void kFCTX( double *data, double *result, double *workspace, int n, int k, int permflag, struct lowhigh *lowpoly, struct lowhigh *highpoly);
	void kFCT(double *data, double *result,double *workspace,int n, int k,int permflag);
	void DCTb( double *array , int n, double *CoswSave );
	void DCTf ( double *array,int n, int p, double *CoswSave);
	double* precomp_dct( int size );
	static void PartitionAddX(struct lowhigh *data,  double *result,int n, int k);
	static void PartitionAdd(double *data, double *result,int n,int k);
	static void OURpermuteX(double *data,struct lowhigh *result, int n);
	static void OURpermute(double *data,double *result,int n);
	static void reverse_it(double *input,double *output,int n);
	newFCT();
	virtual ~newFCT();
	

};

#endif // !defined(AFX_NEWFCT_H__E39B87E7_2A9B_4702_A49F_BBC751E9F955__INCLUDED_)