Implementation of Efficient FFT Algorithms on Fused Multiply- Add Architectures

DOI10.1109/TSP.1993.193130zbMath0768.65094OpenAlexW2122454150MaRDI QIDQ4034618

Elliot Linzer, Ephraim Feig

Publication date: 16 May 1993

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

Full work available at URL: https://doi.org/10.1109/tsp.1993.193130

zbMATH Keywords

factorization of matricesCooley-Turkey algorithmsdecimation-in-time version of fast Fourier transformsfused multiply-add architecturescaled FFT

Mathematics Subject Classification ID

Trigonometric interpolation (42A15) Numerical methods for discrete and fast Fourier transforms (65T50) Numerical algorithms for specific classes of architectures (65Y10)

Related Items (2)

MULTIPLY-ADD OPTIMIZED FFT KERNELS ⋮ Modified FFTs for Fused Multiply-Add Architectures

This page was built for publication: Implementation of Efficient FFT Algorithms on Fused Multiply- Add Architectures