Mathematical Problems in Engineering
Volume 2010 (2010), Article ID 185398, 21 pages
Research Article

An Efficient VLSI Linear Array for DCT/IDCT Using Subband Decomposition Algorithm

1Department of Microelectronics Engineering, Chung Hua University, Hsinchu City 300-12, Taiwan
2Department of Computer Science and Information Engineering, National United University, Miaoli 360-03, Taiwan

Received 30 January 2010; Accepted 22 March 2010

Academic Editor: Ming Li

Copyright © 2010 Tze-Yun Sung et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Discrete Cosine transform (DCT) and inverse DCT (IDCT) have been widely used in many image processing systems and real-time computation of nonlinear time series. In this paper, a novel lineararray of DCT and IDCT is derived from the data flow of subband decompositions representing the factorized coefficient matrices in the matrix formulation of the recursive algorithm. For increasing the throughput as well as decreasing the hardware cost, the input and output data are reordered. The proposed 8-point DCT/IDCT processor with four multipliers, simple adders, and less registers and ROM storing the immediate results and coefficients, respectively, has been implemented on FPGA (field programmable gate array) and SoC (system on chip). The linear-array DCT/IDCT processor with the computation complexity O(5N/8) and hardware complexity O(5N/8) is fully pipelined and scalable for variable-length DCT/IDCT computations.