https://github.com/mikolalysenko/ndfft

n-dimensional FFT codes for JavaScript
https://github.com/mikolalysenko/ndfft

Last synced: about 2 months ago
JSON representation

n-dimensional FFT codes for JavaScript

• Host: GitHub
• URL: https://github.com/mikolalysenko/ndfft
• Owner: mikolalysenko
• Created: 2013-02-13T16:07:42.000Z (almost 12 years ago)
• Default Branch: master
• Last Pushed: 2013-02-13T22:42:08.000Z (almost 12 years ago)
• Last Synced: 2024-10-21T05:10:34.448Z (2 months ago)
• Language: JavaScript
• Size: 113 KB
• Stars: 7
• Watchers: 5
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
ndfft

=====

Complex n-dimensional radix-2 FFT codes for JavaScript.  Derived from [Paul Bourke's C FFT codes](http://paulbourke.net/miscellaneous/dft/).  This routine is not particularly optimized, but it should get the job done.

Usage/Install

=============

To install:

    npm install ndfft

    

And to use it

    var ndfft = require("ndfft");

    

    var re = [[1, 0], [0, 0]];

    var im = [[0, 0], [0, 0]];

    

    //Forward transform

    ndfft(1, re, im);

    //Inverse transform

    ndfft(-1, re, im);

`require("ndfft")(direction, real, imag)`

-----------------------------------------

Executes an n-place n-dimensional Fast Fourier transform.

* `direction`: a number set to +/- 1, representing the direction of the fft.

* `real`: The real part of the array.  Each dimension must be a power of two.

* `imag`: The imaginary part of the array.  Must have same dimensions as x

The fourier transform is computed in place.  No value is returned from this method.

Credits

=======

(c) 1993 Paul Bourke.  Public domain

JavaScript port by Mikola Lysenko (c) 2013.