A quick and dirty implementation of Discrete Fourier transform (DFT) in Haskell. Tested on Polynomial Multiplication.
-
Updated
Oct 14, 2020 - Haskell
#
discrete-fourier-transform
Here are 2 public repositories matching this topic...
Finite field polynomial arithmetic based on fast Fourier transforms
fast-fourier-transform
finite-fields
galois-field
polynomial-multiplication
discrete-fourier-transform
lagrange-interpolation
polynomial-interpolation
-
Updated
Nov 15, 2020 - Haskell
Improve this page
Add a description, image, and links to the discrete-fourier-transform topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the discrete-fourier-transform topic, visit your repo's landing page and select "manage topics."