FFT Implementation with Fused Floating-Point Operations

DOI10.1109/TC.2010.271MaRDI QIDQ5277672zbMATH OpenFDO

Authors Hani H. M. Saleh, Earl E. jun. Swartzlander

Publication date 12 July 2017

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

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

Mathematics Subject Classification ID

Numerical algorithms for computer arithmetic, etc. (65Y04)

Recommendations

• Implementation of Efficient FFT Algorithms on Fused Multiply- Add Architectures
• Compiler Construction
• Fast implementations of fuzzy arithmetic operations using fast Fourier transform (FFT)
• Modified FFTs for Fused Multiply-Add Architectures
• scientific article; zbMATH DE number 3864463
• Further Symmetries of in-Place FFTs
• The Frobenius FFT
• Implementation of FFT Structures Using the Residue Number System
• FFT techniques in the numerical solution of convolution equations
• A Modified Split-Radix FFT With Fewer Arithmetic Operations

Cited in

(6)

• Application of a modified FFT to product type integration
• scientific article; zbMATH DE number 6611926 (Why is no real title available?)
• Implementation of FFT Structures Using the Residue Number System
• Implementation of Efficient FFT Algorithms on Fused Multiply- Add Architectures
• Fast Fourier transform using matrix decomposition
• Compiler Construction

This page was built for publication: FFT Implementation with Fused Floating-Point Operations

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