Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

feat: FFT and IFFT based on domain #30

Open
Tracked by #25
0xJepsen opened this issue May 6, 2024 · 3 comments
Open
Tracked by #25

feat: FFT and IFFT based on domain #30

0xJepsen opened this issue May 6, 2024 · 3 comments
Labels
feature ✨ New feature or request good first issue 👋 Good for newcomers performance ⚡ Benchmarks or performance improvements

Comments

@0xJepsen
Copy link
Contributor

0xJepsen commented May 6, 2024

Feature

Allows us to convert between the two bases via evaluation at roots of unity / inverses.

@0xJepsen
Copy link
Contributor Author

@Autoparallel did the Reed Solomon Encoding PR closed this?

@kevaundray
Copy link

Looking at the PR, I don't think it closes it -- it does a DFT but it is not doing it via the FFT, its doing it via polynomial evaluation

@Autoparallel Autoparallel changed the title FFT and IFFT based on domain. feat: FFT and IFFT based on domain Jul 1, 2024
@Autoparallel Autoparallel added good first issue 👋 Good for newcomers feature ✨ New feature or request performance ⚡ Benchmarks or performance improvements labels Dec 19, 2024
@Autoparallel
Copy link
Contributor

Marking as a good first issue as DFT is already done, FFT is not much more than a case for powers of two that can be divide-and-conquered!

@Autoparallel Autoparallel removed their assignment Dec 19, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
feature ✨ New feature or request good first issue 👋 Good for newcomers performance ⚡ Benchmarks or performance improvements
Projects
None yet
Development

No branches or pull requests

3 participants