Block placement with symmetry constraints based on the O-tree non-slicing representation

The ordered tree (O-tree) representation has recently gained much interest in layout design automation. Different from previous topological representations of non-slicing floorplans, the O-tree representation is simpler, needs linear computation effort to generate a corresponding layout, and exhibits a smaller upper-bound of possible configurations. This paper addresses the problem of handling symmetry constraints in the context of the O-tree representation. This problem arises in analog placement, where symmetry is often used to match layout-induced parasitics and to balance thermal couplings in differential circuits. The good performance of our placement tool dealing with several analog designs taken from industry proves the effectiveness of our technique.

• Type: Conference
• Year: 2000
• Where: DAC
• Authors: Yingxin Pang, Florin Balasa, Koen Lampaert, Chung-Kuan Cheng
• Keywords: Computer Architecture, DAC 2000, Layout Design Automation, Needs Linear Computation, O-tree Representation