Arithmetic optimization using carry-save-adders

  • Authors:
  • Taewhan Kim;William Jao;Steve Tjiang

  • Affiliations:
  • Synopsys Inc., 700 E. Middlefield Rd., Mountain View, CA;Aimfast Corp., 846 Stewart Dr. Sunnyvale, CA;Synopsys Inc., 700 E. Middlefield Rd., Mountain View, CA

  • Venue:
  • DAC '98 Proceedings of the 35th annual Design Automation Conference
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

Carry-save-adder(CSA) is the most often used type of operation in implementing a fast computation of arithmetics of register-transfer level design in industry. This paper establishes a relationship between the properties of arithmetic computations and several optimizing transformations using CSAs to derive consistently better qualities of results than those of manual implementations. In particular, we introduce two important concepts, operation-duplication and operation-split, which are the main driving techniques of our algorithm for achieving an extensive utilization of CSAs. Experimental results from a set of typical arithmetic computations found in industry designs indicate that automating CSA optimization with our algorithm produces designs with significantly faster timing and less area.