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 }
dft/README.md

13 lines
318 B
Raw Normal View History

Initialize the project
10 years ago
Add a couple of failing tests
10 years ago
​
​
​
​
​
​
​
​
​
​
​
  1. # FFT
  3. The package provides an [algorithm][1] to compute the [discrete Fourier
  4. transform][2] and its inverse.
  6. ## Contributing
  8. 1. Fork the project.
  9. 2. Implement your idea.
  10. 3. Open a pull request.
  12. [1]: https://en.wikipedia.org/wiki/Fast_Fourier_transform
  13. [2]: https://en.wikipedia.org/wiki/Discrete_Fourier_transform