Multiplicative complexity, convolution, and the DFT

Authors:
Michael T. Heideman
Affiliations:
Etak, Inc., Menlo Park, CA
Venue:
Multiplicative complexity, convolution, and the DFT
Year:
1988

Citing 0
Cited 3

Automatic Generation of FFT for Translations of Multipole Expansions in Spherical Harmonics

International Journal of High Performance Computing Applications
Algebraic signal processing theory: Cooley-Tukey type algorithms for real DFTs

IEEE Transactions on Signal Processing
Low-complexity 8-point DCT approximations based on integer functions

Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract