Fast Fourier transform: Difference between revisions

Line 1,929:
{{trans|Python}}
<lang nim>import math, complex, strutils
 
proc toComplex(x: float): TComplex = result.re = x
proc toComplex(x: TComplex): TComplex = x
 
# Works with floats and complex numbers as input
proc fft[T: float | Complex[float]](x: openarray[T]): seq[TComplexComplex[float]] =
let n = x.len
if n <== 10: return
result = newSeq[TComplex]()
 
if n <= 1:
for v in x: result.add toComplexnewSeq(vn)
if n == 1:
result[0] = (when T is float: complex(x[0]) else: x[0])
return
 
var evens, odds = newSeq[T]()
for i, v in x:
Line 1,946 ⟶ 1,947:
var (even, odd) = (fft(evens), fft(odds))
 
forlet khalfn in 0 .. <= n div 2:
result.add(even[k] + exp((0.0, -2*pi*float(k)/float(n))) * odd[k])
 
for k in 0 .. < n div 2halfn:
result.add(even[k]let -a = exp(complex(0.0, -2 *pi Pi* float(k) / float(n))) * odd[k])
result[k] = even[k] + a
result[k + halfn] = even[k] - a
 
for i in fft(@[1.0, 1.0, 1.0, 1.0, 0.0, 0.0, 0.0, 0.0]):
Anonymous user