Introduction to algorithms
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Convergence and continuity criteria for discrete approximations of the continuous planar skeleton
CVGIP: Image Understanding
A VLSI artwork legalization technique based on a new criterion of minimum layout perturbation
Proceedings of the 1997 international symposium on Physical design
DAC '83 Proceedings of the 20th Design Automation Conference
Manufacturing-Aware Physical Design
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Technology migration technique for designs with strong RET-driven layout restrictions
Proceedings of the 2005 international symposium on Physical design
Backend CAD flows for "restrictive design rules"
Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
Calligrapher: a new layout-migration engine for hard intellectual property libraries
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Practical method for obtaining a feasible integer solution in hierarchical layout optimization
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
ECP- and CMP-aware detailed routing algorithm for DFM
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Automatic design rule correction in presence of multiple grids and track patterns
Proceedings of the 50th Annual Design Automation Conference
| Hi-index | 0.00 |
Designs using simple geometric layout objects (such as points, sticks and rectangles) with Restrictive Design Rules (RDRs) on each layout object (i.e., it must be placed on a set of grids subject to a set of ground rules) have been introduced as an approach to better enable design for manufacturability (DFM) in ultra-deep submicron designs[9]. In this paper, we study the problem of migrating the conventional shape-based layouts to the simplified layouts with RDR constraints. We present a migration flow which consists of two process steps: (1) conversion where shapes (such as polygons) are converted to simple geometric objects (such as sticks) while the topology is maintained, and (2) grid legalization for RDRs where the simple geometric objects are placed on grid subject to the given set of ground rules by using a novel legalization algorithm, the Minimum Perturbation-driven Graph-based Grid Legalization(MP-GGL) algorithm. We demonstrate the effectiveness of the flow by successfully migrating a set of library cells in the conventional shape-based technology to the simplified layouts with RDR constraints.