mirror of
https://github.com/mborgerding/kissfft.git
synced 2025-05-27 13:10:26 -04:00
'make test' output : ### testing SNR for 1024 point FFTs #### DOUBLE snr_t2f = 295.52 snr_f2t = 307.98 #### FLOAT snr_t2f = 144.62 snr_f2t = 143.23 #### SHORT snr_t2f = -31.515 snr_f2t = -60.836 #### timing 10000 x 1024 point FFTs #### DOUBLE Elapsed:0:44.17 user:35.11 sys:0.27 #### FLOAT Elapsed:0:24.22 user:19.66 sys:0.16 #### SHORT Elapsed:0:30.39 user:25.07 sys:0.09
48 lines
1011 B
Python
48 lines
1011 B
Python
#!/usr/local/bin/python2.3
|
|
import math
|
|
pi=math.pi
|
|
e=math.e
|
|
j=complex(0,1)
|
|
|
|
def fft(f):
|
|
n=len(f)
|
|
if n==1:
|
|
return f
|
|
|
|
for p in 2,3,5:
|
|
if n%p==0:
|
|
break
|
|
else:
|
|
raise Exception('%s not factorable ' % n)
|
|
|
|
print 'n=%d,p=%d' % (n,p)
|
|
print f,' << fin'
|
|
m = n/p
|
|
Fout=[]
|
|
for q in range(p): # 0,1
|
|
fp = f[q::p]
|
|
print fp,'<< fp'
|
|
Fp = fft( fp )
|
|
Fout.extend( Fp )
|
|
|
|
for u in range(m):
|
|
scratch = Fout[u::m] # u to end in strides of m
|
|
print scratch
|
|
for q1 in range(p):
|
|
k = q1*m + u # indices to Fout above that became scratch
|
|
Fout[ k ] = scratch[0] # cuz e**0==1 in loop below
|
|
for q in range(1,p):
|
|
t = e ** ( j*2*pi*k*q/n )
|
|
Fout[ k ] += scratch[q] * t
|
|
|
|
return Fout
|
|
|
|
def test(f=range(1024),ntimes=10):
|
|
import time
|
|
t0 = time.time()
|
|
for i in range(ntimes):
|
|
fft(f)
|
|
t1 = time.time()
|
|
print '%ss'% (t1-t0)
|
|
|