npm package discovery and stats viewer.

Discover Tips

  • General search

    [free text search, go nuts!]

  • Package details

    pkg:[package-name]

  • User packages

    @[username]

Sponsor

Optimize Toolset

I’ve always been into building performant and accessible sites, but lately I’ve been taking it extremely seriously. So much so that I’ve been building a tool to help me optimize and monitor the sites that I build to make sure that I’m making an attempt to offer the best experience to those who visit them. If you’re into performant, accessible and SEO friendly sites, you might like it too! You can check it out at Optimize Toolset.

About

Hi, 👋, I’m Ryan Hefner  and I built this site for me, and you! The goal of this site was to provide an easy way for me to check the stats on my npm packages, both for prioritizing issues and updates, and to give me a little kick in the pants to keep up on stuff.

As I was building it, I realized that I was actually using the tool to build the tool, and figured I might as well put this out there and hopefully others will find it to be a fast and useful way to search and browse npm packages as I have.

If you’re interested in other things I’m working on, follow me on Twitter or check out the open source projects I’ve been publishing on GitHub.

I am also working on a Twitter bot for this site to tweet the most popular, newest, random packages from npm. Please follow that account now and it will start sending out packages soon–ish.

Open Software & Tools

This site wouldn’t be possible without the immense generosity and tireless efforts from the people who make contributions to the world and share their work via open source initiatives. Thank you 🙏

© 2024 – Pkg Stats / Ryan Hefner

dsp-dft

v0.0.1

Published

Discrete Fourier Transform

Downloads

5

Readme

dft

Discrete Fourier Transformation

npm install dsp-dft

This module have functions to compute DFT using the correlation algorithm (the simplest and easy to understand, also the slowest)

Various methods are used to obtain DFT for time domain samples including use of Simultaneous Equations using Gaussian elimination, correlation, and using the Fast Fourier Transform algorithm. The first option requires massive work even for a comparitively small number of samples. In actual practice, correlation is the preferred method if the DFT has less than about 32 points.

The functions of this module are not intended to be used in production. It has two objectives:

  • Educational: learn how to implement the DFT correlation algorithm
  • Test: test more complex algorithms against this to check results

This is part of dsp-kit

Example

var dft = require('dsp-dft')
dft.forward(signal)

dft~dft(src, dest, inverse) ⇒ Object

Perform a DFT using a brute force correlation algorithm

It accepts real and complex signals of any size.

It implements the mathematical function as it, without any kind of optimization, so it's the slowest algorithm possible.

This algorithm is not intended to be used in production. It's main use (apart from the educational purposes) is to check the output of more complex algorithms

Kind: inner method of dft
Returns: Object - the resulted dft as an object { real, imag }

| Param | Type | Description | | --- | --- | --- | | src | Object | The source source buffers. The imaginary part can be null. | | dest | Object | The destation bufers. The imaginary part can be null. | | inverse | Boolean | Perform inverse DFT |

dft~forward(signal) ⇒ Object

A interface to perform forward DFT on a real signal

Kind: inner method of dft
Returns: Object - the complex signal (an objects with the form: { real: Array<Number>, im: Array<Number> })

| Param | Type | Description | | --- | --- | --- | | signal | Array | The (real) signal array |

dft~inverse(signal) ⇒ Array

An interface to perform an inverse DFT on a complex signal with a real signal as result

Kind: inner method of dft
Returns: Array - the resulting real signal

| Param | Type | Description | | --- | --- | --- | | signal | Object | The complex signal as an object with two arrays |