Advertisement

2-D Discrete Cosine Transform (DCT) on Meshes with Hierarchical Control Modes

  • Cheong-Ghil Kim
  • Su-Jin Lee
  • Shin-Dug Kim
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3522)

Abstract

An effective matrix operation is critical to process 2-D DCT. This paper presents a hierarchically controlled SIMD array (HCSA) well suited to matrix computations, in which a conventional 2-D torus is enhanced with the hierarchical organization of control units and the global data buses running across the rows and columns. The distinguished features of the HCSA are the diagonally indexed concurrent broadcast and the efficient data exchanges among PEs through either row or column broadcast. Therefore, the HCSA can provide significant improvement on computation steps of DCT. For the performance evaluation, an algorithmic mapping method is used and the number of computation steps is analytically compared with semisystolic architecture.

Keywords

Discrete Cosine Transform Systolic Array Discrete Cosine Transform Coefficient Inverse Discrete Cosine Transform Host Processor 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Smith, R., Fant, K., Parker, D., Stephani, R., Ching-Yi, W.: An Asynchronous 2-D Discret Cosine Transform Chip. In: Proc. Int’l Symp. Asynchronous Circuits and Systems, pp. 224–233 (1998)Google Scholar
  2. 2.
    Cho, N.I., Lee, S.U.: DCT Algorithms for VLSI Parallel Implementation. IEEE Trans. Acoustics, Speech, and Signal Processing 38, 121–127 (1990)CrossRefGoogle Scholar
  3. 3.
    Bagherzadeh, N., Filho, C., Lu, G., Kurdahi, F.J., Lee, M.-H., Singh, H.: MorphoSys: an Integrated Reconfigurable System for Data-parallel and Computation-intensive Applications. IEEE Trans. Computers 49(5), 465–481 (2000)CrossRefGoogle Scholar
  4. 4.
    Sheu, M., Lee, J., Wang, J., Suen, A., Liu, L.: A High Throughput-rate Architecture for 8×8 2D DCT. In: Proc. Int’l Symp. Circuits and Systems, vol. 3, pp. 1587–1590 (1993)Google Scholar
  5. 5.
    Makhoul, J.: A Fast Cosine Transform in One and Two Dimensions. IEEE Trans. Acoustics, Speech, and Signal Processing 28, 27–34 (1980)zbMATHCrossRefGoogle Scholar
  6. 6.
    Vetterli, M., Nussbaumer, H.J.: Simple FFT and DCT Algorithms with Reduced Number of Operations. Signal Processing 6, 267–278 (1984)CrossRefMathSciNetGoogle Scholar
  7. 7.
    Cho, N., Lee, S.: Fast Algorithm and Implementation of 2D Discrete Cosine Transform. IEEE Trans. Circuits and Systems 38, 297–305 (1991)CrossRefGoogle Scholar
  8. 8.
    Lim, H.S., Piuri, V., Swartzlander Jr., E.E.: A Serial-Parallel Architecture for Two- Dimensional Discrete Cosine and Inverse Discrete Cosine Transforms. IEEE Trans. Computer 49, 1297–1309 (2000)CrossRefMathSciNetGoogle Scholar
  9. 9.
    Kung, S.Y.: VLSI Array Processor. Printice Hall, Englewood Cliffs (1988)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Cheong-Ghil Kim
    • 1
  • Su-Jin Lee
    • 1
  • Shin-Dug Kim
    • 1
  1. 1.Supercomputing Lab, Dept. of Computer ScienceYonsei UniversitySeoulKorea

Personalised recommendations