
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Hyesook Lim, Vincenzo Piuri, Earl E. Swartzlander, "A SerialParallel Architecture for TwoDimensional Discrete Cosine and Inverse Discrete Cosine Transforms," IEEE Transactions on Computers, vol. 49, no. 12, pp. 12971309, December, 2000.  
BibTex  x  
@article{ 10.1109/12.895848, author = {Hyesook Lim and Vincenzo Piuri and Earl E. Swartzlander}, title = {A SerialParallel Architecture for TwoDimensional Discrete Cosine and Inverse Discrete Cosine Transforms}, journal ={IEEE Transactions on Computers}, volume = {49}, number = {12}, issn = {00189340}, year = {2000}, pages = {12971309}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.895848}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  A SerialParallel Architecture for TwoDimensional Discrete Cosine and Inverse Discrete Cosine Transforms IS  12 SN  00189340 SP1297 EP1309 EPD  12971309 A1  Hyesook Lim, A1  Vincenzo Piuri, A1  Earl E. Swartzlander, PY  2000 KW  Application specific processor architecture KW  Discrete Cosine Transform KW  Inverse Discrete Cosine Transform KW  image compression KW  serialparallel processor KW  systolic array. VL  49 JA  IEEE Transactions on Computers ER   
Abstract—The Discrete Cosine and Inverse Discrete Cosine Transforms are widely used tools in many digital signal and image processing applications. The complexity of these algorithms often requires dedicated hardware support to satisfy the performance requirements of hard realtime applications. This paper presents the architecture of an efficient implementation of a twodimensional DCT/IDCT transform processor via a serialparallel systolic array that does not require transposition.
[1] H.S. Lim, “Multidimensional Systolic Arrays and Their Implementations for Discrete Fourier Transform and Discrete Cosine Transform,” PhD dissertation, Univ. of Texas at Austin, 1996.
[2] H. Lim and E.E. Swartzlander Jr., “A Systolic Array for 2D DFT and 2D DCT,” Proc. IEEE Int'l Conf. Application Specific Array Processors, pp. 123131, Aug. 1994.
[3] A.V. Oppenheim and R.W. Schafer, DiscreteTime Signal Processing.Englewood Cliffs, N.J.: Prentice Hall, 1989.
[4] J. Canaris, “A VLSI Architecture for the Real Time Computation of Discrete Trigonometric Transforms,” J. VLSI Signal Processing, vol. 5, pp. 95104, 1993.
[5] B.G. Lee, "A New Algorithm to Compute the Discrete Cosine Transform," IEEE Trans. Acoustics, Speech and Signal Processing, Vol. ASSP32, No. 6, Dec. 1984, pp. 12431245.
[6] H.S. Hou, "A Fast Recursive Algorithm for Computing the Discrete Cosine Transform," IEEE Trans. Acoustics, Speech and Signal Processing, Vol. ASSP35, No. 10, Oct. 1987, pp. 14551461.
[7] 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.
[8] M.J. Narasimha and A.M. Peterson, “On the Computation of the Discrete Cosine Transform,” IEEE Trans. Comm., vol. 26, pp. 934936, 1978.
[9] J. Makhoul, “A Fast Cosine Transform in One and Two Dimensions,” IEEE Trans. Acoustics, Speech, and Signal Processing. vol. 28, pp. 2734, 1980.
[10] J. Bruguera and T. Lang, “2D DCT Using OnLine Arithmetic,” Proc. Int'l Conf. Acoustics, Speech, and Signal Processing, pp. 3,2753,278, 1995.
[11] M. Vetterli and H.J. Nussbaumer, “Simple FFT and DCT Algorithms with Reduced Number of Operations,” Signal Processing, vol. 6, pp. 267278, 1984.
[12] N. Cho and S. Lee, “Fast Algorithm and Implementation of 2D Discrete Cosine Transform,” IEEE Trans. Circuits and Systems, vol. 38, pp. 297305, 1991.
[13] P. Duhamel and C. Guillemot, “Polynomial Transform Computation of the 2D DCT,” Proc. Int'l Conf. Acoustics, Speech, and Signal Processing, pp. 1,5151,518, 1990.
[14] E. Feig and S. Winograd, “Fast Algorithms for the Discrete Cosine Transform,” IEEE Trans. Signal Processing, vol. 40, pp. 21742193, 1992.
[15] C. Chakrabarti and J. JáJá, “Systolic Architectures for the Computation of the Discrete Hartley and the Discrete Cosine Transforms Based on Prime Factor Decomposition,” IEEE Trans. Computers, vol. 39, pp. 1,3591,368, 1990.
[16] N.I. Cho and S.U. Lee, “DCT Algorithms for VLSI Parallel Implementation,” IEEE Trans. Acoustics, Speech, and Signal Processing, vol. 38, pp. 121127, 1990.
[17] P.Z. Lee and F.Y. Huang, “An Efficient PrimeFactor Decomposition of the Discrete Cosine Transform and Its Hardware Realization,” Proc. Int'l Conf. Acoustics, Speech, and Signal Processing, pp. 20.5.120.5.4, 1985.
[18] Y. Chang and C. Wang, “New Systolic Array Implementation of the 2D Discrete Cosine Transform and Its Inverse,” IEEE Trans. Circuits and Systems for Video Technology, vol. 5, pp. 150157, 1995.
[19] S. Pan and R. Park, “Unified Systolic Arrays for Computation of the DCT/DST/DHT,” IEEE Trans. Circuits and Systems for Video Technology, vol. 7, pp. 413419, 1997.
[20] J. Guo, C. Liu, and C. Jen, “The Efficient MemoryBased VLSI Array Designs for DFT and DCT,” IEEE Trans. Circuits and Systems II: Analog and Digital Signal Processing, vol. 39, pp. 723733, 1992.
[21] R. Negrini, M. Sami, and R. Stefanelli, Fault Tolerance through Reconfiguration of VLSI and WSI Arrays, Cambridge, Mass.: MIT Press, 1989.
[22] L. Breveglieri and L. Dadda, “A SerialInput BitSliced Convolver,” Proc. Int'l Conf. Circuit Design, 1988.
[23] L. Breveglieri and V. Piuri, “A Fast Pipelined FFT Unit,” Proc. Int'l Conf. Application Specific Array Processors, pp. 143151, 1994.
[24] S.Y. Kung, VLSI Array Processors. Prentice Hall, 1988.
[25] H.V. Jagadish, S.K. Rao, and T. Kailath, “Array Architectures for Iterative Algorithms,” Proc. IEEE, vol. 75, pp. 1,3041,321, 1987.
[26] E.E. Swartzlander,Systolic Signal Processing Systems. Marcel Dekker, 1987.
[27] T.D. Roziner and M.G. Karpovsky, “Multidimensional Fourier Transforms by Systolic Architectures,” J. VLSI Signal Processing, vol. 4, pp. 343354, 1992.