Gain-based technology mapping for discrete-size cell libraries

  • Authors:
  • Bo Hu;Yosinori Watanabe;Alex Kondratyev;Malgorzata Marek-Sadowska

  • Affiliations:
  • Univ. of CA, Santa Barbara, CA;Cadence Berkeley Labs, Berkeley, CA;Cadence Berkeley Labs, Berkeley, CA;Univ. of CA, Santa Barbara, CA

  • Venue:
  • Proceedings of the 40th annual Design Automation Conference
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we describe a technology mapping technique based on the logical effort theory [13]. First, we appropriately characterize a given standard cell library and extract from it a set of cell classes. Each cell-class is assigned a constant-delay model and corresponding load-bounds, which define the conditions of the delay model's validity. Next, we perform technology mapping using the classes determined in the first step. We propose several effective area-optimization heuristics which allow us to apply our algorithm directly to general graphs. Experimental results show that our gain-based mapping algorithm achieves reduced delay with less area, compared to the mapper in SIS [15]. By adjusting the constant delay model associated with each class, we determine the area-delay trade-off curve. We achieve the best area-delay trade-off using a design-specific constant delay models.