A Multiplication-Free Algorithm and A Parallel Architecture for Affine Transformation

  • Authors:

  • Wael Badawy;Magdy Bayoumi

  • Affiliations:

  • Department of Electrical and Computer Engineering, University of Calgary, 2500 University Drive NW, Calgary, Alberta, Canada T2N 1N4;The Center for Advanced Computer Studies, University of Louisiana, Lafayette, LA 70504-4330, USA

  • Venue:
  • Journal of VLSI Signal Processing Systems
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Affine transformation is widely used in image processing. Recently, it is recommended by MPEG-4 for video motion compensation. This paper presents a novel low power parallel architecture for texture warping using affine transformation (AT). The architecture uses a novel multiplication-free algorithm that employs the algebraic properties of the AT. Low power has been achieved at different levels of the design. At the algorithmic level, replacing multiplication operations with bit shifting saves the power and delay of using a multiplier. At the architecture level, low power is achieved by using parallel computational units, where the latency constraints and/or the operating latency can be reduced. At the circuit level, using low power building blocks (such as low power adders) contributes to the power savings. The proposed architecture is used as a computational kernel in video object coders. It is compatible with MPEG-4 and VRML standards. The architecture has been prototyped in 0.6 μm CMOS technology with three layers of metal. The performance of the proposed architecture shows that it can be used in mobile and handheld applications.