Simple FFT and DCT algorithms with reduced number of operations
- 1 August 1984
- journal article
- Published by Elsevier in Signal Processing
- Vol. 6 (4) , 267-278
- https://doi.org/10.1016/0165-1684(84)90059-8
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Bounds on the minimum number of data transfers in WFTA and FFT programsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1979
- On the Computation of the Discrete Cosine TransformIEEE Transactions on Communications, 1978
- A comparative study of time efficient FFT and WFTA programs for general purpose computersIEEE Transactions on Acoustics, Speech, and Signal Processing, 1978
- z-transform DFT filters and FFT'sIEEE Transactions on Acoustics, Speech, and Signal Processing, 1978
- A Fast Computational Algorithm for the Discrete Cosine TransformIEEE Transactions on Communications, 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
- Discrete Cosine TransformIEEE Transactions on Computers, 1974
- An algorithm for computing the mixed radix fast Fourier transformIEEE Transactions on Audio and Electroacoustics, 1969
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965