The tangent FFT

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4851 LNCS, Issue , 2007, Pages 291-300

  Bernstein, Daniel J ^a  

^a UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

Algebraic complexity; Communication complexity; DFT; convolution,polynomial multiplication; Modified split radix FFT; Scaled odd tail; Split radix FFT; Tangent FFT

Indexed keywords

ALGORITHMS; COMPUTER SOFTWARE; DENSITY FUNCTIONAL THEORY; POLYNOMIAL APPROXIMATION;

ALGEBRAIC COMPLEXITY; COMMUNICATION COMPLEXITY;

FAST FOURIER TRANSFORMS;

EID: 38349002754     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77224-8_34     Document Type: Conference Paper

References (14)

1. 1968 Fall Joint Computer Conference. In: AFIPS conference proceedings, vol. 33, part one. See [13] (1968)
2. Cooley, J.W., Tukey, J.W.: An Algorithm for the Machine Calculation of Complex Fourier Series. Mathematics of Computation 19, 297-301 (1965)
3. Duhamel, P., Hollmann, H.: Split-Radix FFT algorithm. Electronics Letters 20, 14-16 (1984)
4. Duhamel, P., Vetterli, M.: Fast Fourier Transforms: a Tutorial Review and a State of the Art. Signal Processing 19, 259-299 (1990)
5. Fiduccia, C.M.: Polynomial Evaluation Via the Division Algorithm: the Fast Fourier Transform Revisited. In: [10], pp. 88-93 (1972)
6. Gauss, C.F.: Werke, Band 3 Königlichen Gesellschaft der Wissenschaften. Göttingen (1866)
7. Johnson, S.G., Frigo, M.: A Modified Split-Radix FFT with Fewer Arithmetic Operations. IEEE Trans. on Signal Processing 55, 111-119 (2007)
8. k. Computing 80, 23-45 (2007)
9. Martens, J.B.: Recursive Cyclotomic Factorization - A New Algorithm for Calculating the Discrete Fourier Transform. IEEE Trans. Acoustics, Speech, and Signal Processing 32, 750-761 (1984)
10. Rosenberg, A.L.: Fourth Annual ACM Symposium on Theory Of Computing. Association for Computing Machinery, New York (1972)
11. Sorensen, H.V., Heideman, M.T., Burrus, C.S.: On Computing the Split-Radix FFT. IEEE Trans. Acoustics, Speech, and Signal Processing 34, 152-156 (1986)
12. Vetterli, M., Nussbaumer, H.J.: Simple FFT and DCT Algorithms with Reduced Number of Operations. Signal Processing 6, 262-278 (1984)
13. Yavne, R.: An Economical Method for Calculating the Discrete Fourier Transform. In: [1], pp. 115-125 (1968)
14. Zhou, F., Kornerup, P.: A New Fast Discrete Fourier Transform. J. VLSI Signal Processing 20, 219-232 (1998)