npm package discovery and stats viewer.

Discover Tips

  • General search

    [free text search, go nuts!]

  • Package details

    pkg:[package-name]

  • User packages

    @[username]

Sponsor

Optimize Toolset

I’ve always been into building performant and accessible sites, but lately I’ve been taking it extremely seriously. So much so that I’ve been building a tool to help me optimize and monitor the sites that I build to make sure that I’m making an attempt to offer the best experience to those who visit them. If you’re into performant, accessible and SEO friendly sites, you might like it too! You can check it out at Optimize Toolset.

About

Hi, 👋, I’m Ryan Hefner  and I built this site for me, and you! The goal of this site was to provide an easy way for me to check the stats on my npm packages, both for prioritizing issues and updates, and to give me a little kick in the pants to keep up on stuff.

As I was building it, I realized that I was actually using the tool to build the tool, and figured I might as well put this out there and hopefully others will find it to be a fast and useful way to search and browse npm packages as I have.

If you’re interested in other things I’m working on, follow me on Twitter or check out the open source projects I’ve been publishing on GitHub.

I am also working on a Twitter bot for this site to tweet the most popular, newest, random packages from npm. Please follow that account now and it will start sending out packages soon–ish.

Open Software & Tools

This site wouldn’t be possible without the immense generosity and tireless efforts from the people who make contributions to the world and share their work via open source initiatives. Thank you 🙏

© 2026 – Pkg Stats / Ryan Hefner

fft-napi

v1.1.0

Published

Fast Fourier Transform for Float32Array using a native Node-API addon

Readme

fft-napi

Native FFT/IFFT for Node.js using Node-API (N-API).

Install

npm install

Usage

var fft = require('fft-napi').fft;
var ifft = require('fft-napi').ifft;

// Input is 1+0i 2+0i 3+0i 4+0i
var input = new Float32Array([1, 0, 2, 0, 3, 0, 4, 0]);
var spectrum = new Float32Array(input.length);
var restored = new Float32Array(input.length);

fft(input, spectrum, function (err, result) {
  if (err) throw err;
  // result === spectrum

  ifft(spectrum, restored, function (err2, restoredResult) {
    if (err2) throw err2;
    // restoredResult === restored
  });
});

API

fft(input, output, callback)

Forward complex FFT.

ifft(input, output, callback)

Inverse complex FFT (normalized by 1/N).

ifft applies the inverse transform and scales by 1/N internally, so if your input to ifft came from fft, then ifft(fft(x)) reconstructs x (within floating-point tolerance).

Example:

var fft = require('fft-napi').fft;
var ifft = require('fft-napi').ifft;

var time = new Float32Array([1, 0, 2, 0, 3, 0, 4, 0]);
var freq = new Float32Array(time.length);
var restored = new Float32Array(time.length);

fft(time, freq, function (err) {
  if (err) throw err;

  ifft(freq, restored, function (err2, out) {
    if (err2) throw err2;
    // out === restored
    // restored is approximately equal to time
  });
});

For both functions:

  • input: Float32Array containing interleaved complex values [re0, im0, re1, im1, ...]
  • output: Float32Array to receive output values in the same layout
  • callback: (err, result) called asynchronously when done

Rules:

  • input and output must be Float32Array
  • input.length === output.length
  • length must be even (pairs of real/imaginary values)
  • number of complex samples (length / 2) must be a power of two

Test

npm test