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.

Sign up for GitHub

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

Jump to bottom

Investigate Frobenius Additive FFT #21

Open

AndersTrier opened this issue Feb 12, 2024 · 0 comments

Owner

AndersTrier commented Feb 12, 2024 •

edited

Loading

I believe this can be a drop-in replacement for the FFT that is currently being used:
https://arxiv.org/pdf/1802.03932.pdf

More background:
http://www.texmacs.org/joris/ffft/ffft.pdf

~5x faster for 16-bit field, ~3x faster for 8-bit field hypothetically

catid/leopard#5

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment