frost-fft
v0.2.1
Published
Fast Fourier Transform (FFT) implementation in TypeScript using the Cooley–Tukey algorithm for power-of-2 input lengths
Downloads
8
Maintainers
Readme
frost-fft
The world didn't need yet another Fast Fourier Transform (FFT) implementation, but here we are...
import {fft, ifft, ifftReal} from 'frost-fft';
const signal = new Float64Array(256).map(Math.random);
// The imaginary argument is optional, zeros assumed by default (faster).
const [realCoefs, imagCoefs] = fft(
signal,
signal.map(() => 0)
);
// There's no normalization. These are 256 times too large.
const [realSignalScaled, imagSignalScaled] = ifft(realCoefs, imagCoefs);
// The original signal reconstructed (with some floating point noise).
const realSignal = ifftReal(realCoefs, imagCoefs).map(s => s / 256);
Documentation
Documentation is hosted at the project Github pages.
To generate documentation locally run:
npm run doc