search

auroranockert / fft.js

Discrete Fourier Transform in Javascript, it is intended to be reasonably fast.
BSD 2-Clause "Simplified" License
184 stars 35 forks source link

First, most popular hit for FFT in node.js. Missing some important description of how to use. #11

Open SephReed opened 7 years ago

SephReed commented 7 years ago

var fft = new FFT.complex(n, inverse)

What is the logic when setting n and inverse? n = number of samples? inverse = 1/n?

SephReed commented 7 years ago

This similar function is as close as I've come to understanding the parameters: http://mathjs.org/docs/datatypes/complex_numbers.html

But it's complex numbers have a real and imaginary aspect, rather than an n and inverse aspect.

flarn2006 commented 4 years ago

I can't even find the fft.js file. Is there one? :thinking:

SephReed commented 4 years ago

Oh man. I don't remember, but I think it might be this: https://github.com/jensnockert/fft.js/blob/master/lib/real.js