
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Sungwook Yu, Earl E. Swartzlander, "DCT Implementation with Distributed Arithmetic," IEEE Transactions on Computers, vol. 50, no. 9, pp. 985991, September, 2001.  
BibTex  x  
@article{ 10.1109/12.954513, author = {Sungwook Yu and Earl E. Swartzlander}, title = {DCT Implementation with Distributed Arithmetic}, journal ={IEEE Transactions on Computers}, volume = {50}, number = {9}, issn = {00189340}, year = {2001}, pages = {985991}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.954513}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  DCT Implementation with Distributed Arithmetic IS  9 SN  00189340 SP985 EP991 EPD  985991 A1  Sungwook Yu, A1  Earl E. Swartzlander, PY  2001 KW  Discrete Cosine Transform KW  distributed arithmetic KW  recursive DCT algorithm. VL  50 JA  IEEE Transactions on Computers ER   
Abstract—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 evenodd 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 rowcolumn decomposition method, the proposed architectures can be easily extended to compute the twodimensional DCT required in many image compression applications such as HDTV.
[1] A. Peled and B. Liu, “A New Hardware Realization of Digital Filters,” IEEE Trans. Acoustics, Speech, and Signal Processing, vol. 22, pp. 456462, 1974.
[2] S.A. White, “Application of Distributed Arithmetic to Digital Signal Processing: A Tutorial Review,” IEEE Acoustics, Speech, and Signal Processing Magazine, vol. 6, pp. 419, July 1989.
[3] W.P. Burleson and L.L. Scharf, “A VLSI Design Methodology for Distributed Arithmetic,” J. VLSI Signal Processing, vol. 2, pp. 235252, 1991.
[4] S. Wolter, A. Schubert, H. Matz, and R. Laur, “On the Comparison between Architectures for the Implementation of Distributed Arithmetic,” Proc. IEEE Int'l Symp. Circuits and Systems, vol. 3, pp. 18291832, 1993.
[5] K. Nourji and N. Demassieux, “Optimal VLSI Architecture for Distributed ArithmeticBased Algorithms,” Proc. Int'l Conf. Acoustics, Speech, and Signal Processing, vol. 2, pp. 509512, 1994.
[6] M. Sheu, J. Lee, J. Wang, A. Suen, and L. Liu, “A High ThroughputRate Architecture for 8 8 2D DCT,” Proc. IEEE Int'l Symp. Circuits and Systems, vol. 3, pp. 15871590, 1993.
[7] M.T. Sun, T.C. Chen, and A.M. Gottlieb, “VLSI Implementation of a$16\times 16$Discrete Cosine Transform,” IEEE Trans. Circuits and Systems, vol. 36, pp. 610617, 1989.
[8] S.I. Uramoto, Y. Inoue, A. Takabatake, J. Takeda, Y. Yamashita, H. Terane, and M. Yoshimoto, “A 100MHz 2D Discrete Cosine Transform Core Processor,” IEEE J. SolidState Circuits, vol. 27, pp. 492499, 1992.
[9] K. Kim, S. Jang, S. Kwon, and K. Son, “An Improvement of VLSI Architecture for 2Dimensional Discrete Cosine Transform and Its Inverse,” Proc. SPIE, vol. 2727, pp. 10171026, 1996.
[10] S. Wolter, D. Birreck, and R. Laur, “Classification for 2D DCTs and a New Architecture with Distributed Arithmetic,” Proc. IEEE Int'l Symp. Circuits and Systems, vol. 4, pp. 22042207, 1991.
[11] B.G. Lee, “A New Algorithm to Compute the Discrete Cosine Transform,” IEEE Trans. Acoustics, Speech, and Signal Processing, vol. 32, pp. 12431245, 1984.
[12] H.S. Hou, “A Fast Recursive Algorithm for Computing the Discrete Cosine Transform,” IEEE Trans. Acoustics, Speech, and Signal Processing, vol. 35, pp. 14551461, 1987.
[13] H.S. Hou, “Recursive Scaled DCT,” Proc. SPIE, vol. 1567, pp. 402412, 1991.
[14] Y. Arai, T. Agui, and M. Nakajima, “A Fast DCTSQ Scheme for Images,” Trans. IEICE, vol. E71, pp. 10951097, 1988.
[15] E. Feig and S. Winograd, “Fast Algorithms for the Discrete Cosine Transform,” IEEE Trans. Signal Processing, vol. 40, pp. 21742193, 1992.