Discrete Fast fourier Transorm Algorithms: A Tutorial Survey
- 1 January 1991
- book chapter
- Published by Elsevier
- Vol. 80, 1-67
- https://doi.org/10.1016/s0065-2539(08)60607-1
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Factorization method for crystallographic Fourier transformsAdvances in Applied Mathematics, 1990
- A new efficient algorithm to compute the two-dimensional discrete Fourier transformIEEE Transactions on Acoustics, Speech, and Signal Processing, 1988
- Evaluating finite Fourier transforms that respect group symmetriesActa Crystallographica Section A Foundations of Crystallography, 1988
- VLSI Architectures for Multidimensional Fourier Transform ProcessingIEEE Transactions on Computers, 1987
- Maximum entropy and the foundations of direct methodsActa Crystallographica Section A Foundations of Crystallography, 1984
- Computing the fast Fourier transform on a vector computerMathematics of Computation, 1979
- Crystallographic fast Fourier transformsActa Crystallographica Section A, 1973
- An Adaptation of the Fast Fourier Transform for Parallel ProcessingJournal of the ACM, 1968
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965
- Structure invariants and seminvariants for noncentrosymmetric space groupsActa Crystallographica, 1956