Implementation of Efficient FFT Algorithms on Fused Multiply- Add Architectures

DOI10.1109/TSP.1993.193130MaRDI QIDQ4034618zbMATH OpenOpenAlexFDO

Authors 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

Cooley-Turkey algorithmsdecimation-in-time version of fast Fourier transformsfactorization of matricesfused 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)

Recommendations

• Modified FFTs for Fused Multiply-Add Architectures
• A highly efficient FFT using shared-memory multiplexing
• FFT Implementation with Fused Floating-Point Operations
• On hardware implementation of the split-radix FFT
• Publication:4860111
• FFT algorithms and their adaptation to parallel processing
• A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures

Cited in

(19)

• Implementation of a self-sorting in-place prime factor FFT algorithm
• A reduced-complexity fast algorithm for software implementation of the IFFT/FFT in DMT systems
• Effective implementations of multi-dimensional radix-2 FFT
• Scalable FFT processors and pipelined butterfly units
• Multiplierless implementation of rotators and FFTs
• scientific article; zbMATH DE number 6611926 (Why is no real title available?)
• Algorithms for defining mixed radix FFT flow graphs
• Implementation of FFT Structures Using the Residue Number System
• Modified FFTs for Fused Multiply-Add Architectures
• Fast Radix 2, 3, 4, and 5 Kernels for Fast Fourier Transformations on Computers with Overlapping Multiply--Add Instructions
• Hybrid Wordlength Optimization Methods of Pipelined FFT Processors
• Fixed-Point Analysis and Parameter Optimization of the Radix-<formula formulatype="inline"><tex Notation="TeX">$2^{k}$</tex> </formula> Pipelined FFT Processor
• MULTIPLY-ADD OPTIMIZED FFT KERNELS
• scientific article; zbMATH DE number 800360 (Why is no real title available?)
• World’s Fastest FFT Architectures: Breaking the Barrier of 100 GS/s
• FFT Implementation with Fused Floating-Point Operations
• Compiler Construction
• A low-memory-access length-adaptive architecture for \(2^n\)-point FFT
• A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures

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

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