Integration of the Cooley, Rader and Winograd-Fourier algorithms for a faster computation of the DFT.
Sebastiano ImpedovoT. SimoneGiovanni DimauroPublished in: Recent Issues in Pattern Analysis and Recognition (1989)
Keyphrases
- fourier transform
- frequency domain
- recently developed
- learning algorithm
- databases
- computational complexity
- computational cost
- computationally efficient
- benchmark datasets
- orders of magnitude
- fast fourier transform
- matrix multiplication
- feature selection
- motion estimation
- optimization problems
- computationally demanding