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

Implement parallelizable 2-radix FFT algorithms #125

Closed
Tracked by #116
mpaulucci opened this issue Feb 27, 2023 · 0 comments · Fixed by #127
Closed
Tracked by #116

Implement parallelizable 2-radix FFT algorithms #125

mpaulucci opened this issue Feb 27, 2023 · 0 comments · Fixed by #127
Assignees
Labels

Comments

@mpaulucci
Copy link
Collaborator

mpaulucci commented Feb 27, 2023

Acceptance criteria:

  • It should be customisable to to use sequential or the parallelizable implementation.
  • Parallelizable version should pass all the tests that the sequencial version passes.
@xqft xqft changed the title Implement a parallelizable 2-radix ordered NTT algorithm. Implement parallelizable 2-radix NTT algorithms Feb 27, 2023
@IAvecilla IAvecilla changed the title Implement parallelizable 2-radix NTT algorithms Implement parallelizable 2-radix FFT algorithms Mar 6, 2023
@xqft xqft closed this as completed in #127 Mar 6, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Projects
None yet
Development

Successfully merging a pull request may close this issue.

2 participants