Modified FFTs for Fused Multiply-Add Architectures
From MaRDI portal
Recommendations
- Implementation of Efficient FFT Algorithms on Fused Multiply- Add Architectures
- MULTIPLY-ADD OPTIMIZED FFT KERNELS
- Fast Radix 2, 3, 4, and 5 Kernels for Fast Fourier Transformations on Computers with Overlapping Multiply--Add Instructions
- A new matrix approach to real FFTs and convolutions of length \(2^k\)
Cites work
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Direct fast Fourier transform of bivariate functions
- Fast computation of discrete Fourier transforms using polynomial transforms
- scientific article; zbMATH DE number 3928865 (Why is no real title available?)
- scientific article; zbMATH DE number 44502 (Why is no real title available?)
- Implementation of Efficient FFT Algorithms on Fused Multiply- Add Architectures
- On computing the Discrete Fourier Transform
- On systems of bilinear forms whose minimal division-free algorithms are all bilinear
- On the multiplicative complexity of the discrete Fourier transform
- Simple FFT and DCT algorithms with reduced number of operations.
- The multiplicative complexity of the discrete Fourier transform
Cited in
(21)- Application of a modified FFT to product type integration
- Modified Winograd FFT algorithm and its variants for transform size \(N=p^ k\) and their implementations
- Four easy ways to a faster FFT
- A new matrix approach to real FFTs and convolutions of length \(2^k\)
- An FFT performance model for optimizing general-purpose processor architecture
- An algorithm for multiple-precision floating-point multiplication
- Error analysis and efficient realization of the multiplier-less FFT-like transformation (ML-FFT) and related sinusoidal transformations
- Lesser known FFT algorithms
- Generating and searching families of FFT algorithms
- scientific article; zbMATH DE number 4129958 (Why is no real title available?)
- On hardware implementation of the split-radix FFT
- Implementation of Efficient FFT Algorithms on Fused Multiply- Add Architectures
- Fast and precise Fourier transforms
- scientific article; zbMATH DE number 1559520 (Why is no real title available?)
- Hybrid Wordlength Optimization Methods of Pipelined FFT Processors
- FAST: FFT ASIC automated synthesis
- MULTIPLY-ADD OPTIMIZED FFT KERNELS
- FFT Implementation with Fused Floating-Point Operations
- The Tangent FFT
- A polymorphic radix-n framework for fast Fourier transforms
- Pruning fast Fourier transform algorithm design using group-based method
This page was built for publication: Modified FFTs for Fused Multiply-Add Architectures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4293974)
