Fast and precise Fourier transforms

DOI10.1109/18.817519MaRDI QIDQ4503499zbMATH OpenOpenAlexFDO

Authors Joe P. Buhler, M. Amin Shokrollahi, V. Stemann

Publication date 7 September 2000

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.817519

zbMATH Keywords

algorithmChinese remainderingcomputational noisecontinued fractionscyclotomic fieldscyclotomic unitseffective Chebotarev theoremerror analysisfast Fourier transformsinteger linear programmingprediction filtersresidue number systemssignal processing

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Application of orthogonal and other special functions (94A11) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• scientific article; zbMATH DE number 1559520
• Modified FFTs for Fused Multiply-Add Architectures
• Range and error analysis for a fast Fourier transform computed over<tex>Z[{omega}]</tex>
• A Stochastic Roundoff Error Analysis for the Fast Fourier Transform
• Fast Fourier transformation based on number theoretic transforms

Cited in

(35)

• The equivalence of decimation in time and decimation in frequency in FFT computations
• Fast generalized Fourier transforms
• Fast Fourier Transforms using the complex logarithmic number system
• High-accuracy formula for discrete calculation of Fourier transforms
• Fast computation and practical use of amplitudes at non-Fourier frequencies
• Fast and approximate computation of Laplace and Fourier transforms
• scientific article; zbMATH DE number 3921936 (Why is no real title available?)
• scientific article; zbMATH DE number 3942982 (Why is no real title available?)
• scientific article; zbMATH DE number 3970070 (Why is no real title available?)
• An algorithm for complex approximations in<tex>Z[e^{2{pi}i/8}]</tex>(Corresp.)
• Range and error analysis for a fast Fourier transform computed over<tex>Z[{omega}]</tex>
• Fast computation of real discrete Fourier transform for any number of data points
• scientific article; zbMATH DE number 146378 (Why is no real title available?)
• Fast Approximate Fourier Transforms for Irregularly Spaced Data
• A recursive fast Fourier transformation algorithm
• scientific article; zbMATH DE number 1134974 (Why is no real title available?)
• scientific article; zbMATH DE number 1960289 (Why is no real title available?)
• scientific article; zbMATH DE number 1979263 (Why is no real title available?)
• scientific article; zbMATH DE number 1559520 (Why is no real title available?)
• Improved Twiddle Access for Fast Fourier Transforms
• Fibonacci Spectral Transforms: Calculation, Algorithms and Circuit Realizations
• Conversion of FFT’s to Fast Hartley Transforms
• Fast Fourier Transform Accelerated Fast Multipole Algorithm
• Rapid Computation of the Discrete Fourier Transform
• Accuracy of the Discrete Fourier Transform and the Fast Fourier Transform
• Quantization and finite frames
• scientific article; zbMATH DE number 1421270 (Why is no real title available?)
• Fast Fourier Transform for Discontinuous Functions
• Parametric versions of the fast Fourier transform
• Fast Fourier transform of small orders.
• Fast Discrete Curvelet Transforms
• An exact FFT recovery theory: a nonsubtractive dither quantization approach with applications
• An exact FFT recovery theory: a nonsubtractive dither quantization approach with applications
• Efficient Fourier transforms for transverse momentum dependent distributions
• Fast Fourier transform: algorithms and applications

Describes a project that uses

Uses Software

• PARI/GP

This page was built for publication: Fast and precise Fourier transforms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4503499)