Fast Fourier transformation based on number theoretic transforms

DOI10.1016/0016-0032(88)90031-2MaRDI QIDQ1123580zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

fast algorithmdiscrete Fourier transformfast Fourier transformcyclic convolutionscalingChinese remainder theoremcyclic integer convolutionsnumber theoretic transform

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40)

Recommendations

• scientific article; zbMATH DE number 3843648
• Multiple radix fast Fourier transformation based on number theoretic transforms
• scientific article; zbMATH DE number 3915602
• scientific article; zbMATH DE number 3932301
• scientific article; zbMATH DE number 3880785

Cites work

• scientific article; zbMATH DE number 3246595 (Why is no real title available?)
• A Fast Fourier Transform Algorithm Using Base 8 Iterations
• A new radix-6 FFT algorithm
• Algebraic theory of finite Fourier transforms
• An Algorithm for the Machine Calculation of Complex Fourier Series
• An in-place, in-order prime factor FFT algorithm
• Complex Convolutions via Fermat Number Transforms
• 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
• Relative evaluation of various number theoretic transforms for digital filtering applications
• The use of finite fields to compute convolutions

Cited in

(17)

• Number theoretic transforms for the calculation of convolutions
• Faster arithmetic for number-theoretic transforms
• scientific article; zbMATH DE number 3932301 (Why is no real title available?)
• Discrete Fourier transform computation using prime Ramanujan numbers
• Multiple radix fast Fourier transformation based on number theoretic transforms
• Number theoretic transform: generalization, optimization, concrete analysis and applications
• Efficient number theoretic transforms for convolutions using ROM arrays
• Fast Multipliers for Number Theoretic Transforms
• scientific article; zbMATH DE number 3905813 (Why is no real title available?)
• scientific article; zbMATH DE number 3970070 (Why is no real title available?)
• Closed-Form Orthogonal Number Theoretic Transform Eigenvectors and the Fast Fractional NTT
• scientific article; zbMATH DE number 1960289 (Why is no real title available?)
• scientific article; zbMATH DE number 1421270 (Why is no real title available?)
• Techniques for Computing the Discrete Fourier Transform Using the Quadratic Residue Fermat Number Systems
• Fast and precise Fourier transforms
• scientific article; zbMATH DE number 1134974 (Why is no real title available?)
• scientific article; zbMATH DE number 3843648 (Why is no real title available?)

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)