New scaled DCT algorithms for fused multiply/add architectures

29Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

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 of 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.

Cite

CITATION STYLE

APA

Linzer, E., & Feig, E. (1991). New scaled DCT algorithms for fused multiply/add architectures. In Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing (Vol. 3, pp. 2201–2204). Publ by IEEE. https://doi.org/10.1109/icassp.1991.150851

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free