Fast discrete cosine transform pruning
- 1 July 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 42 (7) , 1833-1837
- https://doi.org/10.1109/78.298293
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- A new efficient algorithm for computing a few DFT pointsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Efficient input-reordering algorithms for fast DCTElectronics Letters, 1991
- Pruning the fast discrete cosine transformIEEE Transactions on Communications, 1991
- A new two-dimensional fast cosine transform algorithmIEEE Transactions on Signal Processing, 1991
- Fast cosine transform based on the successive doubling methodElectronics Letters, 1990
- Pruning the decimation-in-time FFT algorithm with frequency shiftIEEE Transactions on Acoustics, Speech, and Signal Processing, 1986
- Discrete Cosine TransformIEEE Transactions on Computers, 1974
- FFT pruningIEEE Transactions on Audio and Electroacoustics, 1971