FFTW函数库

http://blog.chinaunix.net/uid-20559667-id-1925736.html

#include<fftw3.h>
#include<stdio.h>
#define N 8
int main()
{
int i;

fftw_complex *in,*out;
fftw_plan p;
in = (fftw_complex*) fftw_malloc(sizeof(fftw_complex) * N);
out = (fftw_complex*) fftw_malloc(sizeof(fftw_complex) * N);

if((in==NULL)||(out==NULL))
{
printf("Error:insufficient available memory\n");
}
else
{

for(i=0; i<N; i++)/*测试数据 */
{
in[i][0] = i+1;
in[i][1] = 0;
}
}

p = fftw_plan_dft_1d(N, in, out, FFTW_FORWARD,FFTW_ESTIMATE);

fftw_execute(p); /* repeat as needed */
fftw_destroy_plan(p);
fftw_cleanup();
for(i=0;i<N;i++)/*OUTPUT*/
{
printf("%f,%fi\n",in[i][0],in[i][1]);
}
printf("\n");
for(i=0;i<N;i++)/*OUTPUT*/
{
printf("%f,%fi\n",out[i][0],out[i][1]);
    }

         if(in!=NULL) fftw_free(in);
         if(out!=NULL) fftw_free(out);
         retur