package
FFT for ndarrays
npm install ndarray-fftGitHub-flavored package documentation.
Across all versions.
Download trend unavailable.
Runtime metadata.
Tagged topics.
A fast Fourier transform implementation for ndarrays. You can use this to do image processing operations on big, higher dimensional typed arrays in JavaScript.
var zeros = require("zeros")
var ops = require("ndarray-ops")
var fft = require("ndarray-fft")
var x = ops.random(zeros([256, 256]))
, y = ops.random(zeros([256, 256]))
//Forward transform x/y
fft(1, x, y)
//Invert transform
fft(-1, x, y)Via npm:
npm install ndarray-fftrequire("ndarray-fft")(dir, x, y)Executes a fast Fourier transform on the complex valued array x/y.
dir - Either +/- 1. Determines whether to use a forward or inverse FFTx the real part of the signal, encoded as an ndarrayy the imaginary part of the signal, encoded as an ndarrayx and y are transformed in place.
Note This code is fastest when the components of the shapes arrays are all powers of two. For non-power of two shapes, Bluestein's fft is used which is somewhat slower.
Note2 The inverse FFT is scaled by 1/N, forward FFT is unnormalized.
(c) 2013 Mikola Lysenko. MIT License.
Radix 2 FFT based on code by Paul Bourke.
jaspervdg
th.v.d.gronde@hccnet.nl
Estimated unpacked size across 29 packages.
2.5 MB
Includes dependencies.
5 direct dependencies.
^1.0.4
1.0.10
^1.0.15
1.1.1
^1.0.2
1.0.2
^1.2.2
1.2.2
^1.0.0
1.2.0