MULTIPLY-ADD OPTIMIZED FFT KERNELS

DOI10.1142/S0218202501000775zbMath1012.65151OpenAlexW2147407701MaRDI QIDQ4798854

Christoph W. Ueberhuber, Herbert Karner, Martin Auer

Publication date: 16 March 2003

Published in: Mathematical Models and Methods in Applied Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218202501000775

zbMATH Keywords

numerical experimentsefficiencyarithmetic complexityfast Fourier transform (FFT)fused multiply-add instructionradix-2 FFT algorithmradix-3 and radix-5 kernels

Mathematics Subject Classification ID

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

Cites Work

• Fast mixed-radix real Fourier transforms
• Implementation of Efficient FFT Algorithms on Fused Multiply- Add Architectures
• Fast Radix 2, 3, 4, and 5 Kernels for Fast Fourier Transformations on Computers with Overlapping Multiply--Add Instructions

This page was built for publication: MULTIPLY-ADD OPTIMIZED FFT KERNELS