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.
3 Commits
2 Branches
0 Tags
594 KiB
 
Tree: c47196e3e9
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'c47196e3e9'
${ noResults }
Ivan Ukhov c47196e3e9
Add an implementation based on Brenner’s (1976) 		10 years ago
src Add an implementation based on Brenner’s (1976) 10 years ago
tests Add a couple of failing tests 10 years ago
.gitignore Initialize the project 10 years ago
Cargo.toml Add a couple of failing tests 10 years ago
LICENSE.txt Initialize the project 10 years ago
README.md Add a couple of failing tests 10 years ago

README.md

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.