Fast fourier transforms: A tutorial review and a state of the art
- 1 April 1990
- journal article
- Published by Elsevier in Signal Processing
- Vol. 19 (4) , 259-299
- https://doi.org/10.1016/0165-1684(90)90158-u
Abstract
No abstract availableKeywords
This publication has 72 references indexed in Scilit:
- Discrete Hartley transformJournal of the Optical Society of America, 1983
- The additive and logical complexities of linear and bilinear arithmetic algorithmsJournal of Algorithms, 1983
- A new algorithm for the radix-3 FFTIEEE Transactions on Acoustics, Speech, and Signal Processing, 1978
- A comparative study of time efficient FFT and WFTA programs for general purpose computersIEEE Transactions on Acoustics, Speech, and Signal Processing, 1978
- A Fast Computational Algorithm for the Discrete Cosine TransformIEEE Transactions on Communications, 1977
- Direct fast Fourier transform of bivariate functionsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1977
- Automatic generation of time efficient digital signal processing softwareIEEE Transactions on Acoustics, Speech, and Signal Processing, 1977
- A new principle for fast Fourier transformationIEEE Transactions on Acoustics, Speech, and Signal Processing, 1976
- The representation of two-dimensional sequences as one-dimensional sequencesIEEE Transactions on Acoustics, Speech, and Signal Processing, 1974
- Fast one-dimensional digital convolution by multidimensional techniquesIEEE Transactions on Acoustics, Speech, and Signal Processing, 1974