Techniques for Computing the Discrete Fourier Transform Using the Quadratic Residue Fermat Number Systems

DOI10.1109/TC.1986.1676704MaRDI QIDQ3768356zbMATHFDO

Authors

Publication date 1986

Published in IEEE Transactions on Computers (Search for Journal in Brave)

zbMATH Keywords

error analysisdiscrete Fourier transformChinese remainder theoremsystolic arrayquadratic residue Fermat number system

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40)

Recommendations

• Computing the discrete Fourier transform using residue number systems in a ring of algebraic integers
• scientific article; zbMATH DE number 11434
• scientific article; zbMATH DE number 817564
• Very fast computation of the radix-2 discrete Fourier transform
• Fast Fourier transformation based on number theoretic transforms

Cited in

(6)

• An algorithm for complex approximations in<tex>Z[e^{2{pi}i/8}]</tex>(Corresp.)
• Discrete Fourier transform computation using prime Ramanujan numbers
• Computing the discrete Fourier transform using residue number systems in a ring of algebraic integers
• Implementation of FFT Structures Using the Residue Number System
• Method for structuring the Fourier discrete cosine transform in the modular arithmetic of the Haar-Krestenson number-theoretic basis
• Using quadratic residue arithmetic for computing skew cyclic convolutions

This page was built for publication: Techniques for Computing the Discrete Fourier Transform Using the Quadratic Residue Fermat Number Systems

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