Improved Twiddle Access for Fast Fourier Transforms

DOI10.1109/TSP.2009.2035984MaRDI QIDQ4570744zbMATH OpenFDO

Authors Ross A. Lippert, Ron O. Dror, David E. Shaw, Kevin J. Bowers

Publication date 9 July 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• Fast and precise Fourier transforms
• A Methodology for Speeding Up Fast Fourier Transform Focusing on Memory Architecture Utilization
• Accelerating the Nonuniform Fast Fourier Transform
• Parallelization of fast Fourier transforms
• Very fast computation of the radix-2 discrete Fourier transform
• Fast computation of partial Fourier transforms
• Fast Fourier Transform Accelerated Fast Multipole Algorithm
• Fast Fourier transform revisited
• Faster homomorphic evaluation of discrete Fourier transforms

Cited in

(1)

• Extendible look-up table of twiddle factors and radix-8 based fast Fourier transform

This page was built for publication: Improved Twiddle Access for Fast Fourier Transforms

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