Low Power Multiplication Algorithm for Switching Activity Reduction through Operand Decomposition

  • Authors:
  • Masayuki Ito;David Chinnery;Kurt Keutzer

  • Affiliations:
  • -;-;-

  • Venue:
  • ICCD '03 Proceedings of the 21st International Conference on Computer Design
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

A novel low power multiplication algorithm for reducing switchingactivity through operand decomposition is proposed. Ourexperimental results show 12% to 18% reduction in logic transitionsin both array multipliers and tree multipliers of 32 bits and 64bits. Similar results are obtained for dynamic power dissipationafter logic synthesis. One additional logic gate is required on thecritical path for operand decomposition, which corresponds to onlyan additional 2% to 6% of total delay in these four cases. Thus,the proposed algorithm can be applied to many digital systems wherepower consumption is a major design constraint.