Skip to content
This repository has been archived by the owner on Jun 16, 2021. It is now read-only.
/ fft-rs Public archive

Two-Radix dynamically-sized FFTs using recursion trees for experimentation.

License

Notifications You must be signed in to change notification settings

JoshFourie/fft-rs

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

36 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Repository Notice: Archived

This repository is archived. It's an implementation of some kind of fast fourier transform.

fft-rs

Simple Fast Fourier Transform on Polynomials with overloaded operators.

Working on linear algebra crate, better fft can be constructed from matrix/vector routine.

View read_me.md in src.

About

Two-Radix dynamically-sized FFTs using recursion trees for experimentation.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages