New scaled DCT algorithms for fused multiply/add architectures

1 January 1991

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

No. 15206149,p. 2201-2204 vol.3
https://doi.org/10.1109/icassp.1991.150851

Abstract

The authors present novel scaled discrete cosine transform (DCT) and inverse scaled DCT algorithms designed for fused multiply/add architecture. Since the most popular case used in image processing involves 8*8 blocks (both emerging JPEG and MPEG standards call for DCT coding on blocks of this size), the authors discuss this case in detail. The scaled DCT and inverse scaled DCT each use 416 operations, so that, combined with scaling or descaling, each uses 480 operations. For the inverse, the descaling can be combined with computation of the IDCT (inverse DCT). If multiplicative constants, which depend on the quantization matrix, can be computed offline, then the descaling and IDCT can be computed simultaneously with 417 operations.

Keywords

This publication has 4 references indexed in Scilit:

Polynomial transform computation of the 2-D DCT
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
Fast scaled-DCT algorithm
Published by SPIE-Intl Soc Optical Eng ,1990
Simple FFT and DCT algorithms with reduced number of operations
Signal Processing, 1984
On the Computation of the Discrete Cosine Transform
IEEE Transactions on Communications, 1978