fft
Insanely Fast Fourier Transform (radix-4)
Convolution using the FFT or standard algorithm
Simple pure Javascript implementation of the Cooley-Tukey algorithm. Note: fft-js was chosen as the name since a lot of the FFT implementations on NPM at the time this was published were wrappers for Ruby or C.
Matrix manipulation and computation library
Get the maximum value in an array
Various method to process spectra
Get the minimum value in an array
JavaScript implementation of the XORSHIFT-ADD (XSadd) pseudo random number generator
Compute the euclidean distance between two vectors
Rescale an array into a range
Generates markdown API documentation from jsdoc annotated source code
Web Assembly streaming Opus decoder with Machine Learning enhancements
Digital Signal Processing for Javascript
The Fastest Fourier Transform on the Web! 🚀🚀
Choose randomly from a selection of elements
Minimalistic and efficient FFT implementation
Find the nearest point to a sample point
Get the average value in an array
K-Means clustering
Get the average value in an array
Distance and similarity functions to compare vectors
Curve fitting method in javascript
The markuplint AST types.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.