Fast Fourier transformation based on number theoretic transforms
From MaRDI portal
DOI10.1016/0016-0032(88)90031-2zbMATH Open0677.65144OpenAlexW2063102759MaRDI QIDQ1123580FDOQ1123580
Authors: Robert J. Polge, Adhami, Reza R. 
Publication date: 1988
Published in: Journal of the Franklin Institute (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0016-0032(88)90031-2
Recommendations
fast algorithmdiscrete Fourier transformfast Fourier transformcyclic convolutionscalingChinese remainder theoremcyclic integer convolutionsnumber theoretic transform
Cites Work
- An Algorithm for the Machine Calculation of Complex Fourier Series
- The use of finite fields to compute convolutions
- An in-place, in-order prime factor FFT algorithm
- Discrete Convolutions via Mersenne Transforms
- Efficient Fast Fourier Transform Programs for Arbitary Factors with One Step Loop Unscrambling
- On Computing the Discrete Fourier Transform
- Recursive cyclotomic factorization--A new algorithm for calculating the discrete Fourier transform
- A Fast Fourier Transform Algorithm Using Base 8 Iterations
- Algebraic theory of finite Fourier transforms
- A new radix-6 FFT algorithm
- Complex Convolutions via Fermat Number Transforms
- Relative evaluation of various number theoretic transforms for digital filtering applications
- Title not available (Why is that?)
Cited In (17)
- Title not available (Why is that?)
- Fast Multipliers for Number Theoretic Transforms
- Efficient number theoretic transforms for convolutions using ROM arrays
- Techniques for Computing the Discrete Fourier Transform Using the Quadratic Residue Fermat Number Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multiple radix fast Fourier transformation based on number theoretic transforms
- Number theoretic transforms for the calculation of convolutions
- Number theoretic transform: generalization, optimization, concrete analysis and applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Faster arithmetic for number-theoretic transforms
- Discrete Fourier transform computation using prime Ramanujan numbers
- Closed-Form Orthogonal Number Theoretic Transform Eigenvectors and the Fast Fractional NTT
- Fast and precise Fourier transforms
- Title not available (Why is that?)
This page was built for publication: 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 Q1123580)
