Minimalistic and efficient FFT implementation
JavaScript
Pull request Compare This branch is even with scijs:master.
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
.gitignore
benchmark.js
benchmark.md
index.js
package.json
process.md
readme.md
test.js

readme.md

fourier-transform stable

Minimalistic and efficient FFT implementation for 2n-size inputs.

npm install fourier-transform

var ft = require('fourier-transform');
var db = require('decibels');

var frequency = 440;
var size = 1024;
var sampleRate = 44100;
var waveform = new Float32Array(size);
for (var i = 0; i < size; i++) {
    waveform[i] = Math.sin(frequency * Math.PI * 2 * (i / sampleRate));
}

//get normalized magnitudes for frequencies from 0 to 22050 with interval 44100/1024 ≈ 43Hz
var spectrum = ft(waveform);

//convert to decibels
var decibels = spectrum.map((value) => db.fromGain(value))

Thanks

To all the existing fft packages, without them this one would not be possible. Special thanks to @corbanbrook for the most efficient implementation in dsp.js. This package is based on dsp.js RFFT, which is based on RealFFT.

Contribute

If you find it slow, difficult or broken, please post an issue. If you have ideas or know-hows for better implementation - PR’s are welcome.

Related