MyDFT.h
#pragma once
#include <complex>
#include <vector>
using namespace std;
//Copyright (c) 2020 FuZhixiang
#define PI 3.141592653589793
class DFT
{
public:
static void dft(std::vector<std::complex<double> >& vec, bool inverse);
private:
static std::vector<std::complex<double>> temp_vec;
};
std::vector<std::complex<double>> DFT::temp_vec;
void DFT::dft(std::vector<std::complex<double>>& vec, bool inverse)//反变换时inverse为1,正变换为0
{
int N = vec.size();
temp_vec.assign(vec.begin(), vec.end());//temp_vec为vec的拷贝
complex<double> temp;
for (int m = 0; m < N; ++m)
{
temp = 0;
for (int n = 0; n < N; ++n)
{
temp += temp_vec[n] * polar(1.0,(inverse ? 1:-1)*2*PI*n*m/N);//由欧拉公式可得
}
vec[m] = (inverse ? temp / (double)N : temp);
}
}
main.cpp
#include <iostream>
#include "MyDFT.h"
using namespace std;
//Copyright (c) 2020 FuZhixiang
int main()
{
std::vector<complex<double>> arr{2,0,1,8,1,0,0,3,6,7,0,};
std::vector<complex<double>> arr_backup(arr);
cout << "原数列:";
for (int i = 0; i < arr.size(); ++i)
{
cout << arr[i].real() << " ";
}
cout << endl;
//先正变换过去
DFT::dft(arr,0);
//再反变换回来
DFT::dft(arr,1);
//看能不能变得回来
cout << "反变换结果实部与原数列之差:"<<endl;
for (int i = 0; i < arr.size(); ++i)
{
cout<<arr[i].real()-arr_backup[i].real()<<endl;
}
cout <<endl<< "差很小说明精度很高"<<endl;
return 0;
}