warricksothr
/
dft
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
2 Commits
2 Branches
0 Tags
594 KiB
 
Tree: 4622953a91
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from '4622953a91'
${ noResults }
dft/README.md

318 B
Raw Blame History

FFT

The package provides an algorithm to compute the discrete Fourier transform and its inverse.

Contributing

  1. Fork the project.
  2. Implement your idea.
  3. Open a pull request.