Fast Fourier transformation based on number theoretic transforms

DOI10.1016/0016-0032(88)90031-2zbMath0677.65144MaRDI QIDQ1123580

Adhami, Reza R., Robert J. Polge

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 Fourier transform; discrete Fourier transform; scaling; fast algorithm; Chinese remainder theorem; cyclic convolution; cyclic integer convolutions; number theoretic transform

Mathematics Subject Classification ID

65T40: Numerical methods for trigonometric approximation and interpolation

Related Items

Multiple radix fast Fourier transformation based on number theoretic transforms

Cites Work

• Unnamed Item
• Algebraic theory of finite Fourier transforms
• An in-place, in-order prime factor FFT algorithm
• A new radix-6 FFT algorithm
• Recursive cyclotomic factorization--A new algorithm for calculating the discrete Fourier transform
• The use of finite fields to compute convolutions
• Complex Convolutions via Fermat Number Transforms
• Efficient Fast Fourier Transform Programs for Arbitary Factors with One Step Loop Unscrambling
• On Computing the Discrete Fourier Transform
• Relative evaluation of various number theoretic transforms for digital filtering applications
• An Algorithm for the Machine Calculation of Complex Fourier Series
• A Fast Fourier Transform Algorithm Using Base 8 Iterations
• Discrete Convolutions via Mersenne Transforms