main.cpp

基2 fft的基本原理

#include <iostream>
//#include <cstdlib>
#include "complex.h"
#include "fft2.h"
using namespace std;

int main()
{
  cout << "Hello world!" << endl;
  //return 0;
  double real=0,imag=0;
  int N=0,i=0;

  cout<<"本程序完成了一个基2的时间抽取的FFT。"
  <<endl
  <<"请输入你所需要计算的FFT序列点数（请输入为2的整数幂的数字):"
  <<endl;
  cin>>N;

  complex *X=new complex[N];
  cout<<"请输入FFT序列"<<endl;
  for (i=0;i<N;i++)
    {
     // cin>>real>>imag;
      //X[i]=complex(real,imag);
      X[i].real=i;
      X[i].imag=0;
    }
  cout<<"输入的FFT序列为："<<endl;
  for (i=0;i<N;i++)
    {
      X[i].display();
    }
  cout<<endl;


  fft2(X,N);

  cout<<"计算后的序列为："<<endl;

  for (i=0;i<N;i++)
    {
      X[i].display();
    }
  cout<<endl;
  delete []X;
  X=NULL;



}