Fast algorithms for the discrete W transform and for the discrete Fourier transform
- 1 August 1984
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Acoustics, Speech, and Signal Processing
- Vol. 32 (4) , 803-816
- https://doi.org/10.1109/tassp.1984.1164399
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- The discrete cosine transform--A new versionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Reconsideration of "A Fast Computational Algorithm for the Discrete Cosine Transform"IEEE Transactions on Communications, 1983
- A fast algorithm for the discrete sine transform implemented by the fast cosine transformIEEE Transactions on Acoustics, Speech, and Signal Processing, 1982
- Very fast computation of the radix-2 discrete Fourier transformIEEE Transactions on Acoustics, Speech, and Signal Processing, 1982
- Harmonic analysis with a real frequency function. III. Data sequenceApplied Mathematics and Computation, 1981
- Comments on "A prime factor FFT algorithm using high-speed convolution"IEEE Transactions on Acoustics, Speech, and Signal Processing, 1978
- Comparative performance of various trigonometric unitary transforms for transform image codingInternational Journal of Electronics, 1978
- A prime factor FFT algorithm using high-speed convolutionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1977
- A Fast Karhunen-Loeve Transform for a Class of Random ProcessesIEEE Transactions on Communications, 1976
- Discrete Cosine TransformIEEE Transactions on Computers, 1974