fftw 号称是最快的fft函数库
fftw_complex in[1024], out[1024];
fftw_plan p;
p=fftw_plan_dft_1d(1024,in,out,FFTW_FORWARD,FFTW_MEASURE);
for(int i=0;i <1024;i ++) {
in[i][0]=data[i];
in[i][1]=0.0;
}
fftw_execute(p);
for(int i = 1;i<=N/2;i++)
{
real = out[i][0];
imag = out[i][1];
result[i-1]=sqrt(XTRACT_SQ(real) + XTRACT_SQ(imag))/N;
result[N/2+i-1]=i*q;
max=result[i-1]>max ? result[i-1]: max;
}
fftw_destroy_plan(p)