The Tangent FFT
From MaRDI portal
Publication:5386108
DOI10.1007/978-3-540-77224-8_34zbMath1195.94019MaRDI QIDQ5386108
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
convolution; DFT; algebraic complexity; communication complexity; polynomial multiplication; split-radix FFT; scaled odd tail; modified split-radix FFT; Tangent FFT
65T50: Numerical methods for discrete and fast Fourier transforms
94A11: Application of orthogonal and other special functions
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Simple FFT and DCT algorithms with reduced number of operations.
- Fast Fourier transforms: A tutorial review and a state of the art
- A new matrix approach to real FFTs and convolutions of length \(2^k\)
- Recursive cyclotomic factorization--A new algorithm for calculating the discrete Fourier transform
- A Modified Split-Radix FFT With Fewer Arithmetic Operations
- An Algorithm for the Machine Calculation of Complex Fourier Series