最近項目要用到快速傅立葉變換,本身寫了個算法,測試了下,性能和精度還能夠接受算法
len,time= 1048576 378.186167ms性能
diff=-0.00000000000225974794 I0.00000000000936106748成功: 進程退出代碼 0.測試
百萬級別,變換花了378ms進程
逆變換偏差和0.000000000009im
l :=mvm.PowerOf2(20)
arr :=make([]complex128,l)
for i,_ :=range arr{
arr[i]=complex(rand.Float64(),rand.Float64())
}
now :=time.Now()
fft:= mvm.CoreFFT(arr,false)
Println("len,time=",l,time.Now().Sub(now))
// Println("arr=",arr)
// Println("fft=",fft)
reverse:=mvm.CoreFFT(fft,true)
//Println("reverse=",reverse)
var sumDiff complex128
for i,v :=range reverse{
sumDiff =sumDiff+v-arr[i]
}
Printf("diff=%.20f I%.20f",real(sumDiff),imag(sumDiff))