Issue No. 09 - September (2001 vol. 50)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.954513
<p><b>Abstract</b>—This paper presents an efficient method for implementing the Discrete Cosine Transform (DCT) with distributed arithmetic. While conventional approaches use the original DCT algorithm or the even-odd frequency decomposition of the DCT algorithm, the proposed architecture uses the recursive DCT algorithm and requires less area than the conventional approaches, regardless of the memory reduction techniques employed in the ROM Accumulators (RACs). An efficient architecture for implementing the scaled DCT with distributed arithmetic is also proposed. The new architecture requires even less area while keeping the same structural regularity for an easy VLSI implementation. A comparison of synthesized DCT processors shows that the proposed method reduces the hardware area of regular and scaled DCT processors by 17 percent and 23 percent, respectively, relative to a conventional design. With the row-column decomposition method, the proposed architectures can be easily extended to compute the two-dimensional DCT required in many image compression applications such as HDTV.</p>
Discrete Cosine Transform, distributed arithmetic, recursive DCT algorithm.
S. Yu and E. E. Swartzlander, "DCT Implementation with Distributed Arithmetic," in IEEE Transactions on Computers, vol. 50, no. , pp. 985-991, 2001.