Advertisement

Architectures for the DCT

  • Vasudev Bhaskaran
  • Konstantinos Konstantinides
Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 334)

Abstract

Due to the importance of the two-dimensional (2-D) DCT in digital image processing, particularly in video compression, various algorithms and architectures have been proposed for its implementation. These methods can be divided into two main categories. The first category includes techniques from linear matrix analysis and decomposition. Lee’s fast DCT is a typical example of this category. The second category includes algorithms from polynomial and number theory. For example, Winograd’s algorithm fits into this class. Both categories can be further partitioned into algorithms that either use or do not use row-column decompositions. For example, with a row-column decomposition, the 2-D DCT can be computed using one-dimensional DCTs, allowing for simpler implementations. Algorithms that do not use row-column decompositions are more computationally efficient but require complex hardware.

Keywords

Video Compression Video Codec Parallel Multiplier Distribute Arithmetic Pixel Rate 
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.

Copyright information

© Springer Science+Business Media New York 1995

Authors and Affiliations

  • Vasudev Bhaskaran
    • 1
  • Konstantinos Konstantinides
    • 1
  1. 1.Hewlett-Packard LaboratoriesUSA

Personalised recommendations