FFT アルゴリズム ブライアン・ガウ (とみながだいすけ訳 )FFT , bjg@network-theory.co.uk ( tominaga@cbrc.jp) May 1997 ( May 12, 2010) 1 (Fast Fourier Transforms, FFT) (discrete fourier transform, DFT) ha = DFT(gb) (1) = N−1 ∑ b=0 gb exp(−2πiab/N) 0 ≤ a ≤ N − 1 (2) = N−1 ∑ b=0 gbWab N WN = exp(−2πi/N) (3) DFT DFT W~ g N O(N2 ) (N) (N = f1f2 . . . fn) O(N ∑ fi) FFT GSL FFT FFT Fast Fourier Transforms: A Tutorial Review and A State of the Art Vetterli[1] Th
FFTE: A Fast Fourier Transform Package
