Symmetry-aware placement with transitive closure graphs for analog layout design

  • Authors:
  • Lihong Zhang;C.-J. Richard Shi;Yingtao Jiang

  • Affiliations:
  • Memorial University of Newfoundland, NL, Canada;University of Washington, Seattle, WA;University of Nevada, Las Vegas, NV

  • Venue:
  • Proceedings of the 2008 Asia and South Pacific Design Automation Conference
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

A new scheme is proposed to use transitive closure graph (TCG) to explore the full symmetry solution space in analog layout design. We define a set of TCG symmetric-feasible conditions and show that it is extremely useful in reducing the solution space. A method is presented for generating random symmetric-feasible TCGs in O(n) time preserving the TCG closure property. Experimental results have confirmed the effectiveness of the proposed symmetry-aware TCG placement algorithm.