Multiple radix fast Fourier transformation based on number theoretic transforms
From MaRDI portal
Publication:757003
Recommendations
- Fast Fourier transformation based on number theoretic transforms
- Fast Multipliers for Number Theoretic Transforms
- A polymorphic radix-\(n\) framework for fast Fourier transforms
- Very fast computation of the radix-2 discrete Fourier transform
- scientific article; zbMATH DE number 3932301
- The structure of vector radix fast Fourier transforms
- Calculation of radix-2 discrete multiresolution Fourier transform
- Split-radix generalized fast Fourier transform
- Integer fast Fourier transform
- scientific article; zbMATH DE number 3942981
Cites work
Cited in
(9)- Multiplierless implementation of rotators and FFTs
- scientific article; zbMATH DE number 3926792 (Why is no real title available?)
- Fast Radix 2, 3, 4, and 5 Kernels for Fast Fourier Transformations on Computers with Overlapping Multiply--Add Instructions
- Faster arithmetic for number-theoretic transforms
- scientific article; zbMATH DE number 3932301 (Why is no real title available?)
- New Recursive Fast Radix-2 Algorithm for the Modulated Complex Lapped Transform
- Extendible look-up table of twiddle factors and radix-8 based fast Fourier transform
- scientific article; zbMATH DE number 4209552 (Why is no real title available?)
- Fast Fourier transformation based on number theoretic transforms
This page was built for publication: Multiple radix fast Fourier transformation based on number theoretic transforms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757003)