Modified FFTs for Fused Multiply-Add Architectures

DOI10.2307/2153172zbMath0795.65102OpenAlexW4245252498MaRDI QIDQ4293974

Elliot Linzer, Ephraim Feig

Publication date: 10 July 1994

Full work available at URL: https://doi.org/10.2307/2153172

zbMATH Keywords

fast Fourier transformcomplex discrete Fourier transformfused multiply-add architecturesnumber of multiply-adds

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Cites Work

• Unnamed Item
• Unnamed Item
• Simple FFT and DCT algorithms with reduced number of operations.
• The multiplicative complexity of the discrete Fourier transform
• On the multiplicative complexity of the discrete Fourier transform
• Fast computation of discrete Fourier transforms using polynomial transforms
• On systems of bilinear forms whose minimal division-free algorithms are all bilinear
• Implementation of Efficient FFT Algorithms on Fused Multiply- Add Architectures
• On computing the Discrete Fourier Transform
• Direct fast Fourier transform of bivariate functions
• An Algorithm for the Machine Calculation of Complex Fourier Series

This page was built for publication: Modified FFTs for Fused Multiply-Add Architectures