Share Email Print

Proceedings Paper

New inner product algorithm of the two-dimensional DCT
Author(s): Bela Feher
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

The 2D discrete cosine transform (2D DCT) is one of the most effective methods in image data compression. In this paper an inner produce algorithm for the 8 X 8 2D DCT implementation is presented. The proposed direct 2D inner product algorithm exploits redundancies down to the bit level, and results in minimal hardware complexity. The basic algorithm separates the computation to 8 subtransform, according to the different cosine function values. Utilizing the odd-even property of the DCT, every transformed coefficients are expressed as a 4 point size inner product operation. The inner product processors are realized by an efficient distributed vector multiplication arrangement. All of the numerical parameters are built in into the inner product processors, so the arithmetic complexity is partly transformed to the internal topology of the units. The selected globally parallel, locally serial implementation style is features by basic serial processing elements and low communication cost. It is ideal for FPGA implementation, where the available chip area is a priori partitioned between logical and routing resources. The fully concurrent bit-serial pipeline architecture needs less than 1000 arithmetic primitives. Assuming 30 MHz bitclock rate in the Xilinx FPGA, the available throughput is 1 million 2D 8 X 8 DCT transform/sec.

Paper Details

Date Published: 17 April 1995
PDF: 9 pages
Proc. SPIE 2419, Digital Video Compression: Algorithms and Technologies 1995, (17 April 1995); doi: 10.1117/12.206392
Show Author Affiliations
Bela Feher, Technical Univ. of Budapest (Hungary)

Published in SPIE Proceedings Vol. 2419:
Digital Video Compression: Algorithms and Technologies 1995
Arturo A. Rodriguez; Robert J. Safranek; Edward J. Delp, Editor(s)

© SPIE. Terms of Use
Back to Top