A fast recursive algorithm for computing the discrete cosine transform
- 1 October 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Acoustics, Speech, and Signal Processing
- Vol. 35 (10) , 1455-1461
- https://doi.org/10.1109/tassp.1987.1165060
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Fast Computational for the Discrete Cosine TransformPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Fast algorithms for the DFT and other sinusoidal transformsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1986
- A two-dimensional fast cosine transformIEEE Transactions on Acoustics, Speech, and Signal Processing, 1985
- Fast algorithms for the discrete W transform and for the discrete Fourier transformIEEE Transactions on Acoustics, Speech, and Signal Processing, 1984
- Fast cosine transform implementation for television signalsIEE Proceedings F Communications, Radar and Signal Processing, 1982
- Relation between the Karhunen Loève and cosine transformsIEE Proceedings F Communications, Radar and Signal Processing, 1981
- On Computing the Discrete Cosine TransformIEEE Transactions on Computers, 1978
- On a Real-Time Walsh-Hadamard/Cosine Transform Image ProcessorIEEE Transactions on Electromagnetic Compatibility, 1978
- A Fast Computational Algorithm for the Discrete Cosine TransformIEEE Transactions on Communications, 1977
- A Storage Efficient Way to Implement the Discrete Cosine TransformIEEE Transactions on Computers, 1976