Practical fast 1-D DCT algorithms with 11 multiplications
- 13 January 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. assp 32, 988-991
- https://doi.org/10.1109/icassp.1989.266596
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- New 2>sup/sup<DCT algorithms suitable for VLSI implementationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Multiply/Add tradeoffs in length-2>sup/sup<FFT algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Algorithm-architecture mapping for custom DSP chipsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Fast algorithms for the DFT and other sinusoidal transformsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1986
- A Discrete Fourier-Cosine Transform ChipIEEE Journal on Selected Areas in Communications, 1986
- Simple FFT and DCT algorithms with reduced number of operationsSignal Processing, 1984
- Fast algorithms for the discrete W transform and for the discrete Fourier transformIEEE Transactions on Acoustics, Speech, and Signal Processing, 1984
- A Fast Computational Algorithm for the Discrete Cosine TransformIEEE Transactions on Communications, 1977
- Some bilinear forms whose multiplicative complexity depends on the field of constantsTheory of Computing Systems, 1976
- Discrete Cosine TransformIEEE Transactions on Computers, 1974