ndarray-fft
FFT for ndarrays
npm install ndarray-fft
Want to see pretty graphs? Log in now!
13 | downloads in the last week |
38 | downloads in the last month |
Last Published By | |
---|---|
Version | 0.1.0 last updated 10 months ago |
License | MIT |
Keywords | ndarray, fft, fourier, transform, convolution, bluestein, radix, 2, image, volume, filter, signal |
Repository | git://github.com/mikolalysenko/ndarray-fft.git (git) |
Bugs | https://github.com/mikolalysenko/ndarray-fft/issues |
Dependencies | bit-twiddle, ndarray, ndarray-ops, cwise, typedarray-pool |
Dependents (12) | detect-pitch, frequency-viewer, mikolalysenko-hoarders, ndarray-convolve, ndarray-downsample2x, ndarray-gaussian-filter, ndarray-translate-fft, orientation-scores, phase-align, se2-correlate, sillyscope, stft |
Starred by | substack |
ndarray-fft
A fast Fourier transform implementation for ndarrays. You can use this to do image processing operations on big, higher dimensional typed arrays in JavaScript.
Example
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)
Install
Via npm:
npm install ndarray-fft
require("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 ndarray
x
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.
Credits
(c) 2013 Mikola Lysenko. MIT License.
Radix 2 FFT based on code by Paul Bourke.