The Tangent FFT

DOI10.1007/978-3-540-77224-8_34MaRDI QIDQ5386108zbMATH OpenOpenAlexFDO

Authors Daniel J. Bernstein

Publication date 17 April 2008

Published in Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (Search for Journal in Brave)

Full work available at URL https://research.tue.nl/nl/publications/d6554de6-d2d9-42c9-a77b-aa6832f7e5f4

zbMATH Keywords

algebraic complexitycommunication complexityconvolutionDFTmodified split-radix FFTpolynomial multiplicationscaled odd tailsplit-radix FFTTangent FFT

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Application of orthogonal and other special functions (94A11)

Recommendations

• Generating and searching families of FFT algorithms
• On hardware implementation of the split-radix FFT
• A new matrix approach to real FFTs and convolutions of length \(2^k\)
• scientific article; zbMATH DE number 3926792
• Modified FFTs for Fused Multiply-Add Architectures

Cites work

• A Modified Split-Radix FFT With Fewer Arithmetic Operations
• A new matrix approach to real FFTs and convolutions of length \(2^k\)
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Fast Fourier transforms: A tutorial review and a state of the art
• scientific article; zbMATH DE number 3531311 (Why is no real title available?)
• scientific article; zbMATH DE number 3539809 (Why is no real title available?)
• Recursive cyclotomic factorization--A new algorithm for calculating the discrete Fourier transform
• Simple FFT and DCT algorithms with reduced number of operations.

Cited in

(3)

• Generating and searching families of FFT algorithms
• Interpolative butterfly factorization
• Faster Walsh-Hadamard and discrete Fourier transforms from matrix non-rigidity

This page was built for publication: The Tangent FFT

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