Skip to content

Conversation

@Shnatsel
Copy link
Collaborator

The idea is to do twice the work per pass over memory. Code comments explain more.

https://fgiesen.wordpress.com/2023/03/19/notes-on-ffts-for-implementers/ calls this radix-2^2. It lets us keep the simple and SIMD-friendly bit reversal, but has the memory throughput efficiency almost double of the current impl and slightly better than even radix-4 because we need to load less twiddles. It would win on load/store efficiency even more if we were to ramp up the fusion factor instead of increasing the radix.

@codecov-commenter
Copy link

codecov-commenter commented Jan 25, 2026

Codecov Report

❌ Patch coverage is 0% with 79 lines in your changes missing coverage. Please review.
✅ Project coverage is 97.11%. Comparing base (6db0aec) to head (6e92bfd).

Files with missing lines Patch % Lines
src/kernels/dit.rs 0.00% 79 Missing ⚠️
Additional details and impacted files
@@            Coverage Diff             @@
##             main      #65      +/-   ##
==========================================
- Coverage   99.79%   97.11%   -2.68%     
==========================================
  Files          13       13              
  Lines        2867     2946      +79     
==========================================
  Hits         2861     2861              
- Misses          6       85      +79     

☔ View full report in Codecov by Sentry.
📢 Have feedback on the report? Share it here.

🚀 New features to boost your workflow:
  • ❄️ Test Analytics: Detect flaky tests, report on failures, and find test suite problems.

@Shnatsel
Copy link
Collaborator Author

It's so early that it's not worth having a PR open for this yet.

@Shnatsel Shnatsel closed this Jan 25, 2026
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.

3 participants