Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/make-github-pseudonymous-again/js-fft

:butterfly: Fast Fourier Transform algorithms for JavaScript
https://github.com/make-github-pseudonymous-again/js-fft

agpl algorithms computer-science discrete-fourrier-transform fast-fourrier-transform fft fourrier fourrier-transform ifft javascript mathematics transform

Last synced: 24 days ago
JSON representation

:butterfly: Fast Fourier Transform algorithms for JavaScript

Host: GitHub
URL: https://github.com/make-github-pseudonymous-again/js-fft
Owner: make-github-pseudonymous-again
License: agpl-3.0
Created: 2015-06-30T20:14:16.000Z (over 9 years ago)
Default Branch: main
Last Pushed: 2021-04-26T14:08:58.000Z (over 3 years ago)
Last Synced: 2024-10-11T06:45:36.788Z (25 days ago)
Topics: agpl, algorithms, computer-science, discrete-fourrier-transform, fast-fourrier-transform, fft, fourrier, fourrier-transform, ifft, javascript, mathematics, transform
Language: JavaScript
Homepage: https://aureooms.github.io/js-fft
Size: 1.28 MB
Stars: 4
Watchers: 3
Forks: 0
Open Issues: 2
Metadata Files:
- Readme: README.md
- License: LICENSE

Awesome Lists containing this project

README

        :butterfly: [@aureooms/js-fft](https://make-github-pseudonymous-again.github.io/js-fft)

==







Fast Fourier Transform algorithm for JavaScript.

See [docs](https://make-github-pseudonymous-again.github.io/js-fft).

Parent is [@aureooms/js-algorithms](https://github.com/make-github-pseudonymous-again/js-algorithms).

```js

fft( l , m , _u , 0 , n , u , 0 , n ) ;  // O(n log n)

fft( l , m , _v , 0 , n , v , 0 , n ) ;  // O(n log n)

convolution( u , 0 , n , v , 0 , n ) ;   // O(n)

ifft( l , m , u , 0 , n , _u , 0 , n ) ; // O(n log n)

```

[![License](https://img.shields.io/github/license/make-github-pseudonymous-again/js-fft.svg)](https://raw.githubusercontent.com/make-github-pseudonymous-again/js-fft/main/LICENSE)

[![Version](https://img.shields.io/npm/v/@aureooms/js-fft.svg)](https://www.npmjs.org/package/@aureooms/js-fft)

[![Build](https://img.shields.io/travis/make-github-pseudonymous-again/js-fft/main.svg)](https://travis-ci.org/make-github-pseudonymous-again/js-fft/branches)

[![Dependencies](https://img.shields.io/david/make-github-pseudonymous-again/js-fft.svg)](https://david-dm.org/make-github-pseudonymous-again/js-fft)

[![Dev dependencies](https://img.shields.io/david/dev/make-github-pseudonymous-again/js-fft.svg)](https://david-dm.org/make-github-pseudonymous-again/js-fft?type=dev)

[![GitHub issues](https://img.shields.io/github/issues/make-github-pseudonymous-again/js-fft.svg)](https://github.com/make-github-pseudonymous-again/js-fft/issues)

[![Downloads](https://img.shields.io/npm/dm/@aureooms/js-fft.svg)](https://www.npmjs.org/package/@aureooms/js-fft)

[![Code issues](https://img.shields.io/codeclimate/issues/make-github-pseudonymous-again/js-fft.svg)](https://codeclimate.com/github/make-github-pseudonymous-again/js-fft/issues)

[![Code maintainability](https://img.shields.io/codeclimate/maintainability/make-github-pseudonymous-again/js-fft.svg)](https://codeclimate.com/github/make-github-pseudonymous-again/js-fft/trends/churn)

[![Code coverage (cov)](https://img.shields.io/codecov/c/gh/make-github-pseudonymous-again/js-fft/main.svg)](https://codecov.io/gh/make-github-pseudonymous-again/js-fft)

[![Code technical debt](https://img.shields.io/codeclimate/tech-debt/make-github-pseudonymous-again/js-fft.svg)](https://codeclimate.com/github/make-github-pseudonymous-again/js-fft/trends/technical_debt)

[![Documentation](https://make-github-pseudonymous-again.github.io/js-fft/badge.svg)](https://make-github-pseudonymous-again.github.io/js-fft/source.html)

[![Package size](https://img.shields.io/bundlephobia/minzip/@aureooms/js-fft)](https://bundlephobia.com/result?p=@aureooms/js-fft)

## :dancing_women: Related

  - [@aureooms/js-fft-integer](https://github.com/make-github-pseudonymous-again/js-fft-integer)

  

## :scroll: References

  - [Some python code with good comments](https://github.com/aureooms-research/fft/blob/main/code/polynomials.py#L4)