In this paper, a new one-dimensional hierarchical layout compaction scheme based on constraint graph is described. This method can be used to hierarchically compact a 2-dimensional array of several types of cells. To compact repeated cells, special co...
In this paper, a new one-dimensional hierarchical layout compaction scheme based on constraint graph is described. This method can be used to hierarchically compact a 2-dimensional array of several types of cells. To compact repeated cells, special constraint edges are added to the constraint graph for pitch-matching and design-rule enforcing at the cell boundaries. Wire-jogging can be performed during constraint graph solving.