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

Rename FFT to NTT #1202

Merged
merged 1 commit into from
Jan 18, 2025
Merged

Rename FFT to NTT #1202

merged 1 commit into from
Jan 18, 2025

Conversation

cjpatton
Copy link
Collaborator

Closes #632.

@cjpatton cjpatton marked this pull request as ready for review January 17, 2025 23:14
@cjpatton cjpatton requested a review from a team as a code owner January 17, 2025 23:14
/// Sets `outp` to the Discrete Fourier Transform (DFT) using an iterative FFT algorithm.
pub fn benchmarked_iterative_fft<F: FftFriendlyFieldElement>(outp: &mut [F], inp: &[F]) {
discrete_fourier_transform(outp, inp, inp.len()).unwrap();
/// Sets `outp` to the Discrete Fourier Transform (DFT) using an iterative NTT algorithm.
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

nit: We could also remove mention of the DFT from these two methods

Copy link
Collaborator Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Done. FWIW, the recursive versus iterative NTT benchmark may not have a lot of value anymore.

@cjpatton cjpatton merged commit 25b1d59 into main Jan 18, 2025
6 checks passed
@cjpatton cjpatton deleted the cjppatton/632 branch January 18, 2025 00:30
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

"Discrete Fourier transform" is better known as "Number theoretic transform"
2 participants