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

DOI10.1109/TC.1986.1676704zbMATH Open0631.65148MaRDI QIDQ3768356FDOQ3768356

Author name not available (Why is that?)

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)

Cited In (3)

• Implementation of FFT Structures Using the Residue Number System
• Discrete Fourier transform computation using prime Ramanujan numbers
• Using quadratic residue arithmetic for computing skew cyclic convolutions

   Recommendations

• Computing the discrete Fourier transform using residue number systems in a ring of algebraic integers 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Very fast computation of the radix-2 discrete Fourier transform 👍 👎
• Fast Fourier transformation based on number theoretic transforms 👍 👎

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)