Fast fourier transforms: A tutorial review and a state of the art

Signal Processing

Volumn 19, Issue 4, 1990, Pages 259-299

  Duhamel, P ^a   Vetterli, M ^b  

^a ORANGE LABS   (France)

^b Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

computational complexity; fast algorithms; Fourier transforms

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; SIGNAL FILTERING AND PREDICTION; SIGNAL PROCESSING - DIGITAL TECHNIQUES;

COOLEY-TUKEY FAST FOURIER TRANSFORM (FFT) ALGORITHM; FAST ALGORITHMS; LINEAR FILTERING; PRIME FACTOR ALGORITHM; SPLIT-RADIX FFT; WINOGRAD FAST FOURIER TRANSFORM;

MATHEMATICAL TRANSFORMATIONS;

EID: 0025418849     PISSN: 01651684     EISSN: None     Source Type: Journal    
DOI: 10.1016/0165-1684(90)90158-U     Document Type: Article

References (120)

1. Efficient Fourier transform and convolution algorithms
2. Arithmetic Complexity of Computations
3. Fast one-dimensional digital convolution by multi-dimensional techniques
4. A fast Fourier transform algorithm using base 8 iterations
5. z-transform DFT filters and FFTs
6. Index mappings for multidimensional formulation of the DFTs and convolution
7. Real-factor FFT algorithms
8. An algorithm for the machine calculation of complex Fourier series
9. A new algorithm for the radix-3 FFT
10. Split-radix FFT algorithm
11. n+1
12. Un algorithme de transformation de Fourier rapide à double base
13. Implementation of “split-radix” FFT algorithms for comlex, real and real-symmetric data
14. Algorithmes de tranformées discrètes rapides pour convolution cyclique et de convolution cyclique pour transformées rapides
15. The interaction algorithm and practical Fouriers analysis
16. The interaction algorithm and practical Fourier analysis
17. A bibliography of fast transform and convolution algorithms II
18. Gauss and the history of the FFT
19. n DFT
20. Application of multiplicative complexity theory to convolution and the discrete Fourier transform
21. Large DFT modules: 11, 13, 17, 19, and 25
22. The design of optimal DFT algorithms using dynamic programming
23. A prime factor algorithm using high-speed convolution
24. Recursive cyclotomic factorization—A new algorithm for calculating the discrete Fourier transform
25. Efficient algorithms for signal processing
26. Very fast computation of the radix-2 discrete Fourier transform
27. Discrete Fourier transforms when the number of data samples is prime
28. A new principle for fast Fourier transformation
29. An algorithm for computing the mixed radix fast Fourier transform
30. Easy generation of small-N discrete Fourier transform algorithms
31. FFT pruning. A new approach
32. A new FFT algorithm of radix 3, 6, and 12
33. Self-sorting mixed-radix fast Fourier transforms
34. Simple FFT and DCT algorithms with reduced number of operations
35. Algorithmes de transformée de Fourier et cosinus mono- et bi-dimensionnels
36. m DFTs
37. On computing the discrete Fourier transform
38. Some bilinear forms whose multiplicative complexity depends on the field of constants
39. On computing the DFT
40. On the multiplicative complexity of the discrete transform
41. An economical method for calculating the discrete transform
42. Discrete cosine transform
43. A radix-eight fast Fourier transform subroutine for revealed-valued series
44. Discrete hartley transform
45. The fast Hartley transform
46. Unscrambling for fast DFT algorithms
47. A fast computational algorithm for the discrete cosine transform
48. Improved Fourier and Hartley transform algorithms. Application to Cyclic Convolution of Real Data
49. A connection between reverse and matrix transpose. Hardware and software consequences
50. An improved digit reversal permutation algorithm for the fast Fourier and Hartley transforms
51. An algorithm for the evaluation of finite Fourier series
52. A fast recursive algorithm for computing the discrete Fourier transform
53. A sinusoidal family of unitary transforms
54. A new algorithm to compute the discrete cosine transform
55. Fast FIR filtering: algorithms and implementations
56. Digital filtering using polynomial transforms
57. Fast computational algorithms for bit-reversal
58. n DFTs and their connection with practical algorithms
59. Real-valued fast Fourier transform algorithms
60. A new efficient algorithm for computing a few DFT points
61. Fast 2-D discrete cosine transform
62. Analysis, synthesis and computational complexity of digital banks
63. Running FIR and IIR filtering using multirate filter banks
64. New algorithms for the multidimnsional Fourier transform
65. Abelian semisimple algebras and algorithms for the discrete Fourier transform
66. A fast computer method for matrix transposing
67. A unified treatment of Cooley-Tukey algorithms for the evaluation of the multidimensional DFT
68. In-place butterfly-style FFT of 2-D real sequences
69. Computation of convolutions and discrete Fourier transforms by polynomial transforms
70. Fast computation of discrete Fourier transforms using polynomial transforms
71. An adaptation of the fast Fourier transform for parallelprocessing
72. Split-vector radix 2-D fast Fourier transform
73. Algorithm for direct fast Fourier transform of bivariant functions
74. Direct fast Fourier transform of bivariant functions
75. Fourier transform and convolution subroutines for the IBM 3090 Vector Facility
76. Highly concurrent computing structures for matrix arithmetic and signal processing
77. An in-place, in order prime factor FFT algorithm
78. VLSI computations: from physics to algorithms
79. Fourier transform computers using CORDIC iterations
80. Very fast Fourier transform algorithms hardware for implementation
81. On computing the inverse DFT
82. n DCT algorithms suitable for VLSI implementation
83. Error analysis and resulting structural improvements for fixed point FFTs
84. Implantation de transformées de Fourier de dimension 2
85. Floating point roundoff error in the prime factor FFT
86. On the number of active ∗-operations needed to compute the DFT
87. The linear complexity of computation
88. Automatic generation of time efficient digital sigmal processing software
89. A comparative study of time efficient FFT and WFTA programs for generated purpose computers
90. Bounds on the minimum number of data transfers in WFTA and FFT programs
91. The additive and logical complexities of linear and bilinear arithmetic algorithms
92. Implementation of the in-order prime factor transform for variable sizes
93. An introduction to programming the Winograd Fourier transform algorithm
94. An introduction to programming the Winograd Fourier transform algorithm
95. An introduction to programming the Winograd Fourier transform algorithm
96. On computing the split-radix FFT
97. Fourier transforms in VLSI
98. A discrete Fourier-cosine transform chip
99. A combinatorial limit to the computing power of VLSI circuits
100. A fixed-point fast Fourier transform error analysis