Placement with symmetry constraints for analog layout design using TCG-S

  • Authors:
  • Jai-Ming Lin;Guang-Ming Wu;Yao-Wen Chang;Jen-Hui Chuang

  • Affiliations:
  • Realtek Semiconductor Corp., Hsinchu, Taiwan;Nan-Hua University, Chiayi, Taiwan;National Taiwan University, Taipei, Taiwan;National Chiao Tung University, Hsinchu, Taiwan

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

Quantified Score

Hi-index 0.00

Visualization

Abstract

In order to handle device matching for analog circuits, some pairs of modules need to be placed symmetrically with respect to a common axis. In this paper, we deal with the module placement with symmetry constraints for analog design using the Transitive Closure Graph-Sequence (TCG-S) representation. Since the geometric relationships of modules are transparent to TCG-S and its induced operations, TCG-S has better flexibility than previous works in dealing with symmetry constraints. We first propose the necessary and sufficient conditions of TCG-S for symmetry modules. Then, we propose a polynomial-time packing algorithm for a TCG-S with symmetry constraints. Experimental results show that the TCG-S based algorithm results in the best area utilization.